2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Various verify routines that check a scheduled graph for correctness.
9 * @author Matthias Braun
33 #include "beintlive_t.h"
34 #include "belistsched.h"
36 static bool my_values_interfere(const ir_node *a, const ir_node *b);
38 typedef struct be_verify_register_pressure_env_t_ {
39 ir_graph *irg; /**< the irg to verify */
40 be_lv_t *lv; /**< Liveness information. */
41 const arch_register_class_t *cls; /**< the register class to check for */
42 unsigned registers_available; /**< number of available registers */
43 bool problem_found; /**< flag indicating if a problem was found */
44 } be_verify_register_pressure_env_t;
47 * Print all nodes of a pset into a file.
49 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes)
52 foreach_ir_nodeset(live_nodes, node, iter) {
53 ir_fprintf(F, "%+F ", node);
58 static const char *get_irg_name(ir_graph *irg)
60 ir_entity *entity = get_irg_entity(irg);
61 return get_entity_ld_name(entity);
65 * Check if number of live nodes never exceeds the number of available registers.
67 static void verify_liveness_walker(ir_node *block, void *data)
69 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
70 ir_nodeset_t live_nodes;
72 /* collect register pressure info, start with end of a block */
73 ir_nodeset_init(&live_nodes);
74 be_liveness_end_of_block(env->lv, env->cls, block,
77 unsigned pressure = ir_nodeset_size(&live_nodes);
78 if (pressure > env->registers_available) {
79 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
80 block, get_irg_name(env->irg), pressure, env->registers_available);
81 print_living_values(stderr, &live_nodes);
82 env->problem_found = true;
85 sched_foreach_reverse(block, irn) {
89 // print_living_values(stderr, &live_nodes);
90 be_liveness_transfer(env->cls, irn, &live_nodes);
92 pressure = ir_nodeset_size(&live_nodes);
94 if (pressure > env->registers_available) {
95 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
96 irn, block, get_irg_name(env->irg), pressure, env->registers_available);
97 print_living_values(stderr, &live_nodes);
98 env->problem_found = true;
102 ir_nodeset_destroy(&live_nodes);
105 bool be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
107 be_verify_register_pressure_env_t env;
109 env.lv = be_liveness_new(irg);
112 env.registers_available = be_get_n_allocatable_regs(irg, cls);
113 env.problem_found = false;
115 be_liveness_compute_sets(env.lv);
116 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
117 be_liveness_free(env.lv);
119 return ! env.problem_found;
122 /*--------------------------------------------------------------------------- */
124 typedef struct be_verify_schedule_env_t_ {
125 bool problem_found; /**< flags indicating a problem */
126 bitset_t *scheduled; /**< bitset of scheduled nodes */
127 ir_graph *irg; /**< the irg to check */
128 } be_verify_schedule_env_t;
130 static void verify_schedule_walker(ir_node *block, void *data)
132 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
133 ir_node *non_phi_found = NULL;
134 ir_node *cfchange_found = NULL;
135 int last_timestep = INT_MIN;
138 * Tests for the following things:
139 * 1. Make sure that all phi nodes are scheduled at the beginning of the
141 * 2. No value is defined after it has been used
142 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
143 * (except mode_X projs)
145 sched_foreach(block, node) {
146 /* this node is scheduled */
147 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
148 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
149 env->problem_found = true;
151 bitset_set(env->scheduled, get_irn_idx(node));
153 /* Check that scheduled nodes are in the correct block */
154 if (get_nodes_block(node) != block) {
155 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
156 env->problem_found = true;
159 /* Check that timesteps are increasing */
160 int timestep = sched_get_time_step(node);
161 if (timestep <= last_timestep) {
162 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
164 env->problem_found = true;
166 last_timestep = timestep;
168 if (arch_get_irn_flags(node) & arch_irn_flags_not_scheduled) {
169 ir_fprintf(stderr, "Verify warning: flags_not_scheduled node %+F scheduled anyway\n", node);
170 env->problem_found = true;
173 /* Check that phis come before any other node */
175 if (non_phi_found != NULL) {
176 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
177 node, non_phi_found, block, get_irg_name(env->irg));
178 env->problem_found = true;
181 non_phi_found = node;
184 /* Check for control flow changing nodes */
186 /* check, that only one CF operation is scheduled */
187 if (cfchange_found != NULL) {
188 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
189 node, block, cfchange_found, get_irg_name(env->irg));
190 env->problem_found = true;
192 cfchange_found = node;
194 } else if (cfchange_found != NULL) {
195 /* keepany isn't a real instruction. */
196 if (!be_is_Keep(node)) {
197 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
198 node, block, get_irg_name(env->irg));
199 env->problem_found = true;
203 /* Check that all uses come before their definitions */
205 sched_timestep_t nodetime = sched_get_time_step(node);
206 int arity = get_irn_arity(node);
207 for (int i = 0; i < arity; ++i) {
208 ir_node *arg = get_irn_n(node, i);
209 if (get_nodes_block(arg) != block || !sched_is_scheduled(arg))
212 if (sched_get_time_step(arg) >= nodetime) {
213 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
214 arg, node, block, get_irg_name(env->irg));
215 env->problem_found = true;
220 /* Check that no dead nodes are scheduled */
221 if (get_irn_n_edges(node) == 0) {
222 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
223 node, block, get_irg_name(env->irg));
224 env->problem_found = true;
227 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
228 /* at least 1 of the keep arguments has to be its schedule
230 ir_node *prev = sched_prev(node);
231 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
232 prev = sched_prev(prev);
234 int arity = get_irn_arity(node);
237 for (int i = 0; i < arity; ++i) {
238 ir_node *in = get_irn_n(node, i);
245 prev = sched_prev(prev);
250 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
251 node, block, get_irg_name(env->irg));
252 env->problem_found = true;
258 static void check_schedule(ir_node *node, void *data)
260 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
261 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
262 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
264 if (should_be != scheduled) {
265 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
266 node, get_nodes_block(node), get_irg_name(env->irg), should_be ? "" : " not");
267 env->problem_found = true;
271 bool be_verify_schedule(ir_graph *irg)
273 be_verify_schedule_env_t env;
275 env.problem_found = false;
277 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
279 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
280 /* check if all nodes are scheduled */
281 irg_walk_graph(irg, check_schedule, NULL, &env);
283 return ! env.problem_found;
286 /*--------------------------------------------------------------------------- */
288 typedef struct spill_t {
298 } be_verify_spillslots_env_t;
300 static int cmp_spill(const void* d1, const void* d2, size_t size)
303 const spill_t* s1 = (const spill_t*)d1;
304 const spill_t* s2 = (const spill_t*)d2;
305 return s1->spill != s2->spill;
308 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
312 return set_find(spill_t, env->spills, &spill, sizeof(spill), hash_ptr(node));
315 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
317 int hash = hash_ptr(node);
320 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
324 res = set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
330 static ir_node *get_memory_edge(const ir_node *node)
332 ir_node *result = NULL;
333 int arity = get_irn_arity(node);
334 for (int i = arity - 1; i >= 0; --i) {
335 ir_node *arg = get_irn_n(node, i);
336 if (get_irn_mode(arg) == mode_M) {
337 assert(result == NULL);
345 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
347 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
350 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
351 node, get_nodes_block(node), get_irg_name(env->irg));
355 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
357 ir_entity *spillent = arch_get_frame_entity(node);
358 be_check_entity(env, node, spillent);
359 get_spill(env, node, ent);
361 if (spillent != ent) {
362 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
363 node, reload, get_nodes_block(node), get_irg_name(env->irg));
364 env->problem_found = true;
368 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
370 ir_node *memperm = get_Proj_pred(node);
371 int out = get_Proj_proj(node);
373 ir_entity *spillent = be_get_MemPerm_out_entity(memperm, out);
374 be_check_entity(env, memperm, spillent);
375 if (spillent != ent) {
376 ir_fprintf(stderr, "Verify warning: MemPerm %+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;
381 int hash = hash_ptr(node);
384 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
389 spill.ent = spillent;
390 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
392 int arity = be_get_MemPerm_entity_arity(memperm);
393 for (int i = 0; i < arity; ++i) {
394 ir_node* arg = get_irn_n(memperm, i + 1);
395 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
397 collect(env, arg, memperm, argent);
401 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
403 assert(is_Phi(node));
405 int hash = hash_ptr(node);
408 spill_t *res = set_find(spill_t, env->spills, &spill, sizeof(spill), hash);
414 (void)set_insert(spill_t, env->spills, &spill, sizeof(spill), hash);
416 /* is 1 of the arguments a spill? */
417 int arity = get_irn_arity(node);
418 for (int i = 0; i < arity; ++i) {
419 ir_node* arg = get_irn_n(node, i);
420 collect(env, arg, reload, ent);
424 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
426 if (be_is_Spill(node)) {
427 collect_spill(env, node, reload, ent);
428 } else if (is_Proj(node)) {
429 collect_memperm(env, node, reload, ent);
430 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
431 collect_memphi(env, node, reload, ent);
436 * This walker function searches for reloads and collects all the spills
437 * and memphis attached to them.
439 static void collect_spills_walker(ir_node *node, void *data)
441 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
443 if (be_is_Reload(node)) {
444 ir_node *spill = get_memory_edge(node);
446 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
447 node, get_nodes_block(node), get_irg_name(env->irg));
448 env->problem_found = true;
451 ir_entity *ent = arch_get_frame_entity(node);
452 be_check_entity(env, node, ent);
454 collect(env, spill, node, ent);
455 ARR_APP1(ir_node*, env->reloads, node);
459 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
461 int spillcount = set_count(env->spills);
462 spill_t **spills = ALLOCAN(spill_t*, spillcount);
465 foreach_set(env->spills, spill_t, spill) {
468 assert(s == spillcount);
470 for (int i = 0; i < spillcount; ++i) {
471 spill_t *sp1 = spills[i];
473 for (int i2 = i+1; i2 < spillcount; ++i2) {
474 spill_t *sp2 = spills[i2];
476 if (sp1->ent != sp2->ent)
479 if (my_values_interfere(sp1->spill, sp2->spill)) {
480 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
481 sp1->spill, get_nodes_block(sp1->spill), get_irg_name(env->irg),
482 sp2->spill, get_nodes_block(sp2->spill), get_irg_name(env->irg));
483 env->problem_found = true;
484 my_values_interfere(sp1->spill, sp2->spill);
490 static void check_lonely_spills(ir_node *node, void *data)
492 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
494 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
495 spill_t *spill = find_spill(env, node);
496 if (be_is_Spill(node)) {
497 ir_entity *ent = arch_get_frame_entity(node);
498 be_check_entity(env, node, ent);
502 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reload\n",
503 node, get_nodes_block(node), get_irg_name(env->irg));
508 bool be_verify_spillslots(ir_graph *irg)
510 be_verify_spillslots_env_t env;
513 env.spills = new_set(cmp_spill, 10);
514 env.reloads = NEW_ARR_F(ir_node*, 0);
515 env.problem_found = false;
517 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
518 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
520 check_spillslot_interference(&env);
522 DEL_ARR_F(env.reloads);
525 return ! env.problem_found;
528 /*--------------------------------------------------------------------------- */
531 * Check, if two values interfere.
532 * @param a The first value.
533 * @param b The second value.
534 * @return 1, if a and b interfere, 0 if not.
536 static bool my_values_interfere(const ir_node *a, const ir_node *b)
538 int a2b = value_dominates(a, b);
539 int b2a = value_dominates(b, a);
541 /* If there is no dominance relation, they do not interfere. */
546 * Adjust a and b so, that a dominates b if
547 * a dominates b or vice versa.
550 const ir_node *t = a;
555 ir_node *bb = get_nodes_block(b);
558 * Look at all usages of a.
559 * If there's one usage of a in the block of b, then
560 * we check, if this use is dominated by b, if that's true
561 * a and b interfere. Note that b must strictly dominate the user,
562 * since if b is the last user of in the block, b and a do not
564 * Uses of a not in b's block can be disobeyed, because the
565 * check for a being live at the end of b's block is already
568 foreach_out_edge(a, edge) {
569 const ir_node *user = get_edge_src_irn(edge);
573 if (get_irn_opcode(user) == iro_End)
576 /* in case of phi arguments we compare with the block the value comes from */
578 ir_node *phiblock = get_nodes_block(user);
581 user = get_irn_n(phiblock, get_edge_src_pos(edge));
584 if (value_dominates(b, user))
591 /*--------------------------------------------------------------------------- */
593 static const arch_env_t *arch_env;
594 static ir_graph *irg;
596 static bool problem_found;
597 static const ir_node **registers;
599 static void check_output_constraints(const ir_node *node)
601 if (arch_get_irn_reg_class(node) == NULL)
604 /* verify output register */
605 const arch_register_req_t *req = arch_get_irn_register_req(node);
606 const arch_register_t *reg = arch_get_irn_register(node);
608 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
609 node, get_nodes_block(node), get_irg_name(irg));
610 problem_found = true;
611 } else if (!arch_reg_is_allocatable(req, reg)) {
612 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
613 reg->name, node, get_nodes_block(node), get_irg_name(irg));
614 problem_found = true;
618 static void check_input_constraints(ir_node *node)
620 /* verify input register */
621 int arity = get_irn_arity(node);
622 for (int i = 0; i < arity; ++i) {
623 ir_node *pred = get_irn_n(node, i);
625 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
626 node, get_nodes_block(node), get_irg_name(irg), i);
631 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
632 if (req->cls == NULL)
635 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
636 if (req->width > pred_req->width) {
637 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
638 node, get_nodes_block(node), get_irg_name(irg), i);
642 const arch_register_t *reg = arch_get_irn_register(pred);
644 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
645 pred, get_nodes_block(pred), get_irg_name(irg), node);
648 } else if (!arch_reg_is_allocatable(req, reg)) {
649 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
650 reg->name, i, node, get_nodes_block(node), get_irg_name(irg));
655 /* phis should be NOPs at this point, which means all input regs
656 * must be the same as the output reg */
658 const arch_register_t *reg = arch_get_irn_register(node);
660 int arity = get_irn_arity(node);
661 for (int i = 0; i < arity; ++i) {
662 ir_node *pred = get_Phi_pred(node, i);
663 const arch_register_t *pred_reg = arch_get_irn_register(pred);
665 if (reg != pred_reg && !(pred_reg->type & arch_register_type_virtual)) {
666 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
667 const char *reg_name = reg != NULL ? reg->name : "(null)";
668 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
669 i, node, get_nodes_block(node),
670 get_irg_name(irg), pred_name, reg_name);
671 problem_found = true;
677 static void value_used(const ir_node *block, const ir_node *node)
679 const arch_register_t *reg = arch_get_irn_register(node);
680 if (reg == NULL || reg->type & arch_register_type_virtual)
683 const arch_register_req_t *req = arch_get_irn_register_req(node);
684 assert(req->width > 0);
685 unsigned idx = reg->global_index;
686 for (unsigned i = 0; i < req->width; ++i) {
687 const ir_node *reg_node = registers[idx+i];
688 if (reg_node != NULL && reg_node != node) {
689 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
690 reg->name, block, get_irg_name(irg),
692 problem_found = true;
694 registers[idx+i] = node;
698 static void value_def(const ir_node *node)
700 const arch_register_t *reg = arch_get_irn_register(node);
702 if (reg == NULL || reg->type & arch_register_type_virtual)
705 const arch_register_req_t *req = arch_get_irn_register_req(node);
706 assert(req->width > 0);
707 unsigned idx = reg->global_index;
708 for (unsigned i = 0; i < req->width; ++i) {
709 const ir_node *reg_node = registers[idx+i];
711 /* a little cheat, since its so hard to remove all outedges to dead code
712 * in the backend. This particular case should never be a problem. */
713 if (reg_node == NULL && get_irn_n_edges(node) == 0)
716 if (reg_node != node) {
717 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
718 node, reg->name, reg_node, get_nodes_block(node),
720 problem_found = true;
722 registers[idx+i] = NULL;
726 static void verify_block_register_allocation(ir_node *block, void *data)
730 assert(lv->sets_valid && "live sets must be computed");
732 unsigned n_regs = arch_env->n_registers;
733 registers = ALLOCANZ(const ir_node*, n_regs);
735 be_lv_foreach(lv, block, be_lv_state_end, lv_node) {
736 value_used(block, lv_node);
739 sched_foreach_reverse(block, node) {
740 be_foreach_value(node, value,
742 check_output_constraints(value);
745 check_input_constraints(node);
747 /* process uses. (Phi inputs are no real uses) */
749 int arity = get_irn_arity(node);
750 for (int in = 0; in < arity; ++in) {
751 ir_node *use = get_irn_n(node, in);
752 value_used(block, use);
757 be_lv_foreach(lv, block, be_lv_state_in, lv_node) {
761 /* set must be empty now */
762 for (unsigned i = 0; i < n_regs; ++i) {
763 if (registers[i] == NULL)
766 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
767 registers[i], block, get_irg_name(irg));
768 problem_found = true;
772 bool be_verify_register_allocation(ir_graph *new_irg)
775 arch_env = be_get_irg_arch_env(irg);
776 lv = be_liveness_new(irg);
777 problem_found = false;
779 be_liveness_compute_sets(lv);
780 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
781 be_liveness_free(lv);
783 return !problem_found;
786 /*--------------------------------------------------------------------------- */
788 typedef struct lv_walker_t {
793 static const char *lv_flags_to_str(unsigned flags)
795 static const char *states[] = {
806 return states[flags & 7];
809 static void lv_check_walker(ir_node *bl, void *data)
811 lv_walker_t *w = (lv_walker_t*)data;
812 be_lv_t *fresh = (be_lv_t*)w->data;
814 be_lv_info_t *curr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
815 be_lv_info_t *fr = ir_nodehashmap_get(be_lv_info_t, &fresh->map, bl);
817 if (!fr && curr && curr[0].head.n_members > 0) {
818 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
819 for (unsigned i = 0; i < curr[0].head.n_members; ++i) {
820 ir_fprintf(stderr, "\t%+F\n", curr[1 + i].node.node);
823 unsigned n_curr = curr[0].head.n_members;
824 unsigned n_fresh = fr[0].head.n_members;
826 if (n_curr != n_fresh) {
827 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
829 ir_fprintf(stderr, "current:\n");
830 for (unsigned i = 0; i < n_curr; ++i) {
831 be_lv_info_node_t *n = &curr[1 + i].node;
832 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
835 ir_fprintf(stderr, "correct:\n");
836 for (unsigned i = 0; i < n_fresh; ++i) {
837 be_lv_info_node_t *n = &fr[1 + i].node;
838 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, n->node, lv_flags_to_str(n->flags));
844 void be_liveness_check(be_lv_t *lv)
847 be_lv_t *fresh = be_liveness_new(lv->irg);
851 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
852 be_liveness_free(fresh);