* @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
#include "debug.h"
#include "bechordal.h"
-#include "beirg.h"
#include "beifg.h"
/**
* Environment for each of the chordal register allocator phases
*/
struct be_chordal_env_t {
- struct obstack *obst; /**< An obstack for temporary storage. */
+ struct obstack obst; /**< An obstack for temporary storage. */
be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */
ir_graph *irg; /**< The graph under examination. */
const arch_register_class_t *cls; /**< The current register class. */
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 (list_head*)pmap_get(inf->border_heads, bl);
+static inline struct list_head *get_block_border_head(be_chordal_env_t const *const inf, ir_node *const bl)
+{
+ return pmap_get(list_head, 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 border_next(b) (list_entry((b)->list.next, border_t, list))
-#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
-
-#define chordal_has_class(chordal_env, irn) \
- arch_irn_consider_in_reg_alloc(chordal_env->cls, irn)
-
-void be_ra_chordal_color(be_chordal_env_t *chordal_env);
enum {
/* Dump flags */
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 */
};
struct be_ra_chordal_opts_t {
- int dump_flags;
- int lower_perm_opt;
- int vrfy_option;
-
- char ilp_server[128];
- char ilp_solver[128];
+ unsigned dump_flags;
+ int lower_perm_opt;
+ int vrfy_option;
};
void check_for_memory_operands(ir_graph *irg);