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"
49 static int my_values_interfere(const ir_node *a, const ir_node *b);
51 typedef struct be_verify_register_pressure_env_t_ {
52 ir_graph *irg; /**< the irg to verify */
53 be_lv_t *lv; /**< Liveness information. */
54 const arch_register_class_t *cls; /**< the register class to check for */
55 int registers_available; /**< number of available registers */
56 int problem_found; /**< flag indicating if a problem was found */
57 } be_verify_register_pressure_env_t;
60 * Print all nodes of a pset into a file.
62 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes)
64 ir_nodeset_iterator_t iter;
68 foreach_ir_nodeset(live_nodes, node, iter) {
69 ir_fprintf(F, "%+F ", node);
75 * Check if number of live nodes never exceeds the number of available registers.
77 static void verify_liveness_walker(ir_node *block, void *data)
79 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
80 ir_nodeset_t live_nodes;
84 /* collect register pressure info, start with end of a block */
85 // ir_fprintf(stderr, "liveness check %+F\n", block);
86 ir_nodeset_init(&live_nodes);
87 be_liveness_end_of_block(env->lv, env->cls, block,
90 // print_living_values(stderr, &live_nodes);
91 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_dump_name(env->irg), pressure, env->registers_available);
95 print_living_values(stderr, &live_nodes);
96 env->problem_found = 1;
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_dump_name(env->irg), pressure, env->registers_available);
111 print_living_values(stderr, &live_nodes);
112 env->problem_found = 1;
116 ir_nodeset_destroy(&live_nodes);
120 * Start a walk over the irg and check the register pressure.
122 int be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
124 be_verify_register_pressure_env_t env;
126 env.lv = be_liveness(irg);
129 env.registers_available = be_get_n_allocatable_regs(irg, cls);
130 env.problem_found = 0;
132 be_liveness_assure_sets(env.lv);
133 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
134 be_liveness_free(env.lv);
136 return ! env.problem_found;
141 /*--------------------------------------------------------------------------- */
145 typedef struct be_verify_schedule_env_t_ {
146 int problem_found; /**< flags indicating a problem */
147 bitset_t *scheduled; /**< bitset of scheduled nodes */
148 ir_graph *irg; /**< the irg to check */
149 } be_verify_schedule_env_t;
152 * Simple schedule checker.
154 static void verify_schedule_walker(ir_node *block, void *data)
156 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
158 ir_node *non_phi_found = NULL;
159 int cfchange_found = 0;
160 /* TODO ask arch about delay branches */
161 int delay_branches = 0;
162 int last_timestep = INT_MIN;
165 * Tests for the following things:
166 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
167 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
168 * 3. No value is defined after it has been used
169 * 4. mode_T nodes have all projs scheduled behind them followed by Keeps
170 * (except mode_X projs)
172 sched_foreach(block, node) {
176 /* this node is scheduled */
177 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
178 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
179 env->problem_found = 1;
181 bitset_set(env->scheduled, get_irn_idx(node));
183 /* Check that scheduled nodes are in the correct block */
184 if (get_nodes_block(node) != block) {
185 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
186 env->problem_found = 1;
189 /* Check that timesteps are increasing */
190 timestep = sched_get_time_step(node);
191 if (timestep <= last_timestep) {
192 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
194 env->problem_found = 1;
196 last_timestep = timestep;
198 /* Check that phis come before any other node */
200 if (non_phi_found != NULL) {
201 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
202 node, non_phi_found, block, get_irg_dump_name(env->irg));
203 env->problem_found = 1;
206 non_phi_found = node;
209 /* Check for control flow changing nodes */
210 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
211 /* check, that only one CF operation is scheduled */
212 if (cfchange_found == 1) {
213 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
214 node, block, get_irg_dump_name(env->irg));
215 env->problem_found = 1;
218 } else if (cfchange_found) {
219 /* proj and keepany aren't real instructions... */
220 if (!is_Proj(node) && !be_is_Keep(node)) {
221 /* check for delay branches */
222 if (delay_branches == 0) {
223 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
224 node, block, get_irg_dump_name(env->irg));
225 env->problem_found = 1;
232 /* Check that all uses come before their definitions */
234 int nodetime = sched_get_time_step(node);
235 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
236 ir_node *arg = get_irn_n(node, i);
237 if (get_nodes_block(arg) != block
238 || !sched_is_scheduled(arg))
241 if (sched_get_time_step(arg) >= nodetime) {
242 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
243 arg, node, block, get_irg_dump_name(env->irg));
244 env->problem_found = 1;
249 /* Check that no dead nodes are scheduled */
250 if (get_irn_n_edges(node) == 0) {
251 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
252 node, block, get_irg_dump_name(env->irg));
253 env->problem_found = 1;
256 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
257 /* at least 1 of the keep arguments has to be its schedule
259 int arity = get_irn_arity(node);
261 ir_node *prev = sched_prev(node);
262 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
263 prev = sched_prev(prev);
266 for (i = 0; i < arity; ++i) {
267 ir_node *in = get_irn_n(node, i);
274 prev = sched_prev(prev);
279 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
280 node, block, get_irg_dump_name(env->irg));
281 env->problem_found = 1;
286 /* check that all delay branches are filled (at least with NOPs) */
287 if (cfchange_found && delay_branches != 0) {
288 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
289 block, get_irg_dump_name(env->irg));
290 env->problem_found = 1;
294 static void check_schedule(ir_node *node, void *data)
296 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
297 bool should_be = to_appear_in_schedule(node);
298 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
300 if (should_be != scheduled) {
301 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
302 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
303 env->problem_found = 1;
308 * Start a walk over the irg and check schedule.
310 int be_verify_schedule(ir_graph *irg)
312 be_verify_schedule_env_t env;
314 env.problem_found = 0;
316 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
318 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
319 /* check if all nodes are scheduled */
320 irg_walk_graph(irg, check_schedule, NULL, &env);
322 return ! env.problem_found;
327 /*--------------------------------------------------------------------------- */
331 typedef struct spill_t {
341 } be_verify_spillslots_env_t;
343 static int cmp_spill(const void* d1, const void* d2, size_t size)
345 const spill_t* s1 = (const spill_t*)d1;
346 const spill_t* s2 = (const spill_t*)d2;
349 return s1->spill != s2->spill;
352 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
357 return (spill_t*)set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
360 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
363 int hash = HASH_PTR(node);
366 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
370 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
376 static ir_node *get_memory_edge(const ir_node *node)
379 ir_node *result = NULL;
381 arity = get_irn_arity(node);
382 for (i = arity - 1; i >= 0; --i) {
383 ir_node *arg = get_irn_n(node, i);
384 if (get_irn_mode(arg) == mode_M) {
385 assert(result == NULL);
393 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
395 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
398 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
399 node, get_nodes_block(node), get_irg_dump_name(env->irg));
403 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
405 ir_entity *spillent = arch_get_frame_entity(node);
406 be_check_entity(env, node, spillent);
407 get_spill(env, node, ent);
409 if (spillent != ent) {
410 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
411 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
412 env->problem_found = 1;
416 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
420 int hash = HASH_PTR(node);
425 assert(is_Proj(node));
427 memperm = get_Proj_pred(node);
428 out = get_Proj_proj(node);
430 spillent = be_get_MemPerm_out_entity(memperm, out);
431 be_check_entity(env, memperm, spillent);
432 if (spillent != ent) {
433 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
434 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
435 env->problem_found = 1;
439 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
444 spill.ent = spillent;
445 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
447 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
448 ir_node* arg = get_irn_n(memperm, i + 1);
449 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
451 collect(env, arg, memperm, argent);
455 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
459 int hash = HASH_PTR(node);
461 assert(is_Phi(node));
464 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
470 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
472 /* is 1 of the arguments a spill? */
473 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
474 ir_node* arg = get_irn_n(node, i);
475 collect(env, arg, reload, ent);
479 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
481 if (be_is_Spill(node)) {
482 collect_spill(env, node, reload, ent);
483 } else if (is_Proj(node)) {
484 collect_memperm(env, node, reload, ent);
485 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
486 collect_memphi(env, node, reload, ent);
488 /* Disabled for now, spills might get transformed by the backend */
490 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
491 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
492 env->problem_found = 1;
498 * This walker function searches for reloads and collects all the spills
499 * and memphis attached to them.
501 static void collect_spills_walker(ir_node *node, void *data)
503 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
505 if (arch_irn_classify(node) & arch_irn_class_reload) {
506 ir_node *spill = get_memory_edge(node);
510 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
511 node, get_nodes_block(node), get_irg_dump_name(env->irg));
512 env->problem_found = 1;
515 ent = arch_get_frame_entity(node);
516 be_check_entity(env, node, ent);
518 collect(env, spill, node, ent);
519 ARR_APP1(ir_node*, env->reloads, node);
523 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
525 int spillcount = set_count(env->spills);
526 spill_t **spills = ALLOCAN(spill_t*, spillcount);
531 foreach_set(env->spills, spill_t*, spill) {
535 for (i = 0; i < spillcount; ++i) {
536 spill_t *sp1 = spills[i];
539 for (i2 = i+1; i2 < spillcount; ++i2) {
540 spill_t *sp2 = spills[i2];
542 if (sp1->ent != sp2->ent)
545 if (my_values_interfere(sp1->spill, sp2->spill)) {
546 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
547 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
548 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
549 env->problem_found = 1;
550 my_values_interfere(sp1->spill, sp2->spill);
556 static void check_lonely_spills(ir_node *node, void *data)
558 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
560 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
561 spill_t *spill = find_spill(env, node);
562 if (be_is_Spill(node)) {
563 ir_entity *ent = arch_get_frame_entity(node);
564 be_check_entity(env, node, ent);
568 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
569 node, get_nodes_block(node), get_irg_dump_name(env->irg));
574 int be_verify_spillslots(ir_graph *irg)
576 be_verify_spillslots_env_t env;
579 env.spills = new_set(cmp_spill, 10);
580 env.reloads = NEW_ARR_F(ir_node*, 0);
581 env.problem_found = 0;
583 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
584 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
586 check_spillslot_interference(&env);
588 DEL_ARR_F(env.reloads);
591 return ! env.problem_found;
596 /*--------------------------------------------------------------------------- */
601 * Check, if two values interfere.
602 * @param a The first value.
603 * @param b The second value.
604 * @return 1, if a and b interfere, 0 if not.
606 static int my_values_interfere(const ir_node *a, const ir_node *b)
608 const ir_edge_t *edge;
610 int a2b = value_dominates(a, b);
611 int b2a = value_dominates(b, a);
613 /* If there is no dominance relation, they do not interfere. */
618 * Adjust a and b so, that a dominates b if
619 * a dominates b or vice versa.
622 const ir_node *t = a;
627 bb = get_nodes_block(b);
630 * Look at all usages of a.
631 * If there's one usage of a in the block of b, then
632 * we check, if this use is dominated by b, if that's true
633 * a and b interfere. Note that b must strictly dominate the user,
634 * since if b is the last user of in the block, b and a do not
636 * Uses of a not in b's block can be disobeyed, because the
637 * check for a being live at the end of b's block is already
640 foreach_out_edge(a, edge) {
641 const ir_node *user = get_edge_src_irn(edge);
645 if (get_irn_opcode(user) == iro_End)
648 /* in case of phi arguments we compare with the block the value comes from */
650 ir_node *phiblock = get_nodes_block(user);
653 user = get_irn_n(phiblock, get_edge_src_pos(edge));
656 if (value_dominates(b, user))
665 /*--------------------------------------------------------------------------- */
667 static const arch_env_t *arch_env;
668 static ir_graph *irg;
670 static int problem_found;
671 static const arch_register_class_t *regclass;
672 static ir_node **registers;
674 static void check_output_constraints(ir_node *node)
676 /* verify output register */
677 if (arch_get_irn_reg_class_out(node) == regclass) {
678 const arch_register_t *reg = arch_get_irn_register(node);
680 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
681 node, get_nodes_block(node), get_irg_dump_name(irg));
683 } else if (!(reg->type & arch_register_type_joker) && !arch_reg_out_is_allocatable(node, reg)) {
684 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
685 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
691 static void check_input_constraints(ir_node *node)
693 const arch_register_t *reg;
696 /* verify input register */
697 arity = get_irn_arity(node);
698 for (i = 0; i < arity; ++i) {
699 const arch_register_req_t *req = arch_get_in_register_req(node, i);
700 ir_node *pred = get_irn_n(node, i);
701 const arch_register_req_t *pred_req = arch_get_register_req_out(pred);
704 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
705 node, get_nodes_block(node), get_irg_dump_name(irg), i);
709 if (req->cls == NULL)
712 if (req->width > pred_req->width) {
713 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
714 node, get_nodes_block(node), get_irg_dump_name(irg), i);
718 reg = arch_get_irn_register(pred);
719 if (req->type & arch_register_req_type_aligned) {
720 if (reg->index % req->width != 0) {
721 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
722 node, get_nodes_block(node), get_irg_dump_name(irg), i);
728 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
729 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
732 } else if (!(reg->type & arch_register_type_joker) && ! arch_reg_is_allocatable(node, i, reg)) {
733 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
734 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
739 /* phis should be NOPs at this point, which means all input regs
740 * must be the same as the output reg */
744 reg = arch_get_irn_register(node);
746 arity = get_irn_arity(node);
747 for (i = 0; i < arity; ++i) {
748 ir_node *pred = get_Phi_pred(node, i);
749 const arch_register_t *pred_reg = arch_get_irn_register(pred);
751 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
752 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
753 const char *reg_name = reg != NULL ? reg->name : "(null)";
754 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
755 i, node, get_nodes_block(node),
756 get_irg_dump_name(irg), pred_name, reg_name);
763 static void value_used(ir_node *block, ir_node *node)
765 const arch_register_t *reg;
768 if (arch_get_irn_reg_class_out(node) != regclass)
771 reg = arch_get_irn_register(node);
772 if (reg == NULL || reg->type & arch_register_type_virtual)
775 reg_node = registers[reg->index];
776 if (reg_node != NULL && reg_node != node) {
777 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
778 reg->name, block, get_irg_dump_name(irg),
783 registers[reg->index] = node;
786 static void value_def(ir_node *node)
788 const arch_register_t *reg;
791 if (arch_get_irn_reg_class_out(node) != regclass)
794 reg = arch_get_irn_register(node);
795 if (reg == NULL || reg->type & arch_register_type_virtual)
798 reg_node = registers[reg->index];
800 if (reg_node != node) {
801 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
802 node, reg->name, reg_node, get_nodes_block(node), get_irg_dump_name(irg));
805 registers[reg->index] = NULL;
808 static void verify_block_register_allocation(ir_node *block, void *data)
813 nregclasses = arch_env->n_register_classes;
814 for (i = 0; i < nregclasses; ++i) {
818 regclass = &arch_env->register_classes[i];
820 assert(lv->nodes && "live sets must be computed");
822 n_regs = arch_register_class_n_regs(regclass);
823 registers = ALLOCANZ(ir_node*, n_regs);
825 be_lv_foreach(lv, block, be_lv_state_end, idx) {
826 ir_node *node = be_lv_get_irn(lv, block, idx);
827 value_used(block, node);
830 sched_foreach_reverse(block, node) {
833 if (get_irn_mode(node) == mode_T) {
834 const ir_edge_t *edge;
835 foreach_out_edge(node, edge) {
836 ir_node *def = get_edge_src_irn(edge);
838 check_output_constraints(def);
842 check_output_constraints(node);
845 check_input_constraints(node);
847 /* process uses. (Phi inputs are no real uses) */
849 arity = get_irn_arity(node);
850 for (i2 = 0; i2 < arity; ++i2) {
851 ir_node *use = get_irn_n(node, i2);
852 value_used(block, use);
857 be_lv_foreach(lv, block, be_lv_state_in, idx) {
858 ir_node *node = be_lv_get_irn(lv, block, idx);
862 /* set must be empty now */
863 for (i2 = 0; i2 < n_regs; ++i2) {
864 if (registers[i2] == NULL)
867 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
868 registers[i2], block, get_irg_dump_name(irg));
874 int be_verify_register_allocation(ir_graph *new_irg)
877 arch_env = be_get_irg_arch_env(irg);
878 lv = be_liveness(irg);
881 be_liveness_assure_sets(lv);
882 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, NULL);
884 be_liveness_free(lv);
886 return !problem_found;