2 * Contains some useful function for the backend.
3 * @author Sebastian Hack
25 #include "besched_t.h"
28 /* Get an always empty set. */
29 pset *be_empty_set(void)
31 static pset *empty_set = NULL;
34 empty_set = pset_new_ptr(1);
36 assert(pset_count(empty_set) == 0);
45 static void dump_allocated_block(ir_node *block, void *data)
49 struct dump_env *dump_env = data;
50 FILE *f = dump_env->f;
51 arch_env_t *env = dump_env->env;
53 ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
54 sched_foreach(block, irn) {
55 const char *prefix = "";
57 const arch_register_t *reg = arch_get_irn_register(env, irn);
61 ir_fprintf(f, "%s = ", arch_register_get_name(reg));
63 ir_fprintf(f, "%n(", irn);
65 if(block != get_irg_start_block(get_irn_irg(block))) {
66 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
67 ir_node *op = get_irn_n(irn, i);
68 if(arch_is_register_operand(dump_env->env, op, -1)) {
69 ir_fprintf(f, "%s%s", prefix,
70 arch_register_get_name(arch_get_irn_register(env, op)));
78 ir_fprintf(f, "\"}\n");
80 if(get_irg_start_block(get_irn_irg(block)) != block) {
81 for(i = 0, n = get_irn_arity(block); i < n; ++i) {
82 ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
83 ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
88 void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
95 ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
97 if((env.f = fopen(buf, "wt")) != NULL) {
98 fprintf(env.f, "graph:{title:\"prg\"\n");
99 irg_block_walk_graph(irg, dump_allocated_block, NULL, &env);
100 fprintf(env.f, "}\n");
105 static void localize_const_walker(ir_node *irn, void *data)
110 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
111 ir_node *op = get_irn_n(irn, i);
112 if(get_irn_opcode(op) == iro_Const) {
113 ir_node *tgt_block, *cnst;
115 /* Special treatment for phi nodes, because phi-usage is different */
116 tgt_block = get_nodes_block(irn);
118 tgt_block = get_nodes_block(get_irn_n(tgt_block, i));
121 * We have to create the const node by ourselves, since the
122 * firmcons implementation always places it in the start block.
124 cnst = new_ir_node(NULL, get_irn_irg(irn),
125 tgt_block, op_Const, get_irn_mode(op), 0, NULL);
126 cnst->attr.con.tv = get_Const_tarval(op);
127 set_irn_n(irn, i, cnst);
133 void localize_consts(ir_graph *irg)
135 irg_walk_graph(irg, localize_const_walker, NULL, NULL);
136 dead_node_elimination(irg);
140 * Edge hook to dump the schedule edges.
142 static int sched_edge_hook(FILE *F, ir_node *irn)
144 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
145 ir_node *prev = sched_prev(irn);
146 fprintf(F, "edge:{sourcename:\"");
148 fprintf(F, "\" targetname:\"");
150 fprintf(F, "\" color:magenta}\n");
155 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
156 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
158 dump_consts_local(0);
159 set_dump_node_edge_hook(sched_edge_hook);
160 dump_ir_block_graph(irg, suffix);
161 set_dump_node_edge_hook(old);
164 void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
165 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
167 dump_consts_local(0);
168 set_dump_node_edge_hook(sched_edge_hook);
169 dump_ir_extblock_graph(irg, suffix);
170 set_dump_node_edge_hook(old);
174 * Dumps a graph and numbers all dumps.
175 * @param irg The graph
176 * @param suffix A suffix to its file name.
177 * @param dumper The dump function
179 void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)) {
180 static ir_graph *last_irg = NULL;
184 if (irg != last_irg) {
189 snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
190 buf[sizeof(buf) - 1] = '\0';
196 static void collect_phis(ir_node *irn, void *data)
199 ir_node *bl = get_nodes_block(irn);
200 set_irn_link(irn, get_irn_link(bl));
201 set_irn_link(bl, irn);
205 void be_clear_links(ir_graph *irg)
207 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
210 void be_collect_phis(ir_graph *irg)
212 irg_walk_graph(irg, collect_phis, NULL, NULL);
215 static void count_num_reachable_nodes(ir_node *irn, void *env) {
220 unsigned get_num_reachable_nodes(ir_graph *irg) {
222 irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
226 /* FIXME: not used. can be deleted? */
227 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
230 /* search the current block */
231 for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
232 if (pset_find_ptr(accept, irn))
235 /* FIXME: This is obviously buggy: after the first recursive call idom is a block
236 and get_nodes_block will fail.
237 Moreover, why not a simple iteration instead of recursion */
238 idom = get_Block_idom(get_nodes_block(start_point_exclusive));
241 return dom_up_search(accept, idom); /* continue search in idom-block */
243 return NULL; /* this was the start block and we did not find an acceptable irn */