2 * Author: Matthias Braun
4 * Copyright: (c) Universitaet Karlsruhe
5 * License: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
14 #include "besched_t.h"
26 static int my_values_interfere(const ir_node *a, const ir_node *b);
28 typedef struct be_verify_register_pressure_env_t_ {
29 ir_graph *irg; /**< the irg to verify */
30 be_lv_t *lv; /**< Liveness information. */
31 const arch_env_t *arch_env; /**< an architecture environment */
32 const arch_register_class_t *cls; /**< the register class to check for */
33 int registers_available; /**< number of available registers */
34 int problem_found; /**< flag indicating if a problem was found */
35 } be_verify_register_pressure_env_t;
38 * Print all nodes of a pset into a file.
40 static void print_living_values(FILE *F, pset *live_nodes)
45 foreach_pset(live_nodes, node) {
46 ir_fprintf(F, "%+F ", node);
52 * Check if number of live nodes never exceeds the number of available registers.
54 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 arch_env_t *arch_env, const arch_register_class_t *cls, ir_graph *irg)
95 be_verify_register_pressure_env_t env;
97 env.lv = be_liveness(irg);
99 env.arch_env = arch_env;
101 env.registers_available = arch_count_non_ignore_regs(arch_env, cls);
102 env.problem_found = 0;
104 irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
105 be_liveness_free(env.lv);
107 return ! env.problem_found;
110 typedef struct be_verify_schedule_env_t_ {
111 int problem_found; /**< flags indicating if there was a problem */
112 ir_graph *irg; /**< the irg to check */
113 } be_verify_schedule_env_t;
116 * Simple schedule checker.
118 static void verify_schedule_walker(ir_node *block, void *data)
120 be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
122 int non_phi_found = 0;
123 int cfchange_found = 0;
124 // TODO ask arch about delay branches
125 int delay_branches = 0;
126 pset *uses = pset_new_ptr_default();
129 * Tests for the following things:
130 * 1. Make sure that all phi nodes are scheduled at the beginning of the block
131 * 2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
132 * 3. No value is defined after it has been used
134 sched_foreach(block, node) {
140 ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
141 node, block, get_irg_dump_name(env->irg));
142 env->problem_found = 1;
148 // 2. Check for control flow changing nodes
149 if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
150 /* check, that only one CF operation is scheduled */
151 if (cfchange_found == 1) {
152 ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
153 node, block, get_irg_dump_name(env->irg));
154 env->problem_found = 1;
157 } else if (cfchange_found) {
158 // proj and keepany aren't real instructions...
159 if(!is_Proj(node) && !be_is_Keep(node)) {
160 /* check for delay branches */
161 if (delay_branches == 0) {
162 ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
163 node, block, get_irg_dump_name(env->irg));
164 env->problem_found = 1;
172 if(pset_find_ptr(uses, node)) {
173 ir_fprintf(stderr, "Verify Warning: Value %+F used before it was defined in block %+F (%s)\n",
174 node, block, get_irg_dump_name(env->irg));
175 env->problem_found = 1;
178 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
179 pset_insert_ptr(uses, get_irn_n(node, i));
185 /* check that all delay branches are filled (at least with NOPs) */
186 if (cfchange_found && delay_branches != 0) {
187 ir_fprintf(stderr, "Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
188 block, get_irg_dump_name(env->irg));
189 env->problem_found = 1;
194 * Start a walk over the irg and check schedule.
196 int be_verify_schedule(ir_graph *irg)
198 be_verify_schedule_env_t env;
200 env.problem_found = 0;
203 irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
205 return ! env.problem_found;
210 //---------------------------------------------------------------------------
214 typedef struct _spill_t {
225 } be_verify_spillslots_env_t;
227 static int cmp_spill(const void* d1, const void* d2, size_t size) {
228 const spill_t* s1 = d1;
229 const spill_t* s2 = d2;
230 return s1->spill != s2->spill;
233 static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, entity *ent) {
235 int hash = HASH_PTR(node);
238 res = set_find(env->spills, &spill, sizeof(spill), hash);
242 res = set_insert(env->spills, &spill, sizeof(spill), hash);
248 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent);
250 static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
251 entity *spillent = be_get_frame_entity(node);
252 get_spill(env, node, ent);
254 if(spillent != ent) {
255 ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
256 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
257 env->problem_found = 1;
261 static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
264 int hash = HASH_PTR(node);
269 assert(is_Proj(node));
271 memperm = get_Proj_pred(node);
272 out = get_Proj_proj(node);
274 spillent = be_get_MemPerm_out_entity(memperm, out);
275 if(spillent != ent) {
276 ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
277 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
278 env->problem_found = 1;
282 res = set_find(env->spills, &spill, sizeof(spill), hash);
287 spill.ent = spillent;
288 res = set_insert(env->spills, &spill, sizeof(spill), hash);
290 for(i = 0, arity = get_irn_arity(memperm); i < arity; ++i) {
291 ir_node* arg = get_irn_n(memperm, i);
292 entity* argent = be_get_MemPerm_in_entity(memperm, i);
294 collect(env, arg, memperm, argent);
298 static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity *ent) {
301 int hash = HASH_PTR(node);
303 assert(is_Phi(node));
306 res = set_find(env->spills, &spill, sizeof(spill), hash);
312 res = set_insert(env->spills, &spill, sizeof(spill), hash);
314 // is 1 of the arguments a spill?
315 for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
316 ir_node* arg = get_irn_n(node, i);
317 collect(env, arg, reload, ent);
321 static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
322 if(be_is_Spill(node)) {
323 collect_spill(env, node, reload, ent);
324 } else if(is_Proj(node)) {
325 collect_memperm(env, node, reload, ent);
326 } else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
327 collect_memphi(env, node, reload, ent);
329 ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
330 node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
331 env->problem_found = 1;
336 * This walker function searches for reloads and collects all the spills
337 * and memphis attached to them.
339 static void collect_spills_walker(ir_node *node, void *data) {
340 be_verify_spillslots_env_t *env = data;
342 if(be_is_Reload(node)) {
343 ir_node *spill = get_irn_n(node, be_pos_Reload_mem);
344 entity* ent = be_get_frame_entity(node);
346 collect(env, spill, node, ent);
347 ARR_APP1(ir_node*, env->reloads, node);
351 static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
352 int spillcount = set_count(env->spills);
353 spill_t **spills = alloca(spillcount * sizeof(spills[0]));
357 for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
361 for(i = 0; i < spillcount; ++i) {
362 spill_t *sp1 = spills[i];
365 for(i2 = i+1; i2 < spillcount; ++i2) {
366 spill_t *sp2 = spills[i2];
368 if(sp1->ent != sp2->ent)
371 if(my_values_interfere(sp1->spill, sp2->spill)) {
372 ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
373 sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
374 sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
375 env->problem_found = 1;
376 my_values_interfere(sp1->spill, sp2->spill);
377 printf("Intf: %d\n", values_interfere(env->lv, sp1->spill, sp2->spill));
383 int be_verify_spillslots(ir_graph *irg)
385 be_verify_spillslots_env_t env;
388 env.spills = new_set(cmp_spill, 10);
389 env.reloads = NEW_ARR_F(ir_node*, 0);
390 env.problem_found = 0;
391 env.lv = be_liveness(irg);
393 irg_walk_graph(irg, collect_spills_walker, NULL, &env);
395 check_spillslot_interference(&env);
397 be_liveness_free(env.lv);
398 DEL_ARR_F(env.reloads);
401 return ! env.problem_found;
406 //---------------------------------------------------------------------------
411 * Check, if two values interfere.
412 * @param a The first value.
413 * @param b The second value.
414 * @return 1, if a and b interfere, 0 if not.
416 static int my_values_interfere(const ir_node *a, const ir_node *b)
418 const ir_edge_t *edge;
420 int a2b = value_dominates(a, b);
421 int b2a = value_dominates(b, a);
423 /* If there is no dominance relation, they do not interfere. */
428 * Adjust a and b so, that a dominates b if
429 * a dominates b or vice versa.
432 const ir_node *t = a;
437 bb = get_nodes_block(b);
440 * Look at all usages of a.
441 * If there's one usage of a in the block of b, then
442 * we check, if this use is dominated by b, if that's true
443 * a and b interfere. Note that b must strictly dominate the user,
444 * since if b is the last user of in the block, b and a do not
446 * Uses of a not in b's block can be disobeyed, because the
447 * check for a being live at the end of b's block is already
450 foreach_out_edge(a, edge) {
451 const ir_node *user = get_edge_src_irn(edge);
455 if(get_irn_opcode(user) == iro_End)
458 // in case of phi arguments we compare with the block the value comes from
460 ir_node *phiblock = get_nodes_block(user);
463 user = get_irn_n(phiblock, get_edge_src_pos(edge));
466 if(value_dominates(b, user))