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_register_get_index(arch_get_irn_register(node));
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 static inline int is_2addr_code(const arch_register_req_t *req)
81 return (req->type & arch_register_req_type_should_be_same) != 0;
84 /******************************************************************************
85 ____ _ _ _ _ _ _____ _
86 / __ \ | | | | | | (_) | / ____| |
87 | | | |_ __ | |_| | | |_ __ _| |_ ___ | (___ | |_ ___ _ __ __ _ __ _ ___
88 | | | | '_ \| __| | | | '_ \| | __/ __| \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
89 | |__| | |_) | |_| |__| | | | | | |_\__ \ ____) | || (_) | | | (_| | (_| | __/
90 \____/| .__/ \__|\____/|_| |_|_|\__|___/ |_____/ \__\___/|_| \__,_|\__, |\___|
93 ******************************************************************************/
95 #define MIS_HEUR_TRIGGER 8
97 typedef struct unit_t {
98 struct list_head units; /**< chain for all units */
99 copy_opt_t *co; /**< the copy opt this unit belongs to */
100 int node_count; /**< size of the nodes array */
101 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
102 int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */
103 int inevitable_costs; /**< sum of costs of all args interfering with root */
104 int all_nodes_costs; /**< sum of all costs[i] */
105 int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */
106 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
109 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
114 /******************************************************************************
116 / ____| | | / ____| |
117 | | __ _ __ __ _ _ __ | |__ | (___ | |_ ___ _ __ __ _ __ _ ___
118 | | |_ | '__/ _` | '_ \| '_ \ \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
119 | |__| | | | (_| | |_) | | | | ____) | || (_) | | | (_| | (_| | __/
120 \_____|_| \__,_| .__/|_| |_| |_____/ \__\___/|_| \__,_|\__, |\___|
123 ******************************************************************************/
125 typedef struct neighb_t neighb_t;
126 typedef struct affinity_node_t affinity_node_t;
129 neighb_t *next; /** the next neighbour entry*/
130 const ir_node *irn; /** the neighbour itself */
131 int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
134 struct affinity_node_t {
135 const ir_node *irn; /** a node with affinity edges */
136 int degree; /** number of affinity edges in the linked list below */
137 neighb_t *neighbours; /** a linked list of all affinity neighbours */
138 void *data; /** stuff that is attachable. */
142 static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn)
144 affinity_node_t find;
149 return (affinity_node_t*)set_find(co->nodes, &find, sizeof(find), hash_irn(irn));
152 #define co_gs_nodes_begin(co) set_first((co)->nodes)
153 #define co_gs_nodes_next(co) set_next((co)->nodes)
154 #define co_gs_nodes_break(co) set_break((co)->nodes)
156 #define co_gs_foreach_aff_node(co, aff_node) for (aff_node = (affinity_node_t*)co_gs_nodes_begin(co); aff_node != NULL; aff_node = (affinity_node_t*)co_gs_nodes_next(co))
157 #define co_gs_foreach_neighb(aff_node, neighb) for (neighb = (neighb_t*)aff_node->neighbours; neighb != NULL; neighb = (neighb_t*)neighb->next)
159 #endif /* FIRM_BE_BECOPYOPT_T_H */