static int address_mark_cmp(const void *elt, const void *key, size_t size) {
const address_mark_entry_t *e1 = elt;
const address_mark_entry_t *e2 = key;
+ (void) size;
/* compare only the nodes, the rest is used as data container */
return e1->node != e2->node;
{
graph_entry_t key;
graph_entry_t *elem;
- int i;
+ size_t i;
key.irg = irg;
*/
static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
{
+ (void) global;
if (graph->is_deleted) {
/* deleted, ignore */
return;
* @param op the new IR opcode that was created.
*/
static void stat_new_ir_op(void *ctx, ir_op *op) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param op the IR opcode that is freed
*/
static void stat_free_ir_op(void *ctx, ir_op *op) {
+ (void) ctx;
+ (void) op;
if (! status->stat_options)
return;
* @param node the new IR node that was created
*/
static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
+ (void) ctx;
+ (void) irg;
if (! status->stat_options)
return;
* @param node the IR node that will be turned into an ID
*/
static void stat_turn_into_id(void *ctx, ir_node *node) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param ent the entity of this graph
*/
static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
+ (void) ctx;
if (! status->stat_options)
return;
* information from being changed, it's "frozen" from now.
*/
static void stat_free_graph(void *ctx, ir_graph *irg) {
+ (void) ctx;
if (! status->stat_options)
return;
*/
static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
{
+ (void) ctx;
+ (void) pre;
+ (void) post;
if (! status->stat_options)
return;
*/
static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
{
+ (void) ctx;
+ (void) node;
+ (void) pre;
+ (void) post;
if (! status->stat_options)
return;
ir_node **old_node_array, int old_num_entries,
hook_opt_kind opt)
{
+ (void) ctx;
if (! status->stat_options)
return;
* @param flag if non-zero, reassociation is started else stopped
*/
static void stat_reassociate(void *ctx, int flag) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param node the IR node that will be lowered
*/
static void stat_lower(void *ctx, ir_node *node) {
+ (void) ctx;
if (! status->stat_options)
return;
*/
static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
{
+ (void) ctx;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
+ (void) ctx;
+ (void) irg;
if (! status->stat_options)
return;
static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
int pos, ir_node *mux, if_result_t reason)
{
+ (void) context;
+ (void) phi;
+ (void) pos;
+ (void) mux;
if (! status->stat_options)
return;
*/
static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
{
+ (void) context;
+ (void) call;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param node the division node that will be optimized
*/
static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
+ (void) ctx;
if (! status->stat_options)
return;
++p;
l = p - name;
- if (l > sizeof(fname) - 1)
+ if (l > (int) (sizeof(fname) - 1))
l = sizeof(fname) - 1;
memcpy(fname, name, l);
static void vcg_dump_edge(pattern_dumper_t *self, unsigned tgt, unsigned src, unsigned pos, unsigned mode_code)
{
vcg_private_t *priv = self->data;
+ (void) mode_code;
if (priv->pattern_id > priv->max_pattern)
return;
FILE *f = self->data;
ir_op *op = stat_get_op_from_opcode(op_code);
ir_mode *mode = (ir_mode *)mode_code;
+ (void) attr;
/* if (env->options & OPT_ENC_GRAPH) */
fprintf(f, "%u:", id);
static void stdout_dump_edge(pattern_dumper_t *self, unsigned tgt, unsigned src, unsigned pos, unsigned mode_code)
{
FILE *f = self->data;
+ (void) tgt;
+ (void) src;
+ (void) pos;
+ (void) mode_code;
if (pos > 0)
fprintf(f, ", ");
static void stdout_start_children(pattern_dumper_t *self, unsigned id)
{
FILE *f = self->data;
+ (void) id;
fprintf(f, "(");
} /* stdout_start_children */
static void stdout_finish_children(pattern_dumper_t *self, unsigned id)
{
FILE *f = self->data;
+ (void) id;
fprintf(f, ")");
} /* stdout_finish_children */
*/
static void simple_dump_opt_hash(dumper_t *dmp, pset *set, int index)
{
- assert(index < ARR_SIZE(opt_names) && "index out of range");
- assert(opt_names[index].kind == index && "opt_names broken");
+ assert(index < (int) ARR_SIZE(opt_names) && "index out of range");
+ assert((int) opt_names[index].kind == index && "opt_names broken");
if (pset_count(set) > 0) {
opt_entry_t *entry;
/* effects of optimizations */
if (dump_opts) {
- int i;
+ size_t i;
simple_dump_real_func_calls(dmp, &entry->cnt[gcnt_acc_real_func_call]);
simple_dump_tail_recursion(dmp, entry->num_tail_recursion);
*/
static void simple_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
{
- int i;
+ size_t i;
counter_t sum;
if (! dmp->f)
*/
static void csv_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
{
+ (void) dmp;
+ (void) tbl;
/* FIXME: NYI */
} /* csv_dump_const_tbl */
* dumps the parameter distribution table
*/
static void csv_dump_param_tbl(dumper_t *dmp, const distrib_tbl_t *tbl, graph_entry_t *global) {
+ (void) dmp;
+ (void) tbl;
+ (void) global;
/* FIXME: NYI */
} /* csv_dump_param_tbl */