return false;
/* If they are for the same basic block, determine if the
- expressions are equal. */
+ expressions are equal. */
if (expressions_equal_p (ve1->e, ve2->e))
return true;
fprintf (outfile, "%s[%d] := { ", setname, blockindex);
if (set)
{
- int i;
+ bool first = true;
+ unsigned i;
bitmap_iterator bi;
EXECUTE_IF_SET_IN_BITMAP (set->expressions, 0, i, bi)
{
+ if (!first)
+ fprintf (outfile, ", ");
+ first = false;
print_generic_expr (outfile, ssa_name (i), 0);
fprintf (outfile, " (");
print_generic_expr (outfile, get_value_handle (ssa_name (i)), 0);
fprintf (outfile, ") ");
- if (bitmap_last_set_bit (set->expressions) != i)
- fprintf (outfile, ", ");
}
}
fprintf (outfile, " }\n");
switch (TREE_CODE_CLASS (TREE_CODE (expr)))
{
case tcc_reference:
- /* XXX: Until we have PRE of loads working, none will be ANTIC. */
+ /* XXX: Until we have PRE of loads working, none will be ANTIC. */
return NULL;
case tcc_binary:
dom = get_immediate_dominator (CDI_DOMINATORS, block);
if (dom)
{
- int i;
+ unsigned i;
bitmap_iterator bi;
bitmap_set_t newset = NEW_SETS (dom);
unary_node_pool = create_alloc_pool ("Unary tree nodes",
tree_code_size (NEGATE_EXPR), 30);
reference_node_pool = create_alloc_pool ("Reference tree nodes",
- tree_code_size (COMPONENT_REF), 30);
+ tree_code_size (ARRAY_REF), 30);
FOR_ALL_BB (bb)
{
EXP_GEN (bb) = set_new (true);
basic_block bb;
unsigned int i;
- bsi_commit_edge_inserts (NULL);
+ bsi_commit_edge_inserts ();
obstack_free (&grand_bitmap_obstack, NULL);
free_alloc_pool (value_set_pool);
free_dominance_info (CDI_POST_DOMINATORS);
vn_delete ();
- if (bitmap_first_set_bit (need_eh_cleanup) >= 0)
+ if (!bitmap_empty_p (need_eh_cleanup))
{
tree_purge_all_dead_eh_edges (need_eh_cleanup);
cleanup_tree_cfg ();