2 * Author: Matthias Braun
4 * Copyright: (c) Universitaet Karlsruhe
5 * License: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
25 #include "besched_t.h"
28 static int my_values_interfere(const ir_node *a, const ir_node *b);
30 typedef struct be_verify_register_pressure_env_t_ {
31 ir_graph *irg; /**< the irg to verify */
32 be_lv_t *lv; /**< Liveness information. */
33 const arch_env_t *arch_env; /**< an architecture environment */
34 const arch_register_class_t *cls; /**< the register class to check for */
35 int registers_available; /**< number of available registers */
36 int problem_found; /**< flag indicating if a problem was found */
37 } be_verify_register_pressure_env_t;
40 * Print all nodes of a pset into a file.
42 static void print_living_values(FILE *F, pset *live_nodes) {
46 foreach_pset(live_nodes, node) {
47 ir_fprintf(F, "%+F ", node);
53 * Check if number of live nodes never exceeds the number of available registers.
55 static void verify_liveness_walker(ir_node *block, void *data) {
56 be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
57 pset *live_nodes = pset_new_ptr_default();
61 /* collect register pressure info, start with end of a block */
62 be_liveness_end_of_block(env->lv, env->arch_env, env->cls, block, live_nodes);
64 pressure = pset_count(live_nodes);
65 if(pressure > env->registers_available) {
66 ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
67 block, get_irg_dump_name(env->irg), pressure, env->registers_available);
68 print_living_values(stderr, live_nodes);
69 env->problem_found = 1;
72 sched_foreach_reverse(block, irn) {
76 be_liveness_transfer(env->arch_env, env->cls, irn, live_nodes);
78 pressure = pset_count(live_nodes);
80 if(pressure > env->registers_available) {
81 ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
82 irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
83 print_living_values(stderr, live_nodes);
84 env->problem_found = 1;
91 * Start a walk over the irg and check the register pressure.
93 int be_verify_register_pressure(const be_irg_t *birg, const arch_register_class_t *cls, ir_graph *irg) {
94 be_verify_register_pressure_env_t env;
96 env.lv = be_liveness(irg);
98 env.arch_env = birg->main_env->arch_env;
100 env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
101 env.problem_found = 0;
103 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
104 be_liveness_free(env.lv);
106 return ! env.problem_found;
109 typedef struct be_verify_schedule_env_t_ {
110 int problem_found; /**< flags indicating if there was a problem */
111 ir_graph *irg; /**< the irg to check */
112 } be_verify_schedule_env_t;
115 * Simple schedule checker.
117 static void verify_schedule_walker(ir_node *block, void *data) {
118 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
120 int non_phi_found = 0;
121 int cfchange_found = 0;
122 // TODO ask arch about delay branches
123 int delay_branches = 0;
126 * Tests for the following things:
127 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
128 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
129 * 3. No value is defined after it has been used
131 sched_foreach(block, node) {
137 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
138 node, block, get_irg_dump_name(env->irg));
139 env->problem_found = 1;
145 // 2. Check for control flow changing nodes
146 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
147 /* check, that only one CF operation is scheduled */
148 if (cfchange_found == 1) {
149 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
150 node, block, get_irg_dump_name(env->irg));
151 env->problem_found = 1;
154 } else if (cfchange_found) {
155 // proj and keepany aren't real instructions...
156 if(!is_Proj(node) && !be_is_Keep(node)) {
157 /* check for delay branches */
158 if (delay_branches == 0) {
159 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
160 node, block, get_irg_dump_name(env->irg));
161 env->problem_found = 1;
170 int nodetime = sched_get_time_step(node);
171 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
172 ir_node *arg = get_irn_n(node, i);
173 if(get_nodes_block(arg) != block
174 || !sched_is_scheduled(arg))
177 if(sched_get_time_step(arg) >= nodetime) {
178 ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
179 arg, node, block, get_irg_dump_name(env->irg));
180 env->problem_found = 1;
185 // 4. check for dead nodes
186 if(get_irn_n_edges(node) == 0) {
187 ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
188 node, block, get_irg_dump_name(env->irg));
189 env->problem_found = 1;
193 /* check that all delay branches are filled (at least with NOPs) */
194 if (cfchange_found && delay_branches != 0) {
195 ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
196 block, get_irg_dump_name(env->irg));
197 env->problem_found = 1;
201 static int should_be_scheduled(ir_node *node) {
205 if(get_irn_mode(node) == mode_M) {
208 if(is_Phi(node) || is_Sync(node) || is_Pin(node))
211 if(is_Proj(node) && get_irn_mode(node) == mode_X)
213 if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
216 switch(get_irn_opcode(node)) {
228 static void check_schedule(ir_node *node, void *data) {
229 be_verify_schedule_env_t *env = data;
232 should_be = should_be_scheduled(node);
236 if(should_be ? !sched_is_scheduled(node) : sched_is_scheduled(node)) {
237 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
238 node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
239 env->problem_found = 1;
244 * Start a walk over the irg and check schedule.
246 int be_verify_schedule(ir_graph *irg)
248 be_verify_schedule_env_t env;
250 env.problem_found = 0;
253 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
254 // check if all nodes are scheduled
255 irg_walk_graph(irg, check_schedule, NULL, &env);
257 return ! env.problem_found;
262 //---------------------------------------------------------------------------
266 typedef struct _spill_t {
272 const arch_env_t *arch_env;
277 } be_verify_spillslots_env_t;
279 static int cmp_spill(const void* d1, const void* d2, size_t size) {
280 const spill_t* s1 = d1;
281 const spill_t* s2 = d2;
282 return s1->spill != s2->spill;
285 static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
289 return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
292 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
294 int hash = HASH_PTR(node);
297 res = set_find(env->spills, &spill, sizeof(spill), hash);
301 res = set_insert(env->spills, &spill, sizeof(spill), hash);
307 static ir_node *get_memory_edge(const ir_node *node) {
309 ir_node *result = NULL;
311 arity = get_irn_arity(node);
312 for(i = arity - 1; i >= 0; --i) {
313 ir_node *arg = get_irn_n(node, i);
314 if(get_irn_mode(arg) == mode_M) {
315 assert(result == NULL);
323 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent);
325 static void check_entity(be_verify_spillslots_env_t *env, ir_node *node, ir_entity *ent) {
327 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
328 node, get_nodes_block(node), get_irg_dump_name(env->irg));
332 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
333 ir_entity *spillent = arch_get_frame_entity(env->arch_env, node);
334 check_entity(env, node, spillent);
335 get_spill(env, node, ent);
337 if(spillent != ent) {
338 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
339 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
340 env->problem_found = 1;
344 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
347 int hash = HASH_PTR(node);
352 assert(is_Proj(node));
354 memperm = get_Proj_pred(node);
355 out = get_Proj_proj(node);
357 spillent = be_get_MemPerm_out_entity(memperm, out);
358 check_entity(env, memperm, spillent);
359 if(spillent != ent) {
360 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
361 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
362 env->problem_found = 1;
366 res = set_find(env->spills, &spill, sizeof(spill), hash);
371 spill.ent = spillent;
372 res = set_insert(env->spills, &spill, sizeof(spill), hash);
374 for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
375 ir_node* arg = get_irn_n(memperm, i + 1);
376 ir_entity* argent = be_get_MemPerm_in_entity(memperm, i);
378 collect(env, arg, memperm, argent);
382 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity *ent) {
385 int hash = HASH_PTR(node);
387 assert(is_Phi(node));
390 res = set_find(env->spills, &spill, sizeof(spill), hash);
396 res = set_insert(env->spills, &spill, sizeof(spill), hash);
398 // is 1 of the arguments a spill?
399 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
400 ir_node* arg = get_irn_n(node, i);
401 collect(env, arg, reload, ent);
405 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, ir_entity* ent) {
406 if(be_is_Spill(node)) {
407 collect_spill(env, node, reload, ent);
408 } else if(is_Proj(node)) {
409 collect_memperm(env, node, reload, ent);
410 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
411 collect_memphi(env, node, reload, ent);
413 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
414 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
415 env->problem_found = 1;
420 * This walker function searches for reloads and collects all the spills
421 * and memphis attached to them.
423 static void collect_spills_walker(ir_node *node, void *data) {
424 be_verify_spillslots_env_t *env = data;
425 const arch_env_t *arch_env = env->arch_env;
427 // @@@ ia32_classify returns classification of Proj_pred :-/
431 if(arch_irn_class_is(arch_env, node, reload)) {
432 ir_node *spill = get_memory_edge(node);
436 ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
437 node, get_nodes_block(node), get_irg_dump_name(env->irg));
438 env->problem_found = 1;
441 ent = arch_get_frame_entity(env->arch_env, node);
442 check_entity(env, node, ent);
444 collect(env, spill, node, ent);
445 ARR_APP1(ir_node*, env->reloads, node);
449 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
450 int spillcount = set_count(env->spills);
451 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
455 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
459 for(i = 0; i < spillcount; ++i) {
460 spill_t *sp1 = spills[i];
463 for(i2 = i+1; i2 < spillcount; ++i2) {
464 spill_t *sp2 = spills[i2];
466 if(sp1->ent != sp2->ent)
469 if(my_values_interfere(sp1->spill, sp2->spill)) {
470 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
471 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
472 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
473 env->problem_found = 1;
474 my_values_interfere(sp1->spill, sp2->spill);
480 static void check_lonely_spills(ir_node *node, void *data) {
481 be_verify_spillslots_env_t *env = data;
483 if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
484 spill_t *spill = find_spill(env, node);
485 if(be_is_Spill(node)) {
486 ir_entity *ent = arch_get_frame_entity(env->arch_env, node);
487 check_entity(env, node, ent);
491 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
492 node, get_nodes_block(node), get_irg_dump_name(env->irg));
497 int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
499 be_verify_spillslots_env_t env;
501 env.arch_env = arch_env;
503 env.spills = new_set(cmp_spill, 10);
504 env.reloads = NEW_ARR_F(ir_node*, 0);
505 env.problem_found = 0;
507 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
508 irg_walk_graph(irg, check_lonely_spills, NULL, &env);
510 check_spillslot_interference(&env);
512 DEL_ARR_F(env.reloads);
515 return ! env.problem_found;
520 //---------------------------------------------------------------------------
525 * Check, if two values interfere.
526 * @param a The first value.
527 * @param b The second value.
528 * @return 1, if a and b interfere, 0 if not.
530 static int my_values_interfere(const ir_node *a, const ir_node *b) {
531 const ir_edge_t *edge;
533 int a2b = value_dominates(a, b);
534 int b2a = value_dominates(b, a);
536 /* If there is no dominance relation, they do not interfere. */
541 * Adjust a and b so, that a dominates b if
542 * a dominates b or vice versa.
545 const ir_node *t = a;
550 bb = get_nodes_block(b);
553 * Look at all usages of a.
554 * If there's one usage of a in the block of b, then
555 * we check, if this use is dominated by b, if that's true
556 * a and b interfere. Note that b must strictly dominate the user,
557 * since if b is the last user of in the block, b and a do not
559 * Uses of a not in b's block can be disobeyed, because the
560 * check for a being live at the end of b's block is already
563 foreach_out_edge(a, edge) {
564 const ir_node *user = get_edge_src_irn(edge);
568 if(get_irn_opcode(user) == iro_End)
571 // in case of phi arguments we compare with the block the value comes from
573 ir_node *phiblock = get_nodes_block(user);
576 user = get_irn_n(phiblock, get_edge_src_pos(edge));
579 if(value_dominates(b, user))
588 //---------------------------------------------------------------------------
592 typedef struct _be_verify_register_allocation_env_t {
593 const arch_env_t *arch_env;
597 } be_verify_register_allocation_env_t;
599 static void check_register_constraints(ir_node *node, be_verify_register_allocation_env_t *env) {
600 const arch_env_t *arch_env = env->arch_env;
601 const arch_register_t *reg;
604 /* verify output register */
605 if (arch_get_irn_reg_class(arch_env, node, -1) != NULL) {
606 reg = arch_get_irn_register(arch_env, 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_dump_name(env->irg));
610 env->problem_found = 1;
612 else if (! arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(arch_env, node, -1, reg)) {
613 ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
614 reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
615 env->problem_found = 1;
619 /* verify input register */
620 arity = get_irn_arity(node);
621 for (i = 0; i < arity; ++i) {
622 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_dump_name(env->irg), i);
627 env->problem_found = 1;
631 if (arch_get_irn_reg_class(arch_env, node, i) == NULL)
634 reg = arch_get_irn_register(arch_env, pred);
636 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
637 pred, get_nodes_block(pred), get_irg_dump_name(env->irg));
638 env->problem_found = 1;
641 else if (! arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(arch_env, node, i, reg)) {
642 ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
643 reg->name, i, node, get_nodes_block(node), get_irg_dump_name(env->irg));
644 env->problem_found = 1;
649 static void check_register_allocation(be_verify_register_allocation_env_t *env,
650 const arch_register_class_t *regclass, pset *nodes) {
651 const arch_env_t *arch_env = env->arch_env;
652 const arch_register_t *reg = NULL;
654 bitset_t *registers = bitset_alloca(arch_register_class_n_regs(regclass));
657 foreach_pset(nodes, node) {
658 if (arch_get_irn_reg_class(arch_env, node, -1) != regclass)
661 reg = arch_get_irn_register(arch_env, node);
663 /* this problem is already reported in 'check_register_constraints' */
667 if (bitset_is_set(registers, reg->index)) {
672 bitset_set(registers, reg->index);
676 ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s)\n",
677 reg->name, get_nodes_block(node), get_irg_dump_name(env->irg));
678 env->problem_found = 1;
680 foreach_pset(nodes, node) {
681 if (arch_get_irn_register(arch_env, node) == reg) {
682 ir_fprintf(stderr, " at node %+F\n", node);
688 static void verify_block_register_allocation(ir_node *block, void *data) {
689 be_verify_register_allocation_env_t *env = data;
690 const arch_env_t *arch_env = env->arch_env;
691 const arch_isa_t *isa = arch_env->isa;
694 nregclasses = arch_isa_get_n_reg_class(isa);
695 for (i = 0; i < nregclasses; ++i) {
696 const arch_register_class_t *regclass = arch_isa_get_reg_class(isa, i);
698 pset *live_nodes = pset_new_ptr_default();
700 be_liveness_end_of_block(env->lv, env->arch_env, regclass, block, live_nodes);
701 check_register_allocation(env, regclass, live_nodes);
703 sched_foreach_reverse(block, node) {
707 be_liveness_transfer(env->arch_env, regclass, node, live_nodes);
708 check_register_allocation(env, regclass, live_nodes);
709 check_register_constraints(node, env);
712 del_pset(live_nodes);
716 int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg) {
717 be_verify_register_allocation_env_t env;
719 env.arch_env = arch_env;
721 env.lv = be_liveness(irg);
722 env.problem_found = 0;
724 irg_block_walk_graph(irg, verify_block_register_allocation, NULL, &env);
726 be_liveness_free(env.lv);
728 return !env.problem_found;
733 //---------------------------------------------------------------------------
737 typedef struct _verify_out_dead_nodes_env {
742 } verify_out_dead_nodes_env;
744 static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
745 const ir_edge_t* edge;
747 foreach_out_edge(node, edge) {
748 ir_node* src = get_edge_src_irn(edge);
750 if(!bitset_is_set(env->reachable, get_irn_idx(src))) {
751 ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
752 src, get_nodes_block(src), get_irg_dump_name(env->irg), node);
753 env->problem_found = 1;
756 if(!bitset_is_set(env->visited, get_irn_idx(src))) {
757 bitset_set(env->visited, get_irn_idx(src));
759 check_out_edges(src, env);
764 static void set_reachable(ir_node *node, void* data)
766 bitset_t* reachable = data;
767 bitset_set(reachable, get_irn_idx(node));
770 int be_verify_out_edges(ir_graph *irg) {
771 verify_out_dead_nodes_env env;
773 env.reachable = bitset_alloca(get_irg_last_idx(irg));
774 env.visited = bitset_alloca(get_irg_last_idx(irg));
775 env.problem_found = 0;
777 irg_walk_graph(irg, set_reachable, NULL, env.reachable);
778 check_out_edges(get_irg_start(irg), &env);
780 return !env.problem_found;