projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
simplify and cleanup execfreq API
[libfirm]
/
ir
/
be
/
bechordal_t.h
diff --git
a/ir/be/bechordal_t.h
b/ir/be/bechordal_t.h
index
e4ff678
..
c547675
100644
(file)
--- 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
* @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
*/
#ifndef FIRM_BE_BECHORDAL_T_H
#define FIRM_BE_BECHORDAL_T_H
@@
-38,9
+37,6
@@
#include "beirg.h"
#include "beifg.h"
#include "beirg.h"
#include "beifg.h"
-/** Defines an invalid register index. */
-#define NO_COLOR (-1)
-
/**
* A liveness interval border.
*/
/**
* A liveness interval border.
*/
@@
-68,16
+64,16
@@
struct be_chordal_env_t {
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. */
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) {
};
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 pmap_get(
list_head,
inf->border_heads, bl);
}
#define get_block_border_head(info, bl) _get_block_border_head(info, 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))
#define border_next(b) (list_entry((b)->list.next, border_t, list))
#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
@@
-98,7
+94,8
@@
enum {
BE_CH_DUMP_CONSTR = (1 << 7),
BE_CH_DUMP_SPILLSLOTS = (1 << 8),
BE_CH_DUMP_LOWER = (1 << 9),
BE_CH_DUMP_CONSTR = (1 << 7),
BE_CH_DUMP_SPILLSLOTS = (1 << 8),
BE_CH_DUMP_LOWER = (1 << 9),
- BE_CH_DUMP_APPEL = (1 << 10),
+ BE_CH_DUMP_SPLIT = (1 << 10),
+ BE_CH_DUMP_APPEL = (1 << 11),
BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1,
/* lower perm options */
BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1,
/* lower perm options */
@@
-112,9
+109,9
@@
enum {
};
struct be_ra_chordal_opts_t {
};
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];
char ilp_server[128];
char ilp_solver[128];