003 File Manager
Current Path:
/usr/src/contrib/unbound/compat
usr
/
src
/
contrib
/
unbound
/
compat
/
📁
..
📄
arc4_lock.c
(2.3 KB)
📄
arc4random.c
(6.42 KB)
📄
arc4random_uniform.c
(1.78 KB)
📄
chacha_private.h
(5.28 KB)
📄
ctime_r.c
(912 B)
📄
explicit_bzero.c
(473 B)
📄
fake-rfc2553.c
(5.96 KB)
📄
fake-rfc2553.h
(5.18 KB)
📄
getentropy_freebsd.c
(1.58 KB)
📄
getentropy_linux.c
(12.87 KB)
📄
getentropy_osx.c
(10.31 KB)
📄
getentropy_solaris.c
(10.42 KB)
📄
getentropy_win.c
(1.66 KB)
📄
gmtime_r.c
(2.37 KB)
📄
inet_aton.c
(5.4 KB)
📄
inet_ntop.c
(5.48 KB)
📄
inet_pton.c
(5.15 KB)
📄
isblank.c
(1.82 KB)
📄
malloc.c
(450 B)
📄
memcmp.c
(472 B)
📄
memcmp.h
(317 B)
📄
memmove.c
(947 B)
📄
reallocarray.c
(1.4 KB)
📄
sha512.c
(15.5 KB)
📄
snprintf.c
(28.82 KB)
📄
strlcat.c
(2.39 KB)
📄
strlcpy.c
(1.63 KB)
📄
strptime.c
(8.97 KB)
📄
strsep.c
(2.11 KB)
Editing: arc4random_uniform.c
/* $OpenBSD: arc4random_uniform.c,v 1.1 2014/07/12 13:24:54 deraadt Exp $ */ /* * Copyright (c) 2008, Damien Miller <djm@openbsd.org> * * Permission to use, copy, modify, and 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 "config.h" #include <sys/types.h> #include <stdlib.h> /* * Calculate a uniformly distributed random number less than upper_bound * avoiding "modulo bias". * * Uniformity is achieved by generating new random numbers until the one * returned is outside the range [0, 2**32 % upper_bound). This * guarantees the selected random number will be inside * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) * after reduction modulo upper_bound. */ uint32_t arc4random_uniform(uint32_t upper_bound) { uint32_t r, min; if (upper_bound < 2) return 0; /* 2**32 % x == (2**32 - x) % x */ min = -upper_bound % upper_bound; /* * This could theoretically loop forever but each retry has * p > 0.5 (worst case, usually far better) of selecting a * number inside the range we need, so it should rarely need * to re-roll. */ for (;;) { r = arc4random(); if (r >= min) break; } return r % upper_bound; }
Upload File
Create Folder