#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 ipp_usage(void) {
  printf("\nusage of ipp:\n\n");
  printf("OPTIONS   DESCRIPTIONS\n\n");
  printf("-p <str>    path for operator and fact file\n");
  printf("-o <str>    operator file name\n");
  printf("-f <str>    fact file name\n\n");
  printf("-i <num>    run-time information level( preset: 1 )\n");
  printf("     0      nothing\n");
  printf("     1      info on action number, graph, search and plan\n");
  printf("     2      1 + info on problem constants, types and predicates\n");
  printf("     3      1 + 2 + loaded operators, initial and goal state\n");
  printf("     4      1 + predicates and their inertia status\n");
  printf("     5      1 + 4 + goal state and operators with unary inertia "
         "encoded\n");
  printf("     6      1 + actions, initial and goal state after expansion of "
         "variables\n");
  printf("     7      1 + facts selected as relevant to the problem\n");
  printf("     8      1 + final domain representation\n");
  printf(" > 100      1 + various debugging information\n\n");
  printf("-W          write complete graph to text files after planning\n");
  printf(
      "-w <str>    specify name for graph output files( preset: graph )\n\n");
  printf("-m <num>    build graph up to level <num> without search\n");
  printf("-S          don't do complete subset test in memoization\n\n");
}


x86 assembly (clang, -O0):
<ipp_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xeea(%rip),%rdi
call   1030 <printf@plt>
lea    0xef7(%rip),%rdi
call   1030 <printf@plt>
lea    0xf18(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf3d(%rip),%rdi
call   1030 <printf@plt>
lea    0xf66(%rip),%rdi
call   1030 <printf@plt>
lea    0xf6f(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfd3(%rip),%rdi
call   1030 <printf@plt>
lea    0x1005(%rip),%rdi
call   1030 <printf@plt>
lea    0x102e(%rip),%rdi
call   1030 <printf@plt>
lea    0x106b(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ad(%rip),%rdi
call   1030 <printf@plt>
lea    0x10dc(%rip),%rdi
call   1030 <printf@plt>
lea    0x10fd(%rip),%rdi
call   1030 <printf@plt>
lea    0x1121(%rip),%rdi
call   1030 <printf@plt>
lea    0x1154(%rip),%rdi
call   1030 <printf@plt>
lea    0x118b(%rip),%rdi
call   1030 <printf@plt>
lea    0x11b9(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<ipp_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xeec(%rip),%rdi
call   1030 <puts@plt>
lea    0xef8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf18(%rip),%rdi
call   1030 <puts@plt>
lea    0xf2b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf63(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf99(%rip),%rdi
call   1030 <puts@plt>
lea    0xfcd(%rip),%rdi
call   1030 <puts@plt>
lea    0xffe(%rip),%rdi
call   1030 <puts@plt>
lea    0x1026(%rip),%rdi
call   1030 <puts@plt>
lea    0x1062(%rip),%rdi
call   1030 <puts@plt>
lea    0x10a3(%rip),%rdi
call   1030 <puts@plt>
lea    0x10d1(%rip),%rdi
call   1030 <puts@plt>
lea    0x10f1(%rip),%rdi
call   1030 <puts@plt>
lea    0x1114(%rip),%rdi
call   1030 <puts@plt>
lea    0x1146(%rip),%rdi
call   1030 <puts@plt>
lea    0x117c(%rip),%rdi
call   1030 <puts@plt>
lea    0x11a9(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [17 x i8] c"\0Ausage of ipp:\0A\0A\00"
@.str.1 = [25 x i8] c"OPTIONS DESCRIPTIONS\0A\0A\00"
@.str.2 = [45 x i8] c"-p <str> path for operator and fact file\0A\00"
@.str.3 = [32 x i8] c"-o <str> operator file name\0A\00"
@.str.4 = [29 x i8] c"-f <str> fact file name\0A\0A\00"
@.str.5 = [53 x i8] c"-i <num> run-time information level( preset: 1 )\0A\00"
@.str.6 = [21 x i8] c" 0 nothing\0A\00"
@.str.7 = [59 x i8] c" 1 info on action number, graph, search and plan\0A\00"
@.str.8 = [65 x i8] c" 2 1 + info on problem constants, types and predicates\0A\00"
@.str.9 = [62 x i8] c" 3 1 + 2 + loaded operators, initial and goal state\0A\00"
@.str.10 = [53 x i8] c" 4 1 + predicates and their inertia status\0A\00"
@.str.11 = [73 x i8] c" 5 1 + 4 + goal state and operators with unary inertia encoded\0A\00"
@.str.12 = [78 x i8] c" 6 1 + actions, initial and goal state after expansion of variables\0A\00"
@.str.13 = [59 x i8] c" 7 1 + facts selected as relevant to the problem\0A\00"
@.str.14 = [45 x i8] c" 8 1 + final domain representation\0A\00"
@.str.15 = [48 x i8] c" > 100 1 + various debugging information\0A\0A\00"
@.str.16 = [63 x i8] c"-W write complete graph to text files after planning\0A\00"
@.str.17 = [67 x i8] c"-w <str> specify name for graph output files( preset: graph )\0A\0A\00"
@.str.18 = [58 x i8] c"-m <num> build graph up to level <num> without search\0A\00"
@.str.19 = [59 x i8] c"-S don't do complete subset test in memoization\0A\0A\00"
define void @ipp_usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.19, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [16 x i8] c"\0Ausage of ipp:\0A\00"
@str.20 = [24 x i8] c"OPTIONS DESCRIPTIONS\0A\00"
@str.21 = [44 x i8] c"-p <str> path for operator and fact file\00"
@str.22 = [31 x i8] c"-o <str> operator file name\00"
@str.23 = [28 x i8] c"-f <str> fact file name\0A\00"
@str.24 = [52 x i8] c"-i <num> run-time information level( preset: 1 )\00"
@str.25 = [20 x i8] c" 0 nothing\00"
@str.26 = [58 x i8] c" 1 info on action number, graph, search and plan\00"
@str.27 = [64 x i8] c" 2 1 + info on problem constants, types and predicates\00"
@str.28 = [61 x i8] c" 3 1 + 2 + loaded operators, initial and goal state\00"
@str.29 = [52 x i8] c" 4 1 + predicates and their inertia status\00"
@str.30 = [72 x i8] c" 5 1 + 4 + goal state and operators with unary inertia encoded\00"
@str.31 = [77 x i8] c" 6 1 + actions, initial and goal state after expansion of variables\00"
@str.32 = [58 x i8] c" 7 1 + facts selected as relevant to the problem\00"
@str.33 = [44 x i8] c" 8 1 + final domain representation\00"
@str.34 = [47 x i8] c" > 100 1 + various debugging information\0A\00"
@str.35 = [62 x i8] c"-W write complete graph to text files after planning\00"
@str.36 = [66 x i8] c"-w <str> specify name for graph output files( preset: graph )\0A\00"
@str.37 = [57 x i8] c"-m <num> build graph up to level <num> without search\00"
@str.38 = [58 x i8] c"-S don't do complete subset test in memoization\0A\00"
define void @ipp_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.20, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.21, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.22, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.23, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.24, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str.25, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.26, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.27, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.28, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.29, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.30, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.31, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.32, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.33, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.34, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.35, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.36, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.37, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.38, i64 0, i64 0))
ret void
}