X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt_t.h;h=af4642e5b9ea58c0248f1fdb2dc1659a81cf46f0;hb=9de6d983ab8fddcf4b3b1b29dab74e87ebb8d72b;hp=24f602f83d7ce8d1ba9543b52e6b0527d5bb0e73;hpb=ab182d4b9ed44239ab3ff1d08b2f8e14a3699ccf;p=libfirm

diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index 24f602f83..af4642e5b 100644
--- a/ir/be/becopyopt_t.h
+++ b/ir/be/becopyopt_t.h
@@ -22,7 +22,6 @@
  * @brief       Internal header for copy optimization problem.
  * @author      Daniel Grund
  * @date        12.04.2005
- * @version     $Id$
  */
 #ifndef FIRM_BE_BECOPYOPT_T_H
 #define FIRM_BE_BECOPYOPT_T_H
@@ -47,7 +46,7 @@ struct copy_opt_t {
 	cost_fct_t                  get_costs;   /**< function ptr used to get costs for copies */
 
 	/** Representation as optimization units */
-	struct list_head units;	   /**< all units to optimize in specific order */
+	struct list_head units;  /**< all units to optimize in specific order */
 
 	/** Representation in graph structure. Only build on demand */
 	struct obstack obst;
@@ -55,15 +54,24 @@ struct copy_opt_t {
 };
 
 /* Helpers */
-#define ASSERT_OU_AVAIL(co)		assert((co)->units.next && "Representation as optimization-units not build")
-#define ASSERT_GS_AVAIL(co)		assert((co)->nodes && "Representation as graph not build")
+#define ASSERT_OU_AVAIL(co)     assert((co)->units.next && "Representation as optimization-units not build")
+#define ASSERT_GS_AVAIL(co)     assert((co)->nodes && "Representation as graph not build")
 
-#define get_irn_col(irn)          arch_register_get_index(arch_get_irn_register(irn))
-#define set_irn_col(co, irn, col) arch_set_irn_register(irn, arch_register_for_index((co)->cls, col))
+static inline unsigned get_irn_col(const ir_node *node)
+{
+	return arch_register_get_index(arch_get_irn_register(node));
+}
+
+static inline void set_irn_col(const arch_register_class_t *cls, ir_node *node,
+                               unsigned color)
+{
+	const arch_register_t *reg = arch_register_for_index(cls, color);
+	arch_set_irn_register(node, reg);
+}
 
 #define list_entry_units(lh) list_entry(lh, unit_t, units)
 
-#define is_Reg_Phi(irn)						(is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
+#define is_Reg_Phi(irn)        (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
 
 #define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
 #define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
@@ -98,7 +106,7 @@ typedef struct unit_t {
 	int              sort_key;           /**< maximum costs. controls the order of ou's in the struct list_head units. */
 
 	/* for heuristic */
-	struct list_head queue;		         /**< list of qn's sorted by weight of qn-mis */
+	struct list_head queue;              /**< list of qn's sorted by weight of qn-mis */
 } unit_t;
 
 
@@ -131,21 +139,21 @@ struct affinity_node_t {
 };
 
 
-static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn) {
+static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn)
+{
 	affinity_node_t find;
 
 	ASSERT_GS_AVAIL(co);
 
 	find.irn = irn;
-	return set_find(co->nodes, &find, sizeof(find), hash_irn(irn));
+	return (affinity_node_t*)set_find(co->nodes, &find, sizeof(find), hash_irn(irn));
 }
 
-#define co_gs_nodes_begin(co)			set_first((co)->nodes)
-#define co_gs_nodes_next(co)			set_next((co)->nodes)
-#define co_gs_nodes_break(co)			set_break((co)->nodes)
-
-#define co_gs_foreach_aff_node(co, aff_node)	for (aff_node = co_gs_nodes_begin(co); aff_node; aff_node = co_gs_nodes_next(co))
-#define co_gs_foreach_neighb(aff_node, neighb)	for (neighb = aff_node->neighbours; neighb; neighb = neighb->next)
+#define co_gs_nodes_begin(co)         set_first((co)->nodes)
+#define co_gs_nodes_next(co)          set_next((co)->nodes)
+#define co_gs_nodes_break(co)         set_break((co)->nodes)
 
+#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))
+#define co_gs_foreach_neighb(aff_node, neighb)   for (neighb = (neighb_t*)aff_node->neighbours; neighb != NULL; neighb = (neighb_t*)neighb->next)
 
 #endif /* FIRM_BE_BECOPYOPT_T_H */