diff options
| author | amacleod <amacleod@138bc75d-0d04-0410-961f-82ee72b054a4> | 1999-08-25 18:01:48 +0000 |
|---|---|---|
| committer | amacleod <amacleod@138bc75d-0d04-0410-961f-82ee72b054a4> | 1999-08-25 18:01:48 +0000 |
| commit | cb7e28c369135e0ed896d8a5fd5efb40387e79c8 (patch) | |
| tree | ba955e0fe6c71fda70442293df272f976fb43e4e /gcc/sbitmap.h | |
| parent | 1408b4f1267c3ddc0f1765dcfc848d78cafad027 (diff) | |
| download | gcc-cb7e28c369135e0ed896d8a5fd5efb40387e79c8.tar.gz | |
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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@28866 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/sbitmap.h')
| -rw-r--r-- | gcc/sbitmap.h | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/gcc/sbitmap.h b/gcc/sbitmap.h index ca475fa756c..ca2f99730a5 100644 --- a/gcc/sbitmap.h +++ b/gcc/sbitmap.h @@ -120,3 +120,12 @@ extern void sbitmap_union_of_predsucc PROTO ((sbitmap, sbitmap *, int, struct int_list **)); #define sbitmap_union_of_predecessors sbitmap_union_of_predsucc #define sbitmap_union_of_successors sbitmap_union_of_predsucc + +/* Intersection and Union of preds/succs using the new flow graph + structure instead of the pred/succ arrays. */ + +extern void sbitmap_intersection_of_succs PROTO ((sbitmap, sbitmap *, int)); +extern void sbitmap_intersection_of_preds PROTO ((sbitmap, sbitmap *, int)); +extern void sbitmap_union_of_succs PROTO ((sbitmap, sbitmap *, int)); +extern void sbitmap_union_of_preds PROTO ((sbitmap, sbitmap *, int)); + |