Browse Source

trash some old leftover macros and replace them with -mdoc macros

OPENBSD_2_6
aaron 25 years ago
parent
commit
92c35c4d57
3 changed files with 8 additions and 16 deletions
  1. +2
    -5
      src/lib/libc/crypt/arc4random.3
  2. +4
    -9
      src/lib/libc/stdlib/random.3
  3. +2
    -2
      src/lib/libc/stdlib/tsearch.3

+ 2
- 5
src/lib/libc/crypt/arc4random.3 View File

@ -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


+ 4
- 9
src/lib/libc/stdlib/random.3 View File

@ -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


+ 2
- 2
src/lib/libc/stdlib/tsearch.3 View File

@ -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.


Loading…
Cancel
Save