20 #include "besched_t.h"
23 /* Get an always empty set. */
24 pset *be_empty_set(void)
26 static pset *empty_set = NULL;
29 empty_set = pset_new_ptr(1);
31 assert(pset_count(empty_set) == 0);
40 static void dump_allocated_block(ir_node *block, void *data)
44 struct dump_env *dump_env = data;
45 FILE *f = dump_env->f;
46 arch_env_t *env = dump_env->env;
48 ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
49 sched_foreach(block, irn) {
50 const char *prefix = "";
52 const arch_register_t *reg = arch_get_irn_register(env, irn);
56 ir_fprintf(f, "%s = ", arch_register_get_name(reg));
58 ir_fprintf(f, "%n(", irn);
60 if(block != get_irg_start_block(get_irn_irg(block))) {
61 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
62 ir_node *op = get_irn_n(irn, i);
63 if(arch_is_register_operand(dump_env->env, op, -1)) {
64 ir_fprintf(f, "%s%s", prefix,
65 arch_register_get_name(arch_get_irn_register(env, op)));
73 ir_fprintf(f, "\"}\n");
75 if(get_irg_start_block(get_irn_irg(block)) != block) {
76 for(i = 0, n = get_irn_arity(block); i < n; ++i) {
77 ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
78 ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
83 void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
90 ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
92 if((env.f = fopen(buf, "wt")) != NULL) {
93 fprintf(env.f, "graph:{title:\"prg\"\n");
94 irg_block_walk_graph(irg, dump_allocated_block, NULL, &env);
95 fprintf(env.f, "}\n");
100 static void localize_const_walker(ir_node *irn, void *data)
105 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
106 ir_node *op = get_irn_n(irn, i);
107 if(get_irn_opcode(op) == iro_Const) {
108 ir_node *tgt_block, *cnst;
110 /* Special treatment for phi nodes, because phi-usage is different */
111 tgt_block = get_nodes_block(irn);
113 tgt_block = get_nodes_block(get_irn_n(tgt_block, i));
116 * We have to create the const node by ourselves, since the
117 * firmcons implementation always places it in the start block.
119 cnst = new_ir_node(NULL, get_irn_irg(irn),
120 tgt_block, op_Const, get_irn_mode(op), 0, NULL);
121 cnst->attr.con.tv = get_Const_tarval(op);
122 set_irn_n(irn, i, cnst);
128 void localize_consts(ir_graph *irg)
130 irg_walk_graph(irg, localize_const_walker, NULL, NULL);
131 dead_node_elimination(irg);
135 * Edge hook to dump the schedule edges.
137 static int sched_edge_hook(FILE *F, ir_node *irn)
139 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
140 ir_node *prev = sched_prev(irn);
141 fprintf(F, "edge:{sourcename:\"");
143 fprintf(F, "\" targetname:\"");
145 fprintf(F, "\" color:magenta}\n");
150 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
151 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
153 dump_consts_local(0);
154 set_dump_node_edge_hook(sched_edge_hook);
155 dump_ir_block_graph(irg, suffix);
156 set_dump_node_edge_hook(old);
159 void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
160 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
162 dump_consts_local(0);
163 set_dump_node_edge_hook(sched_edge_hook);
164 dump_ir_extblock_graph(irg, suffix);
165 set_dump_node_edge_hook(old);
169 * Dumps a graph and numbers all dumps.
170 * @param irg The graph
171 * @param suffix A suffix to its file name.
172 * @param dumper The dump function
174 void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)) {
175 static ir_graph *last_irg = NULL;
179 if (irg != last_irg) {
184 snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
190 static void collect_phis(ir_node *irn, void *data)
193 ir_node *bl = get_nodes_block(irn);
194 set_irn_link(irn, get_irn_link(bl));
195 set_irn_link(bl, irn);
199 void be_clear_links(ir_graph *irg)
201 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
204 void be_collect_phis(ir_graph *irg)
206 irg_walk_graph(irg, collect_phis, NULL, NULL);
209 /* FIXME: not used. can be deleted? */
210 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
213 /* search the current block */
214 for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
215 if (pset_find_ptr(accept, irn))
218 /* FIXME: This is obviously buggy: after the first recursive call idom is a block
219 and get_nodes_block will fail.
220 Moreover, why not a simple iteration instead of recursion */
221 idom = get_Block_idom(get_nodes_block(start_point_exclusive));
224 return dom_up_search(accept, idom); /* continue search in idom-block */
226 return NULL; /* this was the start block and we did not find an acceptable irn */