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
15 #include "becopyopt.h"
16 #include "becopystat.h"
17 #include "becopyoptmain.h"
22 #define DEBUG_LVL SET_LEVEL_1
23 static firm_dbg_module_t *dbg = NULL;
25 void be_copy_opt_init(void) {
28 void be_copy_opt(be_chordal_env_t *chordal_env) {
32 dbg = firm_dbg_register("ir.be.copyopt");
33 firm_dbg_set_mask(dbg, DEBUG_LVL);
35 co = new_copy_opt(chordal_env);
36 DBG((dbg, LEVEL_1, "\n\n ===> %s <===\n\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, 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, 1, "Heur copies: %3d\n", copies));
53 DBG((dbg, 1, "Heur copies: %3d\n", co_get_copy_count(co)));
57 lb = co_get_lower_bound(co);
58 copies = co_get_copy_count(co);
59 //TODO remove checks and enable lb
61 DBG((dbg, 0, "\n\nAt least one computation of these two is boooogy %d < %d\n\n", lb, copies));
65 co_check_allocation(co);
67 copies = co_get_copy_count(co);
68 assert(copies>=lb && "At least one computation of these two is boooogy");
71 copies = co_get_copy_count(co);
72 curr_vals[I_COPIES_HEUR] += copies;
73 DBG((dbg, 1, "Opt copies: %3d\n", copies));
75 DBG((dbg, 1, "Opt copies: %3d\n", co_get_copy_count(co)));