mirror of
https://github.com/git/git.git
synced 2024-11-05 08:47:56 +01:00
2dca1af448
Reliance on /dev/urandom produces test vectors that are, well, random. This can cause problems impossible to track down when the data is different from one test invokation to another. The goal is not to have random data to test, but rather to have a convenient way to create sets of large files with non compressible and non deltifiable data in a reproducible way. Signed-off-by: Nicolas Pitre <nico@cam.org> Signed-off-by: Junio C Hamano <junkio@cox.net>
34 lines
731 B
C
34 lines
731 B
C
/*
|
|
* Simple random data generator used to create reproducible test files.
|
|
* This is inspired from POSIX.1-2001 implementation example for rand().
|
|
* Copyright (C) 2007 by Nicolas Pitre, licensed under the GPL version 2.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
unsigned long count, next = 0;
|
|
unsigned char *c;
|
|
|
|
if (argc < 2 || argc > 3) {
|
|
fprintf( stderr, "Usage: %s <seed_string> [<size>]", argv[0]);
|
|
return 1;
|
|
}
|
|
|
|
c = (unsigned char *) argv[1];
|
|
do {
|
|
next = next * 11 + *c;
|
|
} while (*c++);
|
|
|
|
count = (argc == 3) ? strtoul(argv[2], NULL, 0) : -1L;
|
|
|
|
while (count--) {
|
|
next = next * 1103515245 + 12345;
|
|
if (putchar((next >> 16) & 0xff) == EOF)
|
|
return -1;
|
|
}
|
|
|
|
return 0;
|
|
}
|