diff options
| author | Jeff Law <law@redhat.com> | 2004-11-30 17:33:05 -0700 |
|---|---|---|
| committer | Jeff Law <law@gcc.gnu.org> | 2004-11-30 17:33:05 -0700 |
| commit | 874437bca02e96899291027cfa3d6e4d4e08414f (patch) | |
| tree | cd189cb08fa13a7f1b8b3f73f4d5e9b4b6f53621 /gcc/modulo-sched.c | |
| parent | 29b0a291d41c929c8b86f40da25071e09beeb7a6 (diff) | |
| download | gcc-874437bca02e96899291027cfa3d6e4d4e08414f.zip gcc-874437bca02e96899291027cfa3d6e4d4e08414f.tar.gz gcc-874437bca02e96899291027cfa3d6e4d4e08414f.tar.bz2 | |
sbitmap.c (sbitmap_any_common_bits): New function.
* sbitmap.c (sbitmap_any_common_bits): New function.
* sbitmap.h (sbitmap_any_common_bits): Prototype.
* modulo-sched.c (sms_schedule_by_order): Use sbitmap_any_common_bits
No longer allocate/free "psp", "pss" sbitmaps.
* tree-ssa-alias.c (compute_flow_insensitive_aliasing): Similarly for
the "res" sbitmap.
(group_aliases): Similarly.
From-SVN: r91550
Diffstat (limited to 'gcc/modulo-sched.c')
| -rw-r--r-- | gcc/modulo-sched.c | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c index 14f006a..57879ba 100644 --- a/gcc/modulo-sched.c +++ b/gcc/modulo-sched.c @@ -1219,8 +1219,6 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order, FILE *du ddg_edge_ptr e; int start, end, step; /* Place together into one struct? */ sbitmap sched_nodes = sbitmap_alloc (num_nodes); - sbitmap psp = sbitmap_alloc (num_nodes); - sbitmap pss = sbitmap_alloc (num_nodes); sbitmap must_precede = sbitmap_alloc (num_nodes); sbitmap must_follow = sbitmap_alloc (num_nodes); @@ -1250,10 +1248,8 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order, FILE *du continue; /* 1. compute sched window for u (start, end, step). */ - sbitmap_zero (psp); - sbitmap_zero (pss); - psp_not_empty = sbitmap_a_and_b_cg (psp, u_node_preds, sched_nodes); - pss_not_empty = sbitmap_a_and_b_cg (pss, u_node_succs, sched_nodes); + psp_not_empty = sbitmap_any_common_bits (u_node_preds, sched_nodes); + pss_not_empty = sbitmap_any_common_bits (u_node_succs, sched_nodes); if (psp_not_empty && !pss_not_empty) { @@ -1399,8 +1395,6 @@ sms_schedule_by_order (ddg_ptr g, int mii, int maxii, int *nodes_order, FILE *du } /* While try_again_with_larger_ii. */ sbitmap_free (sched_nodes); - sbitmap_free (psp); - sbitmap_free (pss); if (ii >= maxii) { |