diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-02-17 21:20:21 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-02-17 21:20:21 +0000 |
| commit | 62402a04aade33d3cc9cfa851b5d4b3cab4fd4bb (patch) | |
| tree | cd25ff5583aa5901b43c9f4ac595b7447da6bce3 /gcc | |
| parent | 869d0ef0606a7308eba00be689253503e1453524 (diff) | |
| download | gcc-62402a04aade33d3cc9cfa851b5d4b3cab4fd4bb.tar.gz | |
* libgcc2.c, tree-vect-analyze.c: Fix comment typos.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@95196 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/ChangeLog | 4 | ||||
| -rw-r--r-- | gcc/libgcc2.c | 2 | ||||
| -rw-r--r-- | gcc/tree-vect-analyze.c | 2 |
3 files changed, 6 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 86723f926ff..a85b50972b3 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,7 @@ +2005-02-17 Kazu Hirata <kazu@cs.umass.edu> + + * libgcc2.c, tree-vect-analyze.c: Fix comment typos. + 2005-02-17 Andreas Krebbel <krebbel1@de.ibm.com> * builtins.c (expand_builtin_return_addr): Remove tem parameter. diff --git a/gcc/libgcc2.c b/gcc/libgcc2.c index 9bdb1c71228..1109c5c4e05 100644 --- a/gcc/libgcc2.c +++ b/gcc/libgcc2.c @@ -1287,7 +1287,7 @@ __fixunssfDI (SFtype a) { /* Since we know that there are fewer significant bits in the SFmode quantity than in a word, we know that we can convert out all the - signficant bits in one step, and thus avoid losing bits. */ + significant bits in one step, and thus avoid losing bits. */ /* ??? This following loop essentially performs frexpf. If we could use the real libm function, or poke at the actual bits of the fp diff --git a/gcc/tree-vect-analyze.c b/gcc/tree-vect-analyze.c index 5caf83231bf..7071199bfa0 100644 --- a/gcc/tree-vect-analyze.c +++ b/gcc/tree-vect-analyze.c @@ -1,4 +1,4 @@ -/* Anlaysis Utilities for Loop Vectorization. +/* Analysis Utilities for Loop Vectorization. Copyright (C) 2003,2004,2005 Free Software Foundation, Inc. Contributed by Dorit Naishlos <dorit@il.ibm.com> |