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
10 * - Two-address code instructions
17 #include "bechordal.h"
20 * Has to be called during the firm init phase
22 void be_copy_opt_init(void);
24 typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
26 typedef struct _copy_opt_t copy_opt_t;
29 * Generate the problem. Collect all information and optimizable nodes.
31 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
34 * Free the space used...
36 void free_copy_opt(copy_opt_t *co);
39 * Checks if a node is optimizable, viz. has somthing to do with coalescing
40 * @param arch The architecture environment
41 * @param irn The irn to check
42 * @param req A register_requirement structure (used to check for 2-addr-code)
44 int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
47 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
49 int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
52 * Computes the costs of a copy according to loop depth
53 * @param pos: the argument position of arg in the root arguments
54 * @return Must be >= 0 in all cases.
56 int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
59 * All costs equal 1. Using this will reduce the _number_ of copies.
60 * @return Must be >= 0 in all cases.
62 int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos);
68 * Build internal optimization units structure
70 void co_build_ou_structure(copy_opt_t *co);
73 * Frees the space used by the opt unit representation.
74 * Does NOT free the whole copyopt structure
76 void co_free_ou_structure(copy_opt_t *co);
79 * Solves the problem using a heuristic approach
81 int co_solve_heuristic(copy_opt_t *co);
84 * Returns the maximal costs possible, i.e. the costs if all
85 * pairs would be assigned different registers.
87 int co_get_max_copy_costs(const copy_opt_t *co);
90 * Returns the inevitable costs, i.e. the costs of
91 * all copy pairs which interfere.
93 int co_get_inevit_copy_costs(const copy_opt_t *co);
96 * Returns the current costs the copies are causing.
97 * The result includes inevitable costs and the costs
98 * of the copies regarding the current register allocation
100 int co_get_copy_costs(const copy_opt_t *co);
103 * Returns a lower bound for the costs of copies in this ou.
104 * The result includes inevitable costs and the costs of a
105 * minimal costs caused by the nodes of the ou.
107 int co_get_lower_bound(const copy_opt_t *co);
114 * Constructs another internal representation of the affinity edges
116 void co_build_graph_structure(copy_opt_t *co);
119 * Frees the space used by the graph representation.
120 * Does NOT free the whole copyopt structure
122 void co_free_graph_structure(copy_opt_t *co);
125 * Solves the problem using mixed integer programming
126 * @returns 1 iff solution state was optimal
128 int co_solve_ilp1(copy_opt_t *co, double time_limit);
131 * Solves the problem using mixed integer programming
132 * @returns 1 iff solution state was optimal
134 int co_solve_ilp2(copy_opt_t *co, double time_limit);
137 * Checks if a node is optimizable, viz. has somthing to do with coalescing.
138 * Uses the graph representation
140 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);