2 * Header for copy optimization problem. Analysis and set up of the problem.
18 #include <sys/types.h>
27 #include "sp_matrix.h"
39 #include "bechordal_t.h"
43 #define is_Copy(irn) 0
44 #define DEBUG_IRG "scanner.c__init_td__gp"
47 * Data representing the problem of copy minimization.
49 typedef struct _copy_opt_t {
50 ir_graph *irg; /**< the irg to process */
51 char *name; /**< ProgName__IrgName__RegClass */
52 const arch_isa_if_t *isa;
53 const arch_register_class_t *cls; /**< the registerclass all nodes belong to (in this pass) */
54 struct list_head units; /**< all units to optimize in right oreder */
55 pset *roots; /**< used only temporary for detecting multiple appends */
60 * A single unit of optimization. Lots of these form a copy-opt problem
62 typedef struct _unit_t {
63 struct list_head units; /**< chain for all units */
64 copy_opt_t *co; /**< the copy_opt this unit belongs to */
65 int interf; /**< number of nodes dropped due to interference */
66 int node_count; /**< size of the nodes array */
67 const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
70 int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */
71 struct list_head queue; /**< list of (mis/color) sorted by size of mis */
75 * Generate the problem. Collect all infos and optimizable nodes.
77 copy_opt_t *new_copy_opt(ir_graph *irg, const arch_isa_if_t *isa, const arch_register_class_t *cls);
82 void free_copy_opt(copy_opt_t *co);
85 * Returns the current number of copies needed
87 int co_get_copy_count(copy_opt_t *co);
90 * IMPORTANT: Available only iff heuristic has run!
91 * Returns a lower bound for the number of copies needed based on interfering
92 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
94 int co_get_lower_bound(copy_opt_t *co);
97 * Returns the number of arguments interfering with their root node. This also
98 * is a (worse) lower bound for the number of copies needed.
100 int co_get_interferer_count(copy_opt_t *co);
103 * Solves the problem using a heuristic approach
105 void co_heur_opt(copy_opt_t *co);
108 * Solves the problem using mixed integer programming
110 void co_ilp_opt(copy_opt_t *co);
113 * Checks the register allocation for correctness
115 void co_check_allocation(copy_opt_t *co);