diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2003-06-23 15:27:37 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2003-06-23 15:27:37 +0000 |
| commit | 71c0e7fc9636c1d99b4a2508bbc2efe3d674f72d (patch) | |
| tree | e01bf4ee4ed8ca0042861ba7004bed92770df135 /gcc/gcov.c | |
| parent | 164131ce2b0389a0ae7254e468c5c7bcada48b28 (diff) | |
| download | gcc-71c0e7fc9636c1d99b4a2508bbc2efe3d674f72d.zip gcc-71c0e7fc9636c1d99b4a2508bbc2efe3d674f72d.tar.gz gcc-71c0e7fc9636c1d99b4a2508bbc2efe3d674f72d.tar.bz2 | |
basic-block.h: Fix comment formatting.
* basic-block.h: Fix comment formatting.
* bt-load.c: Likewise.
* builtins.c: Likewise.
* c-common.c: Likewise.
* c-common.h: Likewise.
* c-format.c: Likewise.
* coverage.c: Likewise.
* cpplib.h: Likewise.
* cpppch.c: Likewise.
* dbxout.c: Likewise.
* diagnostic.c: Likewise.
* dwarf2out.c: Likewise.
* expr.c: Likewise.
* fold-const.c: Likewise.
* function.c: Likewise.
* gcc.c: Likewise.
* gcov-io.c: Likewise.
* gcov-io.h: Likewise.
* gcov.c: Likewise.
* profile.c: Likewise.
* real.h: Likewise.
* sched-deps.c: Likewise.
From-SVN: r68369
Diffstat (limited to 'gcc/gcov.c')
| -rw-r--r-- | gcc/gcov.c | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -149,11 +149,11 @@ typedef struct block_info struct { /* Single line graph cycle workspace. Used for all-blocks - mode. */ + mode. */ arc_t *arc; unsigned ident; } cycle; /* Used in all-blocks mode, after blocks are linked onto - lines. */ + lines. */ } u; /* Temporary chain for solving graph, and for chaining blocks on one @@ -218,9 +218,9 @@ typedef struct line_info { arc_t *branches; /* branches from blocks that end on this line. Used for branch-counts when not - all-blocks mode. */ + all-blocks mode. */ block_t *blocks; /* blocks which start on this line. Used - in all-blocks mode. */ + in all-blocks mode. */ } u; unsigned exists : 1; } line_t; @@ -1691,7 +1691,7 @@ accumulate_line_counts (src) arc_t *cycle_arc = arc; arc_t *probe_arc; - /* Locate the smallest arc count of the loop. */ + /* Locate the smallest arc count of the loop. */ for (dst = head; (probe_arc = dst->u.cycle.arc); dst = probe_arc->src) if (cycle_count > probe_arc->count) @@ -1723,7 +1723,7 @@ accumulate_line_counts (src) arc = head->u.cycle.arc; if (arc) { - /* It was not the first vertex. Move onto next arc. */ + /* It was not the first vertex. Move onto next arc. */ head->u.cycle.arc = NULL; head = arc->src; arc = arc->succ_next; |