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
16 #include "becopyopt.h"
17 #include "becopystat.h"
18 #include "becopyoptmain.h"
23 #define DEBUG_LVL SET_LEVEL_1
24 static firm_dbg_module_t *dbg = NULL;
26 void be_copy_opt_init(void) {
27 dbg = firm_dbg_register("ir.be.copyoptmain");
28 firm_dbg_set_mask(dbg, LEVEL_1);
31 void be_copy_opt(be_chordal_env_t *chordal_env) {
35 co = new_copy_opt(chordal_env, get_costs_loop_depth);
36 DBG((dbg, LEVEL_1, "===> %s <===\n", co->name));
39 copy_costs = co_get_copy_costs(co);
40 curr_vals[I_COPIES_INIT] += copy_costs;
41 DBG((dbg, LEVEL_1, "Init costs: %3d\n", copy_costs));
46 be_ra_chordal_check(chordal_env);
48 copy_costs = co_get_copy_costs(co);
49 curr_vals[I_COPIES_HEUR] += copy_costs;
50 DBG((dbg, LEVEL_1, "Heur costs: %3d\n", copy_costs));
55 lb = co_get_lower_bound(co);
56 copy_costs = co_get_copy_costs(co);
57 assert(copy_costs>=lb && "At least one computation of these two is boooogy");
59 if (copy_costs > lb) {
61 be_ra_chordal_check(chordal_env);
65 copy_costs = co_get_copy_costs(co);
66 curr_vals[I_COPIES_OPT] += copy_costs;
67 DBG((dbg, LEVEL_1, "Opt costs: %3d\n", copy_costs));
68 assert(copy_costs>=lb && "At least one computation of these two is boooogy");