SET *(PMANGLE(new)) (MANGLEP(cmp_fun) cmp, size_t nslots)
{
- int i;
- SET *table = XMALLOC(SET);
+ SET *table = XMALLOC(SET);
+ size_t i;
if (nslots > SEGMENT_SIZE * DIRECTORY_SIZE)
nslots = DIRECTORY_SIZE;
ir_node *block = bl->block;
int i, n = get_Block_n_cfgpreds(block);
size_t end = env.rbs_size - 1;
- size_t pos;
DB((dbg, LEVEL_3, "processing %+F\n", block));
if (n > 1) {
ir_node **ins;
- int pos;
+ size_t pos;
NEW_ARR_A(ir_node *, ins, n);
}
if (n > 1) {
+ size_t pos;
+
/* check for partly redundant values */
for (pos = rbitset_next(bl->anticL_in, 0, 1);
pos < end;
ir_node *sync;
ir_node **in;
ir_nodeset_iterator_t iter;
- int i;
+ size_t i;
++n;
NEW_ARR_A(ir_node*, in, n);
*/
static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
{
- int i, dump_opts = 1;
+ int dump_opts = 1;
block_entry_t *b_entry;
extbb_entry_t *eb_entry;
if (entry->irg) {
ir_graph *const_irg = get_const_code_irg();
+ int i;
if (entry->irg == const_irg)
fprintf(dmp->f, "\nConst code Irg %p", (void *)entry->irg);
/* 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);