4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Header for copy optimization problem. Analysis and set up of the problem.
29 #include "bechordal_t.h"
32 #define DEBUG_IRG "MergeSort.c__merge__datab"
33 #define DEBUG_IRG_LVL_CO SET_LEVEL_1
34 #define DEBUG_IRG_LVL_HEUR SET_LEVEL_1
35 #define DEBUG_IRG_LVL_ILP SET_LEVEL_1
36 #define DEBUG_LVL_CO SET_LEVEL_0
37 #define DEBUG_LVL_HEUR SET_LEVEL_0
38 #define DEBUG_LVL_ILP SET_LEVEL_0
40 typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
43 * Data representing the problem of copy minimization.
45 typedef struct _copy_opt_t {
46 be_chordal_env_t *chordal_env;
47 char *name; /**< ProgName__IrgName__RegClass */
48 struct list_head units; /**< all units to optimize in right order */
49 pset *roots; /**< used only temporary for detecting multiple appends */
50 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
55 * A single unit of optimization. Lots of these form a copy-opt problem
57 typedef struct _unit_t {
58 struct list_head units; /**< chain for all units */
59 copy_opt_t *co; /**< the copy_opt this unit belongs to */
60 int node_count; /**< size of the nodes array */
61 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
62 int *costs; /**< costs[i] are arising, if nodes[i] has a different color */
63 int inevitable_costs; /**< sum of costs of all args interfering with root */
64 int all_nodes_costs; /**< sum of all costs[i] */
65 int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max indep. set */
66 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
69 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
73 #define set_irn_col(co, irn, col) \
74 arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
76 #define get_irn_col(co, irn) \
77 arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
79 #define list_entry_units(lh) list_entry(lh, unit_t, units)
83 * Generate the problem. Collect all infos and optimizable nodes.
85 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node*, ir_node*, int));
90 void free_copy_opt(copy_opt_t *co);
93 #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
96 * A copy is a proj haning out of perm node
98 #define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
101 * returns the corresponding argument of the perm node for a copy
103 #define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
106 * Checks if a node is optimizable, viz. is a target of a 'copy-op'
108 #define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
111 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
113 int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
116 * Computes the costs of a copy according to loop depth
117 * @param root, arg: clear.
118 * @param pos: -1 for perm-copies.
119 * Else the argument position of arg in the phi node root.
120 * @return Must be >= 0 in all cases.
122 int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
125 * All costs equal 1. Using this will reduce the number of copies.
126 * @return Must be >= 0 in all cases.
128 int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
131 * Returns the current costs the copies are causing.
132 * The result includes inevitable costs and the costs
133 * of the copies regarding the current register allocation
135 int co_get_copy_costs(const copy_opt_t *co);
138 * Returns a lower bound for the costs of copies in this ou.
139 * The result includes inevitable costs and the costs of a
140 * minimal costs caused by the nodes of the ou.
142 int co_get_lower_bound(const copy_opt_t *co);
145 * Solves the problem using a heuristic approach
147 void co_heur_opt(copy_opt_t *co);
150 * Solves the problem using mixed integer programming
152 void co_ilp_opt(copy_opt_t *co);