#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*/ fflush(int /*<<< orphan*/);
int /*<<< orphan*/ printf(char *, char *);
int /*<<< orphan*/ stdout;
void clq_sep_params_help_cmd_line() {
  printf("  -%s=int           : print detailed messages on-off\n", "verbose");
  printf("  -%s=float         : minimum violation for a cut to be selected\n",
         "minViol");
  printf("  -%s=float         : minimum violation for a cut to be selected\n",
         "minFrac");
  printf("  -%s=int           : max iterations for BK algorithm\n", "maxItBK");
  printf("  -%s={0,1,2,3,4}   : clique extension: off, random, max degree, "
         "greedy and exact, respectively.\n",
         "extendC");
  printf("  -%s=float           : maximum reduced cost value that a variable "
         "must have to be considered for extension.\n",
         "maxRC");
  printf("  -%s=int        : maximum number of cliques generated by the exact "
         "extension of an original one.\n",
         "maxClqEGen");
  printf("  -%s=float    : maximum range of reduced cost value considered in "
         "the exact extension.\n",
         "rcPercentage");
  fflush(stdout);
}


x86 assembly (clang, -O0):
<clq_sep_params_help_cmd_line>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
lea    0xf04(%rip),%rsi
call   1030 <printf@plt>
lea    0xf00(%rip),%rdi
lea    0xf3b(%rip),%rsi
call   1030 <printf@plt>
lea    0xeed(%rip),%rdi
lea    0xf30(%rip),%rsi
call   1030 <printf@plt>
lea    0xf2c(%rip),%rdi
lea    0xf5c(%rip),%rsi
call   1030 <printf@plt>
lea    0xf58(%rip),%rdi
lea    0xfb3(%rip),%rsi
call   1030 <printf@plt>
lea    0xfaf(%rip),%rdi
lea    0x1016(%rip),%rsi
call   1030 <printf@plt>
lea    0x1010(%rip),%rdi
lea    0x106c(%rip),%rsi
call   1030 <printf@plt>
lea    0x106b(%rip),%rdi
lea    0x10bd(%rip),%rsi
call   1030 <printf@plt>
mov    0x2e1d(%rip),%rax
mov    (%rax),%edi
call   1040 <fflush@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<clq_sep_params_help_cmd_line>:
push   %rbx
lea    0xed8(%rip),%rdi
lea    0xf07(%rip),%rsi
call   1030 <printf@plt>
lea    0xf03(%rip),%rbx
lea    0xf3e(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0xf37(%rip),%rsi
mov    %rbx,%rdi
call   1030 <printf@plt>
lea    0xf30(%rip),%rdi
lea    0xf60(%rip),%rsi
call   1030 <printf@plt>
lea    0xf5c(%rip),%rdi
lea    0xfb7(%rip),%rsi
call   1030 <printf@plt>
lea    0xfb3(%rip),%rdi
lea    0x101a(%rip),%rsi
call   1030 <printf@plt>
lea    0x1014(%rip),%rdi
lea    0x1070(%rip),%rsi
call   1030 <printf@plt>
lea    0x106f(%rip),%rdi
lea    0x10c1(%rip),%rsi
call   1030 <printf@plt>
mov    0x2e21(%rip),%rax
mov    (%rax),%edi
pop    %rbx
jmp    1040 <fflush@plt>

LLVM IR (-O0):
@.str = [54 x i8] c" -%s=int : print detailed messages on-off\0A\00"
@.str.1 = [8 x i8] c"verbose\00"
@.str.2 = [66 x i8] c" -%s=float : minimum violation for a cut to be selected\0A\00"
@.str.3 = [8 x i8] c"minViol\00"
@.str.4 = [8 x i8] c"minFrac\00"
@.str.5 = [55 x i8] c" -%s=int : max iterations for BK algorithm\0A\00"
@.str.6 = [8 x i8] c"maxItBK\00"
@.str.7 = [98 x i8] c" -%s={0,1,2,3,4} : clique extension: off, random, max degree, greedy and exact, respectively.\0A\00"
@.str.8 = [8 x i8] c"extendC\00"
@.str.9 = [110 x i8] c" -%s=float : maximum reduced cost value that a variable must have to be considered for extension.\0A\00"
@.str.10 = [6 x i8] c"maxRC\00"
@.str.11 = [99 x i8] c" -%s=int : maximum number of cliques generated by the exact extension of an original one.\0A\00"
@.str.12 = [11 x i8] c"maxClqEGen\00"
@.str.13 = [89 x i8] c" -%s=float : maximum range of reduced cost value considered in the exact extension.\0A\00"
@.str.14 = [13 x i8] c"rcPercentage\00"
@stdout = global i32 0
define void @clq_sep_params_help_cmd_line() {
%1 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.4, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.5, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.6, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([98 x i8], [98 x i8]* @.str.7, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.8, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([110 x i8], [110 x i8]* @.str.9, i64 0, i64 0), i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.10, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([99 x i8], [99 x i8]* @.str.11, i64 0, i64 0), i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.12, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.13, i64 0, i64 0), i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.14, i64 0, i64 0))
%9 = load i32, i32* @stdout
%10 = call i32 @fflush(i32 %9)
ret void
}

LLVM IR (-O2):
@.str = [54 x i8] c" -%s=int : print detailed messages on-off\0A\00"
@.str.1 = [8 x i8] c"verbose\00"
@.str.2 = [66 x i8] c" -%s=float : minimum violation for a cut to be selected\0A\00"
@.str.3 = [8 x i8] c"minViol\00"
@.str.4 = [8 x i8] c"minFrac\00"
@.str.5 = [55 x i8] c" -%s=int : max iterations for BK algorithm\0A\00"
@.str.6 = [8 x i8] c"maxItBK\00"
@.str.7 = [98 x i8] c" -%s={0,1,2,3,4} : clique extension: off, random, max degree, greedy and exact, respectively.\0A\00"
@.str.8 = [8 x i8] c"extendC\00"
@.str.9 = [110 x i8] c" -%s=float : maximum reduced cost value that a variable must have to be considered for extension.\0A\00"
@.str.10 = [6 x i8] c"maxRC\00"
@.str.11 = [99 x i8] c" -%s=int : maximum number of cliques generated by the exact extension of an original one.\0A\00"
@.str.12 = [11 x i8] c"maxClqEGen\00"
@.str.13 = [89 x i8] c" -%s=float : maximum range of reduced cost value considered in the exact extension.\0A\00"
@.str.14 = [13 x i8] c"rcPercentage\00"
@stdout = global i32 0
define void @clq_sep_params_help_cmd_line() {
%1 = tail call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%2 = tail call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.3, i64 0, i64 0))
%3 = tail call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.4, i64 0, i64 0))
%4 = tail call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.5, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.6, i64 0, i64 0))
%5 = tail call i32 @printf(i8* getelementptr inbounds ([98 x i8], [98 x i8]* @.str.7, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.8, i64 0, i64 0))
%6 = tail call i32 @printf(i8* getelementptr inbounds ([110 x i8], [110 x i8]* @.str.9, i64 0, i64 0), i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.10, i64 0, i64 0))
%7 = tail call i32 @printf(i8* getelementptr inbounds ([99 x i8], [99 x i8]* @.str.11, i64 0, i64 0), i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.12, i64 0, i64 0))
%8 = tail call i32 @printf(i8* getelementptr inbounds ([89 x i8], [89 x i8]* @.str.13, i64 0, i64 0), i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.14, i64 0, i64 0))
%9 = load i32, i32* @stdout
%10 = tail call i32 @fflush(i32 %9)
ret void
}