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 all_nodes_costs; /**< sum of all costs[i] */
64 int min_nodes_costs; /**< a lower bound for this ou, considering only ifg (not coloring conflicts) */
65 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
68 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
72 #define set_irn_col(co, irn, col) \
73 arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
75 #define get_irn_col(co, irn) \
76 arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
78 #define list_entry_units(lh) list_entry(lh, unit_t, units)
82 * Generate the problem. Collect all infos and optimizable nodes.
84 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node*, ir_node*, int));
89 void free_copy_opt(copy_opt_t *co);
92 #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
95 * A copy is a proj haning out of perm node
97 #define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
100 * returns the corresponding argument of the perm node for a copy
102 #define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
105 * Checks if a node is optimizable, viz. is a target of a 'copy-op'
107 #define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
110 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
112 int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
115 * Computes the costs of a copy according to loop depth
116 * @param root, arg: clear.
117 * @param pos: -1 for perm-copies.
118 * Else the argument position of arg in the phi node root.
119 * @return Must be >= 0 in all cases.
121 int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
124 * All costs equal 1. Using this will reduce the number of copies.
125 * @return Must be >= 0 in all cases.
127 int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
130 * Returns the current costs the copies are causing
132 int co_get_copy_costs(const copy_opt_t *co);
135 * Returns a lower bound for the costs of copies based on interfering
136 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
138 int co_get_lower_bound(const copy_opt_t *co);
141 * Solves the problem using a heuristic approach
143 void co_heur_opt(copy_opt_t *co);
146 * Solves the problem using mixed integer programming
148 void co_ilp_opt(copy_opt_t *co);