1 /* mpz_rrandomb -- Generate a positive random mpz_t of specified bit size, with 2 long runs of consecutive ones and zeros in the binary representation. 3 Meant for testing of other MP routines. 4 5 Copyright 2000, 2001, 2002, 2004, 2012 Free Software Foundation, Inc. 6 7 This file is part of the GNU MP Library. 8 9 The GNU MP Library is free software; you can redistribute it and/or modify 10 it under the terms of the GNU Lesser General Public License as published by 11 the Free Software Foundation; either version 3 of the License, or (at your 12 option) any later version. 13 14 The GNU MP Library is distributed in the hope that it will be useful, but 15 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 16 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public 17 License for more details. 18 19 You should have received a copy of the GNU Lesser General Public License 20 along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */ 21 22 #include "gmp.h" 23 #include "gmp-impl.h" 24 25 static void gmp_rrandomb (mp_ptr, gmp_randstate_t, mp_bitcnt_t); 26 27 void 28 mpz_rrandomb (mpz_ptr x, gmp_randstate_t rstate, mp_bitcnt_t nbits) 29 { 30 mp_size_t nl; 31 mp_ptr xp; 32 33 nl = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS; 34 if (nbits != 0) 35 { 36 xp = MPZ_REALLOC (x, nl); 37 gmp_rrandomb (xp, rstate, nbits); 38 } 39 40 SIZ(x) = nl; 41 } 42 43 /* Ask _gmp_rand for 32 bits per call unless that's more than a limb can hold. 44 Thus, we get the same random number sequence in the common cases. 45 FIXME: We should always generate the same random number sequence! */ 46 #if GMP_NUMB_BITS < 32 47 #define BITS_PER_RANDCALL GMP_NUMB_BITS 48 #else 49 #define BITS_PER_RANDCALL 32 50 #endif 51 52 static void 53 gmp_rrandomb (mp_ptr rp, gmp_randstate_t rstate, mp_bitcnt_t nbits) 54 { 55 mp_bitcnt_t bi; 56 mp_limb_t ranm; /* buffer for random bits */ 57 unsigned cap_chunksize, chunksize; 58 mp_size_t i; 59 60 /* Set entire result to 111..1 */ 61 i = (nbits + GMP_NUMB_BITS - 1) / GMP_NUMB_BITS - 1; 62 rp[i] = GMP_NUMB_MAX >> (GMP_NUMB_BITS - (nbits % GMP_NUMB_BITS)) % GMP_NUMB_BITS; 63 for (i = i - 1; i >= 0; i--) 64 rp[i] = GMP_NUMB_MAX; 65 66 _gmp_rand (&ranm, rstate, BITS_PER_RANDCALL); 67 cap_chunksize = nbits / (ranm % 4 + 1); 68 cap_chunksize += cap_chunksize == 0; /* make it at least 1 */ 69 70 bi = nbits; 71 72 for (;;) 73 { 74 _gmp_rand (&ranm, rstate, BITS_PER_RANDCALL); 75 chunksize = 1 + ranm % cap_chunksize; 76 bi = (bi < chunksize) ? 0 : bi - chunksize; 77 78 if (bi == 0) 79 break; /* low chunk is ...1 */ 80 81 rp[bi / GMP_NUMB_BITS] ^= CNST_LIMB (1) << bi % GMP_NUMB_BITS; 82 83 _gmp_rand (&ranm, rstate, BITS_PER_RANDCALL); 84 chunksize = 1 + ranm % cap_chunksize; 85 bi = (bi < chunksize) ? 0 : bi - chunksize; 86 87 mpn_incr_u (rp + bi / GMP_NUMB_BITS, CNST_LIMB (1) << bi % GMP_NUMB_BITS); 88 89 if (bi == 0) 90 break; /* low chunk is ...0 */ 91 } 92 } 93