#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 ff_usage(void) {
  printf("\nusage of ff:\n");
  printf("\nOPTIONS   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("-r <int>    Random seed [used for random restarts; preset: 0]\n\n");
  printf("-s <int>    Search configuration [preset: s=5]; '+H': helpful "
         "actions pruning\n");
  printf("      0     Standard-FF: EHC+H then BFS (cost minimization: NO)\n");
  printf("      1     BFS (cost minimization: NO)\n");
  printf("      2     BFS+H (cost minimization: NO)\n");
  printf("      3     Weighted A* (cost minimization: YES)\n");
  printf("      4     A*epsilon (cost minimization: YES)\n");
  printf("      5     EHC+H then A*epsilon (cost minimization: YES)\n");
  printf("-w <num>    Set weight w for search configs 3,4,5 [preset: w=5]\n\n");
  printf("-C          Do NOT use cost-minimizing relaxed plans for options "
         "3,4,5\n\n");
  printf("-b <float>  Fixed upper bound on solution cost (prune based on "
         "g+hmax); active only with cost minimization\n\n");
  if (0) {
    printf("-i <num>    run-time information level( preset: 1 )\n");
    printf("      0     only times\n");
    printf("      1     problem name, planning process infos\n");
    printf("    101     parsed problem data\n");
    printf("    102     cleaned up ADL problem\n");
    printf("    103     collected string tables\n");
    printf("    104     encoded domain\n");
    printf("    105     predicates inertia info\n");
    printf("    106     splitted initial state\n");
    printf("    107     domain with Wff s normalized\n");
    printf("    108     domain with NOT conds translated\n");
    printf("    109     splitted domain\n");
    printf("    110     cleaned up easy domain\n");
    printf("    111     unaries encoded easy domain\n");
    printf("    112     effects multiplied easy domain\n");
    printf("    113     inertia removed easy domain\n");
    printf("    114     easy action templates\n");
    printf("    115     cleaned up hard domain representation\n");
    printf("    116     mixed hard domain representation\n");
    printf("    117     final hard domain representation\n");
    printf("    118     reachability analysis results\n");
    printf("    119     facts selected as relevant\n");
    printf("    120     final domain and problem representations\n");
    printf("    121     normalized expressions representation\n");
    printf("    122     LNF: translated subtractions representation\n");
    printf("    123     summarized effects LNF  representation\n");
    printf("    124     encoded LNF representation\n");
    printf("    125     connectivity graph\n");
    printf("    126     fixpoint result on each evaluated state\n");
    printf("    127     1P extracted on each evaluated state\n");
    printf("    128     H set collected for each evaluated state\n");
    printf("\n-d <num>    switch on debugging\n\n");
  }
}


x86 assembly (clang, -O0):
<ff_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee8(%rip),%rdi
call   1030 <printf@plt>
lea    0xef6(%rip),%rdi
call   1030 <printf@plt>
lea    0xf17(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf3c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf70(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb3(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe8(%rip),%rdi
call   1030 <printf@plt>
lea    0x1005(%rip),%rdi
call   1030 <printf@plt>
lea    0x1024(%rip),%rdi
call   1030 <printf@plt>
lea    0x104a(%rip),%rdi
call   1030 <printf@plt>
lea    0x106e(%rip),%rdi
call   1030 <printf@plt>
lea    0x109d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10d3(%rip),%rdi
call   1030 <printf@plt>
lea    0x1110(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<ff_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xeea(%rip),%rdi
call   1030 <puts@plt>
lea    0xef7(%rip),%rdi
call   1030 <puts@plt>
lea    0xf17(%rip),%rdi
call   1030 <puts@plt>
lea    0xf2a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6d(%rip),%rdi
call   1030 <puts@plt>
lea    0xfaf(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe3(%rip),%rdi
call   1030 <puts@plt>
lea    0xfff(%rip),%rdi
call   1030 <puts@plt>
lea    0x101d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1042(%rip),%rdi
call   1030 <puts@plt>
lea    0x1065(%rip),%rdi
call   1030 <puts@plt>
lea    0x1093(%rip),%rdi
call   1030 <puts@plt>
lea    0x10c8(%rip),%rdi
call   1030 <puts@plt>
lea    0x1104(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [15 x i8] c"\0Ausage of ff:\0A\00"
@.str.1 = [26 x i8] c"\0AOPTIONS 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 = [64 x i8] c"-r <int> Random seed [used for random restarts; preset: 0]\0A\0A\00"
@.str.6 = [79 x i8] c"-s <int> Search configuration [preset: s=5]; '+H': helpful actions pruning\0A\00"
@.str.7 = [65 x i8] c" 0 Standard-FF: EHC+H then BFS (cost minimization: NO)\0A\00"
@.str.8 = [41 x i8] c" 1 BFS (cost minimization: NO)\0A\00"
@.str.9 = [43 x i8] c" 2 BFS+H (cost minimization: NO)\0A\00"
@.str.10 = [50 x i8] c" 3 Weighted A* (cost minimization: YES)\0A\00"
@.str.11 = [48 x i8] c" 4 A*epsilon (cost minimization: YES)\0A\00"
@.str.12 = [59 x i8] c" 5 EHC+H then A*epsilon (cost minimization: YES)\0A\00"
@.str.13 = [66 x i8] c"-w <num> Set weight w for search configs 3,4,5 [preset: w=5]\0A\0A\00"
@.str.14 = [73 x i8] c"-C Do NOT use cost-minimizing relaxed plans for options 3,4,5\0A\0A\00"
@.str.15 = [109 x i8] c"-b <float> Fixed upper bound on solution cost (prune based on g+hmax); active only with cost minimization\0A\0A\00"
define void @ff_usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 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 ([64 x i8], [64 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([109 x i8], [109 x i8]* @.str.15, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [14 x i8] c"\0Ausage of ff:\00"
@str.16 = [25 x i8] c"\0AOPTIONS DESCRIPTIONS\0A\00"
@str.17 = [44 x i8] c"-p <str> Path for operator and fact file\00"
@str.18 = [31 x i8] c"-o <str> Operator file name\00"
@str.19 = [28 x i8] c"-f <str> Fact file name\0A\00"
@str.20 = [63 x i8] c"-r <int> Random seed [used for random restarts; preset: 0]\0A\00"
@str.21 = [78 x i8] c"-s <int> Search configuration [preset: s=5]; '+H': helpful actions pruning\00"
@str.22 = [64 x i8] c" 0 Standard-FF: EHC+H then BFS (cost minimization: NO)\00"
@str.23 = [40 x i8] c" 1 BFS (cost minimization: NO)\00"
@str.24 = [42 x i8] c" 2 BFS+H (cost minimization: NO)\00"
@str.25 = [49 x i8] c" 3 Weighted A* (cost minimization: YES)\00"
@str.26 = [47 x i8] c" 4 A*epsilon (cost minimization: YES)\00"
@str.27 = [58 x i8] c" 5 EHC+H then A*epsilon (cost minimization: YES)\00"
@str.28 = [65 x i8] c"-w <num> Set weight w for search configs 3,4,5 [preset: w=5]\0A\00"
@str.29 = [72 x i8] c"-C Do NOT use cost-minimizing relaxed plans for options 3,4,5\0A\00"
@str.30 = [108 x i8] c"-b <float> Fixed upper bound on solution cost (prune based on g+hmax); active only with cost minimization\0A\00"
define void @ff_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.16, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.17, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.18, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.19, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.20, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.21, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.22, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.23, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.24, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.25, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.26, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.27, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.28, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.29, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([108 x i8], [108 x i8]* @str.30, i64 0, i64 0))
ret void
}