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 /* Check that phis come before any other node */
184 if (non_phi_found != NULL) {
185 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
186 node, non_phi_found, block, get_irg_name(env->irg));
187 env->problem_found = true;
190 non_phi_found = node;
193 /* Check for control flow changing nodes */
195 /* check, that only one CF operation is scheduled */
196 if (cfchange_found != NULL) {
197 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
198 node, block, cfchange_found, get_irg_name(env->irg));
199 env->problem_found = true;
201 cfchange_found = node;
203 } else if (cfchange_found != NULL) {
204 /* proj and keepany aren't real instructions... */
205 if (!is_Proj(node) && !be_is_Keep(node)) {
206 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
207 node, block, get_irg_name(env->irg));
208 env->problem_found = true;
212 /* Check that all uses come before their definitions */
214 sched_timestep_t nodetime = sched_get_time_step(node);
215 int arity = get_irn_arity(node);
216 for (int i = 0; i < arity; ++i) {
217 ir_node *arg = get_irn_n(node, i);
218 if (get_nodes_block(arg) != block || !sched_is_scheduled(arg))
221 if (sched_get_time_step(arg) >= nodetime) {
222 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
223 arg, node, block, get_irg_name(env->irg));
224 env->problem_found = true;
229 /* Check that no dead nodes are scheduled */
230 if (get_irn_n_edges(node) == 0) {
231 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
232 node, block, get_irg_name(env->irg));
233 env->problem_found = true;
236 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
237 /* at least 1 of the keep arguments has to be its schedule
239 ir_node *prev = sched_prev(node);
240 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
241 prev = sched_prev(prev);
243 int arity = get_irn_arity(node);
246 for (int i = 0; i < arity; ++i) {
247 ir_node *in = get_irn_n(node, i);
254 prev = sched_prev(prev);
259 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
260 node, block, get_irg_name(env->irg));
261 env->problem_found = true;
267 static void check_schedule(ir_node *node, void *data)
269 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
270 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
271 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
273 if (should_be != scheduled) {
274 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
275 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
276 env->problem_found = true;
280 bool be_verify_schedule(ir_graph *irg)
282 be_verify_schedule_env_t env;
284 env.problem_found = false;
286 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
288 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
289 /* check if all nodes are scheduled */
290 irg_walk_graph(irg, check_schedule, NULL, &env);
292 return ! env.problem_found;
295 /*--------------------------------------------------------------------------- */
297 typedef struct spill_t {
307 } be_verify_spillslots_env_t;
309 static int cmp_spill(const void* d1, const void* d2, size_t size)
312 const spill_t* s1 = (const spill_t*)d1;
313 const spill_t* s2 = (const spill_t*)d2;
314 return s1->spill != s2->spill;
317 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
321 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
324 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
326 int hash = hash_ptr(node);
329 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
333 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
339 static ir_node *get_memory_edge(const ir_node *node)
341 ir_node *result = NULL;
342 int arity = get_irn_arity(node);
343 for (int i = arity - 1; i >= 0; --i) {
344 ir_node *arg = get_irn_n(node, i);
345 if (get_irn_mode(arg) == mode_M) {
346 assert(result == NULL);
354 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
356 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
359 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
360 node, get_nodes_block(node), get_irg_name(env->irg));
364 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
366 ir_entity *spillent = arch_get_frame_entity(node);
367 be_check_entity(env, node, spillent);
368 get_spill(env, node, ent);
370 if (spillent != ent) {
371 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
372 node, reload, get_nodes_block(node), get_irg_name(env->irg));
373 env->problem_found = true;
377 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
379 assert(is_Proj(node));
381 ir_node *memperm = get_Proj_pred(node);
382 int out = get_Proj_proj(node);
384 ir_entity *spillent = be_get_MemPerm_out_entity(memperm, out);
385 be_check_entity(env, memperm, spillent);
386 if (spillent != ent) {
387 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
388 node, reload, get_nodes_block(node), get_irg_name(env->irg));
389 env->problem_found = true;
392 int hash = hash_ptr(node);
395 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
400 spill.ent = spillent;
401 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
403 int arity = be_get_MemPerm_entity_arity(memperm);
404 for (int i = 0; i < arity; ++i) {
405 ir_node* arg = get_irn_n(memperm, i + 1);
406 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
408 collect(env, arg, memperm, argent);
412 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
414 assert(is_Phi(node));
416 int hash = hash_ptr(node);
419 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
425 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
427 /* is 1 of the arguments a spill? */
428 int arity = get_irn_arity(node);
429 for (int i = 0; i < arity; ++i) {
430 ir_node* arg = get_irn_n(node, i);
431 collect(env, arg, reload, ent);
435 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
437 if (be_is_Spill(node)) {
438 collect_spill(env, node, reload, ent);
439 } else if (is_Proj(node)) {
440 collect_memperm(env, node, reload, ent);
441 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
442 collect_memphi(env, node, reload, ent);
444 /* Disabled for now, spills might get transformed by the backend */
446 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
447 node, reload, get_nodes_block(node), get_irg_name(env->irg));
448 env->problem_found = true;
454 * This walker function searches for reloads and collects all the spills
455 * and memphis attached to them.
457 static void collect_spills_walker(ir_node *node, void *data)
459 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
461 if (be_is_Reload(node)) {
462 ir_node *spill = get_memory_edge(node);
464 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
465 node, get_nodes_block(node), get_irg_name(env->irg));
466 env->problem_found = true;
469 ir_entity *ent = arch_get_frame_entity(node);
470 be_check_entity(env, node, ent);
472 collect(env, spill, node, ent);
473 ARR_APP1(ir_node*, env->reloads, node);
477 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
479 int spillcount = set_count(env->spills);
480 spill_t **spills = ALLOCAN(spill_t*, spillcount);
483 foreach_set(env->spills, spill_t, spill) {
486 assert(s == spillcount);
488 for (int i = 0; i < spillcount; ++i) {
489 spill_t *sp1 = spills[i];
491 for (int i2 = i+1; i2 < spillcount; ++i2) {
492 spill_t *sp2 = spills[i2];
494 if (sp1->ent != sp2->ent)
497 if (my_values_interfere(sp1->spill, sp2->spill)) {
498 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
499 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
500 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
501 env->problem_found = true;
502 my_values_interfere(sp1->spill, sp2->spill);
508 static void check_lonely_spills(ir_node *node, void *data)
510 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
512 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
513 spill_t *spill = find_spill(env, node);
514 if (be_is_Spill(node)) {
515 ir_entity *ent = arch_get_frame_entity(node);
516 be_check_entity(env, node, ent);
520 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
521 node, get_nodes_block(node), get_irg_name(env->irg));
526 bool be_verify_spillslots(ir_graph *irg)
528 be_verify_spillslots_env_t env;
531 env.spills = new_set(cmp_spill, 10);
532 env.reloads = NEW_ARR_F(ir_node*, 0);
533 env.problem_found = false;
535 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
536 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
538 check_spillslot_interference(&env);
540 DEL_ARR_F(env.reloads);
543 return ! env.problem_found;
546 /*--------------------------------------------------------------------------- */
549 * Check, if two values interfere.
550 * @param a The first value.
551 * @param b The second value.
552 * @return 1, if a and b interfere, 0 if not.
554 static bool my_values_interfere(const ir_node *a, const ir_node *b)
556 int a2b = value_dominates(a, b);
557 int b2a = value_dominates(b, a);
559 /* If there is no dominance relation, they do not interfere. */
564 * Adjust a and b so, that a dominates b if
565 * a dominates b or vice versa.
568 const ir_node *t = a;
573 ir_node *bb = get_nodes_block(b);
576 * Look at all usages of a.
577 * If there's one usage of a in the block of b, then
578 * we check, if this use is dominated by b, if that's true
579 * a and b interfere. Note that b must strictly dominate the user,
580 * since if b is the last user of in the block, b and a do not
582 * Uses of a not in b's block can be disobeyed, because the
583 * check for a being live at the end of b's block is already
586 foreach_out_edge(a, edge) {
587 const ir_node *user = get_edge_src_irn(edge);
591 if (get_irn_opcode(user) == iro_End)
594 /* in case of phi arguments we compare with the block the value comes from */
596 ir_node *phiblock = get_nodes_block(user);
599 user = get_irn_n(phiblock, get_edge_src_pos(edge));
602 if (value_dominates(b, user))
609 /*--------------------------------------------------------------------------- */
611 static const arch_env_t *arch_env;
612 static ir_graph *irg;
614 static bool problem_found;
615 static const ir_node **registers;
617 static void check_output_constraints(const ir_node *node)
619 if (arch_get_irn_reg_class(node) == NULL)
622 /* verify output register */
623 const arch_register_req_t *req = arch_get_irn_register_req(node);
624 const arch_register_t *reg = arch_get_irn_register(node);
626 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
627 node, get_nodes_block(node), get_irg_name(irg));
628 problem_found = true;
629 } else if (!arch_reg_is_allocatable(req, reg)) {
630 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
631 reg->name, node, get_nodes_block(node), get_irg_name(irg));
632 problem_found = true;
636 static void check_input_constraints(ir_node *node)
638 /* verify input register */
639 int arity = get_irn_arity(node);
640 for (int i = 0; i < arity; ++i) {
641 ir_node *pred = get_irn_n(node, i);
643 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
644 node, get_nodes_block(node), get_irg_name(irg), i);
649 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
650 if (req->cls == NULL)
653 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
654 if (req->width > pred_req->width) {
655 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
656 node, get_nodes_block(node), get_irg_name(irg), i);
660 const arch_register_t *reg = arch_get_irn_register(pred);
662 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
663 pred, get_nodes_block(pred), get_irg_name(irg), node);
666 } else if (!arch_reg_is_allocatable(req, reg)) {
667 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
668 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
673 /* phis should be NOPs at this point, which means all input regs
674 * must be the same as the output reg */
676 const arch_register_t *reg = arch_get_irn_register(node);
678 int arity = get_irn_arity(node);
679 for (int i = 0; i < arity; ++i) {
680 ir_node *pred = get_Phi_pred(node, i);
681 const arch_register_t *pred_reg = arch_get_irn_register(pred);
683 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
684 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
685 const char *reg_name = reg != NULL ? reg->name : "(null)";
686 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
687 i, node, get_nodes_block(node),
688 get_irg_name(irg), pred_name, reg_name);
689 problem_found = true;
695 static void value_used(const ir_node *block, const ir_node *node)
697 const arch_register_t *reg = arch_get_irn_register(node);
698 if (reg == NULL || reg->type & arch_register_type_virtual)
701 const arch_register_req_t *req = arch_get_irn_register_req(node);
702 assert(req->width > 0);
703 unsigned idx = reg->global_index;
704 for (unsigned i = 0; i < req->width; ++i) {
705 const ir_node *reg_node = registers[idx+i];
706 if (reg_node != NULL && reg_node != node) {
707 const arch_register_t *realreg = &arch_env->registers[idx+i];
708 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
709 realreg->name, block, get_irg_name(irg),
711 problem_found = true;
713 registers[idx+i] = node;
717 static void value_def(const ir_node *node)
719 const arch_register_t *reg = arch_get_irn_register(node);
721 if (reg == NULL || reg->type & arch_register_type_virtual)
724 const arch_register_req_t *req = arch_get_irn_register_req(node);
725 assert(req->width > 0);
726 unsigned idx = reg->global_index;
727 for (unsigned i = 0; i < req->width; ++i) {
728 const ir_node *reg_node = registers[idx+i];
730 /* a little cheat, since its so hard to remove all outedges to dead code
731 * in the backend. This particular case should never be a problem. */
732 if (reg_node == NULL && get_irn_n_edges(node) == 0)
735 if (reg_node != node) {
736 const arch_register_t *realreg = &arch_env->registers[idx+i];
737 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
738 node, realreg->name, reg_node, get_nodes_block(node),
740 problem_found = true;
742 registers[idx+i] = NULL;
746 static void verify_block_register_allocation(ir_node *block, void *data)
750 assert(lv->sets_valid && "live sets must be computed");
752 unsigned n_regs = arch_env->n_registers;
753 registers = ALLOCANZ(const ir_node*, n_regs);
755 be_lv_foreach(lv, block, be_lv_state_end, lv_node) {
756 value_used(block, lv_node);
759 sched_foreach_reverse(block, node) {
761 if (get_irn_mode(node) == mode_T) {
762 foreach_out_edge(node, edge) {
763 ir_node *def = get_edge_src_irn(edge);
765 check_output_constraints(def);
769 check_output_constraints(node);
772 check_input_constraints(node);
774 /* process uses. (Phi inputs are no real uses) */
776 int arity = get_irn_arity(node);
777 for (int in = 0; in < arity; ++in) {
778 ir_node *use = get_irn_n(node, in);
779 value_used(block, use);
784 be_lv_foreach(lv, block, be_lv_state_in, lv_node) {
788 /* set must be empty now */
789 for (unsigned i = 0; i < n_regs; ++i) {
790 if (registers[i] == NULL)
793 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
794 registers[i], block, get_irg_name(irg));
795 problem_found = true;
799 bool be_verify_register_allocation(ir_graph *new_irg)
802 arch_env = be_get_irg_arch_env(irg);
803 lv = be_liveness_new(irg);
804 problem_found = false;
806 be_liveness_compute_sets(lv);
807 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
808 be_liveness_free(lv);
810 return !problem_found;
813 /*--------------------------------------------------------------------------- */
815 typedef struct lv_walker_t {
820 static const char *lv_flags_to_str(unsigned flags)
822 static const char *states[] = {
833 return states[flags & 7];
836 static void lv_check_walker(ir_node *bl, void *data)
838 lv_walker_t *w = (lv_walker_t*)data;
840 be_lv_t *fresh = (be_lv_t*)w->data;
842 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
843 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
845 if (!fr && curr && curr[0].head.n_members > 0) {
846 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
847 for (unsigned i = 0; i < curr[0].head.n_members; ++i) {
848 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].node.idx));
851 unsigned n_curr = curr[0].head.n_members;
852 unsigned n_fresh = fr[0].head.n_members;
854 if (n_curr != n_fresh) {
855 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
857 ir_fprintf(stderr, "current:\n");
858 for (unsigned i = 0; i < n_curr; ++i) {
859 be_lv_info_node_t *n = &curr[1 + i].node;
860 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
863 ir_fprintf(stderr, "correct:\n");
864 for (unsigned i = 0; i < n_fresh; ++i) {
865 be_lv_info_node_t *n = &fr[1 + i].node;
866 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
872 void be_liveness_check(be_lv_t *lv)
875 be_lv_t *fresh = be_liveness_new(lv->irg);
879 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
880 be_liveness_free(fresh);