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);
36 DBG((dbg, LEVEL_1, "===> %s <===\n", co->name));
37 co_check_allocation(co);
40 copies = co_get_copy_count(co);
41 curr_vals[I_COPIES_INIT] += copies;
42 DBG((dbg, LEVEL_1, "Init copies: %3d\n", copies));
47 co_check_allocation(co);
49 copies = co_get_copy_count(co);
50 curr_vals[I_COPIES_HEUR] += copies;
51 DBG((dbg, LEVEL_1, "Heur copies: %3d\n", copies));
56 lb = co_get_lower_bound(co);
57 copies = co_get_copy_count(co);
58 assert(copies>=lb && "At least one computation of these two is boooogy");
62 co_check_allocation(co);
66 copies = co_get_copy_count(co);
67 curr_vals[I_COPIES_OPT] += copies;
68 DBG((dbg, LEVEL_1, "Opt copies: %3d\n", copies));
69 assert(copies>=lb && "At least one computation of these two is boooogy");