RetroShare/libretroshare/src/util/rsrandom.cc
2020-06-12 20:06:43 +02:00

147 lines
4.6 KiB
C++

/*******************************************************************************
* libretroshare/src/util: rsrandom.cc *
* *
* libretroshare: retroshare core library *
* *
* Copyright (C) 2010 Cyril Soler <csoler@users.sourceforge.net> *
* *
* This program is free software: you can redistribute it and/or modify *
* it under the terms of the GNU Lesser General Public License as *
* published by the Free Software Foundation, either version 3 of the *
* License, or (at your option) any later version. *
* *
* This program 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 Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public License *
* along with this program. If not, see <https://www.gnu.org/licenses/>. *
* *
*******************************************************************************/
#include "rsrandom.h"
#include <stdlib.h>
#include <string>
#include <unistd.h>
#include <openssl/rand.h>
uint32_t RsRandom::index = RsRandom::N;
std::vector<uint32_t> RsRandom::MT(RsRandom::N,0u);
RsMutex RsRandom::rndMtx("RsRandom");
/* According to our tests (cyril+thunder), on both Windows and Linux does
* RAND_bytes init itself automatically at first call, from system-based
* unpredictable values, so that seeding is not even needed.
* This call still adds some randomness (not much actually, but it's always good
* to have anyway) */
#ifdef WINDOWS_SYS
# include "util/rstime.h"
# ifdef WIN_PTHREADS_H
static bool auto_seed = RsRandom::seed(
(time(nullptr) +
static_cast<uint32_t>(pthread_self()) *0x1293fe)^0x18e34a12 );
# else // def WIN_PTHREADS_H
static bool auto_seed = RsRandom::seed(
(time(nullptr) +
static_cast<uint32_t>(pthread_self().p)*0x1293fe)^0x18e34a12 );
# endif // def WIN_PTHREADS_H
#endif
bool RsRandom::seed(uint32_t s)
{
RS_STACK_MUTEX(rndMtx);
MT.resize(N,0) ; // because MT might not be already resized
uint32_t j ;
MT[0]= s & 0xffffffffUL;
for (j=1; j<N; j++)
MT[j] = (1812433253UL * (MT[j-1] ^ (MT[j-1] >> 30)) + j) & 0xffffffffUL ;
// This *does not* replace the internal seed state of RAND_bytes(), but only *adds* entropy to the random pool
// So calling this method with the same value twice does not guarranty that the output of the random bytes
// will be the same.
RAND_seed((unsigned char *)&MT[0],N*sizeof(uint32_t)) ;
locked_next_state() ;
return true ;
}
void RsRandom::random_bytes(unsigned char *data,uint32_t size)
{
RAND_bytes(data,size) ;
}
void RsRandom::locked_next_state()
{
RAND_bytes((unsigned char *)&MT[0],N*sizeof(uint32_t)) ;
index = 0 ;
}
uint32_t RsRandom::random_u32()
{
uint32_t y;
{
RS_STACK_MUTEX(rndMtx);
index++ ;
if(index >= N)
locked_next_state();
y = MT[index] ;
}
#ifdef UNNECESSARY_CODE
// Tempering
y ^= (y >> 11);
y ^= (y << 7 ) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
#endif
return y;
}
uint64_t RsRandom::random_u64()
{
return ((uint64_t)random_u32() << 32ul) + random_u32() ;
}
float RsRandom::random_f32()
{
return random_u32() / (float)(~(uint32_t)0) ;
}
double RsRandom::random_f64()
{
return random_u64() / (double)(~(uint64_t)0) ;
}
/*static*/ std::string RsRandom::alphaNumeric(uint32_t length)
{
std::string s;
while(s.size() < length)
{
uint8_t rChar; random_bytes(&rChar, 1); rChar = rChar % 123;
/* if(isalnum(val)) isalnum result may vary depend on locale!! */
if( (rChar >= 48 && rChar <= 57) /* 0-9 */ ||
(rChar >= 65 && rChar <= 90) /* A-Z */ ||
(rChar >= 97 && rChar <= 122) /* a-z */ )
s += static_cast<char>(rChar);
}
return s;
}
/*static*/ std::string RsRandom::printable(uint32_t length)
{
std::string ret(length, 0);
random_bytes(reinterpret_cast<uint8_t*>(&ret[0]), length);
for(uint32_t i=0; i<length; ++i) ret[i] = (ret[i] % 94) + 33;
return ret;
}