16 #include "besched_t.h"
24 static void dump_allocated_block(ir_node *block, void *data)
28 struct dump_env *dump_env = data;
29 FILE *f = dump_env->f;
30 arch_env_t *env = dump_env->env;
32 ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
33 sched_foreach(block, irn) {
34 const char *prefix = "";
36 const arch_register_t *reg = arch_get_irn_register(env, irn, 0);
40 ir_fprintf(f, "%s = ", arch_register_get_name(reg));
41 ir_fprintf(f, "%n(", irn);
43 if(block != get_irg_start_block(get_irn_irg(block))) {
44 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
45 ir_node *op = get_irn_n(irn, i);
46 if(arch_is_register_operand(dump_env->env, op, arch_pos_make_out(0))) {
47 ir_fprintf(f, "%s%s", prefix,
48 arch_register_get_name(arch_get_irn_register(env, op, 0)));
56 ir_fprintf(f, "\"}\n");
58 if(get_irg_start_block(get_irn_irg(block)) != block) {
59 for(i = 0, n = get_irn_arity(block); i < n; ++i) {
60 ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
61 ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
66 void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
73 ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
75 if((env.f = fopen(buf, "wt")) != NULL) {
76 fprintf(env.f, "graph:{title:\"prg\"\n");
77 irg_block_walk_graph(irg, dump_allocated_block, NULL, &env);
78 fprintf(env.f, "}\n");
83 static void localize_const_walker(ir_node *irn, void *data)
88 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
89 ir_node *op = get_irn_n(irn, i);
90 if(get_irn_opcode(op) == iro_Const) {
91 ir_node *tgt_block, *cnst;
93 /* Special treatment for phi nodes, because phi-usage is different */
94 tgt_block = get_nodes_block(irn);
96 tgt_block = get_nodes_block(get_irn_n(tgt_block, i));
99 * We have to create the const node by ourselves, since the
100 * firmcons implementation always places it in the start block.
102 cnst = new_ir_node(NULL, get_irn_irg(irn),
103 tgt_block, op_Const, get_irn_mode(op), 0, NULL);
104 cnst->attr.con.tv = get_Const_tarval(op);
105 set_irn_n(irn, i, cnst);
111 void localize_consts(ir_graph *irg)
113 irg_walk_graph(irg, localize_const_walker, NULL, NULL);
114 dead_node_elimination(irg);
117 static int sched_edge_hook(FILE *F, ir_node *irn)
119 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
120 ir_node *prev = sched_prev(irn);
121 fprintf(F, "edge:{sourcename:\"");
123 fprintf(F, "\" targetname:\"");
125 fprintf(F, "\" color:magenta}\n");
130 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
131 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
133 dump_consts_local(0);
134 set_dump_node_edge_hook(sched_edge_hook);
135 dump_ir_block_graph(irg, suffix);
136 set_dump_node_edge_hook(old);
139 static void clear_link(ir_node *irn, void *data)
141 set_irn_link(irn, NULL);
144 static void collect_phis(ir_node *irn, void *data)
147 ir_node *bl = get_nodes_block(irn);
148 set_irn_link(irn, get_irn_link(bl));
149 set_irn_link(bl, irn);
153 void be_clear_links(ir_graph *irg)
155 irg_walk_graph(irg, clear_link, NULL, NULL);
158 void be_collect_phis(ir_graph *irg)
160 irg_walk_graph(irg, collect_phis, NULL, NULL);