#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 greet() {
  printf("***************************************************************\n");
  printf("Welcome to dj, a Dijkstra's algorithm shortest path calculator.\n");
  printf("Designed and built by Kevin Rose, March 2012.\n");
  printf("Type \"help\" or \"?\" for instructions.\n");
  printf("Type \"exit\" to exit.\n");
}


x86 assembly (clang, -O0):
<greet>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf1a(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4f(%rip),%rdi
call   1030 <printf@plt>
lea    0xf72(%rip),%rdi
call   1030 <printf@plt>
lea    0xf8c(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<greet>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf1c(%rip),%rdi
call   1030 <puts@plt>
lea    0xf50(%rip),%rdi
call   1030 <puts@plt>
lea    0xf72(%rip),%rdi
call   1030 <puts@plt>
lea    0xf8b(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [65 x i8] c"***************************************************************\0A\00"
@.str.1 = [65 x i8] c"Welcome to dj, a Dijkstra's algorithm shortest path calculator.\0A\00"
@.str.2 = [47 x i8] c"Designed and built by Kevin Rose, March 2012.\0A\00"
@.str.3 = [38 x i8] c"Type \22help\22 or \22?\22 for instructions.\0A\00"
@.str.4 = [22 x i8] c"Type \22exit\22 to exit.\0A\00"
define void @greet() {
%1 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.4, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [64 x i8] c"***************************************************************\00"
@str.5 = [64 x i8] c"Welcome to dj, a Dijkstra's algorithm shortest path calculator.\00"
@str.6 = [46 x i8] c"Designed and built by Kevin Rose, March 2012.\00"
@str.7 = [37 x i8] c"Type \22help\22 or \22?\22 for instructions.\00"
@str.8 = [21 x i8] c"Type \22exit\22 to exit.\00"
define void @greet() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.5, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.6, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.7, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @str.8, i64 0, i64 0))
ret void
}