2 * Header for copy optimization problem. Analysis and set up of the problem.
17 #include <sys/types.h>
26 #include "sp_matrix.h"
38 #include "bechordal_t.h"
42 * TODO external things
43 * define get_weight to sth representing the _gain_ if node n and m
44 * have the same color. Must return values MIN_WEIGHT <= . <= MAX_WEIGHT.
46 #define get_weight(n,m) 1
47 #define is_possible_color(irn, col) 1
48 #define is_Copy(irn) 0
52 * A single unit of optimization. Lots of these form a copy-opt problem
54 typedef struct _unit_t {
55 struct list_head units; /**< chain for all units */
56 int interf; /**< number of nodes dropped due to interference */
57 int node_count; /**< size of the nodes array */
58 const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
61 int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */
62 struct list_head queue; /**< list of (mis/color) sorted by size of mis */
66 * Data representing the problem of copy minimization.
68 typedef struct _copy_opt_t {
69 ir_graph *irg; /**< the irg to process */
70 const arch_isa_if_t *isa;
71 const arch_register_class_t *cls; /**< the registerclass to optimize */
72 struct list_head units; /**< all units to optimize in right oreder */
73 pset *roots; /**< used only temporary for detecting multiple appends */
79 * Generate the problem. Collect all infos and optimizable nodes.
81 copy_opt_t *new_copy_opt(ir_graph *irg, const arch_isa_if_t *isa, const arch_register_class_t *cls);
86 void free_copy_opt(copy_opt_t *co);
89 * Returns the current number of copies needed
91 int co_get_copy_count(copy_opt_t *co);
94 * IMPORTANT: Available only iff heuristic has run!
95 * Returns a lower bound for the number of copies needed based on interfering
96 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
98 int co_get_lower_bound(copy_opt_t *co);
101 * Returns the number of arguments interfering with their root node. This also
102 * is a (worse) lower bound for the number of copies needed.
104 int co_get_interferer_count(copy_opt_t *co);
107 * Solves the problem using a heuristic approach
109 void co_heur_opt(copy_opt_t *co);
112 * Solves the problem using mixed integer programming
114 void co_ilp_opt(copy_opt_t *co);
117 * Checks the register allocation for correctness
119 void co_check_allocation(copy_opt_t *co);