/**
- * Internal datastructures for the chordal register allocator.
+ * Internal data structures for the chordal register allocator.
* @author Sebastian Hack
* @date 25.1.2005
*/
#include "pmap.h"
#include "set.h"
+#include "execfreq.h"
+
#include "be_t.h"
#include "beifg.h"
#include "bera.h"
#include "bearch.h"
#include "bechordal.h"
#include "beirgmod.h"
+#include "belive.h"
typedef struct _be_ra_chordal_opts_t be_ra_chordal_opts_t;
dom_front_info_t *dom_front; /**< Dominance frontiers. */
ir_graph *irg; /**< The graph under examination. */
const arch_register_class_t *cls; /**< The current register class. */
+ exec_freq_t *exec_freq; /**< Adam's execution frequencies. */
+ be_lv_t *lv; /**< Liveness information. */
pmap *border_heads; /**< Maps blocks to border heads. */
be_ifg_t *ifg; /**< The interference graph. */
void *data; /**< Some pointer, to which different phases can attach data to. */
/* spill method */
BE_CH_SPILL_BELADY = 1,
BE_CH_SPILL_MORGAN = 2,
- BE_CH_SPILL_ILP = 3,
- BE_CH_SPILL_REMAT = 4,
- BE_CH_SPILL_APPEL = 5,
+ BE_CH_SPILL_REMAT = 3,
/* Dump flags */
BE_CH_DUMP_NONE = (1 << 0),
BE_CH_DUMP_SSADESTR = (1 << 5),
BE_CH_DUMP_TREE_INTV = (1 << 6),
BE_CH_DUMP_CONSTR = (1 << 7),
- BE_CH_DUMP_LOWER = (1 << 8),
- BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_LOWER - 1,
-
- /* copymin method */
- BE_CH_COPYMIN_NONE = 0,
- BE_CH_COPYMIN_HEUR1 = 1,
- BE_CH_COPYMIN_HEUR2 = 2,
- BE_CH_COPYMIN_STAT = 3,
- BE_CH_COPYMIN_ILP1 = 4,
- BE_CH_COPYMIN_ILP2 = 5,
- BE_CH_COPYMIN_PARK_MOON = 6,
+ BE_CH_DUMP_SPILLSLOTS = (1 << 8),
+ BE_CH_DUMP_LOWER = (1 << 9),
+ BE_CH_DUMP_APPEL = (1 << 10),
+ BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1,
/* ifg flavor */
BE_CH_IFG_STD = 1,
struct _be_ra_chordal_opts_t {
int dump_flags;
int spill_method;
- int copymin_method;
int ifg_flavor;
int lower_perm_opt;
int vrfy_option;
*/
FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix);
+void be_pre_spill_prepare_constr(be_chordal_env_t *cenv);
+
#endif /* _BECHORDAL_T_H */