make function names the correct case

src/lib/libc/stdlib/a64l.3

@@ -24,7 +24,7 @@
 .\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 .\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 .\"
-.\" $OpenBSD: a64l.3,v 1.2 1998/06/21 22:13:48 millert Exp $
+.\" $OpenBSD: a64l.3,v 1.3 1999/02/27 21:55:53 deraadt Exp $
 .\"
 .Dd August 17, 1997
 .Dt A64L 3
@@ -61,7 +61,7 @@ and returns a corresponding 32-bit value.  If the string pointed to by
 contains more than six characters,
 .Fn a64l
 will use the first six.
-.Fn A64l
+.Fn a64l
 scans the character string from left to right, decoding
 each character as a 6-bit radix-64 number.  If a long integer is
 larger than 32 bits, the return value will be sign-extended.

src/lib/libc/stdlib/exit.3

@@ -33,7 +33,7 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: exit.3,v 1.2 1996/08/19 08:33:30 tholo Exp $
+.\"	$OpenBSD: exit.3,v 1.3 1999/02/27 21:55:55 deraadt Exp $
 .\"
 .Dd June 29, 1991
 .Dt EXIT 3
@@ -46,7 +46,7 @@
 .Ft void
 .Fn exit "int status"
 .Sh DESCRIPTION
-.Fn Exit
+.Fn exit
 terminates a process.
 .Pp
 Before termination it performs the following functions in the

src/lib/libc/stdlib/qsort.3

@@ -33,7 +33,7 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: qsort.3,v 1.2 1996/08/19 08:33:42 tholo Exp $
+.\"	$OpenBSD: qsort.3,v 1.3 1999/02/27 21:56:00 deraadt Exp $
 .\"
 .Dd June 4, 1993
 .Dt QSORT 3
@@ -71,7 +71,7 @@ objects, the initial member of which is pointed to by
 .Fa base .
 The size of each object is specified by
 .Fa size .
-.Fn Mergesort
+.Fn mergesort
 behaves similarly, but
 .Em requires
 that
@@ -108,7 +108,7 @@ The
 function is an implementation of C.A.R. Hoare's ``quicksort'' algorithm,
 a variant of partition-exchange sorting; in particular, see D.E. Knuth's
 Algorithm Q.
-.Fn Qsort
+.Fn qsort
 takes O N lg N average time.
 This implementation uses median selection to avoid its
 O N**2 worst-case behavior.
@@ -117,7 +117,7 @@ The
 .Fn heapsort
 function is an implementation of J.W.J. William's ``heapsort'' algorithm,
 a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H.
-.Fn Heapsort
+.Fn heapsort
 takes O N lg N worst-case time.
 Its
 .Em only
@@ -133,7 +133,7 @@ requires additional memory of size
 .Fa nmemb *
 .Fa size 
 bytes; it should be used only when space is not at a premium.
-.Fn Mergesort
+.Fn mergesort
 is optimized for data with pre-existing order; its worst case
 time is O N lg N; its best case is O N.
 .Pp
@@ -175,7 +175,7 @@ argument to
 is less than
 .Dq "sizeof(void *) / 2" .
 .It Bq Er ENOMEM
-.Fn Heapsort
+.Fn heapsort
 or
 .Fn mergesort
 were unable to allocate memory.

src/lib/libc/stdlib/tsearch.3

@@ -23,7 +23,7 @@
 .\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 .\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: tsearch.3,v 1.2 1998/06/21 22:13:49 millert Exp $
+.\"	$OpenBSD: tsearch.3,v 1.3 1999/02/27 21:56:03 deraadt Exp $
 .\"
 .Dd June 15, 1997
 .Dt TSEARCH 3
@@ -53,7 +53,7 @@ from Knuth (6.2.2).  The comparison function passed in by
 the user has the same style of return values as
 .Xr strcmp 3 .
 .Pp
-.Fn Tfind
+.Fn tfind
 searches for the datum matched by the argument
 .Fa key
 in the binary tree rooted at
@@ -61,7 +61,7 @@ in the binary tree rooted at
 returning a pointer to the datum if it is found and NULL
 if it is not.
 .Pp
-.Fn Tsearch
+.Fn tsearch
 is identical to
 .Fn tfind
 except that if no match is found,
@@ -70,7 +70,7 @@ is inserted into the tree and a pointer to it is returned.  If
 .Fa rootp
 points to a NULL value a new binary search tree is created.
 .Pp
-.Fn Tdelete
+.Fn tdelete
 deletes a node from the specified binary search tree and returns
 a pointer to the parent of the node to be deleted.
 It takes the same arguments as
@@ -81,13 +81,13 @@ If the node to be deleted is the root of the binary search tree,
 .Fa rootp
 will be adjusted.
 .Pp
-.Fn Twalk
+.Fn twalk
 walks the binary search tree rooted in
 .fa root
 and calls the function
 .Fa action
 on each node.
-.Fa Action
+.Fa action
 is called with three arguments: a pointer to the current node,
 a value from the enum 
 .Sy "typedef enum { preorder, postorder, endorder, leaf } VISIT;"
@@ -103,7 +103,7 @@ The
 function returns NULL if allocation of a new node fails (usually
 due to a lack of free memory).
 .Pp
-.Fn Tfind ,
+.Fn tfind ,
 .Fn tsearch ,
 and
 .Fn tdelete

src/lib/libutil/getmaxpartitions.3

@@ -1,4 +1,4 @@
-.\"   $OpenBSD: getmaxpartitions.3,v 1.2 1996/10/08 01:20:18 michaels Exp $
+.\"   $OpenBSD: getmaxpartitions.3,v 1.3 1999/02/27 21:57:40 deraadt Exp $
 .\"	$NetBSD: getmaxpartitions.3,v 1.1 1996/05/16 07:03:30 thorpej Exp $
 .\"
 .\" Copyright (c) 1996 The NetBSD Foundation, Inc.
@@ -46,7 +46,7 @@
 .Ft int
 .Fn getmaxpartitions void
 .Sh DESCRIPTION
-.Fn Getmaxpartitions
+.Fn getmaxpartitions
 returns the number of partitions that are allowed per disk on the
 system.
 .Sh SEE ALSO

src/lib/libutil/getrawpartition.3

@@ -1,4 +1,4 @@
-.\"   $OpenBSD: getrawpartition.3,v 1.2 1996/10/08 01:20:18 michaels Exp $
+.\"   $OpenBSD: getrawpartition.3,v 1.3 1999/02/27 21:57:40 deraadt Exp $
 .\"	$NetBSD: getrawpartition.3,v 1.1 1996/05/16 07:03:32 thorpej Exp $
 .\"
 .\" Copyright (c) 1996 The NetBSD Foundation, Inc.
@@ -48,7 +48,7 @@ partition
 .Ft int
 .Fn getrawpartition void
 .Sh DESCRIPTION
-.Fn Getrawpartition
+.Fn getrawpartition
 returns the partition number (
 .Sq a
 == 0,