diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-10-28 14:24:29 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-10-28 14:24:29 +0000 |
| commit | 1c170b5eba160dbdb474f2471af25437c88c5e50 (patch) | |
| tree | 1449ce3c84e030e8ae70a3924d19e8b33c026d54 /gcc | |
| parent | f340a501f7fc0856b317f48ac328af520e292001 (diff) | |
| download | gcc-1c170b5eba160dbdb474f2471af25437c88c5e50.zip gcc-1c170b5eba160dbdb474f2471af25437c88c5e50.tar.gz gcc-1c170b5eba160dbdb474f2471af25437c88c5e50.tar.bz2 | |
tree-ssa-loop-ivopts.c: Fix a comment typo.
* tree-ssa-loop-ivopts.c: Fix a comment typo.
* doc/invoke.texi: Fix a typo.
From-SVN: r89759
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/doc/invoke.texi | 2 | ||||
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 2 |
3 files changed, 7 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index c4413c1..af012f4 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,10 @@ 2004-10-28 Kazu Hirata <kazu@cs.umass.edu> + * tree-ssa-loop-ivopts.c: Fix a comment typo. + * doc/invoke.texi: Fix a typo. + +2004-10-28 Kazu Hirata <kazu@cs.umass.edu> + * Makefile.in (OBJS-common): Remove duplicates. 2004-10-28 Kazu Hirata <kazu@cs.umass.edu> diff --git a/gcc/doc/invoke.texi b/gcc/doc/invoke.texi index 72d4f57..c1d48ed 100644 --- a/gcc/doc/invoke.texi +++ b/gcc/doc/invoke.texi @@ -5322,7 +5322,7 @@ default value, 0, implies that GCC will select the most appropriate size itself. @item sra-field-structure-ratio -The treshold ratio (as a percentage) between instantiated fields and +The threshold ratio (as a percentage) between instantiated fields and the complete structure size. We say that if the ratio of the number of bytes in instantiated fields to the number of bytes in the complete structure exceeds this parameter, then block copies are not used. The diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index c0c800a7..58771cd 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -3615,7 +3615,7 @@ try_add_cand_for (struct ivopts_data *data, bitmap ivs, bitmap inv, just one generic biv. If we added here many ivs specific to the uses, the optimization algorithm later would be likely to get stuck in a local minimum, thus causing us to create too many ivs. The approach from - few ivs to more seems more likely to be succesful -- starting from few + few ivs to more seems more likely to be successful -- starting from few ivs, replacing an expensive use by a specific iv should always be a win. */ EXECUTE_IF_SET_IN_BITMAP (data->important_candidates, 0, i, bi) |