diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2002-05-09 12:02:29 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2002-05-09 12:02:29 +0000 |
| commit | 786de7eb9aaaf39f96248b6d42316b2aa4e9bf63 (patch) | |
| tree | 8dfb059637bc4dfe3718b626a8be035328c2a665 /gcc/sbitmap.c | |
| parent | b7764693d645c516a9b1be36fce35b12731fffb6 (diff) | |
| download | gcc-786de7eb9aaaf39f96248b6d42316b2aa4e9bf63.zip gcc-786de7eb9aaaf39f96248b6d42316b2aa4e9bf63.tar.gz gcc-786de7eb9aaaf39f96248b6d42316b2aa4e9bf63.tar.bz2 | |
sbitmap.c: Fix formatting.
* sbitmap.c: Fix formatting.
* scan.c: Likewise.
* scan-decls.c: Likewise.
* sched-deps.c: Likewise.
* sched-ebb.c: Likewise.
* sched-rgn.c: Likewise.
* sched-vis.c: Likewise.
* sdbout.c: Likewise.
* sibcall.c: Likewise.
* simplify-rtx.c: Likewise.
* ssa.c: Likewise.
* ssa-ccp.c: Likewise.
* ssa-dce.c: Likewise.
* stmt.c: Likewise.
* stor-layout.c: Likewise.
* stringpool.c: Likewise.
From-SVN: r53324
Diffstat (limited to 'gcc/sbitmap.c')
| -rw-r--r-- | gcc/sbitmap.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/sbitmap.c b/gcc/sbitmap.c index c101cb0..e581000 100644 --- a/gcc/sbitmap.c +++ b/gcc/sbitmap.c @@ -1,5 +1,5 @@ /* Simple bitmaps. - Copyright (C) 1999, 2000 Free Software Foundation, Inc. + Copyright (C) 1999, 2000, 2002 Free Software Foundation, Inc. This file is part of GCC. @@ -222,7 +222,7 @@ sbitmap_difference (dst, a, b) sbitmap_ptr dstp = dst->elms; sbitmap_ptr ap = a->elms; sbitmap_ptr bp = b->elms; - + for (i = 0; i < n; i++) *dstp++ = *ap++ & ~*bp++; } @@ -444,7 +444,7 @@ sbitmap_intersection_of_succs (dst, src, bb) for (e = b->succ; e != 0; e = e->succ_next) { if (e->dest == EXIT_BLOCK_PTR) - continue; + continue; sbitmap_copy (dst, src[e->dest->index]); break; @@ -484,7 +484,7 @@ sbitmap_intersection_of_preds (dst, src, bb) for (e = b->pred; e != 0; e = e->pred_next) { if (e->src == ENTRY_BLOCK_PTR) - continue; + continue; sbitmap_copy (dst, src[e->src->index]); break; @@ -524,7 +524,7 @@ sbitmap_union_of_succs (dst, src, bb) for (e = b->succ; e != 0; e = e->succ_next) { if (e->dest == EXIT_BLOCK_PTR) - continue; + continue; sbitmap_copy (dst, src[e->dest->index]); break; @@ -564,7 +564,7 @@ sbitmap_union_of_preds (dst, src, bb) for (e = b->pred; e != 0; e = e->pred_next) { if (e->src== ENTRY_BLOCK_PTR) - continue; + continue; sbitmap_copy (dst, src[e->src->index]); break; @@ -580,7 +580,7 @@ sbitmap_union_of_preds (dst, src, bb) if (e->src == ENTRY_BLOCK_PTR) continue; - + p = src[e->src->index]->elms; r = dst->elms; for (i = 0; i < set_size; i++) |