diff options
| author | Andrew MacLeod <amacleod@cygnus.com> | 1999-08-25 18:01:48 +0000 |
|---|---|---|
| committer | Andrew Macleod <amacleod@gcc.gnu.org> | 1999-08-25 18:01:48 +0000 |
| commit | 36349f8be4d205674b7ac3a4711ffdf2e2220792 (patch) | |
| tree | ba955e0fe6c71fda70442293df272f976fb43e4e /libjava/java/util/Stack.java | |
| parent | 3d31bc7f586d9d4980995289e5057beed1a8227a (diff) | |
| download | gcc-36349f8be4d205674b7ac3a4711ffdf2e2220792.zip gcc-36349f8be4d205674b7ac3a4711ffdf2e2220792.tar.gz gcc-36349f8be4d205674b7ac3a4711ffdf2e2220792.tar.bz2 | |
sbitmap.h (sbitmap_intersection_of_succs): Add prototype.
Wed Aug 25 13:55:47 EDT 1999 Andrew MacLeod <amacleod@cygnus.com>
* sbitmap.h (sbitmap_intersection_of_succs): Add prototype.
(sbitmap_intersection_of_preds, sbitmap_union_of_succs,
sbitmap_union_of_preds): Add prototypes.
* sbitmap.c (sbitmap_intersection_of_succs): New function to compute
the intersection of successors with the new flow graph structures.
(sbitmap_intersection_of_preds): New function to compute the
intersection of predecessors with the new flow graph structures.
(sbitmap_union_of_succs): New function to compute the union of
successors with the new flow graph structures.
(sbitmap_union_of_preds): New function to compute the union of
predecessors with the new flow graph structures.
* gcse.c (compute_rdm, compute_available): Use new sbitmap routines.
(expr_reaches_here_p): Use edge and basic_block structures instead
of s_preds and s_succs.
(compute_cprop_avinout): Use new sbitmap routines.
(pre_expr_reaches_here_p): Use edge and basic_block structures instead
of s_preds and s_succs.
* flow.c (compute_flow_dominators): Compute dominators using
edges and basic blocks instead of s_preds and s_succs.
From-SVN: r28866
Diffstat (limited to 'libjava/java/util/Stack.java')
0 files changed, 0 insertions, 0 deletions