X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=7d7bee50416502cde1aad1ba4818f38d84f0e06b;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=a7dcb36abb45c0c9096775b21b33ab8fc42ad07a;hpb=ce6161a7e42a48f7422b7babcc64d8ace18e2687;p=libfirm

diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h
index a7dcb36ab..7d7bee504 100644
--- a/ir/be/bechordal_t.h
+++ b/ir/be/bechordal_t.h
@@ -22,7 +22,6 @@
  * @brief       Internal data structures for the chordal register allocator.
  * @author      Sebastian Hack
  * @date        25.01.2005
- * @version     $Id$
  */
 #ifndef FIRM_BE_BECHORDAL_T_H
 #define FIRM_BE_BECHORDAL_T_H
@@ -38,9 +37,6 @@
 #include "beirg.h"
 #include "beifg.h"
 
-/** Defines an invalid register index. */
-#define NO_COLOR (-1)
-
 /**
  * A liveness interval border.
  */
@@ -77,7 +73,7 @@ static inline struct list_head *_get_block_border_head(const be_chordal_env_t *i
 
 #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))
 
@@ -112,9 +108,9 @@ enum {
 };
 
 struct be_ra_chordal_opts_t {
-	int dump_flags;
-	int lower_perm_opt;
-	int vrfy_option;
+	unsigned dump_flags;
+	int      lower_perm_opt;
+	int      vrfy_option;
 
 	char ilp_server[128];
 	char ilp_solver[128];