3 * @author Sebastian Hack
13 #include <libcore/lc_opts.h>
14 #include <libcore/lc_opts_enum.h>
15 #endif /* WITH_LIBCORE */
26 #include "iredges_t.h"
31 #include "bechordal_t.h"
34 #include "beifg_impl.h"
36 #include "besched_t.h"
37 #include "belistsched.h"
40 #include "bechordal.h"
42 #include "becopyoptmain.h"
43 #include "becopystat.h"
44 #include "bessadestr.h"
47 #include "bespillilp.h"
48 #include "bespillbelady.h"
50 #include "firm/bearch_firm.h"
51 #include "ia32/bearch_ia32.h"
53 #define DUMP_INITIAL (1 << 0)
54 #define DUMP_SCHED (1 << 1)
55 #define DUMP_PREPARED (1 << 2)
56 #define DUMP_RA (1 << 3)
57 #define DUMP_FINAL (1 << 4)
59 /* options visible for anyone */
60 be_options_t be_options = {
62 "i44pc52.info.uni-karlsruhe.de",
69 static unsigned dump_flags = DUMP_INITIAL | DUMP_SCHED | DUMP_PREPARED | DUMP_RA | DUMP_FINAL;
71 /* register allocator to use. */
72 static const be_ra_t *ra = &be_ra_chordal_allocator;
74 /* back end instruction set architecture to use */
75 static const arch_isa_if_t *isa_if = &ia32_isa_if;
79 static lc_opt_entry_t *be_grp_root = NULL;
81 /* possible dumping options */
82 static const lc_opt_enum_mask_items_t dump_items[] = {
84 { "initial", DUMP_INITIAL },
85 { "sched", DUMP_SCHED },
86 { "prepared", DUMP_PREPARED },
87 { "regalloc", DUMP_RA },
88 { "final", DUMP_FINAL },
89 { "all", 2 * DUMP_FINAL - 1 },
93 /* register allocators */
94 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
95 { "chordal", &be_ra_chordal_allocator },
99 /* instruction set architectures. */
100 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
101 { "firm", &firm_isa },
102 { "ia32", &ia32_isa_if },
106 static lc_opt_enum_mask_var_t dump_var = {
107 &dump_flags, dump_items
110 static lc_opt_enum_const_ptr_var_t ra_var = {
111 (const void **) &ra, ra_items
114 static lc_opt_enum_const_ptr_var_t isa_var = {
115 (const void **) &isa_if, isa_items
118 static const lc_opt_table_entry_t be_main_options[] = {
119 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
120 LC_OPT_ENT_ENUM_PTR("ra", "register allocator", &ra_var),
121 LC_OPT_ENT_ENUM_PTR("isa", "the instruction set architecture", &isa_var),
123 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
124 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
128 #endif /* WITH_LIBCORE */
130 void be_opt_register(void)
135 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
137 lc_opt_add_table(be_grp_root, be_main_options);
139 /* register register allocator options */
140 for(i = 0; ra_items[i].name != NULL; ++i) {
141 const be_ra_t *ra = ra_items[i].value;
142 ra->register_options(be_grp_root);
145 /* register isa options */
146 for(i = 0; isa_items[i].name != NULL; ++i) {
147 const arch_isa_if_t *isa = isa_items[i].value;
148 isa->register_options(be_grp_root);
150 #endif /* WITH_LIBCORE */
166 static be_main_env_t *be_init_env(be_main_env_t *env)
168 obstack_init(&env->obst);
169 env->dbg = firm_dbg_register("be.main");
171 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
172 arch_env_init(env->arch_env, isa_if);
174 /* Register the irn handler of the architecture */
175 if (arch_isa_get_irn_handler(env->arch_env->isa))
176 arch_env_add_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
179 * Register the node handler of the back end infrastructure.
180 * This irn handler takes care of the platform independent
181 * spill, reload and perm nodes.
183 arch_env_add_irn_handler(env->arch_env, &be_node_irn_handler);
188 static void be_done_env(be_main_env_t *env)
190 env->arch_env->isa->impl->done(env->arch_env->isa);
191 obstack_free(&env->obst, NULL);
194 static void dump(int mask, ir_graph *irg, const char *suffix,
195 void (*dumper)(ir_graph *, const char *))
197 if(dump_flags & mask)
201 static void prepare_graph(be_main_env_t *s, ir_graph *irg)
203 /* Normalize proj nodes. */
204 normalize_proj_nodes(irg);
206 /* Remove critical edges */
207 remove_critical_cf_edges(irg);
209 /* Compute the dominance information. */
213 /* Ensure, that the ir_edges are computed. */
216 /* Compute loop nesting information (for weighting copies) */
217 if (get_irg_loopinfo_state(irg) != (loopinfo_valid & loopinfo_cf_consistent))
218 construct_cf_backedges(irg);
220 be_check_dominance(irg);
223 static void be_main_loop(FILE *file_handle)
231 isa = arch_env_get_isa(env.arch_env);
234 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
235 ir_graph *irg = get_irp_irg(i);
237 arch_code_generator_t *cg;
238 const arch_code_generator_if_t *cg_if;
240 DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
241 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
243 /* set the current graph (this is important for several firm functions) */
244 current_ir_graph = irg;
246 /* Get the code generator interface. */
247 cg_if = isa->impl->get_code_generator(isa);
249 /* get a code generator for this graph. */
250 cg = cg_if->init(file_handle, irg, env.arch_env);
252 /* create the code generator and generate code. */
253 prepare_graph(&env, irg);
254 arch_code_generator_prepare_graph(cg);
256 edges_deactivate(irg);
257 dead_node_elimination(irg);
260 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
262 /* Schedule the graphs. */
263 arch_code_generator_before_sched(cg);
264 list_sched(isa, irg);
266 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
268 /* Verify the schedule */
269 sched_verify_irg(irg);
271 /* Do register allocation */
272 arch_code_generator_before_ra(cg);
273 ra->allocate(&env, irg);
275 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
277 arch_code_generator_done(cg);
278 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
284 void be_main(FILE *file_handle)
287 be_main_loop(file_handle);