void argerr(progname) char *progname;
{
  printf("Usage: %s [ nn -dnnnn -S[n[,n[,n[,n[,n]]]]] -mnn -Mnn -q -t -e]",
         progname);
  printf(" -f -v -p");
  printf(" ]\n");
  printf("  nn sets number of random generates to be tested.  Default 10.\n");
  printf(
      "  -dnnnn discards nnnn generates between tested values.  Default 0.\n");
  printf("  -S[n[,n[,n[,n[,n[,n]]]]]] initializes an RNG, as follows:\n");
  printf("    parameter #1 sets the RNG algorithm:\n");
  printf("      0 is an additive linear scheme (for testing only);\n");
  printf("      1 is 4.3bsd random,\n");
  printf("      2 is the Knuth/Bentley prand,\n");
  printf("      3 is L'Ecuyer's portable combined multiplicative RNG,\n");
  printf("      4 is 4.3bsd nrandom48, and\n");
  printf("      5 is 4.3bsd rand;\n");
  printf("      6 is Press & Teukolsky's ran0\n");
  printf("      7 is Press & Teukolsky's ran1\n");
  printf("      8 is Press & Teukolsky's ran2\n");
  printf("      9 is Marsaglia's Ultra\n");
  printf("    parameter #2 sets the first RNG seed\n");
  printf("    parameter #3 sets the second RNG seed (if any)\n");
  printf("    parameter #4 sets the number of times to cycle the RNG\n");
  printf("      before starting the tests, mod 1 billion.\n");
  printf("    parameter #5 sets the number of times to cycle the RNG\n");
  printf("      before starting the tests, div 1 billion.\n");
  printf("    defaults are 1,1,1,0,0 respectively.\n");
  printf("  -mnnnn sets the range of the RNG to be nnnn.  Default 100.\n");
  printf("  -Mnn sets the range of the RNG to be 2^nn, 0<=nn<=31.\n");
  printf("  -q or -quiet doesn't print any random generates.\n");
  printf("  -t eliminates most RNG tests, for timing measurements.\n");
  printf("  -e echos the command line (useful in scripts).\n");
  printf("  -f uses (int(dxrandom()*m): faster, but slightly biased.\n");
  printf("  -p uses random()%%m, a poor method.\n");
  exit(1);
}


x86 assembly (clang, -O0):
<argerr>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
mov    -0x8(%rbp),%rsi
lea    0xec9(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xefb(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xef7(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xeed(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf20(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf57(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf86(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xfa2(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xfce(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xfdb(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xff2(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1021(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1035(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1040(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1057(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x106e(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1085(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1095(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x10b1(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x10d7(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1105(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1128(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1156(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1179(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1195(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x11c5(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x11f0(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1216(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1242(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1266(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1294(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    $0x1,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<argerr>:
push   %rax
mov    %rdi,%rsi
lea    0xec5(%rip),%rdi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xef7(%rip),%rdi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xf1a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf11(%rip),%rdi
call   1030 <puts@plt>
lea    0xf45(%rip),%rdi
call   1030 <puts@plt>
lea    0xf7d(%rip),%rdi
call   1030 <puts@plt>
lea    0xfad(%rip),%rdi
call   1030 <puts@plt>
lea    0xfca(%rip),%rdi
call   1030 <puts@plt>
lea    0xff7(%rip),%rdi
call   1030 <puts@plt>
lea    0x1005(%rip),%rdi
call   1030 <puts@plt>
lea    0x101d(%rip),%rdi
call   1030 <puts@plt>
lea    0x104d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1062(%rip),%rdi
call   1030 <puts@plt>
lea    0x106e(%rip),%rdi
call   1030 <puts@plt>
lea    0x1086(%rip),%rdi
call   1030 <puts@plt>
lea    0x109e(%rip),%rdi
call   1030 <puts@plt>
lea    0x10b6(%rip),%rdi
call   1030 <puts@plt>
lea    0x10c7(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e4(%rip),%rdi
call   1030 <puts@plt>
lea    0x110b(%rip),%rdi
call   1030 <puts@plt>
lea    0x113a(%rip),%rdi
call   1030 <puts@plt>
lea    0x115e(%rip),%rdi
call   1030 <puts@plt>
lea    0x118d(%rip),%rdi
call   1030 <puts@plt>
lea    0x11b1(%rip),%rdi
call   1030 <puts@plt>
lea    0x11ce(%rip),%rdi
call   1030 <puts@plt>
lea    0x11ff(%rip),%rdi
call   1030 <puts@plt>
lea    0x122b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1252(%rip),%rdi
call   1030 <puts@plt>
lea    0x127f(%rip),%rdi
call   1030 <puts@plt>
lea    0x12a4(%rip),%rdi
call   1030 <puts@plt>
lea    0xda3(%rip),%rdi
xor    %eax,%eax
call   1040 <printf@plt>
mov    $0x1,%edi
call   1050 <exit@plt>

LLVM IR (-O0):
@.str = [64 x i8] c"Usage: %s [ nn -dnnnn -S[n[,n[,n[,n[,n]]]]] -mnn -Mnn -q -t -e]\00"
@.str.1 = [10 x i8] c" -f -v -p\00"
@.str.2 = [4 x i8] c" ]\0A\00"
@.str.3 = [65 x i8] c" nn sets number of random generates to be tested. Default 10.\0A\00"
@.str.4 = [69 x i8] c" -dnnnn discards nnnn generates between tested values. Default 0.\0A\00"
@.str.5 = [61 x i8] c" -S[n[,n[,n[,n[,n[,n]]]]]] initializes an RNG, as follows:\0A\00"
@.str.6 = [42 x i8] c" parameter sets the RNG algorithm:\0A\00"
@.str.7 = [58 x i8] c" 0 is an additive linear scheme (for testing only);\0A\00"
@.str.8 = [27 x i8] c" 1 is 4.3bsd random,\0A\00"
@.str.9 = [37 x i8] c" 2 is the Knuth/Bentley prand,\0A\00"
@.str.10 = [61 x i8] c" 3 is L'Ecuyer's portable combined multiplicative RNG,\0A\00"
@.str.11 = [34 x i8] c" 4 is 4.3bsd nrandom48, and\0A\00"
@.str.12 = [25 x i8] c" 5 is 4.3bsd rand;\0A\00"
@.str.13 = [37 x i8] c" 6 is Press & Teukolsky's ran0\0A\00"
@.str.14 = [37 x i8] c" 7 is Press & Teukolsky's ran1\0A\00"
@.str.15 = [37 x i8] c" 8 is Press & Teukolsky's ran2\0A\00"
@.str.16 = [30 x i8] c" 9 is Marsaglia's Ultra\0A\00"
@.str.17 = [42 x i8] c" parameter sets the first RNG seed\0A\00"
@.str.18 = [52 x i8] c" parameter sets the second RNG seed (if any)\0A\00"
@.str.19 = [60 x i8] c" parameter sets the number of times to cycle the RNG\0A\00"
@.str.20 = [49 x i8] c" before starting the tests, mod 1 billion.\0A\00"
@.str.21 = [60 x i8] c" parameter sets the number of times to cycle the RNG\0A\00"
@.str.22 = [49 x i8] c" before starting the tests, div 1 billion.\0A\00"
@.str.23 = [42 x i8] c" defaults are 1,1,1,0,0 respectively.\0A\00"
@.str.24 = [62 x i8] c" -mnnnn sets the range of the RNG to be nnnn. Default 100.\0A\00"
@.str.25 = [57 x i8] c" -Mnn sets the range of the RNG to be 2^nn, 0<=nn<=31.\0A\00"
@.str.26 = [52 x i8] c" -q or -quiet doesn't print any random generates.\0A\00"
@.str.27 = [58 x i8] c" -t eliminates most RNG tests, for timing measurements.\0A\00"
@.str.28 = [50 x i8] c" -e echos the command line (useful in scripts).\0A\00"
@.str.29 = [60 x i8] c" -f uses (int(dxrandom()*m): faster, but slightly biased.\0A\00"
@.str.30 = [39 x i8] c" -p uses random()%%m, a poor method.\0A\00"
define void @argerr(i8* %0) {
%2 = alloca i8*
store i8* %0, i8** %2
%3 = load i8*, i8** %2
%4 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str, i64 0, i64 0), i8* %3)
%5 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.1, i64 0, i64 0))
%6 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.2, i64 0, i64 0))
%7 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.4, i64 0, i64 0))
%9 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.5, i64 0, i64 0))
%10 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.6, i64 0, i64 0))
%11 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.7, i64 0, i64 0))
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.8, i64 0, i64 0))
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.9, i64 0, i64 0))
%14 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.10, i64 0, i64 0))
%15 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.11, i64 0, i64 0))
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.12, i64 0, i64 0))
%17 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.13, i64 0, i64 0))
%18 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.14, i64 0, i64 0))
%19 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.15, i64 0, i64 0))
%20 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.16, i64 0, i64 0))
%21 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.17, i64 0, i64 0))
%22 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.18, i64 0, i64 0))
%23 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.19, i64 0, i64 0))
%24 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.20, i64 0, i64 0))
%25 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.21, i64 0, i64 0))
%26 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.22, i64 0, i64 0))
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.23, i64 0, i64 0))
%28 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.24, i64 0, i64 0))
%29 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.25, i64 0, i64 0))
%30 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.26, i64 0, i64 0))
%31 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.27, i64 0, i64 0))
%32 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.28, i64 0, i64 0))
%33 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.29, i64 0, i64 0))
%34 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.30, i64 0, i64 0))
unreachable
}

LLVM IR (-O2):
@.str = [64 x i8] c"Usage: %s [ nn -dnnnn -S[n[,n[,n[,n[,n]]]]] -mnn -Mnn -q -t -e]\00"
@.str.1 = [10 x i8] c" -f -v -p\00"
@.str.30 = [39 x i8] c" -p uses random()%%m, a poor method.\0A\00"
@str = [3 x i8] c" ]\00"
@str.31 = [64 x i8] c" nn sets number of random generates to be tested. Default 10.\00"
@str.32 = [68 x i8] c" -dnnnn discards nnnn generates between tested values. Default 0.\00"
@str.33 = [60 x i8] c" -S[n[,n[,n[,n[,n[,n]]]]]] initializes an RNG, as follows:\00"
@str.34 = [41 x i8] c" parameter sets the RNG algorithm:\00"
@str.35 = [57 x i8] c" 0 is an additive linear scheme (for testing only);\00"
@str.36 = [26 x i8] c" 1 is 4.3bsd random,\00"
@str.37 = [36 x i8] c" 2 is the Knuth/Bentley prand,\00"
@str.38 = [60 x i8] c" 3 is L'Ecuyer's portable combined multiplicative RNG,\00"
@str.39 = [33 x i8] c" 4 is 4.3bsd nrandom48, and\00"
@str.40 = [24 x i8] c" 5 is 4.3bsd rand;\00"
@str.41 = [36 x i8] c" 6 is Press & Teukolsky's ran0\00"
@str.42 = [36 x i8] c" 7 is Press & Teukolsky's ran1\00"
@str.43 = [36 x i8] c" 8 is Press & Teukolsky's ran2\00"
@str.44 = [29 x i8] c" 9 is Marsaglia's Ultra\00"
@str.45 = [41 x i8] c" parameter sets the first RNG seed\00"
@str.46 = [51 x i8] c" parameter sets the second RNG seed (if any)\00"
@str.47 = [59 x i8] c" parameter sets the number of times to cycle the RNG\00"
@str.48 = [48 x i8] c" before starting the tests, mod 1 billion.\00"
@str.49 = [59 x i8] c" parameter sets the number of times to cycle the RNG\00"
@str.50 = [48 x i8] c" before starting the tests, div 1 billion.\00"
@str.51 = [41 x i8] c" defaults are 1,1,1,0,0 respectively.\00"
@str.52 = [61 x i8] c" -mnnnn sets the range of the RNG to be nnnn. Default 100.\00"
@str.53 = [56 x i8] c" -Mnn sets the range of the RNG to be 2^nn, 0<=nn<=31.\00"
@str.54 = [51 x i8] c" -q or -quiet doesn't print any random generates.\00"
@str.55 = [57 x i8] c" -t eliminates most RNG tests, for timing measurements.\00"
@str.56 = [49 x i8] c" -e echos the command line (useful in scripts).\00"
@str.57 = [59 x i8] c" -f uses (int(dxrandom()*m): faster, but slightly biased.\00"
define void @argerr(i8* %0) {
%2 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @.str, i64 0, i64 0), i8* %0)
%3 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @.str.1, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([3 x i8], [3 x i8]* @str, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.31, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.32, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.33, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.34, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.35, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.36, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.37, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.38, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.39, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.40, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.41, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.42, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.43, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.44, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.45, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.46, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.47, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.48, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.49, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.50, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.51, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.52, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([56 x i8], [56 x i8]* @str.53, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.54, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.55, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.56, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.57, i64 0, i64 0))
%32 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @.str.30, i64 0, i64 0))
tail call void @exit(i32 1)
unreachable
}