#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 *);
instructions() {
  printf("\n\n\n\nWelcome to Paranoia!\n\n");
  printf("HOW TO PLAY:\n\n");
  printf("  Just press <RETURN> until you are asked to make a choice.\n");
  printf("  Select 'a' or 'b' or whatever for your choice, then press "
         "<RETURN>.\n");
  printf("  You may select 'p' at any time to get a display of your "
         "statistics.\n");
  printf("  Always choose the least dangerous option.  Continue doing this "
         "until you win.\n");
  printf("  At times you will use a skill or engage in combat and and will be "
         "informed of\n");
  printf("  the outcome.  These sections will be self explanatory.\n\n");
  printf("HOW TO DIE:\n\n");
  printf("  As Philo-R-DMD you will die at times during the adventure.\n");
  printf("  When this happens you will be given an new clone at a particular "
         "location.\n");
  printf("  The new Philo-R will usually have to retrace some of the old "
         "Philo-R\'s path;\n");
  printf("  hopefully he won\'t make the same mistake as his predecessor.\n\n");
  printf("HOW TO WIN:\n\n");
  printf("  Simply complete the mission before you expend all six clones.\n");
  printf("  If you make it, congratulations.\n");
  printf("  If not, you can try again later.\n");
}


x86 assembly (clang, -O0):
<instructions>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
lea    0xee1(%rip),%rdi
call   1030 <printf@plt>
lea    0xef0(%rip),%rdi
call   1030 <printf@plt>
lea    0xef3(%rip),%rdi
call   1030 <printf@plt>
lea    0xf24(%rip),%rdi
call   1030 <printf@plt>
lea    0xf5f(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9a(%rip),%rdi
call   1030 <printf@plt>
lea    0xfdf(%rip),%rdi
call   1030 <printf@plt>
lea    0x1024(%rip),%rdi
call   1030 <printf@plt>
lea    0x1053(%rip),%rdi
call   1030 <printf@plt>
lea    0x1055(%rip),%rdi
call   1030 <printf@plt>
lea    0x1087(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c9(%rip),%rdi
call   1030 <printf@plt>
lea    0x110d(%rip),%rdi
call   1030 <printf@plt>
lea    0x1142(%rip),%rdi
call   1030 <printf@plt>
lea    0x1144(%rip),%rdi
call   1030 <printf@plt>
lea    0x1179(%rip),%rdi
call   1030 <printf@plt>
lea    0x1191(%rip),%rdi
call   1030 <printf@plt>
mov    -0x4(%rbp),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<instructions>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xef6(%rip),%rdi
call   1030 <puts@plt>
lea    0xef8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf28(%rip),%rdi
call   1030 <puts@plt>
lea    0xf62(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9c(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe0(%rip),%rdi
call   1030 <puts@plt>
lea    0x1024(%rip),%rdi
call   1030 <puts@plt>
lea    0x1052(%rip),%rdi
call   1030 <puts@plt>
lea    0x1053(%rip),%rdi
call   1030 <puts@plt>
lea    0x1084(%rip),%rdi
call   1030 <puts@plt>
lea    0x10c5(%rip),%rdi
call   1030 <puts@plt>
lea    0x1108(%rip),%rdi
call   1030 <puts@plt>
lea    0x113c(%rip),%rdi
call   1030 <puts@plt>
lea    0x113d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1171(%rip),%rdi
call   1030 <puts@plt>
lea    0x1188(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [27 x i8] c"\0A\0A\0A\0AWelcome to Paranoia!\0A\0A\00"
@.str.1 = [15 x i8] c"HOW TO PLAY:\0A\0A\00"
@.str.2 = [61 x i8] c" Just press <RETURN> until you are asked to make a choice.\0A\00"
@.str.3 = [71 x i8] c" Select 'a' or 'b' or whatever for your choice, then press <RETURN>.\0A\00"
@.str.4 = [71 x i8] c" You may select 'p' at any time to get a display of your statistics.\0A\00"
@.str.5 = [81 x i8] c" Always choose the least dangerous option. Continue doing this until you win.\0A\00"
@.str.6 = [81 x i8] c" At times you will use a skill or engage in combat and and will be informed of\0A\00"
@.str.7 = [59 x i8] c" the outcome. These sections will be self explanatory.\0A\0A\00"
@.str.8 = [14 x i8] c"HOW TO DIE:\0A\0A\00"
@.str.9 = [62 x i8] c" As Philo-R-DMD you will die at times during the adventure.\0A\00"
@.str.10 = [78 x i8] c" When this happens you will be given an new clone at a particular location.\0A\00"
@.str.11 = [80 x i8] c" The new Philo-R will usually have to retrace some of the old Philo-R's path;\0A\00"
@.str.12 = [65 x i8] c" hopefully he won't make the same mistake as his predecessor.\0A\0A\00"
@.str.13 = [14 x i8] c"HOW TO WIN:\0A\0A\00"
@.str.14 = [65 x i8] c" Simply complete the mission before you expend all six clones.\0A\00"
@.str.15 = [36 x i8] c" If you make it, congratulations.\0A\00"
@.str.16 = [36 x i8] c" If not, you can try again later.\0A\00"
define i32 @instructions() {
%1 = alloca i32
%2 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.1, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.2, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.4, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.5, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.6, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.7, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.8, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.9, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.10, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.11, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.12, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.13, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.14, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.15, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.16, i64 0, i64 0))
%19 = load i32, i32* %1
ret i32 %19
}

LLVM IR (-O2):
@str = [26 x i8] c"\0A\0A\0A\0AWelcome to Paranoia!\0A\00"
@str.17 = [14 x i8] c"HOW TO PLAY:\0A\00"
@str.18 = [60 x i8] c" Just press <RETURN> until you are asked to make a choice.\00"
@str.19 = [70 x i8] c" Select 'a' or 'b' or whatever for your choice, then press <RETURN>.\00"
@str.20 = [70 x i8] c" You may select 'p' at any time to get a display of your statistics.\00"
@str.21 = [80 x i8] c" Always choose the least dangerous option. Continue doing this until you win.\00"
@str.22 = [80 x i8] c" At times you will use a skill or engage in combat and and will be informed of\00"
@str.23 = [58 x i8] c" the outcome. These sections will be self explanatory.\0A\00"
@str.24 = [13 x i8] c"HOW TO DIE:\0A\00"
@str.25 = [61 x i8] c" As Philo-R-DMD you will die at times during the adventure.\00"
@str.26 = [77 x i8] c" When this happens you will be given an new clone at a particular location.\00"
@str.27 = [79 x i8] c" The new Philo-R will usually have to retrace some of the old Philo-R's path;\00"
@str.28 = [64 x i8] c" hopefully he won't make the same mistake as his predecessor.\0A\00"
@str.29 = [13 x i8] c"HOW TO WIN:\0A\00"
@str.30 = [64 x i8] c" Simply complete the mission before you expend all six clones.\00"
@str.31 = [35 x i8] c" If you make it, congratulations.\00"
@str.32 = [35 x i8] c" If not, you can try again later.\00"
define i32 @instructions() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.17, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.18, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.19, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.20, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([80 x i8], [80 x i8]* @str.21, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([80 x i8], [80 x i8]* @str.22, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.23, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.24, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.25, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.26, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.27, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.28, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.29, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.30, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.31, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.32, i64 0, i64 0))
ret i32 undef
}