tree-cfg.c (bsi_commit_edge_inserts): Remove an argument.
* tree-cfg.c (bsi_commit_edge_inserts): Remove an argument. (tree_flow_call_edges_add): Update the call to bsi_commit_edge_inserts. * lambda-code.c (lambda_loopnest_to_gcc_loopnest): Likewise. * profile.c (branch_prob): Likewise. * tree-mudflap.c (mf_decl_cache_locals): Likewise. * tree-sra.c (scalarize_function): Likewise. * tree-ssa-loop-im.c (loop_commit_inserts): Likewise. * tree-ssa-pre.c (fini_pre): Likewise. * tree-flow.h: Update the prototype for bsi_commit_edge_inserts. From-SVN: r90704
This commit is contained in:
parent
a62346841c
commit
8e731e4e6c
|
@ -8,6 +8,18 @@
|
|||
TREE_OPERAND with COND_EXPR_COND, COND_EXPR_THEN, or
|
||||
COND_EXPR_ELSE.
|
||||
|
||||
* tree-cfg.c (bsi_commit_edge_inserts): Remove an argument.
|
||||
(tree_flow_call_edges_add): Update the call to
|
||||
bsi_commit_edge_inserts.
|
||||
* lambda-code.c (lambda_loopnest_to_gcc_loopnest): Likewise.
|
||||
* profile.c (branch_prob): Likewise.
|
||||
* tree-mudflap.c (mf_decl_cache_locals): Likewise.
|
||||
* tree-sra.c (scalarize_function): Likewise.
|
||||
* tree-ssa-loop-im.c (loop_commit_inserts): Likewise.
|
||||
* tree-ssa-pre.c (fini_pre): Likewise.
|
||||
* tree-flow.h: Update the prototype for
|
||||
bsi_commit_edge_inserts.
|
||||
|
||||
2004-11-15 Eric Christopher <echristo@redhat.com>
|
||||
|
||||
* sched-deps.c (set_sched_group_p): Delete.
|
||||
|
|
|
@ -1900,7 +1900,7 @@ lambda_loopnest_to_gcc_loopnest (struct loop *old_loopnest,
|
|||
new_ivs,
|
||||
invariants, MAX_EXPR, &stmts);
|
||||
bsi_insert_on_edge (loop_preheader_edge (temp), stmts);
|
||||
bsi_commit_edge_inserts (NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
/* Build the new upper bound and insert its statements in the
|
||||
basic block of the exit condition */
|
||||
newupperbound = lle_to_gcc_expression (LL_UPPER_BOUND (newloop),
|
||||
|
|
|
@ -1109,7 +1109,7 @@ branch_prob (void)
|
|||
|
||||
/* Commit changes done by instrumentation. */
|
||||
if (ir_type ())
|
||||
bsi_commit_edge_inserts ((int *)NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
else
|
||||
{
|
||||
commit_edge_insertions_watch_calls ();
|
||||
|
|
|
@ -3005,29 +3005,20 @@ tree_find_edge_insert_loc (edge e, block_stmt_iterator *bsi,
|
|||
|
||||
|
||||
/* This routine will commit all pending edge insertions, creating any new
|
||||
basic blocks which are necessary.
|
||||
|
||||
If specified, NEW_BLOCKS returns a count of the number of new basic
|
||||
blocks which were created. */
|
||||
basic blocks which are necessary. */
|
||||
|
||||
void
|
||||
bsi_commit_edge_inserts (int *new_blocks)
|
||||
bsi_commit_edge_inserts (void)
|
||||
{
|
||||
basic_block bb;
|
||||
edge e;
|
||||
int blocks;
|
||||
edge_iterator ei;
|
||||
|
||||
blocks = n_basic_blocks;
|
||||
|
||||
bsi_commit_one_edge_insert (EDGE_SUCC (ENTRY_BLOCK_PTR, 0), NULL);
|
||||
|
||||
FOR_EACH_BB (bb)
|
||||
FOR_EACH_EDGE (e, ei, bb->succs)
|
||||
bsi_commit_one_edge_insert (e, NULL);
|
||||
|
||||
if (new_blocks)
|
||||
*new_blocks = n_basic_blocks - blocks;
|
||||
}
|
||||
|
||||
|
||||
|
@ -5168,7 +5159,7 @@ tree_flow_call_edges_add (sbitmap blocks)
|
|||
if (e->dest == EXIT_BLOCK_PTR)
|
||||
{
|
||||
bsi_insert_on_edge (e, build_empty_stmt ());
|
||||
bsi_commit_edge_inserts ((int *)NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -480,7 +480,7 @@ extern void tree_optimize_tail_calls (bool, enum tree_dump_index);
|
|||
extern void bsi_insert_on_edge (edge, tree);
|
||||
extern basic_block bsi_insert_on_edge_immediate (edge, tree);
|
||||
extern void bsi_commit_one_edge_insert (edge, basic_block *);
|
||||
extern void bsi_commit_edge_inserts (int *);
|
||||
extern void bsi_commit_edge_inserts (void);
|
||||
extern void notice_special_calls (tree);
|
||||
extern void clear_special_calls (void);
|
||||
extern void verify_stmts (void);
|
||||
|
|
|
@ -476,7 +476,7 @@ mf_decl_cache_locals (void)
|
|||
! tsi_end_p (tsi);
|
||||
tsi_next (&tsi))
|
||||
insert_edge_copies (tsi_stmt (tsi), ENTRY_BLOCK_PTR);
|
||||
bsi_commit_edge_inserts (NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -1992,7 +1992,7 @@ scalarize_function (void)
|
|||
|
||||
sra_walk_function (&fns);
|
||||
scalarize_parms ();
|
||||
bsi_commit_edge_inserts (NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -596,7 +596,7 @@ loop_commit_inserts (void)
|
|||
basic_block bb;
|
||||
|
||||
old_last_basic_block = last_basic_block;
|
||||
bsi_commit_edge_inserts (NULL);
|
||||
bsi_commit_edge_inserts ();
|
||||
for (i = old_last_basic_block; i < (unsigned) last_basic_block; i++)
|
||||
{
|
||||
bb = BASIC_BLOCK (i);
|
||||
|
|
|
@ -1964,7 +1964,7 @@ fini_pre (void)
|
|||
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);
|
||||
|
|
Loading…
Reference in New Issue