diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2002-12-13 00:17:22 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2002-12-13 00:17:22 +0000 |
| commit | 09da15320b1856ba010101ca5a1c2766d493c1b4 (patch) | |
| tree | 3f4977682a21560e2c4d370fc537230aad533512 /gcc/profile.c | |
| parent | 7930523de8ea4ce820f4a83b2a87b076b5d0ff37 (diff) | |
| download | gcc-09da15320b1856ba010101ca5a1c2766d493c1b4.zip gcc-09da15320b1856ba010101ca5a1c2766d493c1b4.tar.gz gcc-09da15320b1856ba010101ca5a1c2766d493c1b4.tar.bz2 | |
c-decl.c: Fix a comment typo.
* c-decl.c: Fix a comment typo.
* cfg.c: Likewise.
* cfgcleanup.c: Likewise.
* cfglayout.c: Likewise.
* cfgrtl.c: Likewise.
* c-typeck.c: Likewise.
* dominance.c: Likewise.
* dwarf2asm.c: Likewise.
* dwarfout.c: Likewise.
* expmed.c: Likewise.
* expr.c: Likewise.
* final.c: Likewise.
* flow.c: Likewise.
* function.c: Likewise.
* gcc.c: Likewise.
* genautomata.c: Likewise.
* integrate.c: Likewise.
* loop.c: Likewise.
* loop.h: Likewise.
* output.h: Likewise.
* profile.c: Likewise.
* ra.h: Likewise.
* reload1.c: Likewise.
* reload.c: Likewise.
* sched-rgn.c: Likewise.
* stmt.c: Likewise.
* tree.h: Likewise.
* vmsdbgout.c: Likewise.
From-SVN: r60085
Diffstat (limited to 'gcc/profile.c')
| -rw-r--r-- | gcc/profile.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/profile.c b/gcc/profile.c index fd1f424..a70dc61 100644 --- a/gcc/profile.c +++ b/gcc/profile.c @@ -1109,7 +1109,7 @@ union_groups (bb1, bb2) /* This function searches all of the edges in the program flow graph, and puts as many bad edges as possible onto the spanning tree. Bad edges include abnormals edges, which can't be instrumented at the moment. Since it is - possible for fake edges to form an cycle, we will have to develop some + possible for fake edges to form a cycle, we will have to develop some better way in the future. Also put critical edges to the tree, since they are more expensive to instrument. */ @@ -1128,7 +1128,7 @@ find_spanning_tree (el) /* Add fake edge exit to entry we can't instrument. */ union_groups (EXIT_BLOCK_PTR, ENTRY_BLOCK_PTR); - /* First add all abnormal edges to the tree unless they form an cycle. Also + /* First add all abnormal edges to the tree unless they form a cycle. Also add all edges to EXIT_BLOCK_PTR to avoid inserting profiling code behind setting return value from function. */ for (i = 0; i < num_edges; i++) @@ -1148,7 +1148,7 @@ find_spanning_tree (el) } } - /* Now insert all critical edges to the tree unless they form an cycle. */ + /* Now insert all critical edges to the tree unless they form a cycle. */ for (i = 0; i < num_edges; i++) { edge e = INDEX_EDGE (el, i); |