diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2001-08-17 21:23:12 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2001-08-17 21:23:12 +0000 |
| commit | 1be87b7252bb4b5936fc2ebebdcb9f18bed35bae (patch) | |
| tree | d04df8e015f11f7c3f1a689524aaa53d9d41c76a /gcc/unwind-dw2-fde.c | |
| parent | 6eb959329f3e10ce3d614e2701a701d89f95cb35 (diff) | |
| download | gcc-1be87b7252bb4b5936fc2ebebdcb9f18bed35bae.tar.gz | |
* sbitmap.c: Fix comment formatting.
* sched-deps.c: Likewise.
* sibcall.c: Likewise.
* simplify-rtx.c: Likewise.
* ssa.c: Likewise.
* ssa-ccp.c: Likewise.
* stor-layout.c: Likewise.
* timevar.c: Likewise.
* toplev.c: Likewise.
* unwind-dw2.c: Likewise.
* unwind-dw2-fde.c: Likewise.
* varasm.c: Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@44983 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/unwind-dw2-fde.c')
| -rw-r--r-- | gcc/unwind-dw2-fde.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/unwind-dw2-fde.c b/gcc/unwind-dw2-fde.c index 333daecd451..c9ead4af776 100644 --- a/gcc/unwind-dw2-fde.c +++ b/gcc/unwind-dw2-fde.c @@ -436,11 +436,11 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare, { /* For a description of this algorithm, see: Samuel P. Harbison, Guy L. Steele Jr.: C, a reference manual, 2nd ed., - p. 60-61. */ + p. 60-61. */ fde ** a = erratic->array; /* A portion of the array is called a "heap" if for all i>=0: If i and 2i+1 are valid indices, then a[i] >= a[2i+1]. - If i and 2i+2 are valid indices, then a[i] >= a[2i+2]. */ + If i and 2i+2 are valid indices, then a[i] >= a[2i+2]. */ #define SWAP(x,y) do { fde * tmp = x; x = y; y = tmp; } while (0) size_t n = erratic->count; size_t m = n; @@ -448,7 +448,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare, while (m > 0) { - /* Invariant: a[m..n-1] is a heap. */ + /* Invariant: a[m..n-1] is a heap. */ m--; for (i = m; 2*i+1 < n; ) { @@ -470,7 +470,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare, } while (n > 1) { - /* Invariant: a[0..n-1] is a heap. */ + /* Invariant: a[0..n-1] is a heap. */ n--; SWAP (a[0], a[n]); for (i = 0; 2*i+1 < n; ) @@ -494,7 +494,7 @@ frame_heapsort (struct object *ob, fde_compare_t fde_compare, #undef SWAP } -/* Merge V1 and V2, both sorted, and put the result into V1. */ +/* Merge V1 and V2, both sorted, and put the result into V1. */ static inline void fde_merge (struct object *ob, fde_compare_t fde_compare, struct fde_vector *v1, struct fde_vector *v2) |