4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Main file for the optimization reducing the copies needed for:
9 * - register-constrained nodes
17 #include "becopyopt.h"
18 #include "becopystat.h"
19 #include "becopyoptmain.h"
24 #define DEBUG_LVL SET_LEVEL_1
25 static firm_dbg_module_t *dbg = NULL;
27 void be_copy_opt_init(void) {
28 dbg = firm_dbg_register("ir.be.copyoptmain");
29 firm_dbg_set_mask(dbg, LEVEL_1);
32 void be_copy_opt(be_chordal_env_t *chordal_env) {
36 /* BETTER: You can remove this if you replace all `grep get_irn_out *.c`*/
37 compute_outs(chordal_env->irg);
39 co = new_copy_opt(chordal_env, get_costs_loop_depth);
40 DBG((dbg, LEVEL_1, "===> %s <===\n", co->name));
43 lb = co_get_lower_bound(co);
44 copy_costs = co_get_copy_costs(co);
45 curr_vals[I_COPIES_INIT] += copy_costs;
46 DBG((dbg, LEVEL_1, "Init costs: %3d / %3d\n", lb, copy_costs));
52 copy_costs = co_get_copy_costs(co);
53 curr_vals[I_COPIES_HEUR] += copy_costs;
54 DBG((dbg, LEVEL_1, "Heur costs: %3d / %3d\n", lb, copy_costs));
59 copy_costs = co_get_copy_costs(co);
60 assert(copy_costs>=lb && "At least one computation of these two is boooogy");
61 if (copy_costs > lb) {
63 be_ra_chordal_check(chordal_env);
67 copy_costs = co_get_copy_costs(co);
68 assert(copy_costs>=lb && "At least one computation of these two is boooogy");
69 curr_vals[I_COPIES_OPT] += copy_costs;
70 DBG((dbg, LEVEL_1, "Opt costs: %3d / %3d\n", copy_costs));