/** @file
Parser: random related functions.
Copyright (c) 2001-2026 Art. Lebedev Studio (https://www.artlebedev.com)
Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru>
*/
// includes
#include "pa_common.h"
#include "pa_random.h"
#include "pa_exception.h"
#include "pa_threads.h"
volatile const char * IDENT_PA_RANDOM_C="$Id: pa_random.C,v 1.17 2026/04/25 13:38:46 moko Exp $" IDENT_PA_RANDOM_H;
#ifdef _MSC_VER
#include <windows.h>
class Random_provider {
HCRYPTPROV fhProv;
void acquire() {
SYNCHRONIZED;
if(fhProv)
return;
if(!CryptAcquireContext(&fhProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
throw Exception(0, 0, "CryptAcquireContext failed");
}
void release() {
if(fhProv)
CryptReleaseContext(fhProv, 0);
}
public:
Random_provider(): fhProv(0) {}
~Random_provider() { release(); }
void generate(void *buffer, size_t size) {
acquire();
if(!CryptGenRandom(fhProv, size, (BYTE*)buffer))
throw Exception(0, 0, "CryptGenRandom failed");
}
} random_provider;
int gettimeofday(struct timeval * tp, void *);
#else
/// from gen_uuid.c
static int get_random_fd(void)
{
struct timeval tv;
static int fd = -2;
int i;
if (fd == -2) {
gettimeofday(&tv, 0);
fd = open("/dev/urandom", O_RDONLY);
if (fd == -1)
fd = open("/dev/random", O_RDONLY | O_NONBLOCK);
srand((getpid() << 16) ^ getuid() ^ tv.tv_sec ^ tv.tv_usec);
}
/* Crank the random number generator a few times */
gettimeofday(&tv, 0);
for (i = (tv.tv_sec ^ tv.tv_usec) & 0x1F; i > 0; i--)
rand();
return fd;
}
/*
* Generate a series of random bytes. Use /dev/urandom if possible,
* and if not, use srandom/random.
*/
static void get_random_bytes(void *buf, int nbytes)
{
int i, fd = get_random_fd();
int lose_counter = 0;
char *cp = (char *) buf;
if (fd >= 0) {
while (nbytes > 0) {
i = read(fd, cp, nbytes);
if (i <= 0) {
if (lose_counter++ > 16)
break;
continue;
}
nbytes -= i;
cp += i;
lose_counter = 0;
}
}
/* XXX put something better here if no /dev/random! */
for (i = 0; i < nbytes; i++)
*cp++ = rand() & 0xFF;
return;
}
#endif
void random(void *buffer, size_t size) {
#ifdef _MSC_VER
random_provider.generate(buffer, size);
#else
get_random_bytes(buffer, size);
#endif
}
/// to hell with extra bytes on 64bit platforms
struct uuid {
unsigned int time_low;
unsigned short time_mid;
unsigned short time_hi_and_version;
unsigned short clock_seq;
unsigned char node[6];
};
static uuid get_uuid() {
// random
uuid uuid;
random(&uuid, sizeof(uuid));
// http://www.opengroup.org/onlinepubs/9629399/apdxa.htm#tagtcjh_35
// ~
// version = DCE Security version, with embedded POSIX UIDs.
// variant = DCE
//
// DCE=Distributed Computing Environment
// http://www.opengroup.org/dce/
//
// they say this influences comparison&such,
// but could not figure out how, hence structure layout specified strictly
// anyhow, uuidgen on Win32 yield those values
//
// xxxxxxxx-xxxx-4xxx-{8,9,A,B}xxx-xxxxxxxxxxxx
uuid.clock_seq = (uuid.clock_seq & 0x3FFF) | 0x8000;
uuid.time_hi_and_version = (uuid.time_hi_and_version & 0x0FFF) | 0x4000;
return uuid;
}
char *get_uuid_cstr(bool lower, bool solid) {
uuid uuid=get_uuid();
const size_t bufsize=36+1/*zero-teminator*/+1/*for faulty snprintfs*/;
char* cstr=new(PointerFreeGC) char[bufsize];
const char *format[] = {
"%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X",
"%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
"%08X%04X%04X%02X%02X%02X%02X%02X%02X%02X%02X",
"%08x%04x%04x%02x%02x%02x%02x%02x%02x%02x%02x"
};
snprintf(cstr, bufsize,
format[(lower ? 1:0) + (solid ? 2:0)],
uuid.time_low, uuid.time_mid, uuid.time_hi_and_version,
uuid.clock_seq >> 8, uuid.clock_seq & 0xFF,
uuid.node[0], uuid.node[1], uuid.node[2],
uuid.node[3], uuid.node[4], uuid.node[5]);
return cstr;
}
char *get_uuid_boundary() {
uuid uuid=get_uuid();
const int boundary_bufsize=10+32+1/*for zero-teminator*/+1/*for faulty snprintfs*/;
char* boundary=new(PointerFreeGC) char[boundary_bufsize];
snprintf(boundary, boundary_bufsize,
"----------%08X%04X%04X%02X%02X%02X%02X%02X%02X%02X%02X",
uuid.time_low, uuid.time_mid, uuid.time_hi_and_version,
uuid.clock_seq >> 8, uuid.clock_seq & 0xFF,
uuid.node[0], uuid.node[1], uuid.node[2],
uuid.node[3], uuid.node[4], uuid.node[5]);
return boundary;
}
// UUID version 7
// https://datatracker.ietf.org/doc/draft-ietf-uuidrev-rfc4122bis/
//
// UUID version 7 features a time-ordered value field derived from the
// widely implemented and well known Unix Epoch timestamp source, the
// number of milliseconds since midnight 1 Jan 1970 UTC, leap seconds
// excluded. UUIDv7 generally has improved entropy characteristics over
// UUIDv1 or UUIDv6.
//
// 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
// | unix_ts_ms |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
// | unix_ts_ms | ver | rand_a |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
// |var| rand_b |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
// | rand_b |
// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
//
// unix_ts_ms:
// 48 bit big-endian unsigned number of Unix epoch timestamp in
// milliseconds. Occupies bits 0 through 47 (octets 0-5).
// ver:
// The 4 bit version field, set to 0b0111 (7).
// Occupies bits 48 through 51 of octet 6.
// rand_a:
// 12 bits pseudo-random data to provide uniqueness as per
// Section 6.8 and/or optional constructs to guarantee additional
// monotonicity. Occupies bits 52 through 63 (octets 6-7).
// var:
// The 2 bit variant field as defined by Section 4.1, set to 0b10.
// Occupies bits 64 and 65 of octet 8.
// rand_b:
// The final 62 bits of pseudo-random data to provide uniqueness as
// per Section 6.8 and/or an optional counter to guarantee additional
// monotonicity. Occupies bits 66 through 127 (octets 8-15).
char *get_uuid7_cstr(bool lower, bool solid) {
unsigned char uuid[16];
random(&uuid[8], 8);
struct timeval tv;
gettimeofday(&tv, 0);
// 48 bit big-endian unsigned number of Unix epoch timestamp in milliseconds
uint64_t unix_ts_ms = (uint64_t)tv.tv_sec * 1000 + (uint64_t)tv.tv_usec / 1000;
// 12 bit monotonicity counter
static int seq = 0;
static uint64_t ms_previous=0;
if(unix_ts_ms == ms_previous){
seq++;
unix_ts_ms += seq >> 12;
} else {
seq = 0;
ms_previous = unix_ts_ms;
}
uuid[7] = (unsigned char) (seq);
uuid[6] = (unsigned char) (seq >> 8);
uuid[5] = (unsigned char) (unix_ts_ms); unix_ts_ms >>= 8;
uuid[4] = (unsigned char) (unix_ts_ms); unix_ts_ms >>= 8;
uuid[3] = (unsigned char) (unix_ts_ms); unix_ts_ms >>= 8;
uuid[2] = (unsigned char) (unix_ts_ms); unix_ts_ms >>= 8;
uuid[1] = (unsigned char) (unix_ts_ms); unix_ts_ms >>= 8;
uuid[0] = (unsigned char) (unix_ts_ms);
// Set magic numbers for a "version 7" UUID, see
// https://www.ietf.org/archive/id/draft-ietf-uuidrev-rfc4122bis-00.html#name-uuid-version-7
uuid[6] = (uuid[6] & 0x0f) | 0x70; /* 4 bit version [0111] */
uuid[8] = (uuid[8] & 0x3f) | 0x80; /* 2 bit variant [10] */
const size_t bufsize=36+1/*zero-teminator*/+1/*for faulty snprintfs*/;
char* cstr=new(PointerFreeGC) char[bufsize];
const char *format[] = {
"%02X%02X%02X%02X-%02X%02X-%02X%02X-%02X%02X-%02X%02X%02X%02X%02X%02X",
"%02x%02x%02x%02x-%02x%02x-%02x%02x-%02x%02x-%02x%02x%02x%02x%02x%02x",
"%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X",
"%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x",
};
snprintf(cstr, bufsize, format[(lower ? 1:0) + (solid ? 2:0)],
uuid[0], uuid[1], uuid[2], uuid[3], uuid[4], uuid[5], uuid[6], uuid[7],
uuid[8], uuid[9], uuid[10], uuid[11], uuid[12], uuid[13], uuid[14], uuid[15]
);
return cstr;
}
E-mail: