The constructor initializes the array.
[libfirm] / ir / be / bechordal_t.h
index 90cba6b..66669db 100644 (file)
@@ -38,9 +38,6 @@
 #include "beirg.h"
 #include "beifg.h"
 
-/** Defines an invalid register index. */
-#define NO_COLOR (-1)
-
 /**
  * A liveness interval border.
  */
@@ -64,21 +61,20 @@ struct border_t {
 struct be_chordal_env_t {
        struct obstack       *obst;         /**< An obstack for temporary storage. */
        be_ra_chordal_opts_t *opts;         /**< A pointer to the chordal ra options. */
-       be_irg_t             *birg;         /**< Back-end IRG session. */
        ir_graph             *irg;          /**< The graph under examination. */
        const arch_register_class_t *cls;   /**< The current register class. */
        pmap                 *border_heads; /**< Maps blocks to border heads. */
        be_ifg_t             *ifg;          /**< The interference graph. */
-       bitset_t             *ignore_colors;/**< A set of colors which shall be ignored in register allocation. */
+       bitset_t             *allocatable_regs; /**< set of allocatable registers */
 };
 
 static inline struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) {
-  return pmap_get(inf->border_heads, bl);
+  return (list_head*)pmap_get(inf->border_heads, bl);
 }
 
 #define get_block_border_head(info, bl)     _get_block_border_head(info, bl)
 
-#define foreach_border_head(head, pos)         list_for_each_entry_reverse(border_t, pos, head, list)
+#define foreach_border_head(head, pos)      list_for_each_entry_reverse(border_t, pos, head, list)
 #define border_next(b)                      (list_entry((b)->list.next, border_t, list))
 #define border_prev(b)                      (list_entry((b)->list.prev, border_t, list))
 
@@ -121,8 +117,6 @@ struct be_ra_chordal_opts_t {
        char ilp_solver[128];
 };
 
-void be_pre_spill_prepare_constr(be_chordal_env_t *cenv);
-
 void check_for_memory_operands(ir_graph *irg);
 
 #endif /* FIRM_BE_BECHORDAL_T_H */