aboutsummaryrefslogtreecommitdiff
path: root/gcc/libgcc2.c
diff options
context:
space:
mode:
authorRichard Kenner <kenner@gcc.gnu.org>1995-08-28 06:54:22 -0400
committerRichard Kenner <kenner@gcc.gnu.org>1995-08-28 06:54:22 -0400
commitabc95ed36d4c350fa1e23c1d322fee9bd8a018fe (patch)
tree1c83e6e4689be8894157ee8b0f76e689bf3b8871 /gcc/libgcc2.c
parent2d5144e9ae5ef3e32c059f6a572d4bab6863c976 (diff)
downloadgcc-abc95ed36d4c350fa1e23c1d322fee9bd8a018fe.zip
gcc-abc95ed36d4c350fa1e23c1d322fee9bd8a018fe.tar.gz
gcc-abc95ed36d4c350fa1e23c1d322fee9bd8a018fe.tar.bz2
Fix spelling errors.
From-SVN: r10289
Diffstat (limited to 'gcc/libgcc2.c')
-rw-r--r--gcc/libgcc2.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/libgcc2.c b/gcc/libgcc2.c
index 1ab9794..3879bc0 100644
--- a/gcc/libgcc2.c
+++ b/gcc/libgcc2.c
@@ -2204,7 +2204,7 @@ find_exception_table (pc)
return 0;
Assuming a correctly sorted table (ascending order) this routine should
- return the tighest match...
+ return the tightest match...
In the advent of a tie, we have to give the last entry, as it represents
an inner block.