Commit 3cd16bd3 authored by Matthias Braun's avatar Matthias Braun
Browse files

fix a few more warnings

parent b041f035
......@@ -77,6 +77,7 @@ typedef struct _be_chordal_alloc_env_t {
/* Make a fourcc for border checking. */
#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D')
#if 0
static void check_border_list(struct list_head *head)
{
border_t *x;
......@@ -93,7 +94,7 @@ static void check_heads(be_chordal_env_t *env)
check_border_list(ent->value);
}
}
#endif
/**
* Add an interval border to the list of a block's list
......@@ -221,8 +222,6 @@ static be_insn_t *chordal_scan_insn(be_chordal_env_t *env, ir_node *irn)
static ir_node *prepare_constr_insn(be_chordal_env_t *env, ir_node *irn)
{
be_insn_t *insn = chordal_scan_insn(env, irn);
int n_uses = be_insn_n_uses(insn);
int n_defs = be_insn_n_defs(insn);
int i;
if(!insn->has_constraints)
......@@ -338,6 +337,10 @@ static ir_node *pre_process_constraints(be_chordal_alloc_env_t *alloc_env, be_in
Now, figure out which input operand must be copied since it has input
constraints which are also output constraints.
*/
(void) bl;
(void) copy;
(void) bs;
(void) dbg;
#if 0
for(i = insn->use_start; i < insn->n_ops; ++i) {
be_operand_t *op = &insn->ops[i];
......
......@@ -435,9 +435,6 @@ static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
/* Perform the following for each register class. */
for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
//FILE *f;
copy_opt_t *co = NULL;
chordal_env.cls = arch_isa_get_reg_class(isa, j);
chordal_env.border_heads = pmap_create();
chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
......
......@@ -294,7 +294,7 @@ static void *reg_pressure_block_init(void *graph_env, ir_node *bl)
int i, n;
for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
//ir_node *op = get_irn_n(irn, i);
if(must_appear_in_schedule(env->main_env->vtab, env, irn)) {
usage_stats_t *us = get_or_set_usage_stats(env, irn);
#if 0 /* Liveness is not computed here! */
......@@ -600,17 +600,6 @@ static INLINE void make_users_ready(block_sched_env_t *env, ir_node *irn)
}
}
/**
* Compare to nodes using pointer equality.
* @param p1 Node one.
* @param p2 Node two.
* @return 0 if they are identical.
*/
static int node_cmp_func(const void *p1, const void *p2)
{
return p1 != p2;
}
/**
* Append an instruction to a schedule.
* @param env The block scheduling environment.
......
......@@ -555,7 +555,6 @@ static void lv_check_walker(ir_node *bl, void *data)
else if(curr) {
unsigned n_curr = curr[0].u.head.n_members;
unsigned n_fresh = fr[0].u.head.n_members;
unsigned n = MIN(n_curr, n_fresh);
unsigned i;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment