#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("==================== available commands ====================\n");
  printf("  ? (help)\n");
  printf("    provides information on available commands\n");
  printf("  r \"file_name\" (read)\n");
  printf("    reads file of name \"file_name\" into dj's system\n");
  printf("  s [-n <vertex>] [-c <vertex>] [-f] [-v] (stats)\n");
  printf("    [-n <vertex>] - prints all neighbors of specified vertex\n");
  printf("                  - if no vertex present, prints all neighbors\n");
  printf("    [-c <vertex>] - prints all connections of specified vertex\n");
  printf("                  - if no vertex present, prints all connections\n");
  printf("    [-f] - prints current working file\n");
  printf("    [-v] - prints all vertices in working file\n");
  printf("  c <vertex_1>, <vertex_2> (calculate)\n");
  printf("    displays shortest path between specified vertices\n");
  printf("    NOTE: the comma between vertex names is necessary\n");
  printf("  exit\n");
  printf("    terminates execution of program\n");
  printf("============================================================\n");
  return;
}


x86 assembly (clang, -O0):
<help>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf17(%rip),%rdi
call   1030 <printf@plt>
lea    0xf17(%rip),%rdi
call   1030 <printf@plt>
lea    0xf3b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf47(%rip),%rdi
call   1030 <printf@plt>
lea    0xf70(%rip),%rdi
call   1030 <printf@plt>
lea    0xf97(%rip),%rdi
call   1030 <printf@plt>
lea    0xfc9(%rip),%rdi
call   1030 <printf@plt>
lea    0xffd(%rip),%rdi
call   1030 <printf@plt>
lea    0x1031(%rip),%rdi
call   1030 <printf@plt>
lea    0x1067(%rip),%rdi
call   1030 <printf@plt>
lea    0x1083(%rip),%rdi
call   1030 <printf@plt>
lea    0x10a7(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c3(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ee(%rip),%rdi
call   1030 <printf@plt>
lea    0x1119(%rip),%rdi
call   1030 <printf@plt>
lea    0x1115(%rip),%rdi
call   1030 <printf@plt>
lea    0x112e(%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    0xf19(%rip),%rdi
call   1030 <puts@plt>
lea    0xf18(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf46(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6e(%rip),%rdi
call   1030 <puts@plt>
lea    0xf94(%rip),%rdi
call   1030 <puts@plt>
lea    0xfc5(%rip),%rdi
call   1030 <puts@plt>
lea    0xff8(%rip),%rdi
call   1030 <puts@plt>
lea    0x102b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1060(%rip),%rdi
call   1030 <puts@plt>
lea    0x107b(%rip),%rdi
call   1030 <puts@plt>
lea    0x109e(%rip),%rdi
call   1030 <puts@plt>
lea    0x10b9(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e3(%rip),%rdi
call   1030 <puts@plt>
lea    0x110d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1108(%rip),%rdi
call   1030 <puts@plt>
lea    0x1120(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [62 x i8] c"==================== available commands ====================\0A\00"
@.str.1 = [12 x i8] c" ? (help)\0A\00"
@.str.2 = [48 x i8] c" provides information on available commands\0A\00"
@.str.3 = [24 x i8] c" r \22file_name\22 (read)\0A\00"
@.str.4 = [53 x i8] c" reads file of name \22file_name\22 into dj's system\0A\00"
@.str.5 = [51 x i8] c" s [-n <vertex>] [-c <vertex>] [-f] [-v] (stats)\0A\00"
@.str.6 = [62 x i8] c" [-n <vertex>] - prints all neighbors of specified vertex\0A\00"
@.str.7 = [64 x i8] c" - if no vertex present, prints all neighbors\0A\00"
@.str.8 = [64 x i8] c" [-c <vertex>] - prints all connections of specified vertex\0A\00"
@.str.9 = [66 x i8] c" - if no vertex present, prints all connections\0A\00"
@.str.10 = [40 x i8] c" [-f] - prints current working file\0A\00"
@.str.11 = [48 x i8] c" [-v] - prints all vertices in working file\0A\00"
@.str.12 = [40 x i8] c" c <vertex_1>, <vertex_2> (calculate)\0A\00"
@.str.13 = [55 x i8] c" displays shortest path between specified vertices\0A\00"
@.str.14 = [55 x i8] c" NOTE: the comma between vertex names is necessary\0A\00"
@.str.15 = [8 x i8] c" exit\0A\00"
@.str.16 = [37 x i8] c" terminates execution of program\0A\00"
@.str.17 = [62 x i8] c"============================================================\0A\00"
define void @help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 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 ([40 x i8], [40 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.17, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [61 x i8] c"==================== available commands ====================\00"
@str.18 = [11 x i8] c" ? (help)\00"
@str.19 = [47 x i8] c" provides information on available commands\00"
@str.20 = [23 x i8] c" r \22file_name\22 (read)\00"
@str.21 = [52 x i8] c" reads file of name \22file_name\22 into dj's system\00"
@str.22 = [50 x i8] c" s [-n <vertex>] [-c <vertex>] [-f] [-v] (stats)\00"
@str.23 = [61 x i8] c" [-n <vertex>] - prints all neighbors of specified vertex\00"
@str.24 = [63 x i8] c" - if no vertex present, prints all neighbors\00"
@str.25 = [63 x i8] c" [-c <vertex>] - prints all connections of specified vertex\00"
@str.26 = [65 x i8] c" - if no vertex present, prints all connections\00"
@str.27 = [39 x i8] c" [-f] - prints current working file\00"
@str.28 = [47 x i8] c" [-v] - prints all vertices in working file\00"
@str.29 = [39 x i8] c" c <vertex_1>, <vertex_2> (calculate)\00"
@str.30 = [54 x i8] c" displays shortest path between specified vertices\00"
@str.31 = [54 x i8] c" NOTE: the comma between vertex names is necessary\00"
@str.32 = [7 x i8] c" exit\00"
@str.33 = [36 x i8] c" terminates execution of program\00"
@str.34 = [61 x i8] c"============================================================\00"
define void @help() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.18, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.19, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.20, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.21, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.22, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.23, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.24, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.25, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.26, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.27, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([47 x i8], [47 x i8]* @str.28, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.29, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.30, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.31, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @str.32, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.33, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.34, i64 0, i64 0))
ret void
}