#include "irtools.h"
#include "error.h"
#include "list.h"
-#include "statev.h"
+#include "statev_t.h"
#include "bearch.h"
#include "beifg.h"
#include "bemodule.h"
-#define COL_COST_INFEASIBLE DBL_MAX
-#define AFF_NEIGHBOUR_FIX_BENEFIT 128.0
-#define NEIGHBOUR_CONSTR_COSTS 64.0
-
-
#ifdef DEBUG_libfirm
#define DBG_AFF_CHUNK(env, level, chunk) do { if (firm_dbg_get_mask(dbg) & (level)) dbg_aff_chunk((env), (chunk)); } while (0)
/* main coalescing environment */
typedef struct co_mst_env_t {
int n_regs; /**< number of regs in class */
- int k; /**< number of non-ignore registers in class */
bitset_t *allocatable_regs; /**< set containing all global ignore registers */
ir_nodemap map; /**< phase object holding data for nodes */
struct obstack obst;
const arch_register_req_t *req;
neighbours_iter_t nodes_it;
- ir_node *neigh;
unsigned len;
res->irn = irn;
res->tmp_col = -1;
res->int_neighs = NULL;
res->int_aff_neigh = 0;
- res->col = arch_register_get_index(arch_get_irn_register(irn));
+ res->col = arch_get_irn_register(irn)->index;
res->init_col = res->col;
INIT_LIST_HEAD(&res->list);
req = arch_get_irn_register_req(irn);
if (arch_register_req_is(req, limited)) {
rbitset_copy_to_bitset(req->limited, res->adm_colors);
+ /* exclude global ignore registers as well */
+ bitset_and(res->adm_colors, env->allocatable_regs);
} else {
- bitset_set_all(res->adm_colors);
+ bitset_copy(res->adm_colors, env->allocatable_regs);
}
- /* exclude global ignore registers as well */
- bitset_and(res->adm_colors, env->allocatable_regs);
-
/* compute the constraint factor */
res->constr_factor = (real_t) (1 + env->n_regs - bitset_popcount(res->adm_colors)) / env->n_regs;
{
nodes_iter_t nodes_it;
aff_edge_t *edges = NEW_ARR_F(aff_edge_t, 0);
- ir_node *n;
int i, len;
- aff_chunk_t *curr_chunk;
size_t pn;
/* at first we create the affinity edge objects */
*/
static inline void reject_coloring(struct list_head *nodes)
{
- co_mst_irn_t *n, *temp;
DB((dbg, LEVEL_4, "\treject coloring for"));
list_for_each_entry_safe(co_mst_irn_t, n, temp, nodes, list) {
DB((dbg, LEVEL_4, " %+F", n->irn));
static inline void materialize_coloring(struct list_head *nodes)
{
- co_mst_irn_t *n, *temp;
list_for_each_entry_safe(co_mst_irn_t, n, temp, nodes, list) {
assert(n->tmp_col >= 0);
n->col = n->tmp_col;
* TODO Sebastian: Perhaps we should at all nodes and figure out
* a suitable color using costs as done above (determine_color_costs).
*/
- for (i = 0; i < env->k; ++i) {
+ for (i = 0; i < env->n_regs; ++i) {
int col = order[i].col;
waitq *good_starts;
aff_chunk_t *local_best;
unsigned n_regs = co->cls->n_regs;
bitset_t *allocatable_regs = bitset_alloca(n_regs);
unsigned i, j;
- size_t k;
size_t pn;
ir_node *irn;
co_mst_env_t mst_env;
obstack_init(&mst_env.obst);
be_put_allocatable_regs(co->cenv->irg, co->cls, allocatable_regs);
- k = bitset_popcount(allocatable_regs);
mst_env.n_regs = n_regs;
- mst_env.k = k;
mst_env.chunks = new_pqueue();
mst_env.co = co;
mst_env.allocatable_regs = allocatable_regs;