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
16 #include "firm_types.h"
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 something to do with coalescing
40 * @param arch The architecture environment
41 * @param irn The irn to check
43 int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
46 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
48 int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
51 * Computes the costs of a copy according to loop depth
52 * @param pos: the argument position of arg in the root arguments
53 * @return Must be >= 0 in all cases.
55 int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
58 * All costs equal 1. Using this will reduce the _number_ of copies.
59 * @return Must be >= 0 in all cases.
61 int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos);
67 * Build internal optimization units structure
69 void co_build_ou_structure(copy_opt_t *co);
72 * Frees the space used by the opt unit representation.
73 * Does NOT free the whole copyopt structure
75 void co_free_ou_structure(copy_opt_t *co);
78 * Solves the problem using a heuristic approach
79 * Uses the OU data structure
81 int co_solve_heuristic(copy_opt_t *co);
84 * Solves the copy minimization problem using another heuristic approach.
85 * Uses the OU data structure.
87 void co_solve_heuristic_new(copy_opt_t *co);
90 * Returns the maximal costs possible, i.e. the costs if all
91 * pairs would be assigned different registers.
92 * Uses the OU data structure
94 int co_get_max_copy_costs(const copy_opt_t *co);
97 * Returns the inevitable costs, i.e. the costs of
98 * all copy pairs which interfere.
99 * Uses the OU data structure
101 int co_get_inevit_copy_costs(const copy_opt_t *co);
104 * Returns the current costs the copies are causing.
105 * The result includes inevitable costs and the costs
106 * of the copies regarding the current register allocation
107 * Uses the OU data structure
109 int co_get_copy_costs(const copy_opt_t *co);
112 * Returns a lower bound for the costs of copies in this ou.
113 * The result includes inevitable costs and the costs of a
114 * minimal costs caused by the nodes of the ou.
115 * Uses the OU data structure
117 int co_get_lower_bound(const copy_opt_t *co);
124 * Constructs another internal representation of the affinity edges
126 void co_build_graph_structure(copy_opt_t *co);
129 * Frees the space used by the graph representation.
130 * Does NOT free the whole copyopt structure
132 void co_free_graph_structure(copy_opt_t *co);
135 * Solves the problem using mixed integer programming
136 * @returns 1 iff solution state was optimal
139 int co_solve_ilp1(copy_opt_t *co, double time_limit);
142 * Solves the problem using mixed integer programming
143 * @returns 1 iff solution state was optimal
144 * Uses the OU and the GRAPH data structure
145 * Dependency of the OU structure can be removed
147 int co_solve_ilp2(copy_opt_t *co, double time_limit);
150 * Checks if a node is optimizable, viz has something to do with coalescing.
151 * Uses the GRAPH data structure
153 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
155 #endif /* _BECOPYOPT_H */