#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);
int /*<<< orphan*/ fprintf(int /*<<< orphan*/, char *);
int /*<<< orphan*/ stderr;
void usage(void) {
  fprintf(stderr, "usage: hsp <flags>* [ <algorithm> | -S <schedule> ] "
                  "<problem.pddl> <domain.pddl>\n");
  fprintf(stderr, "where <flags> are among:\n");
  fprintf(stderr, "   -v <level>\t\tVerbose level >= 0 (default is 1).\n");
  fprintf(stderr, "   -w <weight>\t\tFloat to weight the heuristic component "
                  "of the cost function.\n");
  fprintf(stderr, "<algorithm> is:\n");
  fprintf(stderr, "   -a <algorithm>\tEither 'bfs' or 'gbfs'.\n");
  fprintf(stderr, "   -d <direction>\tEither 'forward' or 'backward'.\n");
  fprintf(stderr,
          "   -h <heuristic>\tOne of 'h1plus', 'h1max', 'h2plus', 'h2max'.\n");
  fprintf(
      stderr,
      "<schedule> is a colon separated <option> list where each option has\n");
  fprintf(
      stderr,
      "form '[<direction>,<heuristic>,<msecs>]'. The options are performed\n");
  fprintf(stderr, "sequentially until one finds a plan, or no more options are "
                  "available\n");
  fprintf(stderr,
          "(each option is attempted with the given time constraint).\n");
  exit(-1);
}


x86 assembly (clang, -O0):
<usage>:
push   %rbp
mov    %rsp,%rbp
mov    0x2eb5(%rip),%rax
mov    (%rax),%edi
lea    0xecc(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2ea0(%rip),%rax
mov    (%rax),%edi
lea    0xf09(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e8b(%rip),%rax
mov    (%rax),%edi
lea    0xf0e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e76(%rip),%rax
mov    (%rax),%edi
lea    0xf2c(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e61(%rip),%rax
mov    (%rax),%edi
lea    0xf66(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e4c(%rip),%rax
mov    (%rax),%edi
lea    0xf62(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e37(%rip),%rax
mov    (%rax),%edi
lea    0xf78(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e22(%rip),%rax
mov    (%rax),%edi
lea    0xf96(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e0d(%rip),%rax
mov    (%rax),%edi
lea    0xfc1(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2df8(%rip),%rax
mov    (%rax),%edi
lea    0xff1(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2de3(%rip),%rax
mov    (%rax),%edi
lea    0x1021(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2dce(%rip),%rax
mov    (%rax),%edi
lea    0x1053(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0xffffffff,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<usage>:
push   %rbx
mov    0x2eb8(%rip),%rbx
mov    (%rbx),%edi
lea    0xecf(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf13(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf1f(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf44(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf85(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf88(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfa5(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfca(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xffc(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1033(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x106a(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x10a3(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0xffffffff,%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@stderr = global i32 0
@.str = [82 x i8] c"usage: hsp <flags>* [ <algorithm> | -S <schedule> ] <problem.pddl> <domain.pddl>\0A\00"
@.str.1 = [26 x i8] c"where <flags> are among:\0A\00"
@.str.2 = [51 x i8] c" -v <level>\09\09Verbose level >= 0 (default is 1).\0A\00"
@.str.3 = [79 x i8] c" -w <weight>\09\09Float to weight the heuristic component of the cost function.\0A\00"
@.str.4 = [17 x i8] c"<algorithm> is:\0A\00"
@.str.5 = [43 x i8] c" -a <algorithm>\09Either 'bfs' or 'gbfs'.\0A\00"
@.str.6 = [51 x i8] c" -d <direction>\09Either 'forward' or 'backward'.\0A\00"
@.str.7 = [64 x i8] c" -h <heuristic>\09One of 'h1plus', 'h1max', 'h2plus', 'h2max'.\0A\00"
@.str.8 = [69 x i8] c"<schedule> is a colon separated <option> list where each option has\0A\00"
@.str.9 = [69 x i8] c"form '[<direction>,<heuristic>,<msecs>]'. The options are performed\0A\00"
@.str.10 = [71 x i8] c"sequentially until one finds a plan, or no more options are available\0A\00"
@.str.11 = [60 x i8] c"(each option is attempted with the given time constraint).\0A\00"
define void @usage() {
%1 = load i32, i32* @stderr
%2 = call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.2, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.3, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.4, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.5, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.6, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.7, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.8, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.9, i64 0, i64 0))
%21 = load i32, i32* @stderr
%22 = call i32 @fprintf(i32 %21, i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.10, i64 0, i64 0))
%23 = load i32, i32* @stderr
%24 = call i32 @fprintf(i32 %23, i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.11, i64 0, i64 0))
%25 = call i32 @exit(i32 -1)
unreachable
}

LLVM IR (-O2):
@stderr = global i32 0
@.str = [82 x i8] c"usage: hsp <flags>* [ <algorithm> | -S <schedule> ] <problem.pddl> <domain.pddl>\0A\00"
@.str.1 = [26 x i8] c"where <flags> are among:\0A\00"
@.str.2 = [51 x i8] c" -v <level>\09\09Verbose level >= 0 (default is 1).\0A\00"
@.str.3 = [79 x i8] c" -w <weight>\09\09Float to weight the heuristic component of the cost function.\0A\00"
@.str.4 = [17 x i8] c"<algorithm> is:\0A\00"
@.str.5 = [43 x i8] c" -a <algorithm>\09Either 'bfs' or 'gbfs'.\0A\00"
@.str.6 = [51 x i8] c" -d <direction>\09Either 'forward' or 'backward'.\0A\00"
@.str.7 = [64 x i8] c" -h <heuristic>\09One of 'h1plus', 'h1max', 'h2plus', 'h2max'.\0A\00"
@.str.8 = [69 x i8] c"<schedule> is a colon separated <option> list where each option has\0A\00"
@.str.9 = [69 x i8] c"form '[<direction>,<heuristic>,<msecs>]'. The options are performed\0A\00"
@.str.10 = [71 x i8] c"sequentially until one finds a plan, or no more options are available\0A\00"
@.str.11 = [60 x i8] c"(each option is attempted with the given time constraint).\0A\00"
define void @usage() {
%1 = load i32, i32* @stderr
%2 = tail call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = tail call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = tail call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.2, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = tail call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.3, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = tail call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.4, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = tail call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.5, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = tail call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.6, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = tail call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.7, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = tail call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.8, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = tail call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.9, i64 0, i64 0))
%21 = load i32, i32* @stderr
%22 = tail call i32 @fprintf(i32 %21, i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.10, i64 0, i64 0))
%23 = load i32, i32* @stderr
%24 = tail call i32 @fprintf(i32 %23, i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.11, i64 0, i64 0))
%25 = tail call i32 @exit(i32 -1)
unreachable
}