Result: better seeded random numbers that are cryptographically secure
(not that it matters in this case)
Please let it be right this time...
Signed-off-by: Robin McCorkell <rmccorkell@karoshi.org.uk>
Reviewed-by: Volker Lendecke <Volker.Lendecke@SerNet.DE>
Reviewed-by: Jeremy Allison <jra@samba.org>
{
uint32_t i;
- srandom(time(NULL));
-
for (i = list->count; i > 1; i--) {
uint32_t r;
const char *tmp;
- r = random() % i;
+ r = generate_random() % i;
tmp = list->names[i - 1];
list->names[i - 1] = list->names[r];
static void shuffle_strlist(char **list, int count)
{
- int i, r;
+ int i;
+ uint32_t r;
char *tmp;
- srandom(time(NULL));
-
for (i = count; i > 1; i--) {
- r = random() % i;
+ r = generate_random() % i;
tmp = list[i-1];
list[i-1] = list[r];