1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/* mpfr_random -- generate a random floating-point number
Copyright (C) 1999 Free Software Foundation.
This file is part of the MPFR Library.
The MPFR 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 MPFR 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 MPFR 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 "gmp.h"
#include "longlong.h"
#include "urandom.h"
#include "mpfr.h"
#include "gmp-impl.h"
/* Computes a random mpfr in [0, 1[ with precision MPFR_PREC */
void
#if __STDC__
mpfr_random(mpfr_ptr x)
#else
mpfr_random(x)
mpfr_ptr x;
#endif
{
mp_limb_t *xp; unsigned long xn, i, cnt, prec=MPFR_PREC(x);
MPFR_CLEAR_FLAGS(x);
xp = MPFR_MANT(x);
xn = (prec-1)/BITS_PER_MP_LIMB + 1;
for (i = 0; i < xn; i++)
xp[i] = urandom();
count_leading_zeros(cnt, xp[xn - 1]);
if (cnt) mpn_lshift(xp, xp, xn, cnt);
MPFR_EXP(x) = -cnt;
cnt = xn*BITS_PER_MP_LIMB - prec;
/* cnt is the number of non significant bits in the low limb */
xp[0] &= ~((((mp_limb_t)1)<<cnt) - 1);
}
void
#if __STDC__
mpfr_srandom(unsigned long int seed)
#else
mpfr_srandom(seed)
unsigned long int seed;
#endif
{
srandom(seed);
}
|
