summaryrefslogtreecommitdiff
path: root/lib/libc
diff options
context:
space:
mode:
authorAaron Campbell <aaron@cvs.openbsd.org>1999-07-04 18:59:45 +0000
committerAaron Campbell <aaron@cvs.openbsd.org>1999-07-04 18:59:45 +0000
commitce33624f105bbf6b20e87d0e06c24996db2e0176 (patch)
tree66d6fb743c7b71c44d2e5fe784ce772f6e55b4cf /lib/libc
parent02f5c89460eebf5fccec73d72f630200c765c1c9 (diff)
trash some old leftover macros and replace them with -mdoc macros
Diffstat (limited to 'lib/libc')
-rw-r--r--lib/libc/crypt/arc4random.37
-rw-r--r--lib/libc/db/man/btree.331
-rw-r--r--lib/libc/db/man/hash.318
-rw-r--r--lib/libc/gen/sysctl.311
-rw-r--r--lib/libc/net/getservent.33
-rw-r--r--lib/libc/regex/regex.36
-rw-r--r--lib/libc/stdlib/random.313
-rw-r--r--lib/libc/stdlib/tsearch.34
-rw-r--r--lib/libc/sys/fcntl.23
-rw-r--r--lib/libc/sys/getpgrp.24
-rw-r--r--lib/libc/sys/intro.27
-rw-r--r--lib/libc/sys/link.23
-rw-r--r--lib/libc/sys/mmap.24
-rw-r--r--lib/libc/sys/nfssvc.28
14 files changed, 58 insertions, 64 deletions
diff --git a/lib/libc/crypt/arc4random.3 b/lib/libc/crypt/arc4random.3
index bcf98bd9648..988de1d0f67 100644
--- a/lib/libc/crypt/arc4random.3
+++ b/lib/libc/crypt/arc4random.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: arc4random.3,v 1.9 1999/06/30 01:40:18 deraadt Exp $
+.\" $OpenBSD: arc4random.3,v 1.10 1999/07/04 18:59:42 aaron Exp $
.\" Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de>
.\" All rights reserved.
.\"
@@ -50,10 +50,7 @@ The
.Fn arc4random
function uses the key stream generator employed by the
arc4 cipher, which uses 8*8 8 bit S-Boxes. The S-Boxes
-can be in about
-.if t 2\u\s71700\s10\d
-.if n (2**1700)
-states.
+can be in about (2**1700) states.
.Pp
The
.Fn arc4random_stir
diff --git a/lib/libc/db/man/btree.3 b/lib/libc/db/man/btree.3
index 4fdc9cd6786..71b398a1ba1 100644
--- a/lib/libc/db/man/btree.3
+++ b/lib/libc/db/man/btree.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: btree.3,v 1.9 1999/06/05 04:47:41 aaron Exp $
+.\" $OpenBSD: btree.3,v 1.10 1999/07/04 18:59:42 aaron Exp $
.\" $NetBSD: btree.3,v 1.6 1996/05/03 21:26:48 cgd Exp $
.\"
.\" Copyright (c) 1997, Phillip F Knaack. All rights reserved.
@@ -135,7 +135,7 @@ cache can reduce the number of I/O operations significantly.
Obviously, using a cache increases (but only increases) the likelihood of
corruption or lost data if the system crashes while a tree is being modified.
If
-.Em cachesize
+.Fa cachesize
is 0 (no size is specified) a default cache is used.
.It maxkeypage
The maximum number of keys which will be stored on any single page.
@@ -146,13 +146,13 @@ This value is used to determine which keys will be stored on overflow
pages, i.e. if a key or data item is longer than the pagesize divided
by the minkeypage value, it will be stored on overflow pages instead
of in the page itself. If
-.Em minkeypage
+.Fa minkeypage
is 0 (no minimum number of keys is specified) a value of 2 is used.
.It psize
Page size is the size (in bytes) of the pages used for nodes in the tree.
The minimum page size is 512 bytes and the maximum page size is 64K.
If
-.Em psize
+.Fa psize
is 0 (no page size is specified) a page size is chosen based on the
underlying file system I/O block size.
.It compare
@@ -162,8 +162,10 @@ first key argument is considered to be respectively less than, equal to,
or greater than the second key argument.
The same comparison function must be used on a given tree every time it
is opened.
-.Em compare
-is NULL (no comparison function is specified), the keys are compared
+.Fa compare
+is
+.Dv NULL
+(no comparison function is specified), the keys are compared
lexically, with shorter keys considered less than longer keys.
.It prefix
Prefix is the prefix comparison function.
@@ -173,20 +175,23 @@ key argument.
If the keys are equal, the key length should be returned.
Note, the usefulness of this routine is very data dependent, but, in some
data sets can produce significantly reduced tree sizes and search times. If
-.Em prefix
-is NULL (no prefix function is specified),
-.B and
+.Fa prefix
+is
+.Dv NULL
+(no prefix function is specified),
+.Em and
no comparison function is specified, a default lexical comparison routine
is used. If
-.I prefix
-is NULL and a comparison routine is specified, no prefix comparison is
-done.
+.Fa prefix
+is
+.Dv NULL
+and a comparison routine is specified, no prefix comparison is done.
.It lorder
The byte order for integers in the stored database metadata.
The number should represent the order as an integer; for example,
big endian order would be the number 4,321.
If
-.Em lorder
+.Fa lorder
is 0 (no order is specified) the current host order is used.
.El
.Pp
diff --git a/lib/libc/db/man/hash.3 b/lib/libc/db/man/hash.3
index 43a66b96e62..413a734b9e0 100644
--- a/lib/libc/db/man/hash.3
+++ b/lib/libc/db/man/hash.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: hash.3,v 1.6 1999/05/23 14:10:58 aaron Exp $
+.\" $OpenBSD: hash.3,v 1.7 1999/07/04 18:59:42 aaron Exp $
.\" $NetBSD: hash.3,v 1.6 1996/05/03 21:26:50 cgd Exp $
.\"
.\" Copyright (c) 1997, Phillip F Knaack. All rights reserved.
@@ -59,7 +59,7 @@ The hash data structure is an extensible, dynamic hashing scheme.
The access method specific data structure provided to
.Fn dbopen
is defined in the
-.Em <db.h>
+.Aq Pa db.h
include file as follows:
.Pp
.Bl -item -compact
@@ -86,18 +86,18 @@ int lorder;
The elements of this structure are as follows:
.Bl -tag -width XXXXXX -offset indent
.It bsize
-.Em bsize
+.Fa bsize
defines the hash table bucket size, and is, by default, 256 bytes.
It may be preferable to increase the page size for disk-resident tables
and tables with large data items.
.It ffactor
-.Em Ffactor
+.Fa ffactor
indicates a desired density within the hash table.
It is an approximation of the number of keys allowed to accumulate in any
one bucket, determining when the hash table grows or shrinks.
The default value is 8.
.It nelem
-.Em Nelem
+.Fa nelem
is an estimate of the final size of the hash table.
If not set or set too low, hash tables will expand gracefully as keys
are entered, although a slight performance degradation may be noticed.
@@ -105,11 +105,11 @@ The default value is 1.
.It cachesize
A suggested maximum size, in bytes, of the memory cache.
This value is
-.B only
+.Em only
advisory, and the access method will allocate more memory rather
than fail.
.It hash
-.Em Hash
+.Fa hash
is a user defined hash function.
Since no hash function performs equally well on all possible data, the
user may find that the built-in hash function does poorly on a particular
@@ -121,7 +121,7 @@ value.
The byte order for integers in the stored database metadata.
The number should represent the order as an integer; for example,
big endian order would be the number 4,321. If
-.Em lorder
+.Fa lorder
is 0 (no order is specified) the current host order is used.
If the file already exists, the specified value is ignored and the
value specified when the tree was created is used.
@@ -134,7 +134,7 @@ values specified for the parameters bsize, ffactor, lorder and nelem are
ignored and the values specified when the tree was created are used.
.Pp
If a hash function is specified,
-.Em hash_open
+.Fa hash_open
will attempt to determine if the hash function specified is the same as
the one with which the database was created, and will fail if it is not.
.Pp
diff --git a/lib/libc/gen/sysctl.3 b/lib/libc/gen/sysctl.3
index a4fb69338b6..2de353c1a90 100644
--- a/lib/libc/gen/sysctl.3
+++ b/lib/libc/gen/sysctl.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: sysctl.3,v 1.25 1999/07/04 12:25:14 aaron Exp $
+.\" $OpenBSD: sysctl.3,v 1.26 1999/07/04 18:59:42 aaron Exp $
.\"
.\" Copyright (c) 1993
.\" The Regents of the University of California. All rights reserved.
@@ -142,20 +142,20 @@ in the system:
.Bd -literal -offset indent -compact
int mib[2], maxproc;
size_t len;
-.sp
+
mib[0] = CTL_KERN;
mib[1] = KERN_MAXPROC;
len = sizeof(maxproc);
sysctl(mib, 2, &maxproc, &len, NULL, 0);
.Ed
-.sp
+.Pp
To retrieve the standard search path for the system utilities:
.Pp
.Bd -literal -offset indent -compact
int mib[2];
size_t len;
char *p;
-.sp
+
mib[0] = CTL_USER;
mib[1] = USER_CS_PATH;
sysctl(mib, 2, NULL, &len, NULL, 0);
@@ -261,6 +261,7 @@ information.
.It Dv KERN_NAME_MAX No " integer no"
.It Dv KERN_NGROUPS No " integer no"
.It Dv KERN_NO_TRUNC No " integer no"
+.It Dv KERN_NOSUIDCOREDUMP No " integer yes"
.It Dv KERN_OSRELEASE No " string no"
.It Dv KERN_OSREV No " integer no"
.It Dv KERN_OSTYPE No " string no"
@@ -350,6 +351,8 @@ The maximum number of supplemental groups.
Return 1 if file names longer than
.Dv KERN_NAME_MAX
are truncated.
+.It Dv KERN_NOSUIDCOREDUMP
+Programs with their set-user-ID bit set will not dump core when this is set.
.It Dv KERN_OSRELEASE
The system release string.
.It Dv KERN_OSREV
diff --git a/lib/libc/net/getservent.3 b/lib/libc/net/getservent.3
index 6badd85337b..477d34249d3 100644
--- a/lib/libc/net/getservent.3
+++ b/lib/libc/net/getservent.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: getservent.3,v 1.6 1999/05/25 01:50:58 aaron Exp $
+.\" $OpenBSD: getservent.3,v 1.7 1999/07/04 18:59:43 aaron Exp $
.\"
.\" Copyright (c) 1983, 1991, 1993
.\" The Regents of the University of California. All rights reserved.
@@ -124,7 +124,6 @@ is encountered.
If a protocol name is also supplied (non-
.Dv NULL ) ,
searches must also match the protocol.
-.ne 1i
.Sh FILES
.Bl -tag -width /etc/services -compact
.It Pa /etc/services
diff --git a/lib/libc/regex/regex.3 b/lib/libc/regex/regex.3
index 39dc19de6bc..fe81eff0779 100644
--- a/lib/libc/regex/regex.3
+++ b/lib/libc/regex/regex.3
@@ -1,4 +1,4 @@
-.\" $OpenBSD: regex.3,v 1.9 1999/06/05 04:47:41 aaron Exp $
+.\" $OpenBSD: regex.3,v 1.10 1999/07/04 18:59:43 aaron Exp $
.\"
.\" Copyright (c) 1997, Phillip F Knaack. All rights reserved.
.\"
@@ -306,7 +306,7 @@ and
both of type
.Fa regoff_t
(a signed arithmetic type at least as large as an
-.I off_t
+.Li off_t
and a
.Li ssize_t ),
containing respectively the offset of the first character of a substring
@@ -321,7 +321,7 @@ both indicating the character following the empty substring.
The 0th member of the
.Fa pmatch
array is filled in to indicate what substring of
-.I string
+.Fa string
was matched by the entire RE.
Remaining members report what substring was matched by parenthesized
subexpressions within the RE;
diff --git a/lib/libc/stdlib/random.3 b/lib/libc/stdlib/random.3
index e1ab9e44da9..7b8a566115a 100644
--- a/lib/libc/stdlib/random.3
+++ b/lib/libc/stdlib/random.3
@@ -29,7 +29,7 @@
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" SUCH DAMAGE.
.\"
-.\" $OpenBSD: random.3,v 1.8 1999/06/29 18:36:23 aaron Exp $
+.\" $OpenBSD: random.3,v 1.9 1999/07/04 18:59:43 aaron Exp $
.\"
.Dd April 19, 1991
.Dt RANDOM 3
@@ -56,9 +56,7 @@ The
function
uses a non-linear additive feedback random number generator employing a
default table of size 31 long integers to return successive pseudo-random
-numbers in the range from 0 to
-.if t 2\u\s731\s10\d\(mi1.
-.if n (2**31)\(mi1.
+numbers in the range from 0 to (2**31)\-1.
The maximum value returned by
.Fn random
is
@@ -66,8 +64,7 @@ is
(as defined by the header file
.Aq Pa limits.h ) .
The period of this random number generator is very large, approximately
-.if t 16\(mu(2\u\s731\s10\d\(mi1).
-.if n 16*((2**31)\(mi1).
+16*((2**31)\-1.
.Pp
The
.Fn random Ns / Fn srandom
@@ -148,9 +145,7 @@ is that the size of the state array does not have to be remembered after
it is initialized.
.Pp
With 256 bytes of state information, the period of the random number
-generator is greater than
-.if t 2\u\s769\s10\d,
-.if n 2**69
+generator is greater than 2**69
which should be sufficient for most purposes.
.Sh AUTHOR
Earl T. Cohen
diff --git a/lib/libc/stdlib/tsearch.3 b/lib/libc/stdlib/tsearch.3
index 8456457e272..79e220e2cb5 100644
--- a/lib/libc/stdlib/tsearch.3
+++ b/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.5 1999/06/29 18:36:24 aaron Exp $
+.\" $OpenBSD: tsearch.3,v 1.6 1999/07/04 18:59:43 aaron Exp $
.\"
.Dd June 15, 1997
.Dt TSEARCH 3
@@ -84,7 +84,7 @@ will be adjusted.
.Pp
.Fn twalk
walks the binary search tree rooted in
-.fa root
+.Fa root
and calls the function
.Fa action
on each node.
diff --git a/lib/libc/sys/fcntl.2 b/lib/libc/sys/fcntl.2
index 46baf45cb0b..16bb09733c3 100644
--- a/lib/libc/sys/fcntl.2
+++ b/lib/libc/sys/fcntl.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: fcntl.2,v 1.15 1999/06/29 14:23:28 aaron Exp $
+.\" $OpenBSD: fcntl.2,v 1.16 1999/07/04 18:59:43 aaron Exp $
.\" $NetBSD: fcntl.2,v 1.6 1995/02/27 12:32:29 cgd Exp $
.\"
.\" Copyright (c) 1983, 1993
@@ -178,7 +178,6 @@ upon availability of data to be read.
.Pp
Several commands are available for doing advisory file locking;
they all operate on the following structure:
-.ne 7v
.Bd -literal
struct flock {
off_t l_start; /* starting offset */
diff --git a/lib/libc/sys/getpgrp.2 b/lib/libc/sys/getpgrp.2
index 9d082519024..7ad5ef3799b 100644
--- a/lib/libc/sys/getpgrp.2
+++ b/lib/libc/sys/getpgrp.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: getpgrp.2,v 1.5 1999/05/23 14:10:52 aaron Exp $
+.\" $OpenBSD: getpgrp.2,v 1.6 1999/07/04 18:59:43 aaron Exp $
.\" $NetBSD: getpgrp.2,v 1.8 1995/02/27 12:33:09 cgd Exp $
.\"
.\" Copyright (c) 1983, 1991, 1993
@@ -100,7 +100,7 @@ This incompatibility is required by
From the
.St -p1003.1-88
Rationale:
-.sp
+.Pp
.Bx 4.3
provides a
.Fn getpgrp
diff --git a/lib/libc/sys/intro.2 b/lib/libc/sys/intro.2
index 44d68cb32a0..8602a7e39c1 100644
--- a/lib/libc/sys/intro.2
+++ b/lib/libc/sys/intro.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: intro.2,v 1.14 1999/07/02 19:50:51 deraadt Exp $
+.\" $OpenBSD: intro.2,v 1.15 1999/07/04 18:59:43 aaron Exp $
.\" $NetBSD: intro.2,v 1.6 1995/02/27 12:33:41 cgd Exp $
.\"
.\" Copyright (c) 1980, 1983, 1986, 1991, 1993
@@ -196,10 +196,7 @@ while the pure procedure file was being executed an
.Xr open 2
call requested write access.
.It Er 27 EFBIG Em "File too large" .
-The size of a file exceeded the maximum (about
-.if t 2\u\s-231\s+2\d
-.if n 2.1E9
-bytes).
+The size of a file exceeded the maximum (about 2.1E9 bytes).
.It Er 28 ENOSPC Em "Device out of space" .
A
.Xr write 2
diff --git a/lib/libc/sys/link.2 b/lib/libc/sys/link.2
index 0c72c6427ff..23eefdccccf 100644
--- a/lib/libc/sys/link.2
+++ b/lib/libc/sys/link.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: link.2,v 1.10 1999/06/29 14:10:04 aaron Exp $
+.\" $OpenBSD: link.2,v 1.11 1999/07/04 18:59:43 aaron Exp $
.\" $NetBSD: link.2,v 1.7 1995/02/27 12:34:01 cgd Exp $
.\"
.\" Copyright (c) 1980, 1991, 1993
@@ -141,7 +141,6 @@ are on different file systems.
The directory in which the entry for the new link is being placed
cannot be extended because there is no space left on the file
system containing the directory.
-.ne 3v
.It Bq Er EDQUOT
The directory in which the entry for the new link
is being placed cannot be extended because the
diff --git a/lib/libc/sys/mmap.2 b/lib/libc/sys/mmap.2
index 8031c0018c0..c23d2a2a0dd 100644
--- a/lib/libc/sys/mmap.2
+++ b/lib/libc/sys/mmap.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: mmap.2,v 1.18 1999/07/02 16:57:49 aaron Exp $
+.\" $OpenBSD: mmap.2,v 1.19 1999/07/04 18:59:44 aaron Exp $
.\" $NetBSD: mmap.2,v 1.5 1995/06/24 10:48:59 cgd Exp $
.\"
.\" Copyright (c) 1991, 1993
@@ -202,7 +202,7 @@ is not a valid open file descriptor.
.It Bq Er EINVAL
.Dv MAP_FIXED
was specified and the
-.I addr
+.Fa addr
parameter was not page aligned.
.Fa fd
did not reference a regular or character special file.
diff --git a/lib/libc/sys/nfssvc.2 b/lib/libc/sys/nfssvc.2
index f4d96deef8f..58658023b3a 100644
--- a/lib/libc/sys/nfssvc.2
+++ b/lib/libc/sys/nfssvc.2
@@ -1,4 +1,4 @@
-.\" $OpenBSD: nfssvc.2,v 1.8 1999/06/29 14:10:11 aaron Exp $
+.\" $OpenBSD: nfssvc.2,v 1.9 1999/07/04 18:59:44 aaron Exp $
.\" $NetBSD: nfssvc.2,v 1.6 1995/02/27 12:35:08 cgd Exp $
.\"
.\" Copyright (c) 1989, 1991, 1993
@@ -95,7 +95,7 @@ struct nfsd_cargs {
NFSKERBKEY_T ncd_key; /* Session key */
};
.Ed
-.sp
+.Pp
structure.
The initial call has only the
.Dv NFSSVC_MNTD
@@ -152,7 +152,7 @@ struct nfsd_srvargs {
NFSKERBKEY_T nsd_key; /* Session key */
};
.Ed
-.sp
+.Pp
to enter the kernel as an
.Xr nfsd 8
daemon.
@@ -206,7 +206,7 @@ struct nfsd_args {
int namelen; /* Length of name */
};
.Ed
-.sp
+.Pp
to pass a server side
.Tn NFS
socket into the kernel for servicing by the