+2004-09-20 Daniel Berlin <dberlin@dberlin.org>
+
+ * tree-ssa-pre.c (compute_antic_aux): Use malloc'd worklist, to avoid
+ generating useless garbage.
+
2004-09-20 Paolo Bonzini <bonzini@gnu.org>
* builtins.c (fold_builtin): Call the new omonymous
gcc_assert (val);
if (!is_gimple_min_invariant (val))
+ {
bitmap_set_bit (set->values, VALUE_HANDLE_ID (val));
- bitmap_set_bit (set->expressions, SSA_NAME_VERSION (expr));
+ bitmap_set_bit (set->expressions, SSA_NAME_VERSION (expr));
+ }
}
/* Insert EXPR into SET. */
}
}
+DEF_VEC_MALLOC_P (basic_block);
+
/* Compute the ANTIC set for BLOCK.
ANTIC_OUT[BLOCK] = intersection of ANTIC_IN[b] for all succ(BLOCK), if
them. */
else
{
- varray_type worklist;
+ VEC (basic_block) * worklist;
edge e;
size_t i;
basic_block bprime, first;
- VARRAY_BB_INIT (worklist, 1, "succ");
+ worklist = VEC_alloc (basic_block, 2);
e = block->succ;
while (e)
{
- VARRAY_PUSH_BB (worklist, e->dest);
+ VEC_safe_push (basic_block, worklist, e->dest);
e = e->succ_next;
}
- first = VARRAY_BB (worklist, 0);
+ first = VEC_index (basic_block, worklist, 0);
set_copy (ANTIC_OUT, ANTIC_IN (first));
- for (i = 1; i < VARRAY_ACTIVE_SIZE (worklist); i++)
+ for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++)
{
- bprime = VARRAY_BB (worklist, i);
node = ANTIC_OUT->head;
while (node)
{
node = next;
}
}
- VARRAY_CLEAR (worklist);
+ VEC_free (basic_block, worklist);
}
/* Generate ANTIC_OUT - TMP_GEN */