#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ exit(int /*<<< orphan*/);
int /*<<< orphan*/ printf(char *);
void printUsage(void) {
  printf("Usage: AMaLGaM-Full-Free [-?] [-P] [-s] [-w] [-v] [-r] pro dim low "
         "upp rot eva vtr tol pop\n");
  printf(" -?: Prints out this usage information.\n");
  printf(" -P: Prints out a list of all installed optimization problems.\n");
  printf(
      " -s: Enables computing and writing of statistics every generation.\n");
  printf(" -w: Enables writing of solutions and their fitnesses every "
         "generation.\n");
  printf(" -v: Enables verbose mode. Prints the settings before starting the "
         "run.\n");
  printf(
      " -r: Enables use of vtr in termination condition (value-to-reach).\n");
  printf("\n");
  printf("  pro: Index of optimization problem to be solved (minimization).\n");
  printf("  dim: Number of parameters.\n");
  printf("  low: Overall initialization lower bound.\n");
  printf("  upp: Overall initialization upper bound.\n");
  printf("  rot: The angle by which to rotate the problem.\n");
  printf("  eva: Maximum number of evaluations allowed.\n");
  printf("  vtr: The value to reach. If the objective value of the best "
         "feasible solution reaches\n");
  printf("       this value, termination is enforced (if -r is specified).\n");
  printf("  tol: The tolerance level for fitness variance (i.e. minimum "
         "fitness variance)\n");
  printf("  pop: The maximum number of parallel populations.\n");
  exit(0);
}


x86 assembly (clang, -O0):
<printUsage>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf25(%rip),%rdi
call   1030 <printf@plt>
lea    0xf42(%rip),%rdi
call   1030 <printf@plt>
lea    0xf76(%rip),%rdi
call   1030 <printf@plt>
lea    0xfae(%rip),%rdi
call   1030 <printf@plt>
lea    0xfeb(%rip),%rdi
call   1030 <printf@plt>
lea    0x1028(%rip),%rdi
call   1030 <printf@plt>
lea    0x1264(%rip),%rdi
call   1030 <printf@plt>
lea    0x1054(%rip),%rdi
call   1030 <printf@plt>
lea    0x108b(%rip),%rdi
call   1030 <printf@plt>
lea    0x109d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10bd(%rip),%rdi
call   1030 <printf@plt>
lea    0x10dd(%rip),%rdi
call   1030 <printf@plt>
lea    0x1103(%rip),%rdi
call   1030 <printf@plt>
lea    0x1126(%rip),%rdi
call   1030 <printf@plt>
lea    0x1173(%rip),%rdi
call   1030 <printf@plt>
lea    0x11a9(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ee(%rip),%rdi
call   1030 <printf@plt>
xor    %edi,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<printUsage>:
push   %rax
lea    0xec8(%rip),%rdi
call   1040 <puts@plt>
lea    0xf17(%rip),%rdi
call   1040 <puts@plt>
lea    0xf33(%rip),%rdi
call   1040 <puts@plt>
lea    0xf66(%rip),%rdi
call   1040 <puts@plt>
lea    0xf9d(%rip),%rdi
call   1040 <puts@plt>
lea    0xfd9(%rip),%rdi
call   1040 <puts@plt>
lea    0x1015(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1042(%rip),%rdi
call   1040 <puts@plt>
lea    0x1078(%rip),%rdi
call   1040 <puts@plt>
lea    0x1089(%rip),%rdi
call   1040 <puts@plt>
lea    0x10a8(%rip),%rdi
call   1040 <puts@plt>
lea    0x10c7(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ec(%rip),%rdi
call   1040 <puts@plt>
lea    0x110e(%rip),%rdi
call   1040 <puts@plt>
lea    0x115a(%rip),%rdi
call   1040 <puts@plt>
lea    0x118f(%rip),%rdi
call   1040 <puts@plt>
lea    0x11d3(%rip),%rdi
call   1040 <puts@plt>
xor    %edi,%edi
call   1050 <exit@plt>

LLVM IR (-O0):
@.str = [92 x i8] c"Usage: AMaLGaM-Full-Free [-?] [-P] [-s] [-w] [-v] [-r] pro dim low upp rot eva vtr tol pop\0A\00"
@.str.1 = [41 x i8] c" -?: Prints out this usage information.\0A\00"
@.str.2 = [64 x i8] c" -P: Prints out a list of all installed optimization problems.\0A\00"
@.str.3 = [68 x i8] c" -s: Enables computing and writing of statistics every generation.\0A\00"
@.str.4 = [73 x i8] c" -w: Enables writing of solutions and their fitnesses every generation.\0A\00"
@.str.5 = [73 x i8] c" -v: Enables verbose mode. Prints the settings before starting the run.\0A\00"
@.str.6 = [68 x i8] c" -r: Enables use of vtr in termination condition (value-to-reach).\0A\00"
@.str.7 = [2 x i8] c"\0A\00"
@.str.8 = [67 x i8] c" pro: Index of optimization problem to be solved (minimization).\0A\00"
@.str.9 = [30 x i8] c" dim: Number of parameters.\0A\00"
@.str.10 = [44 x i8] c" low: Overall initialization lower bound.\0A\00"
@.str.11 = [44 x i8] c" upp: Overall initialization upper bound.\0A\00"
@.str.12 = [50 x i8] c" rot: The angle by which to rotate the problem.\0A\00"
@.str.13 = [47 x i8] c" eva: Maximum number of evaluations allowed.\0A\00"
@.str.14 = [89 x i8] c" vtr: The value to reach. If the objective value of the best feasible solution reaches\0A\00"
@.str.15 = [66 x i8] c" this value, termination is enforced (if -r is specified).\0A\00"
@.str.16 = [81 x i8] c" tol: The tolerance level for fitness variance (i.e. minimum fitness variance)\0A\00"
@.str.17 = [52 x i8] c" pop: The maximum number of parallel populations.\0A\00"
define void @printUsage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([92 x i8], [92 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @exit(i32 0)
unreachable
}

LLVM IR (-O2):
@str = [91 x i8] c"Usage: AMaLGaM-Full-Free [-?] [-P] [-s] [-w] [-v] [-r] pro dim low upp rot eva vtr tol pop\00"
@str.18 = [40 x i8] c" -?: Prints out this usage information.\00"
@str.19 = [63 x i8] c" -P: Prints out a list of all installed optimization problems.\00"
@str.20 = [67 x i8] c" -s: Enables computing and writing of statistics every generation.\00"
@str.21 = [72 x i8] c" -w: Enables writing of solutions and their fitnesses every generation.\00"
@str.22 = [72 x i8] c" -v: Enables verbose mode. Prints the settings before starting the run.\00"
@str.23 = [67 x i8] c" -r: Enables use of vtr in termination condition (value-to-reach).\00"
@str.24 = [66 x i8] c" pro: Index of optimization problem to be solved (minimization).\00"
@str.25 = [29 x i8] c" dim: Number of parameters.\00"
@str.26 = [43 x i8] c" low: Overall initialization lower bound.\00"
@str.27 = [43 x i8] c" upp: Overall initialization upper bound.\00"
@str.28 = [49 x i8] c" rot: The angle by which to rotate the problem.\00"
@str.29 = [46 x i8] c" eva: Maximum number of evaluations allowed.\00"
@str.30 = [88 x i8] c" vtr: The value to reach. If the objective value of the best feasible solution reaches\00"
@str.31 = [65 x i8] c" this value, termination is enforced (if -r is specified).\00"
@str.32 = [80 x i8] c" tol: The tolerance level for fitness variance (i.e. minimum fitness variance)\00"
@str.33 = [51 x i8] c" pop: The maximum number of parallel populations.\00"
define void @printUsage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([91 x i8], [91 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.18, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.19, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.20, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.21, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.22, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.23, i64 0, i64 0))
%8 = tail call i32 @putchar(i32 10)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.24, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.25, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.26, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.27, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.28, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.29, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([88 x i8], [88 x i8]* @str.30, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.31, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([80 x i8], [80 x i8]* @str.32, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.33, i64 0, i64 0))
%19 = tail call i32 @exit(i32 0)
unreachable
}