#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() {
  printf("COMMANDS:\n");
  printf("  initialize HISTORY ALGORITHM ROOT_ID[:ROOT_DATA]\n");
  printf("  add_child PARENT_ID NEW_ID[:NEW_DATA]\n");
  printf("  deactivate NODE_ID\n");
  printf("  expand PARENT_ID NEW_ID1[:NEW_DATA1] NEW_ID2[:NEW_DATA2] ...\n");
  printf("  history NODE_ID\n");
  printf("  help\n");
  printf("HISTORY is a positive integer\n");
  printf("ALGORITHM is one of: naive gc amortized real-time\n");
  printf("IDs and DATA are integers\n");
}


x86 assembly (clang, -O0):
<print_help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee4(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf29(%rip),%rdi
call   1030 <printf@plt>
lea    0xf33(%rip),%rdi
call   1030 <printf@plt>
lea    0xf67(%rip),%rdi
call   1030 <printf@plt>
lea    0xf6e(%rip),%rdi
call   1030 <printf@plt>
lea    0xf6a(%rip),%rdi
call   1030 <printf@plt>
lea    0xf7d(%rip),%rdi
call   1030 <printf@plt>
lea    0xfa4(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_help>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xee6(%rip),%rdi
call   1030 <puts@plt>
lea    0xf0d(%rip),%rdi
call   1030 <puts@plt>
lea    0xf29(%rip),%rdi
call   1030 <puts@plt>
lea    0xf32(%rip),%rdi
call   1030 <puts@plt>
lea    0xf65(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf66(%rip),%rdi
call   1030 <puts@plt>
lea    0xf78(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9e(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [11 x i8] c"COMMANDS:\0A\00"
@.str.1 = [52 x i8] c" initialize HISTORY ALGORITHM ROOT_ID[:ROOT_DATA]\0A\00"
@.str.2 = [41 x i8] c" add_child PARENT_ID NEW_ID[:NEW_DATA]\0A\00"
@.str.3 = [22 x i8] c" deactivate NODE_ID\0A\00"
@.str.4 = [64 x i8] c" expand PARENT_ID NEW_ID1[:NEW_DATA1] NEW_ID2[:NEW_DATA2] ...\0A\00"
@.str.5 = [19 x i8] c" history NODE_ID\0A\00"
@.str.6 = [8 x i8] c" help\0A\00"
@.str.7 = [31 x i8] c"HISTORY is a positive integer\0A\00"
@.str.8 = [51 x i8] c"ALGORITHM is one of: naive gc amortized real-time\0A\00"
@.str.9 = [27 x i8] c"IDs and DATA are integers\0A\00"
define void @print_help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.9, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [10 x i8] c"COMMANDS:\00"
@str.10 = [51 x i8] c" initialize HISTORY ALGORITHM ROOT_ID[:ROOT_DATA]\00"
@str.11 = [40 x i8] c" add_child PARENT_ID NEW_ID[:NEW_DATA]\00"
@str.12 = [21 x i8] c" deactivate NODE_ID\00"
@str.13 = [63 x i8] c" expand PARENT_ID NEW_ID1[:NEW_DATA1] NEW_ID2[:NEW_DATA2] ...\00"
@str.14 = [18 x i8] c" history NODE_ID\00"
@str.15 = [7 x i8] c" help\00"
@str.16 = [30 x i8] c"HISTORY is a positive integer\00"
@str.17 = [50 x i8] c"ALGORITHM is one of: naive gc amortized real-time\00"
@str.18 = [26 x i8] c"IDs and DATA are integers\00"
define void @print_help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.10, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.11, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @str.12, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.13, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.14, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @str.15, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.16, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.17, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.18, i64 0, i64 0))
ret void
}