mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-07 23:13:34 +00:00
39bf41f4eb
- Python static hello world now 1.8mb
- Python static fully loaded now 10mb
- Python HTTPS client now uses MbedTLS
- Python REPL now completes import stmts
- Increase stack size for Python for now
- Begin synthesizing posixpath and ntpath
- Restore Python \N{UNICODE NAME} support
- Restore Python NFKD symbol normalization
- Add optimized code path for Intel SHA-NI
- Get more Python unit tests passing faster
- Get Python help() pagination working on NT
- Python hashlib now supports MbedTLS PBKDF2
- Make memcpy/memmove/memcmp/bcmp/etc. faster
- Add Mersenne Twister and Vigna to LIBC_RAND
- Provide privileged __printf() for error code
- Fix zipos opendir() so that it reports ENOTDIR
- Add basic chmod() implementation for Windows NT
- Add Cosmo's best functions to Python cosmo module
- Pin function trace indent depth to that of caller
- Show memory diagram on invalid access in MODE=dbg
- Differentiate stack overflow on crash in MODE=dbg
- Add stb_truetype and tools for analyzing font files
- Upgrade to UNICODE 13 and reduce its binary footprint
- COMPILE.COM now logs resource usage of build commands
- Start implementing basic poll() support on bare metal
- Set getauxval(AT_EXECFN) to GetModuleFileName() on NT
- Add descriptions to strerror() in non-TINY build modes
- Add COUNTBRANCH() macro to help with micro-optimizations
- Make error / backtrace / asan / memory code more unbreakable
- Add fast perfect C implementation of μ-Law and a-Law audio codecs
- Make strtol() functions consistent with other libc implementations
- Improve Linenoise implementation (see also github.com/jart/bestline)
- COMPILE.COM now suppresses stdout/stderr of successful build commands
77 lines
3.3 KiB
C
77 lines
3.3 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2021 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/bits/xadd.h"
|
|
#include "libc/rand/rand.h"
|
|
|
|
static uint64_t g_vigna;
|
|
|
|
/**
|
|
* Returns deterministic pseudorandom data, e.g.
|
|
*
|
|
* uint64_t x = vigna();
|
|
*
|
|
* You can generate different types of numbers as follows:
|
|
*
|
|
* int64_t x = vigna() >> 1; // make positive signed integer
|
|
* double x = _real1(vigna()); // make float on [0,1]-interval
|
|
*
|
|
* You can seed this random number generator using:
|
|
*
|
|
* svigna(rdseed());
|
|
*
|
|
* You may use the reentrant version of this function:
|
|
*
|
|
* static uint64_t s = 0;
|
|
* uint64_t x = svigna_r(&s);
|
|
*
|
|
* This function is the fastest way to generate good scalar pseudorandom
|
|
* numbers that aren't truncated. If you want to fill a buffer with data
|
|
* then rngset() implements vigna's algorithm to do that extremely well:
|
|
*
|
|
* char buf[4096];
|
|
* rngset(buf, sizeof(buf), vigna, 0);
|
|
*
|
|
* If you want a fast pseudorandom number generator that seeds itself
|
|
* automatically on startup and fork() then consider rand64(). If you
|
|
* want true random data then consider rdseed, rdrand, and getrandom.
|
|
*
|
|
* @return 64 bits of pseudorandom data
|
|
*/
|
|
uint64_t vigna(void) {
|
|
return vigna_r(&g_vigna);
|
|
}
|
|
|
|
/**
|
|
* Returns pseudorandom data.
|
|
* @see vigna() for easy api
|
|
*/
|
|
uint64_t vigna_r(uint64_t state[hasatleast 1]) {
|
|
uint64_t z = (state[0] += 0x9e3779b97f4a7c15);
|
|
z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;
|
|
z = (z ^ (z >> 27)) * 0x94d049bb133111eb;
|
|
return z ^ (z >> 31);
|
|
}
|
|
|
|
/**
|
|
* Seeds vigna() pseudorandom number generator.
|
|
* @see vigna(), vigna_r()
|
|
*/
|
|
void svigna(uint64_t seed) {
|
|
g_vigna = seed;
|
|
}
|