2 * Header for copy optimization problem. Analysis and set up of the problem.
16 #include "sp_matrix.h"
28 #include "bechordal_t.h"
32 #define is_Copy(irn) 0
33 #define DEBUG_IRG "scanner.c__init_td__gp"
36 * Data representing the problem of copy minimization.
38 typedef struct _copy_opt_t {
39 ir_graph *irg; /**< the irg to process */
40 char *name; /**< ProgName__IrgName__RegClass */
41 const arch_isa_if_t *isa;
42 const arch_register_class_t *cls; /**< the registerclass all nodes belong to (in this pass) */
43 struct list_head units; /**< all units to optimize in right oreder */
44 pset *roots; /**< used only temporary for detecting multiple appends */
49 * A single unit of optimization. Lots of these form a copy-opt problem
51 typedef struct _unit_t {
52 struct list_head units; /**< chain for all units */
53 copy_opt_t *co; /**< the copy_opt this unit belongs to */
54 int interf; /**< number of nodes dropped due to interference */
55 int node_count; /**< size of the nodes array */
56 const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
59 int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */
60 struct list_head queue; /**< list of (mis/color) sorted by size of mis */
64 * Generate the problem. Collect all infos and optimizable nodes.
66 copy_opt_t *new_copy_opt(ir_graph *irg, const arch_isa_if_t *isa, const arch_register_class_t *cls);
71 void free_copy_opt(copy_opt_t *co);
74 * Returns the current number of copies needed
76 int co_get_copy_count(copy_opt_t *co);
79 * IMPORTANT: Available only iff heuristic has run!
80 * Returns a lower bound for the number of copies needed based on interfering
81 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
83 int co_get_lower_bound(copy_opt_t *co);
86 * Returns the number of arguments interfering with their root node. This also
87 * is a (worse) lower bound for the number of copies needed.
89 int co_get_interferer_count(copy_opt_t *co);
92 * Solves the problem using a heuristic approach
94 void co_heur_opt(copy_opt_t *co);
97 * Solves the problem using mixed integer programming
99 void co_ilp_opt(copy_opt_t *co);
102 * Checks the register allocation for correctness
104 void co_check_allocation(copy_opt_t *co);