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 unsigned registers_available; /**< number of available registers */
57 bool 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;
86 /* collect register pressure info, start with end of a block */
87 ir_nodeset_init(&live_nodes);
88 be_liveness_end_of_block(env->lv, env->cls, block,
91 unsigned pressure = ir_nodeset_size(&live_nodes);
92 if (pressure > env->registers_available) {
93 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
94 block, get_irg_name(env->irg), pressure, env->registers_available);
95 print_living_values(stderr, &live_nodes);
96 env->problem_found = true;
99 sched_foreach_reverse(block, irn) {
103 // print_living_values(stderr, &live_nodes);
104 be_liveness_transfer(env->cls, irn, &live_nodes);
106 pressure = ir_nodeset_size(&live_nodes);
108 if (pressure > env->registers_available) {
109 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
110 irn, block, get_irg_name(env->irg), pressure, env->registers_available);
111 print_living_values(stderr, &live_nodes);
112 env->problem_found = true;
116 ir_nodeset_destroy(&live_nodes);
119 bool be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
121 be_verify_register_pressure_env_t env;
123 env.lv = be_liveness_new(irg);
126 env.registers_available = be_get_n_allocatable_regs(irg, cls);
127 env.problem_found = false;
129 be_liveness_compute_sets(env.lv);
130 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
131 be_liveness_free(env.lv);
133 return ! env.problem_found;
136 /*--------------------------------------------------------------------------- */
138 typedef struct be_verify_schedule_env_t_ {
139 bool problem_found; /**< flags indicating a problem */
140 bitset_t *scheduled; /**< bitset of scheduled nodes */
141 ir_graph *irg; /**< the irg to check */
142 } be_verify_schedule_env_t;
144 static void verify_schedule_walker(ir_node *block, void *data)
146 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
147 ir_node *non_phi_found = NULL;
148 ir_node *cfchange_found = NULL;
149 int last_timestep = INT_MIN;
152 * Tests for the following things:
153 * 1. Make sure that all phi nodes are scheduled at the beginning of the
155 * 2. No value is defined after it has been used
156 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
157 * (except mode_X projs)
159 sched_foreach(block, node) {
160 /* this node is scheduled */
161 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
162 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
163 env->problem_found = true;
165 bitset_set(env->scheduled, get_irn_idx(node));
167 /* Check that scheduled nodes are in the correct block */
168 if (get_nodes_block(node) != block) {
169 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
170 env->problem_found = true;
173 /* Check that timesteps are increasing */
174 int timestep = sched_get_time_step(node);
175 if (timestep <= last_timestep) {
176 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
178 env->problem_found = true;
180 last_timestep = timestep;
182 if (arch_get_irn_flags(node) & arch_irn_flags_not_scheduled) {
183 ir_fprintf(stderr, "Verify warning: flags_not_scheduled node %+F scheduled anyway\n", node);
184 env->problem_found = true;
187 /* Check that phis come before any other node */
189 if (non_phi_found != NULL) {
190 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
191 node, non_phi_found, block, get_irg_name(env->irg));
192 env->problem_found = true;
195 non_phi_found = node;
198 /* Check for control flow changing nodes */
200 /* check, that only one CF operation is scheduled */
201 if (cfchange_found != NULL) {
202 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
203 node, block, cfchange_found, get_irg_name(env->irg));
204 env->problem_found = true;
206 cfchange_found = node;
208 } else if (cfchange_found != NULL) {
209 /* keepany isn't a real instruction. */
210 if (!be_is_Keep(node)) {
211 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
212 node, block, get_irg_name(env->irg));
213 env->problem_found = true;
217 /* Check that all uses come before their definitions */
219 sched_timestep_t nodetime = sched_get_time_step(node);
220 int arity = get_irn_arity(node);
221 for (int i = 0; i < arity; ++i) {
222 ir_node *arg = get_irn_n(node, i);
223 if (get_nodes_block(arg) != block || !sched_is_scheduled(arg))
226 if (sched_get_time_step(arg) >= nodetime) {
227 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
228 arg, node, block, get_irg_name(env->irg));
229 env->problem_found = true;
234 /* Check that no dead nodes are scheduled */
235 if (get_irn_n_edges(node) == 0) {
236 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
237 node, block, get_irg_name(env->irg));
238 env->problem_found = true;
241 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
242 /* at least 1 of the keep arguments has to be its schedule
244 ir_node *prev = sched_prev(node);
245 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
246 prev = sched_prev(prev);
248 int arity = get_irn_arity(node);
251 for (int i = 0; i < arity; ++i) {
252 ir_node *in = get_irn_n(node, i);
259 prev = sched_prev(prev);
264 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
265 node, block, get_irg_name(env->irg));
266 env->problem_found = true;
272 static void check_schedule(ir_node *node, void *data)
274 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
275 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
276 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
278 if (should_be != scheduled) {
279 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
280 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
281 env->problem_found = true;
285 bool be_verify_schedule(ir_graph *irg)
287 be_verify_schedule_env_t env;
289 env.problem_found = false;
291 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
293 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
294 /* check if all nodes are scheduled */
295 irg_walk_graph(irg, check_schedule, NULL, &env);
297 return ! env.problem_found;
300 /*--------------------------------------------------------------------------- */
302 typedef struct spill_t {
312 } be_verify_spillslots_env_t;
314 static int cmp_spill(const void* d1, const void* d2, size_t size)
317 const spill_t* s1 = (const spill_t*)d1;
318 const spill_t* s2 = (const spill_t*)d2;
319 return s1->spill != s2->spill;
322 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
326 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
329 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
331 int hash = hash_ptr(node);
334 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
338 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
344 static ir_node *get_memory_edge(const ir_node *node)
346 ir_node *result = NULL;
347 int arity = get_irn_arity(node);
348 for (int i = arity - 1; i >= 0; --i) {
349 ir_node *arg = get_irn_n(node, i);
350 if (get_irn_mode(arg) == mode_M) {
351 assert(result == NULL);
359 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
361 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
364 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
365 node, get_nodes_block(node), get_irg_name(env->irg));
369 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
371 ir_entity *spillent = arch_get_frame_entity(node);
372 be_check_entity(env, node, spillent);
373 get_spill(env, node, ent);
375 if (spillent != ent) {
376 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
377 node, reload, get_nodes_block(node), get_irg_name(env->irg));
378 env->problem_found = true;
382 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
384 ir_node *memperm = get_Proj_pred(node);
385 int out = get_Proj_proj(node);
387 ir_entity *spillent = be_get_MemPerm_out_entity(memperm, out);
388 be_check_entity(env, memperm, spillent);
389 if (spillent != ent) {
390 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
391 node, reload, get_nodes_block(node), get_irg_name(env->irg));
392 env->problem_found = true;
395 int hash = hash_ptr(node);
398 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
403 spill.ent = spillent;
404 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
406 int arity = be_get_MemPerm_entity_arity(memperm);
407 for (int i = 0; i < arity; ++i) {
408 ir_node* arg = get_irn_n(memperm, i + 1);
409 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
411 collect(env, arg, memperm, argent);
415 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
417 assert(is_Phi(node));
419 int hash = hash_ptr(node);
422 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
428 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
430 /* is 1 of the arguments a spill? */
431 int arity = get_irn_arity(node);
432 for (int i = 0; i < arity; ++i) {
433 ir_node* arg = get_irn_n(node, i);
434 collect(env, arg, reload, ent);
438 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
440 if (be_is_Spill(node)) {
441 collect_spill(env, node, reload, ent);
442 } else if (is_Proj(node)) {
443 collect_memperm(env, node, reload, ent);
444 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
445 collect_memphi(env, node, reload, ent);
447 /* Disabled for now, spills might get transformed by the backend */
449 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
450 node, reload, get_nodes_block(node), get_irg_name(env->irg));
451 env->problem_found = true;
457 * This walker function searches for reloads and collects all the spills
458 * and memphis attached to them.
460 static void collect_spills_walker(ir_node *node, void *data)
462 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
464 if (be_is_Reload(node)) {
465 ir_node *spill = get_memory_edge(node);
467 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
468 node, get_nodes_block(node), get_irg_name(env->irg));
469 env->problem_found = true;
472 ir_entity *ent = arch_get_frame_entity(node);
473 be_check_entity(env, node, ent);
475 collect(env, spill, node, ent);
476 ARR_APP1(ir_node*, env->reloads, node);
480 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
482 int spillcount = set_count(env->spills);
483 spill_t **spills = ALLOCAN(spill_t*, spillcount);
486 foreach_set(env->spills, spill_t, spill) {
489 assert(s == spillcount);
491 for (int i = 0; i < spillcount; ++i) {
492 spill_t *sp1 = spills[i];
494 for (int i2 = i+1; i2 < spillcount; ++i2) {
495 spill_t *sp2 = spills[i2];
497 if (sp1->ent != sp2->ent)
500 if (my_values_interfere(sp1->spill, sp2->spill)) {
501 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
502 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
503 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
504 env->problem_found = true;
505 my_values_interfere(sp1->spill, sp2->spill);
511 static void check_lonely_spills(ir_node *node, void *data)
513 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
515 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
516 spill_t *spill = find_spill(env, node);
517 if (be_is_Spill(node)) {
518 ir_entity *ent = arch_get_frame_entity(node);
519 be_check_entity(env, node, ent);
523 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
524 node, get_nodes_block(node), get_irg_name(env->irg));
529 bool be_verify_spillslots(ir_graph *irg)
531 be_verify_spillslots_env_t env;
534 env.spills = new_set(cmp_spill, 10);
535 env.reloads = NEW_ARR_F(ir_node*, 0);
536 env.problem_found = false;
538 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
539 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
541 check_spillslot_interference(&env);
543 DEL_ARR_F(env.reloads);
546 return ! env.problem_found;
549 /*--------------------------------------------------------------------------- */
552 * Check, if two values interfere.
553 * @param a The first value.
554 * @param b The second value.
555 * @return 1, if a and b interfere, 0 if not.
557 static bool my_values_interfere(const ir_node *a, const ir_node *b)
559 int a2b = value_dominates(a, b);
560 int b2a = value_dominates(b, a);
562 /* If there is no dominance relation, they do not interfere. */
567 * Adjust a and b so, that a dominates b if
568 * a dominates b or vice versa.
571 const ir_node *t = a;
576 ir_node *bb = get_nodes_block(b);
579 * Look at all usages of a.
580 * If there's one usage of a in the block of b, then
581 * we check, if this use is dominated by b, if that's true
582 * a and b interfere. Note that b must strictly dominate the user,
583 * since if b is the last user of in the block, b and a do not
585 * Uses of a not in b's block can be disobeyed, because the
586 * check for a being live at the end of b's block is already
589 foreach_out_edge(a, edge) {
590 const ir_node *user = get_edge_src_irn(edge);
594 if (get_irn_opcode(user) == iro_End)
597 /* in case of phi arguments we compare with the block the value comes from */
599 ir_node *phiblock = get_nodes_block(user);
602 user = get_irn_n(phiblock, get_edge_src_pos(edge));
605 if (value_dominates(b, user))
612 /*--------------------------------------------------------------------------- */
614 static const arch_env_t *arch_env;
615 static ir_graph *irg;
617 static bool problem_found;
618 static const ir_node **registers;
620 static void check_output_constraints(const ir_node *node)
622 if (arch_get_irn_reg_class(node) == NULL)
625 /* verify output register */
626 const arch_register_req_t *req = arch_get_irn_register_req(node);
627 const arch_register_t *reg = arch_get_irn_register(node);
629 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
630 node, get_nodes_block(node), get_irg_name(irg));
631 problem_found = true;
632 } else if (!arch_reg_is_allocatable(req, reg)) {
633 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
634 reg->name, node, get_nodes_block(node), get_irg_name(irg));
635 problem_found = true;
639 static void check_input_constraints(ir_node *node)
641 /* verify input register */
642 int arity = get_irn_arity(node);
643 for (int i = 0; i < arity; ++i) {
644 ir_node *pred = get_irn_n(node, i);
646 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
647 node, get_nodes_block(node), get_irg_name(irg), i);
652 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
653 if (req->cls == NULL)
656 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
657 if (req->width > pred_req->width) {
658 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
659 node, get_nodes_block(node), get_irg_name(irg), i);
663 const arch_register_t *reg = arch_get_irn_register(pred);
665 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
666 pred, get_nodes_block(pred), get_irg_name(irg), node);
669 } else if (!arch_reg_is_allocatable(req, reg)) {
670 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
671 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
676 /* phis should be NOPs at this point, which means all input regs
677 * must be the same as the output reg */
679 const arch_register_t *reg = arch_get_irn_register(node);
681 int arity = get_irn_arity(node);
682 for (int i = 0; i < arity; ++i) {
683 ir_node *pred = get_Phi_pred(node, i);
684 const arch_register_t *pred_reg = arch_get_irn_register(pred);
686 if (reg != pred_reg && !(pred_reg->type & arch_register_type_virtual)) {
687 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
688 const char *reg_name = reg != NULL ? reg->name : "(null)";
689 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
690 i, node, get_nodes_block(node),
691 get_irg_name(irg), pred_name, reg_name);
692 problem_found = true;
698 static void value_used(const ir_node *block, const ir_node *node)
700 const arch_register_t *reg = arch_get_irn_register(node);
701 if (reg == NULL || reg->type & arch_register_type_virtual)
704 const arch_register_req_t *req = arch_get_irn_register_req(node);
705 assert(req->width > 0);
706 unsigned idx = reg->global_index;
707 for (unsigned i = 0; i < req->width; ++i) {
708 const ir_node *reg_node = registers[idx+i];
709 if (reg_node != NULL && reg_node != node) {
710 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
711 reg->name, block, get_irg_name(irg),
713 problem_found = true;
715 registers[idx+i] = node;
719 static void value_def(const ir_node *node)
721 const arch_register_t *reg = arch_get_irn_register(node);
723 if (reg == NULL || reg->type & arch_register_type_virtual)
726 const arch_register_req_t *req = arch_get_irn_register_req(node);
727 assert(req->width > 0);
728 unsigned idx = reg->global_index;
729 for (unsigned i = 0; i < req->width; ++i) {
730 const ir_node *reg_node = registers[idx+i];
732 /* a little cheat, since its so hard to remove all outedges to dead code
733 * in the backend. This particular case should never be a problem. */
734 if (reg_node == NULL && get_irn_n_edges(node) == 0)
737 if (reg_node != node) {
738 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
739 node, reg->name, reg_node, get_nodes_block(node),
741 problem_found = true;
743 registers[idx+i] = NULL;
747 static void verify_block_register_allocation(ir_node *block, void *data)
751 assert(lv->sets_valid && "live sets must be computed");
753 unsigned n_regs = arch_env->n_registers;
754 registers = ALLOCANZ(const ir_node*, n_regs);
756 be_lv_foreach(lv, block, be_lv_state_end, lv_node) {
757 value_used(block, lv_node);
760 sched_foreach_reverse(block, node) {
761 be_foreach_value(node, value,
763 check_output_constraints(value);
766 check_input_constraints(node);
768 /* process uses. (Phi inputs are no real uses) */
770 int arity = get_irn_arity(node);
771 for (int in = 0; in < arity; ++in) {
772 ir_node *use = get_irn_n(node, in);
773 value_used(block, use);
778 be_lv_foreach(lv, block, be_lv_state_in, lv_node) {
782 /* set must be empty now */
783 for (unsigned i = 0; i < n_regs; ++i) {
784 if (registers[i] == NULL)
787 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
788 registers[i], block, get_irg_name(irg));
789 problem_found = true;
793 bool be_verify_register_allocation(ir_graph *new_irg)
796 arch_env = be_get_irg_arch_env(irg);
797 lv = be_liveness_new(irg);
798 problem_found = false;
800 be_liveness_compute_sets(lv);
801 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
802 be_liveness_free(lv);
804 return !problem_found;
807 /*--------------------------------------------------------------------------- */
809 typedef struct lv_walker_t {
814 static const char *lv_flags_to_str(unsigned flags)
816 static const char *states[] = {
827 return states[flags & 7];
830 static void lv_check_walker(ir_node *bl, void *data)
832 lv_walker_t *w = (lv_walker_t*)data;
833 be_lv_t *fresh = (be_lv_t*)w->data;
835 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
836 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
838 if (!fr && curr && curr[0].head.n_members > 0) {
839 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
840 for (unsigned i = 0; i < curr[0].head.n_members; ++i) {
841 ir_fprintf(stderr, "\t%+F\n", curr[1 + i].node.node);
844 unsigned n_curr = curr[0].head.n_members;
845 unsigned n_fresh = fr[0].head.n_members;
847 if (n_curr != n_fresh) {
848 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
850 ir_fprintf(stderr, "current:\n");
851 for (unsigned i = 0; i < n_curr; ++i) {
852 be_lv_info_node_t *n = &curr[1 + i].node;
853 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
856 ir_fprintf(stderr, "correct:\n");
857 for (unsigned i = 0; i < n_fresh; ++i) {
858 be_lv_info_node_t *n = &fr[1 + i].node;
859 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
865 void be_liveness_check(be_lv_t *lv)
868 be_lv_t *fresh = be_liveness_new(lv->irg);
872 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
873 be_liveness_free(fresh);