2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Internal header for copy optimization problem.
23 * @author Daniel Grund
26 #ifndef FIRM_BE_BECOPYOPT_T_H
27 #define FIRM_BE_BECOPYOPT_T_H
35 #include "bechordal_t.h"
36 #include "becopyopt.h"
39 * Data representing the problem of copy minimization.
42 be_chordal_env_t *cenv;
43 const arch_register_class_t *cls;
45 char *name; /**< ProgName__IrgName__RegClassName */
46 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
48 /** Representation as optimization units */
49 struct list_head units; /**< all units to optimize in specific order */
51 /** Representation in graph structure. Only build on demand */
57 #define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build")
58 #define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build")
60 static inline unsigned get_irn_col(const ir_node *node)
62 return arch_get_irn_register(node)->index;
65 static inline void set_irn_col(const arch_register_class_t *cls, ir_node *node,
68 const arch_register_t *reg = arch_register_for_index(cls, color);
69 arch_set_irn_register(node, reg);
72 #define list_entry_units(lh) list_entry(lh, unit_t, units)
74 #define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
76 #define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
77 #define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
79 /******************************************************************************
80 ____ _ _ _ _ _ _____ _
81 / __ \ | | | | | | (_) | / ____| |
82 | | | |_ __ | |_| | | |_ __ _| |_ ___ | (___ | |_ ___ _ __ __ _ __ _ ___
83 | | | | '_ \| __| | | | '_ \| | __/ __| \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
84 | |__| | |_) | |_| |__| | | | | | |_\__ \ ____) | || (_) | | | (_| | (_| | __/
85 \____/| .__/ \__|\____/|_| |_|_|\__|___/ |_____/ \__\___/|_| \__,_|\__, |\___|
88 ******************************************************************************/
90 #define MIS_HEUR_TRIGGER 8
92 typedef struct unit_t {
93 struct list_head units; /**< chain for all units */
94 copy_opt_t *co; /**< the copy opt this unit belongs to */
95 int node_count; /**< size of the nodes array */
96 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
97 int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */
98 int inevitable_costs; /**< sum of costs of all args interfering with root */
99 int all_nodes_costs; /**< sum of all costs[i] */
100 int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */
101 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
104 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
109 /******************************************************************************
111 / ____| | | / ____| |
112 | | __ _ __ __ _ _ __ | |__ | (___ | |_ ___ _ __ __ _ __ _ ___
113 | | |_ | '__/ _` | '_ \| '_ \ \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
114 | |__| | | | (_| | |_) | | | | ____) | || (_) | | | (_| | (_| | __/
115 \_____|_| \__,_| .__/|_| |_| |_____/ \__\___/|_| \__,_|\__, |\___|
118 ******************************************************************************/
120 typedef struct neighb_t neighb_t;
121 typedef struct affinity_node_t affinity_node_t;
124 neighb_t *next; /** the next neighbour entry*/
125 const ir_node *irn; /** the neighbour itself */
126 int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
129 struct affinity_node_t {
130 const ir_node *irn; /** a node with affinity edges */
131 int degree; /** number of affinity edges in the linked list below */
132 neighb_t *neighbours; /** a linked list of all affinity neighbours */
133 void *data; /** stuff that is attachable. */
137 static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn)
139 affinity_node_t find;
144 return set_find(affinity_node_t, co->nodes, &find, sizeof(find), hash_irn(irn));
147 #define co_gs_foreach_aff_node(co, aff_node) foreach_set((co)->nodes, affinity_node_t, (aff_node))
148 #define co_gs_foreach_neighb(aff_node, neighb) for (neighb_t *neighb = aff_node->neighbours; neighb; neighb = neighb->next)
150 #endif /* FIRM_BE_BECOPYOPT_T_H */