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 "NONE spec.c__main__datab"
33 #define DEBUG_LVL_CO LEVEL_1
34 #define DEBUG_LVL_HEUR LEVEL_1
35 #define DEBUG_LVL_ILP LEVEL_1
37 typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
40 * Data representing the problem of copy minimization.
42 typedef struct _copy_opt_t {
43 be_chordal_env_t *chordal_env;
44 char *name; /**< ProgName__IrgName__RegClass */
45 struct list_head units; /**< all units to optimize in right order */
46 pset *roots; /**< used only temporary for detecting multiple appends */
47 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
52 * A single unit of optimization. Lots of these form a copy-opt problem
54 typedef struct _unit_t {
55 struct list_head units; /**< chain for all units */
56 copy_opt_t *co; /**< the copy_opt this unit belongs to */
57 int node_count; /**< size of the nodes array */
58 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
59 int *costs; /**< costs[i] are arising, if nodes[i] has a different color */
60 int complete_costs; /**< sum of all costs[i] */
61 int minimal_costs; /**< a lower bound for this ou, considering only ifg (not coloring conflicts) */
63 int sort_key; /**< maximum costs. controls the order of ou's. */
66 struct list_head queue; /**< list of (mis/color) sorted by size of mis */
70 #define set_irn_col(co, irn, col) \
71 arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
73 #define get_irn_col(co, irn) \
74 arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
76 #define list_entry_units(lh) list_entry(lh, unit_t, units)
80 * Generate the problem. Collect all infos and optimizable nodes.
82 copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, int (*get_costs)(ir_node*, ir_node*, int));
87 void free_copy_opt(copy_opt_t *co);
90 #define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
93 * A copy is a proj haning out of perm node
95 #define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
98 * returns the corresponding argument of the perm node for a copy
100 #define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
103 * Checks if a node is optimizable, viz. is a target of a 'copy-op'
105 #define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
108 * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
110 int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
113 * Computes the costs of a copy according to loop depth
114 * @param root, arg: clear.
115 * @param pos: -1 for perm-copies.
116 * Else the argument position of arg in the phi node root.
117 * @return Must be >= 0 in all cases.
119 int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
122 * All costs equal 1. Using this will reduce the number of copies.
123 * @return Must be >= 0 in all cases.
125 int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
128 * Returns the current costs the copies are causing
130 int co_get_copy_costs(const copy_opt_t *co);
133 * Returns a lower bound for the costs of copies based on interfering
134 * arguments and the size of a max indep. set (only ifg-edges) of the other args.
136 int co_get_lower_bound(const copy_opt_t *co);
139 * Solves the problem using a heuristic approach
141 void co_heur_opt(copy_opt_t *co);
144 * Solves the problem using mixed integer programming
146 void co_ilp_opt(copy_opt_t *co);