#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 help() {
  printf("Commands (x, y and w must be integers):\n\n");
  printf("add x => adds vertex with value x to the Graph\n");
  printf("contains x => returns whether x is present in the Graph\n");
  printf("adj x y => returns whether there exists an edge from x to y in the "
         "Graph\n");
  printf("edge x y w => adds an edge between x and y with weight w to the "
         "Graph\n");
  printf("remove x y => removes an edge between x and y from the Graph\n");
  printf("neighbors x => lists a series of (y,w) pairs, where each y is a "
         "neighbor of x and w is the weight of the edge between them\n");
  printf("help => show this menu\n");
  printf("quit => quit the application\n");
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf03(%rip),%rdi
call   1030 <printf@plt>
lea    0xf27(%rip),%rdi
call   1030 <printf@plt>
lea    0xf54(%rip),%rdi
call   1030 <printf@plt>
lea    0xf92(%rip),%rdi
call   1030 <printf@plt>
lea    0xfcd(%rip),%rdi
call   1030 <printf@plt>
lea    0xfff(%rip),%rdi
call   1030 <printf@plt>
lea    0x106f(%rip),%rdi
call   1030 <printf@plt>
lea    0x107b(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<help>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf05(%rip),%rdi
call   1030 <puts@plt>
lea    0xf28(%rip),%rdi
call   1030 <puts@plt>
lea    0xf54(%rip),%rdi
call   1030 <puts@plt>
lea    0xf91(%rip),%rdi
call   1030 <puts@plt>
lea    0xfcb(%rip),%rdi
call   1030 <puts@plt>
lea    0xffc(%rip),%rdi
call   1030 <puts@plt>
lea    0x106b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1076(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [42 x i8] c"Commands (x, y and w must be integers):\0A\0A\00"
@.str.1 = [48 x i8] c"add x => adds vertex with value x to the Graph\0A\00"
@.str.2 = [57 x i8] c"contains x => returns whether x is present in the Graph\0A\00"
@.str.3 = [74 x i8] c"adj x y => returns whether there exists an edge from x to y in the Graph\0A\00"
@.str.4 = [71 x i8] c"edge x y w => adds an edge between x and y with weight w to the Graph\0A\00"
@.str.5 = [62 x i8] c"remove x y => removes an edge between x and y from the Graph\0A\00"
@.str.6 = [124 x i8] c"neighbors x => lists a series of (y,w) pairs, where each y is a neighbor of x and w is the weight of the edge between them\0A\00"
@.str.7 = [24 x i8] c"help => show this menu\0A\00"
@.str.8 = [30 x i8] c"quit => quit the application\0A\00"
define void @help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([124 x i8], [124 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.8, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [41 x i8] c"Commands (x, y and w must be integers):\0A\00"
@str.9 = [47 x i8] c"add x => adds vertex with value x to the Graph\00"
@str.10 = [56 x i8] c"contains x => returns whether x is present in the Graph\00"
@str.11 = [73 x i8] c"adj x y => returns whether there exists an edge from x to y in the Graph\00"
@str.12 = [70 x i8] c"edge x y w => adds an edge between x and y with weight w to the Graph\00"
@str.13 = [61 x i8] c"remove x y => removes an edge between x and y from the Graph\00"
@str.14 = [123 x i8] c"neighbors x => lists a series of (y,w) pairs, where each y is a neighbor of x and w is the weight of the edge between them\00"
@str.15 = [23 x i8] c"help => show this menu\00"
@str.16 = [29 x i8] c"quit => quit the application\00"
define void @help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.9, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([56 x i8], [56 x i8]* @str.10, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.11, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.12, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.13, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([123 x i8], [123 x i8]* @str.14, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.15, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.16, i64 0, i64 0))
ret void
}