2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Internal header for copy optimization problem.
12 #ifndef FIRM_BE_BECOPYOPT_T_H
13 #define FIRM_BE_BECOPYOPT_T_H
21 #include "bechordal_t.h"
22 #include "becopyopt.h"
25 * Data representing the problem of copy minimization.
28 be_chordal_env_t *cenv;
29 const arch_register_class_t *cls;
31 cost_fct_t get_costs; /**< function ptr used to get costs for copies */
33 /** Representation as optimization units */
34 struct list_head units; /**< all units to optimize in specific order */
36 /** Representation in graph structure. Only build on demand */
42 #define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not built")
43 #define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not built")
45 static inline unsigned get_irn_col(const ir_node *node)
47 return arch_get_irn_register(node)->index;
50 static inline void set_irn_col(const arch_register_class_t *cls, ir_node *node,
53 const arch_register_t *reg = arch_register_for_index(cls, color);
54 arch_set_irn_register(node, reg);
57 #define list_entry_units(lh) list_entry(lh, unit_t, units)
59 #define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
61 #define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
62 #define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
64 /******************************************************************************
65 ____ _ _ _ _ _ _____ _
66 / __ \ | | | | | | (_) | / ____| |
67 | | | |_ __ | |_| | | |_ __ _| |_ ___ | (___ | |_ ___ _ __ __ _ __ _ ___
68 | | | | '_ \| __| | | | '_ \| | __/ __| \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
69 | |__| | |_) | |_| |__| | | | | | |_\__ \ ____) | || (_) | | | (_| | (_| | __/
70 \____/| .__/ \__|\____/|_| |_|_|\__|___/ |_____/ \__\___/|_| \__,_|\__, |\___|
73 ******************************************************************************/
75 #define MIS_HEUR_TRIGGER 8
77 typedef struct unit_t {
78 struct list_head units; /**< chain for all units */
79 int node_count; /**< size of the nodes array */
80 ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
81 int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */
82 int inevitable_costs; /**< sum of costs of all args interfering with root */
83 int all_nodes_costs; /**< sum of all costs[i] */
84 int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */
85 int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
88 struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
93 /******************************************************************************
96 | | __ _ __ __ _ _ __ | |__ | (___ | |_ ___ _ __ __ _ __ _ ___
97 | | |_ | '__/ _` | '_ \| '_ \ \___ \| __/ _ \| '__/ _` |/ _` |/ _ \
98 | |__| | | | (_| | |_) | | | | ____) | || (_) | | | (_| | (_| | __/
99 \_____|_| \__,_| .__/|_| |_| |_____/ \__\___/|_| \__,_|\__, |\___|
102 ******************************************************************************/
104 typedef struct neighb_t neighb_t;
105 typedef struct affinity_node_t affinity_node_t;
108 neighb_t *next; /** the next neighbour entry*/
109 const ir_node *irn; /** the neighbour itself */
110 int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */
113 struct affinity_node_t {
114 const ir_node *irn; /** a node with affinity edges */
115 neighb_t *neighbours; /** a linked list of all affinity neighbours */
119 static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn)
121 affinity_node_t find;
126 return set_find(affinity_node_t, co->nodes, &find, sizeof(find), hash_irn(irn));
129 #define co_gs_foreach_aff_node(co, aff_node) foreach_set((co)->nodes, affinity_node_t, (aff_node))
130 #define co_gs_foreach_neighb(aff_node, neighb) for (neighb_t *neighb = aff_node->neighbours; neighb; neighb = neighb->next)
132 #endif /* FIRM_BE_BECOPYOPT_T_H */