Commit a6e674f7 authored by Matthias Braun's avatar Matthias Braun
Browse files

fix a bunch of warnings reported by cparser

[r27467]
parent 1a33d732
......@@ -953,13 +953,6 @@ typedef ir_type *(*get_Alloc_func)(ir_node *n);
/** Set a new get_Alloc_func and returns the old one. */
get_Alloc_func firm_set_Alloc_func(get_Alloc_func newf);
/**
* sets value ranges through value range propagation
* @param irg The IR-graph on which to work
*
*/
void set_vrp_data(ir_graph *irg);
/**
* Creates an ir_graph pass for set_vrp_data()
*
......
......@@ -54,13 +54,6 @@ typedef struct {
*/
void set_vrp_data(ir_graph *irg);
/**
* Creates an ir_prog_pass for vrp
*
* @param name the name of this pass or NULL
*/
ir_graph_pass_t *set_vrp_pass(const char *name);
/**
* Test, if the two nodes can be compared with their vrp information
*
......
......@@ -193,7 +193,7 @@ static int ia32_dump_node(ir_node *n, FILE *F, dump_reason_t reason)
}
/* dump AM scale */
fprintf(F, "AM scale = %d\n", get_ia32_am_scale(n));
fprintf(F, "AM scale = %u\n", get_ia32_am_scale(n));
/* dump pn code */
if (is_ia32_SwitchJmp(n)) {
......@@ -201,7 +201,8 @@ static int ia32_dump_node(ir_node *n, FILE *F, dump_reason_t reason)
} else if (is_ia32_CMovcc(n) || is_ia32_Setcc(n) || is_ia32_Jcc(n)) {
ia32_attr_t *attr = get_ia32_attr(n);
long pnc = get_ia32_condcode(n);
fprintf(F, "pn_code = 0x%lX (%s)\n", pnc, get_pnc_string(pnc & pn_Cmp_True));
fprintf(F, "pn_code = 0x%X (%s)\n", (unsigned) pnc,
get_pnc_string(pnc & pn_Cmp_True));
fprintf(F, "ins_permuted = %u \n", attr->data.ins_permuted);
fprintf(F, "cmp_unsigned = %u \n", attr->data.cmp_unsigned);
}
......@@ -213,7 +214,7 @@ static int ia32_dump_node(ir_node *n, FILE *F, dump_reason_t reason)
fprintf(F, "commutative = %d\n", is_ia32_commutative(n));
fprintf(F, "need stackent = %d\n", is_ia32_need_stackent(n));
fprintf(F, "is reload = %d\n", is_ia32_is_reload(n));
fprintf(F, "latency = %d\n", get_ia32_latency(n));
fprintf(F, "latency = %u\n", get_ia32_latency(n));
/* dump frame entity */
fprintf(F, "frame entity = ");
......
......@@ -381,7 +381,7 @@ static void write_initializer(io_env_t *env, ir_initializer_t *ini)
case IR_INITIALIZER_COMPOUND: {
unsigned i, n = get_initializer_compound_n_entries(ini);
fprintf(f, "%d ", n);
fprintf(f, "%u ", n);
for (i = 0; i < n; i++)
write_initializer(env, get_initializer_compound_value(ini, i));
break;
......@@ -415,7 +415,7 @@ static void write_volatility(io_env_t *env, ir_node *irn)
static void export_type_common(io_env_t *env, ir_type *tp)
{
fprintf(env->file, "\ttype %ld %s %u %u %s %d ",
fprintf(env->file, "\ttype %ld %s %u %u %s %u ",
get_type_nr(tp),
get_type_tpop_name(tp),
get_type_size_bytes(tp),
......@@ -713,7 +713,7 @@ static void export_modes(io_env_t *env)
break;
}
fprintf(env->file, "\tmode \"%s\" %s %d %d %s %d %d ",
fprintf(env->file, "\tmode \"%s\" %s %u %d %s %u %u ",
get_mode_name(mode), get_mode_sort_name(get_mode_sort(mode)),
get_mode_size_bits(mode), get_mode_sign(mode),
get_mode_arithmetic_name(get_mode_arithmetic(mode)),
......
......@@ -274,11 +274,11 @@ static void create_location_data(dbg_info *dbg, block_id_walker_data_t *wd)
int i, len = strlen(fname) + 1;
tarval **tarval_string;
snprintf(buf, sizeof(buf), "firm_name_arr.%d", nr);
snprintf(buf, sizeof(buf), "firm_name_arr.%u", nr);
arr = new_type_array(1, wd->tp_char);
set_array_bounds_int(arr, 0, 0, len);
snprintf(buf, sizeof(buf), "__firm_name.%d", nr++);
snprintf(buf, sizeof(buf), "__firm_name.%u", nr++);
id = new_id_from_str(buf);
ent = new_entity(get_glob_type(), id, arr);
set_entity_ld_ident(ent, id);
......
......@@ -213,10 +213,6 @@ const char *lc_opt_get_type_name(const lc_opt_entry_t *ent)
return get_type_name(lc_get_opt_special(ent)->type);
}
lc_opt_entry_t *lc_opt_find_grp(const lc_opt_entry_t *grp, const char *name, lc_opt_err_info_t *err);
lc_opt_entry_t *lc_opt_find_opt(const lc_opt_entry_t *grp, const char *name, lc_opt_err_info_t *err);
lc_opt_entry_t *lc_opt_get_grp(lc_opt_entry_t *parent, const char *name)
{
lc_opt_entry_t *ent = lc_opt_find_grp(parent, name, NULL);
......@@ -429,7 +425,7 @@ int lc_opt_std_dump(char *buf, size_t n, UNUSED(const char *name), lc_opt_type_t
switch (type) {
case lc_opt_type_bit:
case lc_opt_type_negbit:
res = snprintf(buf, n, "%x", *((int *) data));
res = snprintf(buf, n, "%x", *((unsigned *) data));
break;
case lc_opt_type_boolean:
case lc_opt_type_negboolean:
......@@ -572,8 +568,6 @@ static char *lc_opt_values_to_string(char *buf, size_t len, const lc_opt_entry_t
return buf;
}
static lc_opt_entry_t *resolve_up_to_last_str(lc_opt_entry_t *root, const char *path, const char **last_name);
int lc_opt_add_table(lc_opt_entry_t *root, const lc_opt_table_entry_t *table)
{
int i, res = 0;
......
......@@ -639,7 +639,7 @@ static ir_node *eval_strlen(ir_entity *ent, ir_type *res_tp)
return NULL;
if (!has_entity_initializer(ent)) {
int len;
int len = 0;
int n;
int i = -1;
......@@ -753,6 +753,7 @@ static ir_node *eval_strcmp(ir_entity *left, ir_entity *right, ir_type *res_tp)
n_r = get_compound_ent_n_values(right);
if (n_r < n)
n = n_r;
res = 0;
for (i = 0; i < n; ++i) {
ir_node *irn;
long v_l, v_r;
......
......@@ -3478,7 +3478,7 @@ static void apply_result(ir_node *irn, void *ctx)
static void apply_end(ir_node *end, environment_t *env)
{
int i, j, n = get_End_n_keepalives(end);
ir_node **in;
ir_node **in = NULL;
if (n > 0)
NEW_ARR_A(ir_node *, in, n);
......
......@@ -1882,7 +1882,7 @@ static void move_loads_out_of_loops(scc *pscc, loop_env *env)
/* only Phis and pure Calls are allowed here, so ignore them */
}
if (other == NULL) {
ldst_info_t *ninfo;
ldst_info_t *ninfo = NULL;
phi_entry *pe;
dbg_info *db;
......
......@@ -121,7 +121,8 @@ static inline void cnt_add_i(counter_t *dst, int src)
static inline int cnt_cmp(const counter_t *a, const counter_t *b)
{
int i;
unsigned va, vb;
unsigned va = 0;
unsigned vb = 0;
for (i = STAT_CNT_NUM - 1 ; i >= 0; --i) {
va = a->cnt[i];
......
......@@ -379,7 +379,7 @@ void count_dags_in_graph(graph_entry_t *global, graph_entry_t *graph)
/* connect and count them */
irg_walk_graph(graph->irg, connect_dags, NULL, &root_env);
printf("Graph %p %s --- %d\n", (void *)graph->irg, get_entity_name(get_irg_entity(graph->irg)),
printf("Graph %p %s --- %u\n", (void *)graph->irg, get_entity_name(get_irg_entity(graph->irg)),
root_env.num_of_dags);
for (id = 0, entry = root_env.list_of_dags; entry; entry = entry->next) {
......@@ -387,7 +387,7 @@ void count_dags_in_graph(graph_entry_t *global, graph_entry_t *graph)
continue;
entry->id = id++;
printf("number of roots %d number of nodes %d inner %d tree %u %ld\n",
printf("number of roots %u number of nodes %u inner %u tree %u %ld\n",
entry->num_roots,
entry->num_nodes,
entry->num_inner_nodes,
......
......@@ -294,7 +294,7 @@ static void simple_dump_be_block_reg_pressure(dumper_t *dmp, graph_entry_t *entr
static void simple_dump_distrib_entry(const distrib_entry_t *entry, void *env)
{
dumper_t *dmp = env;
fprintf(dmp->f, "%12d", cnt_to_uint(&entry->cnt));
fprintf(dmp->f, "%12u", cnt_to_uint(&entry->cnt));
} /* simple_dump_distrib_entry */
/**
......@@ -464,7 +464,7 @@ static void simple_dump_edges(dumper_t *dmp, counter_t *cnt)
if (! dmp->f)
return;
fprintf(dmp->f, "%-16s %8d\n", "Edges", cnt_to_uint(cnt));
fprintf(dmp->f, "%-16s %8u\n", "Edges", cnt_to_uint(cnt));
} /* simple_dump_edges */
/**
......@@ -795,7 +795,7 @@ static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry)
csv_count_nodes(dmp, entry, cnt);
fprintf(dmp->f, "%-40s, %p, %d, %d, %d, %d\n",
fprintf(dmp->f, "%-40s, %p, %u, %u, %u, %u\n",
name,
(void *)entry->irg,
cnt_to_uint(&cnt[0]),
......
......@@ -378,7 +378,7 @@ void set_type_state(ir_type *tp, ir_type_state state)
break;
case tpo_enumeration:
#ifndef NDEBUG
assert(get_type_mode != NULL);
assert(get_type_mode(tp) != NULL);
for (i = get_enumeration_n_enums(tp) - 1; i >= 0; --i) {
ir_enum_const *ec = get_enumeration_const(tp, i);
tarval *tv = get_enumeration_value(ec);
......
......@@ -911,7 +911,7 @@ pn_Cmp tarval_cmp(tarval *a, tarval *b)
tarval *tarval_convert_to(tarval *src, ir_mode *dst_mode)
{
char *buffer;
fp_value *res;
fp_value *res = NULL;
const ieee_descriptor_t *desc;
int len;
......
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