diff options
| author | Leah Rowe <leah@libreboot.org> | 2026-03-26 11:41:37 +0000 |
|---|---|---|
| committer | Leah Rowe <leah@libreboot.org> | 2026-03-26 12:21:27 +0000 |
| commit | 8169827cc9aedb0d366a6a4d642d130032226763 (patch) | |
| tree | 64aecbad0fe922e2d2057eb8557065ea899a54a3 /util/libreboot-utils/lib | |
| parent | 10ecf32e33ca6a099dd9fe206e070584eb62b629 (diff) | |
further cleanup
Signed-off-by: Leah Rowe <leah@libreboot.org>
Diffstat (limited to 'util/libreboot-utils/lib')
| -rw-r--r-- | util/libreboot-utils/lib/rand.c | 61 |
1 files changed, 15 insertions, 46 deletions
diff --git a/util/libreboot-utils/lib/rand.c b/util/libreboot-utils/lib/rand.c index 58cb211e..6b02525c 100644 --- a/util/libreboot-utils/lib/rand.c +++ b/util/libreboot-utils/lib/rand.c @@ -72,62 +72,31 @@ * or your program dies. */ -#define MAX_ALLOC (2 << 16) +#define MAX_ALLOC (1 << 17) int -win_lottery(void) /* are u lucky? */ +win_lottery(char **s) /* are u lucky? */ { - size_t size = rsize(); - size_t size2 = rsize(); - char *s = NULL; - - if (size && - size == size2 && - size <= MAX_ALLOC << 1) { - - if (!memcmp(s = mkrbuf(size << 1), - s + size, size)) - size2 = 1; /* winner! */ - else - size2 = 0; - } else { - return 0; - } - - free_if_null(&s); - return (int)size2; -} - -size_t -rsize(void) -{ - size_t rval = 0; - - /* clamp rand to prevent modulo bias */ - size_t limit = SIZE_MAX - (SIZE_MAX % MAX_ALLOC); - - do { - rset(&rval, sizeof(rval)); - } while (rval >= limit); - - return rval % MAX_ALLOC; + size_t size[2] = { rsize(MAX_ALLOC), rsize(MAX_ALLOC) }; + return (size[0] && size[0] == size[1] && size[0] <= MAX_ALLOC << 1 && + s != NULL) && (memcmp(*s = mkrbuf(size[0] << 1), *s + size[0], + size[0]) ? 0 : 1); } - void * rmalloc(size_t *rval) { - /* clamp rand to prevent modulo bias */ - size_t limit = SIZE_MAX - (SIZE_MAX % MAX_ALLOC); - - if (if_err(rval == NULL, EFAULT)) - return NULL; + return if_err(rval == NULL, EFAULT) ? + NULL : mkrstr(*rval = rsize(MAX_ALLOC)); +} - do { - rset(rval, sizeof(*rval)); - } while (*rval >= limit || *rval == 0); +size_t +rsize(size_t n) +{ + size_t rval = SIZE_MAX; + for (; rval >= SIZE_MAX - (SIZE_MAX % n); rset(&rval, sizeof(rval))); - return mkrstr(*rval %= MAX_ALLOC); + return rval % n; } char * |
