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
48 #include "beintlive_t.h"
49 #include "belistsched.h"
51 static int my_values_interfere(const ir_node *a, const ir_node *b);
53 typedef struct be_verify_register_pressure_env_t_ {
54 ir_graph *irg; /**< the irg to verify */
55 be_lv_t *lv; /**< Liveness information. */
56 const arch_register_class_t *cls; /**< the register class to check for */
57 int registers_available; /**< number of available registers */
58 int problem_found; /**< flag indicating if a problem was found */
59 } be_verify_register_pressure_env_t;
62 * Print all nodes of a pset into a file.
64 static void print_living_values(FILE *F, const ir_nodeset_t *live_nodes)
66 ir_nodeset_iterator_t iter;
70 foreach_ir_nodeset(live_nodes, node, iter) {
71 ir_fprintf(F, "%+F ", node);
77 * Check if number of live nodes never exceeds the number of available registers.
79 static void verify_liveness_walker(ir_node *block, void *data)
81 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
82 ir_nodeset_t live_nodes;
86 /* collect register pressure info, start with end of a block */
87 // ir_fprintf(stderr, "liveness check %+F\n", block);
88 ir_nodeset_init(&live_nodes);
89 be_liveness_end_of_block(env->lv, env->cls, block,
92 // print_living_values(stderr, &live_nodes);
93 pressure = ir_nodeset_size(&live_nodes);
94 if (pressure > env->registers_available) {
95 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
96 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
97 print_living_values(stderr, &live_nodes);
98 env->problem_found = 1;
101 sched_foreach_reverse(block, irn) {
105 // print_living_values(stderr, &live_nodes);
106 be_liveness_transfer(env->cls, irn, &live_nodes);
108 pressure = ir_nodeset_size(&live_nodes);
110 if (pressure > env->registers_available) {
111 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
112 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
113 print_living_values(stderr, &live_nodes);
114 env->problem_found = 1;
118 ir_nodeset_destroy(&live_nodes);
122 * Start a walk over the irg and check the register pressure.
124 int be_verify_register_pressure(ir_graph *irg, const arch_register_class_t *cls)
126 be_verify_register_pressure_env_t env;
128 env.lv = be_liveness(irg);
131 env.registers_available = be_get_n_allocatable_regs(irg, cls);
132 env.problem_found = 0;
134 be_liveness_assure_sets(env.lv);
135 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
136 be_liveness_free(env.lv);
138 return ! env.problem_found;
143 /*--------------------------------------------------------------------------- */
147 typedef struct be_verify_schedule_env_t_ {
148 int problem_found; /**< flags indicating a problem */
149 bitset_t *scheduled; /**< bitset of scheduled nodes */
150 ir_graph *irg; /**< the irg to check */
151 } be_verify_schedule_env_t;
154 * Simple schedule checker.
156 static void verify_schedule_walker(ir_node *block, void *data)
158 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
160 ir_node *non_phi_found = NULL;
161 ir_node *cfchange_found = NULL;
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
168 * 2. No value is defined after it has been used
169 * 3. mode_T nodes have all projs scheduled behind them followed by Keeps
170 * (except mode_X projs)
172 sched_foreach(block, node) {
175 /* this node is scheduled */
176 if (bitset_is_set(env->scheduled, get_irn_idx(node))) {
177 ir_fprintf(stderr, "Verify warning: %+F appears to be schedule twice\n");
178 env->problem_found = 1;
180 bitset_set(env->scheduled, get_irn_idx(node));
182 /* Check that scheduled nodes are in the correct block */
183 if (get_nodes_block(node) != block) {
184 ir_fprintf(stderr, "Verify warning: %+F is in block %+F but scheduled in %+F\n", node, get_nodes_block(node), block);
185 env->problem_found = 1;
188 /* Check that timesteps are increasing */
189 timestep = sched_get_time_step(node);
190 if (timestep <= last_timestep) {
191 ir_fprintf(stderr, "Verify warning: Schedule timestep did not increase at node %+F\n",
193 env->problem_found = 1;
195 last_timestep = timestep;
197 /* Check that phis come before any other node */
199 if (non_phi_found != NULL) {
200 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes (for example %+F) in block %+F (%s)\n",
201 node, non_phi_found, block, get_irg_dump_name(env->irg));
202 env->problem_found = 1;
205 non_phi_found = node;
208 /* Check for control flow changing nodes */
210 /* check, that only one CF operation is scheduled */
211 if (cfchange_found != NULL) {
212 ir_fprintf(stderr, "Verify Warning: Additional control flow changing node %+F scheduled after %+F in block %+F (%s)\n",
213 node, block, cfchange_found, get_irg_dump_name(env->irg));
214 env->problem_found = 1;
216 cfchange_found = node;
218 } else if (cfchange_found != NULL) {
219 /* proj and keepany aren't real instructions... */
220 if (!is_Proj(node) && !be_is_Keep(node)) {
221 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node in block %+F (%s)\n",
222 node, block, get_irg_dump_name(env->irg));
223 env->problem_found = 1;
227 /* Check that all uses come before their definitions */
231 sched_timestep_t nodetime = sched_get_time_step(node);
232 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
233 ir_node *arg = get_irn_n(node, i);
234 if (get_nodes_block(arg) != block
235 || !sched_is_scheduled(arg))
238 if (sched_get_time_step(arg) >= nodetime) {
239 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
240 arg, node, block, get_irg_dump_name(env->irg));
241 env->problem_found = 1;
246 /* Check that no dead nodes are scheduled */
247 if (get_irn_n_edges(node) == 0) {
248 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
249 node, block, get_irg_dump_name(env->irg));
250 env->problem_found = 1;
253 if (be_is_Keep(node) || be_is_CopyKeep(node)) {
254 /* at least 1 of the keep arguments has to be its schedule
256 int arity = get_irn_arity(node);
258 ir_node *prev = sched_prev(node);
259 while (be_is_Keep(prev) || be_is_CopyKeep(prev))
260 prev = sched_prev(prev);
264 for (i = 0; i < arity; ++i) {
265 ir_node *in = get_irn_n(node, i);
272 prev = sched_prev(prev);
277 ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
278 node, block, get_irg_dump_name(env->irg));
279 env->problem_found = 1;
285 static void check_schedule(ir_node *node, void *data)
287 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*)data;
288 bool should_be = !is_Proj(node) && !(arch_get_irn_flags(node) & arch_irn_flags_not_scheduled);
289 bool scheduled = bitset_is_set(env->scheduled, get_irn_idx(node));
291 if (should_be != scheduled) {
292 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
293 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
294 env->problem_found = 1;
299 * Start a walk over the irg and check schedule.
301 int be_verify_schedule(ir_graph *irg)
303 be_verify_schedule_env_t env;
305 env.problem_found = 0;
307 env.scheduled = bitset_alloca(get_irg_last_idx(env.irg));
309 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
310 /* check if all nodes are scheduled */
311 irg_walk_graph(irg, check_schedule, NULL, &env);
313 return ! env.problem_found;
318 /*--------------------------------------------------------------------------- */
322 typedef struct spill_t {
332 } be_verify_spillslots_env_t;
334 static int cmp_spill(const void* d1, const void* d2, size_t size)
336 const spill_t* s1 = (const spill_t*)d1;
337 const spill_t* s2 = (const spill_t*)d2;
340 return s1->spill != s2->spill;
343 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node)
348 return (spill_t*)set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
351 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
354 int hash = HASH_PTR(node);
357 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
361 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
367 static ir_node *get_memory_edge(const ir_node *node)
370 ir_node *result = NULL;
372 arity = get_irn_arity(node);
373 for (i = arity - 1; i >= 0; --i) {
374 ir_node *arg = get_irn_n(node, i);
375 if (get_irn_mode(arg) == mode_M) {
376 assert(result == NULL);
384 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
386 static void be_check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent)
389 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
390 node, get_nodes_block(node), get_irg_dump_name(env->irg));
394 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
396 ir_entity *spillent = arch_get_frame_entity(node);
397 be_check_entity(env, node, spillent);
398 get_spill(env, node, ent);
400 if (spillent != ent) {
401 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
402 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
403 env->problem_found = 1;
407 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
411 int hash = HASH_PTR(node);
416 assert(is_Proj(node));
418 memperm = get_Proj_pred(node);
419 out = get_Proj_proj(node);
421 spillent = be_get_MemPerm_out_entity(memperm, out);
422 be_check_entity(env, memperm, spillent);
423 if (spillent != ent) {
424 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
425 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
426 env->problem_found = 1;
430 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
435 spill.ent = spillent;
436 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
438 for (i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
439 ir_node* arg = get_irn_n(memperm, i + 1);
440 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
442 collect(env, arg, memperm, argent);
446 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent)
450 int hash = HASH_PTR(node);
452 assert(is_Phi(node));
455 res = (spill_t*)set_find(env->spills, &spill, sizeof(spill), hash);
461 res = (spill_t*)set_insert(env->spills, &spill, sizeof(spill), hash);
463 /* is 1 of the arguments a spill? */
464 for (i = 0, arity = get_irn_arity(node); i < arity; ++i) {
465 ir_node* arg = get_irn_n(node, i);
466 collect(env, arg, reload, ent);
470 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent)
472 if (be_is_Spill(node)) {
473 collect_spill(env, node, reload, ent);
474 } else if (is_Proj(node)) {
475 collect_memperm(env, node, reload, ent);
476 } else if (is_Phi(node) && get_irn_mode(node) == mode_M) {
477 collect_memphi(env, node, reload, ent);
479 /* Disabled for now, spills might get transformed by the backend */
481 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
482 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
483 env->problem_found = 1;
489 * This walker function searches for reloads and collects all the spills
490 * and memphis attached to them.
492 static void collect_spills_walker(ir_node *node, void *data)
494 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
496 if (arch_irn_classify(node) & arch_irn_class_reload) {
497 ir_node *spill = get_memory_edge(node);
501 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
502 node, get_nodes_block(node), get_irg_dump_name(env->irg));
503 env->problem_found = 1;
506 ent = arch_get_frame_entity(node);
507 be_check_entity(env, node, ent);
509 collect(env, spill, node, ent);
510 ARR_APP1(ir_node*, env->reloads, node);
514 static void check_spillslot_interference(be_verify_spillslots_env_t *env)
516 int spillcount = set_count(env->spills);
517 spill_t **spills = ALLOCAN(spill_t*, spillcount);
522 foreach_set(env->spills, spill_t*, spill) {
526 for (i = 0; i < spillcount; ++i) {
527 spill_t *sp1 = spills[i];
530 for (i2 = i+1; i2 < spillcount; ++i2) {
531 spill_t *sp2 = spills[i2];
533 if (sp1->ent != sp2->ent)
536 if (my_values_interfere(sp1->spill, sp2->spill)) {
537 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
538 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
539 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
540 env->problem_found = 1;
541 my_values_interfere(sp1->spill, sp2->spill);
547 static void check_lonely_spills(ir_node *node, void *data)
549 be_verify_spillslots_env_t *env = (be_verify_spillslots_env_t*)data;
551 if (be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
552 spill_t *spill = find_spill(env, node);
553 if (be_is_Spill(node)) {
554 ir_entity *ent = arch_get_frame_entity(node);
555 be_check_entity(env, node, ent);
559 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
560 node, get_nodes_block(node), get_irg_dump_name(env->irg));
565 int be_verify_spillslots(ir_graph *irg)
567 be_verify_spillslots_env_t env;
570 env.spills = new_set(cmp_spill, 10);
571 env.reloads = NEW_ARR_F(ir_node*, 0);
572 env.problem_found = 0;
574 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
575 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
577 check_spillslot_interference(&env);
579 DEL_ARR_F(env.reloads);
582 return ! env.problem_found;
587 /*--------------------------------------------------------------------------- */
592 * Check, if two values interfere.
593 * @param a The first value.
594 * @param b The second value.
595 * @return 1, if a and b interfere, 0 if not.
597 static int my_values_interfere(const ir_node *a, const ir_node *b)
599 const ir_edge_t *edge;
601 int a2b = value_dominates(a, b);
602 int b2a = value_dominates(b, a);
604 /* If there is no dominance relation, they do not interfere. */
609 * Adjust a and b so, that a dominates b if
610 * a dominates b or vice versa.
613 const ir_node *t = a;
618 bb = get_nodes_block(b);
621 * Look at all usages of a.
622 * If there's one usage of a in the block of b, then
623 * we check, if this use is dominated by b, if that's true
624 * a and b interfere. Note that b must strictly dominate the user,
625 * since if b is the last user of in the block, b and a do not
627 * Uses of a not in b's block can be disobeyed, because the
628 * check for a being live at the end of b's block is already
631 foreach_out_edge(a, edge) {
632 const ir_node *user = get_edge_src_irn(edge);
636 if (get_irn_opcode(user) == iro_End)
639 /* in case of phi arguments we compare with the block the value comes from */
641 ir_node *phiblock = get_nodes_block(user);
644 user = get_irn_n(phiblock, get_edge_src_pos(edge));
647 if (value_dominates(b, user))
656 /*--------------------------------------------------------------------------- */
658 static const arch_env_t *arch_env;
659 static ir_graph *irg;
661 static bool problem_found;
662 static const ir_node **registers;
664 static void check_output_constraints(const ir_node *node)
666 if (arch_get_irn_reg_class(node) == NULL)
669 /* verify output register */
670 const arch_register_req_t *req = arch_get_irn_register_req(node);
671 const arch_register_t *reg = arch_get_irn_register(node);
673 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
674 node, get_nodes_block(node), get_irg_dump_name(irg));
675 problem_found = true;
676 } else if (!arch_reg_is_allocatable(req, reg)) {
677 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
678 reg->name, node, get_nodes_block(node), get_irg_dump_name(irg));
679 problem_found = true;
683 static void check_input_constraints(ir_node *node)
685 const arch_register_t *reg;
688 /* verify input register */
689 arity = get_irn_arity(node);
690 for (i = 0; i < arity; ++i) {
691 const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
692 ir_node *pred = get_irn_n(node, i);
693 const arch_register_req_t *pred_req = arch_get_irn_register_req(pred);
696 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
697 node, get_nodes_block(node), get_irg_dump_name(irg), i);
701 if (req->cls == NULL)
704 if (req->width > pred_req->width) {
705 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register width of value at input %d too small\n",
706 node, get_nodes_block(node), get_irg_dump_name(irg), i);
710 reg = arch_get_irn_register(pred);
711 if (req->type & arch_register_req_type_aligned) {
712 if (reg->index % req->width != 0) {
713 ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) register allignment not fulfilled\n",
714 node, get_nodes_block(node), get_irg_dump_name(irg), i);
720 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned (%+F input constraint)\n",
721 pred, get_nodes_block(pred), get_irg_dump_name(irg), node);
724 } else if (!arch_reg_is_allocatable(req, reg)) {
725 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
726 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(irg));
731 /* phis should be NOPs at this point, which means all input regs
732 * must be the same as the output reg */
734 reg = arch_get_irn_register(node);
736 arity = get_irn_arity(node);
737 for (i = 0; i < arity; ++i) {
738 ir_node *pred = get_Phi_pred(node, i);
739 const arch_register_t *pred_reg = arch_get_irn_register(pred);
741 if (reg != pred_reg && !(pred_reg->type & arch_register_type_joker)) {
742 const char *pred_name = pred_reg != NULL ? pred_reg->name : "(null)";
743 const char *reg_name = reg != NULL ? reg->name : "(null)";
744 ir_fprintf(stderr, "Verify warning: Input %d of %+F in block %+F(%s) uses register %s instead of %s\n",
745 i, node, get_nodes_block(node),
746 get_irg_dump_name(irg), pred_name, reg_name);
753 static void value_used(const ir_node *block, const ir_node *node)
755 const arch_register_t *reg = arch_get_irn_register(node);
756 const arch_register_req_t *req;
760 if (reg == NULL || reg->type & arch_register_type_virtual)
763 req = arch_get_irn_register_req(node);
764 assert(req->width > 0);
765 idx = reg->global_index;
766 for (i = 0; i < req->width; ++i) {
767 const ir_node *reg_node = registers[idx+i];
768 if (reg_node != NULL && reg_node != node) {
769 const arch_register_t *realreg = &arch_env->registers[idx+i];
770 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s) (nodes %+F %+F)\n",
771 realreg->name, block, get_irg_dump_name(irg),
773 problem_found = true;
775 registers[idx+i] = node;
779 static void value_def(const ir_node *node)
781 const arch_register_t *reg = arch_get_irn_register(node);
782 const arch_register_req_t *req;
786 if (reg == NULL || reg->type & arch_register_type_virtual)
789 req = arch_get_irn_register_req(node);
790 assert(req->width > 0);
791 idx = reg->global_index;
792 for (i = 0; i < req->width; ++i) {
793 const ir_node *reg_node = registers[idx+i];
795 /* a little cheat, since its so hard to remove all outedges to dead code
796 * in the backend. This particular case should never be a problem. */
797 if (reg_node == NULL && get_irn_n_edges(node) == 0)
800 if (reg_node != node) {
801 const arch_register_t *realreg = &arch_env->registers[idx+i];
802 ir_fprintf(stderr, "Verify warning: Node %+F not registered as value for Register %s (but %+F) in block %+F(%s)\n",
803 node, realreg->name, reg_node, get_nodes_block(node),
804 get_irg_dump_name(irg));
805 problem_found = true;
807 registers[idx+i] = NULL;
811 static void verify_block_register_allocation(ir_node *block, void *data)
820 assert(lv->nodes && "live sets must be computed");
822 n_regs = arch_env->n_registers;
823 registers = ALLOCANZ(const ir_node*, n_regs);
825 be_lv_foreach(lv, block, be_lv_state_end, idx) {
826 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
827 value_used(block, lv_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) */
850 arity = get_irn_arity(node);
851 for (in = 0; in < arity; ++in) {
852 ir_node *use = get_irn_n(node, in);
853 value_used(block, use);
858 be_lv_foreach(lv, block, be_lv_state_in, idx) {
859 ir_node *lv_node = be_lv_get_irn(lv, block, idx);
863 /* set must be empty now */
864 for (i = 0; i < n_regs; ++i) {
865 if (registers[i] == NULL)
868 ir_fprintf(stderr, "Verify warning: Node %+F not live-in and no def found in block %+F(%s)\n",
869 registers[i], block, get_irg_dump_name(irg));
870 problem_found = true;
874 bool be_verify_register_allocation(ir_graph *new_irg)
877 arch_env = be_get_irg_arch_env(irg);
878 lv = be_liveness(irg);
879 problem_found = false;
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;