typos;

4 files changed, 31 insertions, 31 deletions

diff --git a/share/man/man3/bitstring.3 b/share/man/man3/bitstring.3
index e6bbc9c6fd3..2cf9135b7d5 100644
--- a/share/man/man3/bitstring.3
+++ b/share/man/man3/bitstring.3
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: bitstring.3,v 1.9 2000/12/15 14:31:19 aaron Exp $
+.\"	$OpenBSD: bitstring.3,v 1.10 2003/05/20 09:13:38 jmc Exp $
 .\"	$NetBSD: bitstring.3,v 1.4 1994/11/30 15:24:31 jtc Exp $
 .\"
 .\" Copyright (c) 1989, 1991, 1993
@@ -46,7 +46,7 @@
 .Nm bit_ffc ,
 .Nm bit_ffs ,
 .Nm bit_nclear ,
-.Nm bit_nset,
+.Nm bit_nset ,
 .Nm bit_set ,
 .Nm bitstr_size ,
 .Nm bit_test
diff --git a/share/man/man3/queue.3 b/share/man/man3/queue.3
index 9cdfe211565..c6b3a741649 100644
--- a/share/man/man3/queue.3
+++ b/share/man/man3/queue.3
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: queue.3,v 1.29 2003/05/17 18:40:12 krw Exp $
+.\"	$OpenBSD: queue.3,v 1.30 2003/05/20 09:13:38 jmc Exp $
 .\"	$NetBSD: queue.3,v 1.4 1995/07/03 00:25:36 mycroft Exp $
 .\"
 .\" Copyright (c) 1993 The Regents of the University of California.
@@ -299,7 +299,7 @@ However:
 .Pp
 .Bl -enum -compact -offset indent
 .It
-Each elements requires two pointers rather than one.
+Each element requires two pointers rather than one.
 .It
 Code size and execution time of operations (except for removal) is about
 twice that of the singly-linked data-structures.
@@ -454,7 +454,7 @@ of the list pointed by
 .Fa head .
 .Pp
 The
-.Fn SLIST_FIRST ,
+.Fn SLIST_FIRST
 and
 .Fn SLIST_NEXT
 macros can be used to traverse the list:
@@ -561,7 +561,7 @@ with the new element
 .Fa elm2 .
 .Pp
 The
-.Fn LIST_FIRST ,
+.Fn LIST_FIRST
 and
 .Fn LIST_NEXT
 macros can be used to traverse the list:
@@ -680,13 +680,13 @@ macro removes the first element
 from the queue.
 .Pp
 The
-.Fn SIMPLEQ_FIRST ,
+.Fn SIMPLEQ_FIRST
 and
 .Fn SIMPLEQ_NEXT
 macros can be used to traverse the queue.
 The
 .Fn SIMPLEQ_FOREACH
-is used for queue traversal
+is used for queue traversal:
 .Bd -literal -offset indent
 SIMPLEQ_FOREACH(np, head, NAME)
 .Ed
@@ -947,7 +947,7 @@ and
 macros can be used to traverse a circular queue.
 The
 .Fn CIRCLEQ_FOREACH
-is used for circular queue forward traversal
+is used for circular queue forward traversal:
 .Bd -literal -offset indent
 CIRCLEQ_FOREACH(np, head, NAME)
 .Ed
diff --git a/share/man/man3/sysexits.3 b/share/man/man3/sysexits.3
index c7e4d8a0890..97cc36478ae 100644
--- a/share/man/man3/sysexits.3
+++ b/share/man/man3/sysexits.3
@@ -23,7 +23,7 @@
 .\" (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 .\" THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 .\"
-.\" $OpenBSD: sysexits.3,v 1.5 2001/01/24 22:49:06 aaron Exp $
+.\" $OpenBSD: sysexits.3,v 1.6 2003/05/20 09:13:38 jmc Exp $
 .\" $FreeBSD: src/share/man/man3/sysexits.3,v 1.4.2.1 1999/08/29 16:45:41 peter Exp $
 .\"
 .Dd March 31, 1996
@@ -37,7 +37,7 @@
 .Sh DESCRIPTION
 According to
 .Xr style 9 ,
-it is not a good practice to call
+it is not good practice to call
 .Xr exit 3
 with arbitrary values to indicate a failure condition when ending a program.
 Instead, the pre-defined exit codes from
@@ -55,7 +55,7 @@ The meaning of the code is approximately as follows:
 .Bl -tag -width "EX_UNAVAILABLEXX(XX)"
 .It Dv EX_USAGE Pq 64
 The command was used incorrectly, e.g., with the wrong number of
-arguments, a bad flag, a bad syntax in a parameter, or whatever.
+arguments, a bad flag, bad syntax in a parameter, or whatever.
 .It Dv EX_DATAERR Pq 65
 The input data was incorrect in some way.
 This should only be used for user's data and not system files.
@@ -90,8 +90,8 @@ returning a user that does not exist in the passwd file.
 .It Dv EX_OSFILE Pq 72
 Some system file (e.g.,
 .Pa /etc/passwd ,
-.Pa /var/run/utmp ,
-etc.) does not exist, cannot be opened, or has some sort of error
+.Pa /var/run/utmp )
+does not exist, cannot be opened, or has some sort of error
 (e.g., syntax error).
 .It Dv EX_CANTCREAT Pq 73
 A (user specified) output file cannot be created.
@@ -99,7 +99,7 @@ A (user specified) output file cannot be created.
 An error occurred while doing I/O on some file.
 .It Dv EX_TEMPFAIL Pq 75
 Temporary failure, indicating something that is not really an error.
-In sendmail, this means that a mailer (e.g.) could not create a
+In sendmail, this means that a mailer, for example, could not create a
 connection, and the request should be reattempted later.
 .It Dv EX_PROTOCOL Pq 76
 The remote system returned something that was
@@ -127,7 +127,7 @@ The
 file appeared sometime after
 .Bx 4.3 .
 .Sh AUTHORS
-This man page has been written by
+This man page was written by
 .ie t J\(:org Wunsch
 .el Joerg Wunsch
 after the comments in
diff --git a/share/man/man3/tree.3 b/share/man/man3/tree.3
index 234be208de9..1c5f3072615 100644
--- a/share/man/man3/tree.3
+++ b/share/man/man3/tree.3
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: tree.3,v 1.8 2002/11/08 08:08:46 mpech Exp $
+.\"	$OpenBSD: tree.3,v 1.9 2003/05/20 09:13:38 jmc Exp $
 .\"/*
 .\" * Copyright 2002 Niels Provos <provos@citi.umich.edu>
 .\" * All rights reserved.
@@ -32,8 +32,8 @@
 .Dt TREE 3
 .Os
 .Sh NAME
-.Nm SPLAY_PROTOTYPE,
-.Nm SPLAY_GENERATE,
+.Nm SPLAY_PROTOTYPE ,
+.Nm SPLAY_GENERATE ,
 .Nm SPLAY_ENTRY ,
 .Nm SPLAY_HEAD ,
 .Nm SPLAY_INITIALIZER ,
@@ -49,8 +49,8 @@
 .Nm SPLAY_INIT ,
 .Nm SPLAY_INSERT ,
 .Nm SPLAY_REMOVE ,
-.Nm RB_PROTOTYPE,
-.Nm RB_GENERATE,
+.Nm RB_PROTOTYPE ,
+.Nm RB_GENERATE ,
 .Nm RB_ENTRY ,
 .Nm RB_HEAD ,
 .Nm RB_INITIALIZER ,
@@ -131,7 +131,7 @@
 .Ft "struct TYPE *"
 .Fn RB_REMOVE "NAME" "RB_HEAD *head" "struct TYPE *elm"
 .Sh DESCRIPTION
-These macros defines data structures for different types of trees:
+These macros define data structures for different types of trees:
 splay trees and red-black trees.
 .Pp
 In the macro definitions,
@@ -146,7 +146,7 @@ The argument
 .Fa HEADNAME
 is the name tag of a user defined structure that must be declared
 using the macros
-.Fn SPLAY_HEAD ,
+.Fn SPLAY_HEAD
 or
 .Fn RB_HEAD .
 The argument
@@ -154,11 +154,11 @@ The argument
 has to be a unique name prefix for every tree that is defined.
 .Pp
 The function prototypes are declared with either
-.Li SPLAY_PROTOTYPE,
+.Li SPLAY_PROTOTYPE
 or
 .Li RB_PROTOTYPE .
 The function bodies are generated with either
-.Li SPLAY_GENERATE,
+.Li SPLAY_GENERATE
 or
 .Li RB_GENERATE .
 See the examples below for further explanation of how these macros are used.
@@ -174,7 +174,7 @@ On the other hand, every lookup causes memory writes.
 .Pp
 The Balance Theorem bounds the total access time for m operations
 and n inserts on an initially empty tree as O((m + n)lg n).
-The amortized cost for a sequence of m accesses to a splay tree is O(lg n);
+The amortized cost for a sequence of m accesses to a splay tree is O(lg n).
 .Pp
 A splay tree is headed by a structure defined by the
 .Fn SPLAY_HEAD
@@ -203,7 +203,7 @@ macro,
 where
 .Fa NAME
 is a unique identifier for this particular tree.
-The 
+The
 .Fa TYPE
 argument is the type of the structure that is being managed
 by the tree.
@@ -222,7 +222,7 @@ macro, but should be used only once.
 Finally,
 the
 .Fa CMP
-argument is the name of a function used to compare tree noded
+argument is the name of a function used to compare trees noded
 with each other.
 The function takes two arguments of type
 .Fa "struct TYPE *" .
@@ -331,7 +331,7 @@ macro,
 where
 .Fa NAME
 is a unique identifier for this particular tree.
-The 
+The
 .Fa TYPE
 argument is the type of the structure that is being managed
 by the tree.
@@ -350,7 +350,7 @@ macro, but should be used only once.
 Finally,
 the
 .Fa CMP
-argument is the name of a function used to compare tree noded
+argument is the name of a function used to compare trees noded
 with each other.
 The function takes two arguments of type
 .Fa "struct TYPE *" .
@@ -452,7 +452,7 @@ Accordingly,
 .Fn RB_REMOVE
 and
 .Fn SPLAY_REMOVE
-return the pointer to the removed element otherwise they return
+return the pointer to the removed element, otherwise they return
 .Va NULL
 to indicate an error.
 .Sh AUTHORS