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.
19 #include "sp_matrix.h"
30 #include "bechordal_t.h"
33 #define DEBUG_IRG "NONE spec.c__main__datab"
34 #define DEBUG_LVL_CO LEVEL_1
35 #define DEBUG_LVL_HEUR LEVEL_1
36 #define DEBUG_LVL_ILP LEVEL_1
38 typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
41 * Data representing the problem of copy minimization.
43 typedef struct _copy_opt_t {
44 be_chordal_env_t *chordal_env;
45 char *name; /**< ProgName__IrgName__RegClass */
46 struct list_head units; /**< all units to optimize in right order */
47 pset *roots; /**< used only temporary for detecting multiple appends */
48 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
53 * A single unit of optimization. Lots of these form a copy-opt problem
55 typedef struct _unit_t {
56 struct list_head units; /**< chain for all units */
57 copy_opt_t *co; /**< the copy_opt this unit belongs to */
58 int node_count; /**< size of the nodes array */
59 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
60 int *costs; /**< costs[i] are arising, if nodes[i] has a different color */
61 int complete_costs; /**< sum of all costs[i] */
62 int minimal_costs; /**< a lower bound for this ou, considering only ifg (not coloring conflicts) */
64 int sort_key; /**< maximum costs. controls the order of ou's. */
67 struct list_head queue; /**< list of (mis/color) sorted by size of mis */
71 #define set_irn_col(co, irn, col) \
72 arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
74 #define get_irn_col(co, irn) \
75 arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
77 #define list_entry_units(lh) list_entry(lh, unit_t, units)
81 * Generate the problem. Collect all infos and optimizable nodes.
83 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node*, ir_node*, int));
88 void free_copy_opt(copy_opt_t *co);
91 #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
94 * A copy is a proj haning out of perm node
96 #define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
99 * returns the corresponding argument of the perm node for a copy
101 #define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
104 * Checks if a node is optimizable, viz. is a target of a 'copy-op'
106 #define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
109 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
111 int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
114 * Computes the costs of a copy according to loop depth
115 * @param root, arg: clear.
116 * @param pos: -1 for perm-copies.
117 * Else the argument position of arg in the phi node root.
118 * @return Must be >= 0 in all cases.
120 int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
123 * All costs equal 1. Using this will reduce the number of copies.
124 * @return Must be >= 0 in all cases.
126 int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
129 * Returns the current costs the copies are causing
131 int co_get_copy_costs(const copy_opt_t *co);
134 * Returns a lower bound for the costs of copies based on interfering
135 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
137 int co_get_lower_bound(const copy_opt_t *co);
140 * Solves the problem using a heuristic approach
142 void co_heur_opt(copy_opt_t *co);
145 * Solves the problem using mixed integer programming
147 void co_ilp_opt(copy_opt_t *co);