static void ana_Call(ir_node *n, void *env) {
int i, n_callees;
ir_graph *irg;
+ (void) env;
if (! is_Call(n)) return;
double freq;
int found_edge;
int n_callees;
+ (void) env;
if (cg_irg_visited(irg)) return;
void free_cdep(ir_graph *irg)
{
+ (void) irg;
// TODO atm leaking more memory than a small memory leaking animal
}
static int exec_freq_cmp(const void *e1, const void *e2, size_t size) {
reg_exec_freq *ef1 = (reg_exec_freq *)e1;
reg_exec_freq *ef2 = (reg_exec_freq *)e2;
+ (void) size;
+
return (ef1->reg != ef2->reg);
}
}
-static void walk_pre(ir_node *n, void *env) {
-
+static void walk_pre(ir_node *n, void *env)
+{
+ (void) env;
if (get_irn_op(n) == op_Raise)
just_passed_a_Raise = 1;
}
}
-static void walk_post(ir_node *n, void *env) {
-
+static void walk_post(ir_node *n, void *env)
+{
+ (void) env;
if (get_irn_op(n) == op_Raise)
just_passed_a_Raise = 0;
static double exception_prob = 0.001;
-static INLINE int is_loop_head(ir_node *cond) {
+static INLINE int is_loop_head(ir_node *cond)
+{
+ (void) cond;
return 0;
}
set_region_exec_freq(reg, my_freq);
}
-static void check_proper_head(ir_loop *l, void *reg) {
+static void check_proper_head(ir_loop *l, void *reg)
+{
int i, n_ins = get_region_n_ins(reg);
+ (void) l;
for (i = 0; i < n_ins; ++i) {
assert(!get_region_in(reg, i));
}
static void *irn_height_init(ir_phase *ph, ir_node *irn, void *data)
{
+ (void) irn;
irn_height_t *h = data ? data : phase_alloc(ph, sizeof(h[0]));
memset(h, 0, sizeof(h[0]));
return h;
int region_attr_cmp(const void *e1, const void *e2, size_t size) {
region_attr *ra1 = (region_attr *)e1;
region_attr *ra2 = (region_attr *)e2;
+ (void) size;
return (ra1->reg != ra2->reg);
}
}
-static int find_previous_loop(ir_loop *l, ir_loop *pred_l, ir_node *b, ir_node *pred_b, ir_node *cfop) {
+static int find_previous_loop(ir_loop *l, ir_loop *pred_l, ir_node *b,
+ ir_node *pred_b, ir_node *cfop)
+{
ir_loop *outer = get_loop_outer_loop(l);
int found, i;
int l_pos = get_loop_element_pos(outer, l);
+ (void) pred_l;
assert(l_pos > -1);
assert(l_pos > 0 && "Is this a necessary condition? There could be a perfect nest ...");
* Called from a walker.
*/
static INLINE void
-init_node (ir_node *n, void *env) {
+init_node (ir_node *n, void *env)
+{
+ (void) env;
if (is_Block(n))
set_irn_link (n, new_scc_info());
clear_backedges(n);
static int cmp_mem_disambig_entry(const void *elt, const void *key, size_t size) {
const mem_disambig_entry *p1 = elt;
const mem_disambig_entry *p2 = key;
+ (void) size;
return p1->adr1 == p2->adr1 && p1->adr2 == p2->adr2;
} /* cmp_mem_disambig_entry */
ir_address_taken_state state = get_entity_address_taken(ent);
if (state != ir_address_not_taken) {
- assert(ir_address_not_taken <= state && state <= ir_address_taken);
+ assert(ir_address_not_taken <= (int) state && state <= ir_address_taken);
ir_printf("%+F: %s\n", ent, get_address_taken_state_name(state));
}
}