5 files changed, 33 insertions, 33 deletions
diff --git a/misc/getpass.c b/misc/getpass.c
index 16f4a3a365..81c0f689de 100644
--- a/misc/getpass.c
+++ b/misc/getpass.c
@@ -1,26 +1,26 @@
-/* Copyright (C) 1992, 1993, 1994, 1995 Free Software Foundation, Inc.
-This file is part of the GNU C Library.
+/* Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc.
+   This file is part of the GNU C Library.
 
-The GNU C Library is free software; you can redistribute it and/or
-modify it under the terms of the GNU Library General Public License as
-published by the Free Software Foundation; either version 2 of the
-License, or (at your option) any later version.
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
 
-The GNU C Library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-Library General Public License for more details.
+   The GNU C Library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Library General Public License for more details.
 
-You should have received a copy of the GNU Library General Public
-License along with the GNU C Library; see the file COPYING.LIB.  If
-not, write to the Free Software Foundation, Inc., 675 Mass Ave,
-Cambridge, MA 02139, USA.  */
+   You should have received a copy of the GNU Library General Public
+   License along with the GNU C Library; see the file COPYING.LIB.  If not,
+   write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+   Boston, MA 02111-1307, USA.  */
 
 #include <stdio.h>
 #include <termios.h>
 #include <unistd.h>
 
-/* It is desireable to use this bit on systems that have it.
+/* It is desirable to use this bit on systems that have it.
    The only bit of terminal state we want to twiddle is echoing, which is
    done in software; there is no need to change the state of the terminal
    hardware.  */
diff --git a/misc/hsearch_r.c b/misc/hsearch_r.c
index bf7cadc536..980b7c8d72 100644
--- a/misc/hsearch_r.c
+++ b/misc/hsearch_r.c
@@ -118,7 +118,7 @@ hdestroy_r (htab)
 }
 
 
-/* This is the search function. It uses double hashing with open adressing.
+/* This is the search function. It uses double hashing with open addressing.
    The argument item.key has to be a pointer to an zero terminated, most
    probably strings of chars. The function for generating a number of the
    strings is simple but fast. It can be replaced by a more complex function
diff --git a/misc/search.h b/misc/search.h
index 221546d2ba..d0097429e9 100644
--- a/misc/search.h
+++ b/misc/search.h
@@ -93,7 +93,7 @@ extern void hdestroy_r __P ((struct hsearch_data *htab));
 
 
 /* The tsearch routines are very interesting. They make many
-   assumptions about the compiler.  It assumpts that the first field
+   assumptions about the compiler.  It assumes that the first field
    in node must be the "key" field, which points to the datum.
    Everything depends on that.  */
 /* For tsearch */
diff --git a/misc/syslog.c b/misc/syslog.c
index 4c5b6f4bbc..6e9cdef547 100644
--- a/misc/syslog.c
+++ b/misc/syslog.c
@@ -177,7 +177,7 @@ vsyslog(pri, fmt, ap)
 	}
 
 	/* Prepare for multiple users.  We have to take care: open and
-	   write are cancelation points.  */
+	   write are cancellation points.  */
 	__libc_cleanup_region_start ((void (*) (void *)) cancel_handler,
 				     &oldaction_ptr);
 	__libc_lock_lock (syslog_lock);
diff --git a/misc/tsearch.c b/misc/tsearch.c
index 689b2e1104..6af6536a72 100644
--- a/misc/tsearch.c
+++ b/misc/tsearch.c
@@ -1,20 +1,20 @@
 /* Copyright (C) 1995, 1996 Free Software Foundation, Inc.
-This file is part of the GNU C Library.
+   This file is part of the GNU C Library.
 
-The GNU C Library is free software; you can redistribute it and/or
-modify it under the terms of the GNU Library General Public License as
-published by the Free Software Foundation; either version 2 of the
-License, or (at your option) any later version.
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
 
-The GNU C Library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-Library General Public License for more details.
+   The GNU C Library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Library General Public License for more details.
 
-You should have received a copy of the GNU Library General Public
-License along with the GNU C Library; see the file COPYING.LIB.  If
-not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA.  */
+   You should have received a copy of the GNU Library General Public
+   License along with the GNU C Library; see the file COPYING.LIB.  If not,
+   write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+   Boston, MA 02111-1307, USA.  */
 
 /* Tree search generalized from Knuth (6.2.2) Algorithm T just like
    the AT&T man page says.
@@ -30,8 +30,8 @@ Boston, MA 02111-1307, USA.  */
 #include <search.h>
 
 /* This routine is not very bad.  It makes many assumptions about
-   the compiler. It assumpts that the first field in node must be
-   the "key" field, which points to the datum. It is a very trick
+   the compiler. It assumes that the first field in the node must be
+   the "key" field, which points to the datum. It is very tricky
    stuff. H.J.  */
 
 typedef struct node_t