#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*/ printf(char *, ...);
void print_help(char *argv[]) {
  printf("Usage of %s version %s:\n", argv[0], "2.2");
  printf("%s [options] [[<]input_file]\n", argv[0]);
  printf("list of options:\n");
  printf("-h\t\tprints this message\n");
  printf("-v\t\tverbose mode, gives flow through the program\n");
  printf("-d\t\tdebug mode, all intermediate results are printed,\n\t\tand the "
         "branch-and-bound decisions\n");
  printf("-p\t\tprint the values of the dual variables\n");
  printf("-b <bound>\tspecify a lower bound for the objective function\n\t\tto "
         "the program. If close enough, may speed up the\n\t\tcalculations.\n");
  printf("-i\t\tprint all intermediate valid solutions.\n\t\tCan give you "
         "useful solutions even if the total run time\n\t\tis too long\n");
  printf("-e <number>\tspecifies the epsilon which is used to determine "
         "whether a\n\t\tfloating point number is in fact an "
         "integer.\n\t\tShould be < 0.5\n");
  printf("-c\t\tduring branch-and-bound, take the ceiling branch first\n");
  printf("-s\t\tuse automatic problem scaling.\n");
  printf("-I\t\tprint info after reinverting\n");
  printf("-t\t\ttrace pivot selection\n");
  printf("-mps\t\tread from MPS file instead of lp file\n");
  printf("-degen\t\tuse perturbations to reduce degeneracy,\n\t\tcan increase "
         "numerical instability\n");
  printf("-trej <Trej>\tset minimum pivot value\n");
  printf("-parse_only\tparse input file but do not calculate (ie check)\n");
  printf("-time\t\tPrint CPU time to parse input and to calculate result\n");
  printf("-min\t\tMinimize the lp problem (overrules setting in file)\n");
  printf("-max\t\tMaximize the lp problem (overrules setting in file)\n");
}


x86 assembly (clang, -O0):
<print_help>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
mov    -0x8(%rbp),%rax
mov    (%rax),%rsi
lea    0xed6(%rip),%rdi
lea    0xee8(%rip),%rdx
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%rax
mov    (%rax),%rsi
lea    0xed7(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xee7(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xeeb(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xef6(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf1a(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf68(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xf86(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0xff9(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1061(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x10dc(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x110a(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1120(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1134(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1141(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1160(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x11a8(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x11c0(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x11f0(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x1220(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
lea    0x124d(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_help>:
push   %rbx
mov    %rdi,%rbx
mov    (%rdi),%rsi
lea    0xed2(%rip),%rdi
lea    0xee4(%rip),%rdx
xor    %eax,%eax
call   1040 <printf@plt>
mov    (%rbx),%rsi
lea    0xed7(%rip),%rdi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xee7(%rip),%rdi
call   1030 <puts@plt>
lea    0xeec(%rip),%rdi
call   1030 <puts@plt>
lea    0xef8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf1d(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6c(%rip),%rdi
call   1030 <puts@plt>
lea    0xf8b(%rip),%rdi
call   1030 <puts@plt>
lea    0xfff(%rip),%rdi
call   1030 <puts@plt>
lea    0x1068(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e4(%rip),%rdi
call   1030 <puts@plt>
lea    0x1113(%rip),%rdi
call   1030 <puts@plt>
lea    0x112a(%rip),%rdi
call   1030 <puts@plt>
lea    0x113f(%rip),%rdi
call   1030 <puts@plt>
lea    0x114d(%rip),%rdi
call   1030 <puts@plt>
lea    0x116d(%rip),%rdi
call   1030 <puts@plt>
lea    0x11b6(%rip),%rdi
call   1030 <puts@plt>
lea    0x11cf(%rip),%rdi
call   1030 <puts@plt>
lea    0x1200(%rip),%rdi
call   1030 <puts@plt>
lea    0x1231(%rip),%rdi
call   1030 <puts@plt>
lea    0x125f(%rip),%rdi
pop    %rbx
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [25 x i8] c"Usage of %s version %s:\0A\00"
@.str.1 = [4 x i8] c"2.2\00"
@.str.2 = [30 x i8] c"%s [options] [[<]input_file]\0A\00"
@.str.3 = [18 x i8] c"list of options:\0A\00"
@.str.4 = [25 x i8] c"-h\09\09prints this message\0A\00"
@.str.5 = [50 x i8] c"-v\09\09verbose mode, gives flow through the program\0A\00"
@.str.6 = [92 x i8] c"-d\09\09debug mode, all intermediate results are printed,\0A\09\09and the branch-and-bound decisions\0A\00"
@.str.7 = [44 x i8] c"-p\09\09print the values of the dual variables\0A\00"
@.str.8 = [129 x i8] c"-b <bound>\09specify a lower bound for the objective function\0A\09\09to the program. If close enough, may speed up the\0A\09\09calculations.\0A\00"
@.str.9 = [118 x i8] c"-i\09\09print all intermediate valid solutions.\0A\09\09Can give you useful solutions even if the total run time\0A\09\09is too long\0A\00"
@.str.10 = [137 x i8] c"-e <number>\09specifies the epsilon which is used to determine whether a\0A\09\09floating point number is in fact an integer.\0A\09\09Should be < 0.5\0A\00"
@.str.11 = [60 x i8] c"-c\09\09during branch-and-bound, take the ceiling branch first\0A\00"
@.str.12 = [36 x i8] c"-s\09\09use automatic problem scaling.\0A\00"
@.str.13 = [34 x i8] c"-I\09\09print info after reinverting\0A\00"
@.str.14 = [27 x i8] c"-t\09\09trace pivot selection\0A\00"
@.str.15 = [45 x i8] c"-mps\09\09read from MPS file instead of lp file\0A\00"
@.str.16 = [86 x i8] c"-degen\09\09use perturbations to reduce degeneracy,\0A\09\09can increase numerical instability\0A\00"
@.str.17 = [38 x i8] c"-trej <Trej>\09set minimum pivot value\0A\00"
@.str.18 = [62 x i8] c"-parse_only\09parse input file but do not calculate (ie check)\0A\00"
@.str.19 = [62 x i8] c"-time\09\09Print CPU time to parse input and to calculate result\0A\00"
@.str.20 = [59 x i8] c"-min\09\09Minimize the lp problem (overrules setting in file)\0A\00"
@.str.21 = [59 x i8] c"-max\09\09Maximize the lp problem (overrules setting in file)\0A\00"
define void @print_help(i8** %0) {
%2 = alloca i8**
store i8** %0, i8*** %2
%3 = load i8**, i8*** %2
%4 = getelementptr inbounds i8*, i8** %3, i64 0
%5 = load i8*, i8** %4
%6 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0), i8* %5, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.1, i64 0, i64 0))
%7 = load i8**, i8*** %2
%8 = getelementptr inbounds i8*, i8** %7, i64 0
%9 = load i8*, i8** %8
%10 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.2, i64 0, i64 0), i8* %9)
%11 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.3, i64 0, i64 0))
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.4, i64 0, i64 0))
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.5, i64 0, i64 0))
%14 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([92 x i8], [92 x i8]* @.str.6, i64 0, i64 0))
%15 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.7, i64 0, i64 0))
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([129 x i8], [129 x i8]* @.str.8, i64 0, i64 0))
%17 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([118 x i8], [118 x i8]* @.str.9, i64 0, i64 0))
%18 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([137 x i8], [137 x i8]* @.str.10, i64 0, i64 0))
%19 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.11, i64 0, i64 0))
%20 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.12, i64 0, i64 0))
%21 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.13, i64 0, i64 0))
%22 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.14, i64 0, i64 0))
%23 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.15, i64 0, i64 0))
%24 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([86 x i8], [86 x i8]* @.str.16, i64 0, i64 0))
%25 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.17, i64 0, i64 0))
%26 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.18, i64 0, i64 0))
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.19, i64 0, i64 0))
%28 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.20, i64 0, i64 0))
%29 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.21, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@.str = [25 x i8] c"Usage of %s version %s:\0A\00"
@.str.1 = [4 x i8] c"2.2\00"
@.str.2 = [30 x i8] c"%s [options] [[<]input_file]\0A\00"
@str = [17 x i8] c"list of options:\00"
@str.22 = [24 x i8] c"-h\09\09prints this message\00"
@str.23 = [49 x i8] c"-v\09\09verbose mode, gives flow through the program\00"
@str.24 = [91 x i8] c"-d\09\09debug mode, all intermediate results are printed,\0A\09\09and the branch-and-bound decisions\00"
@str.25 = [43 x i8] c"-p\09\09print the values of the dual variables\00"
@str.26 = [128 x i8] c"-b <bound>\09specify a lower bound for the objective function\0A\09\09to the program. If close enough, may speed up the\0A\09\09calculations.\00"
@str.27 = [117 x i8] c"-i\09\09print all intermediate valid solutions.\0A\09\09Can give you useful solutions even if the total run time\0A\09\09is too long\00"
@str.28 = [136 x i8] c"-e <number>\09specifies the epsilon which is used to determine whether a\0A\09\09floating point number is in fact an integer.\0A\09\09Should be < 0.5\00"
@str.29 = [59 x i8] c"-c\09\09during branch-and-bound, take the ceiling branch first\00"
@str.30 = [35 x i8] c"-s\09\09use automatic problem scaling.\00"
@str.31 = [33 x i8] c"-I\09\09print info after reinverting\00"
@str.32 = [26 x i8] c"-t\09\09trace pivot selection\00"
@str.33 = [44 x i8] c"-mps\09\09read from MPS file instead of lp file\00"
@str.34 = [85 x i8] c"-degen\09\09use perturbations to reduce degeneracy,\0A\09\09can increase numerical instability\00"
@str.35 = [37 x i8] c"-trej <Trej>\09set minimum pivot value\00"
@str.36 = [61 x i8] c"-parse_only\09parse input file but do not calculate (ie check)\00"
@str.37 = [61 x i8] c"-time\09\09Print CPU time to parse input and to calculate result\00"
@str.38 = [58 x i8] c"-min\09\09Minimize the lp problem (overrules setting in file)\00"
@str.39 = [58 x i8] c"-max\09\09Maximize the lp problem (overrules setting in file)\00"
define void @print_help(i8** nocapture %0) {
%2 = load i8*, i8** %0
%3 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0), i8* %2, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.1, i64 0, i64 0))
%4 = load i8*, i8** %0
%5 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @.str.2, i64 0, i64 0), i8* %4)
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([17 x i8], [17 x i8]* @str, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.22, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.23, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([91 x i8], [91 x i8]* @str.24, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.25, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([128 x i8], [128 x i8]* @str.26, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([117 x i8], [117 x i8]* @str.27, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([136 x i8], [136 x i8]* @str.28, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.29, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.30, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.31, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.32, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.33, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([85 x i8], [85 x i8]* @str.34, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.35, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.36, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.37, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.38, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.39, i64 0, i64 0))
ret void
}