#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 choices() {
  printf("\nAvailable choices are\n\n");
  printf("1: \tTo insert/push into the queue.\n");
  printf("2: \tTo return the first inserted/pushed element from the queue and "
         "delete it.\n");
  printf("3: \tTo return the first inserted/pushed element into the queue "
         "without deleting it.\n");
  printf("4: \tTo find whether queue is empty or not.\n");
  printf("-1: \tTo exit.\n\n");
}


x86 assembly (clang, -O0):
<choices>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xef2(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0a(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4d(%rip),%rdi
call   1030 <printf@plt>
lea    0xf96(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb6(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<choices>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xef4(%rip),%rdi
call   1030 <puts@plt>
lea    0xf0b(%rip),%rdi
call   1030 <puts@plt>
lea    0xf4d(%rip),%rdi
call   1030 <puts@plt>
lea    0xf95(%rip),%rdi
call   1030 <puts@plt>
lea    0xfb4(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [25 x i8] c"\0AAvailable choices are\0A\0A\00"
@.str.1 = [36 x i8] c"1: \09To insert/push into the queue.\0A\00"
@.str.2 = [79 x i8] c"2: \09To return the first inserted/pushed element from the queue and delete it.\0A\00"
@.str.3 = [85 x i8] c"3: \09To return the first inserted/pushed element into the queue without deleting it.\0A\00"
@.str.4 = [44 x i8] c"4: \09To find whether queue is empty or not.\0A\00"
@.str.5 = [16 x i8] c"-1: \09To exit.\0A\0A\00"
define void @choices() {
%1 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([85 x i8], [85 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.5, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [24 x i8] c"\0AAvailable choices are\0A\00"
@str.6 = [35 x i8] c"1: \09To insert/push into the queue.\00"
@str.7 = [78 x i8] c"2: \09To return the first inserted/pushed element from the queue and delete it.\00"
@str.8 = [84 x i8] c"3: \09To return the first inserted/pushed element into the queue without deleting it.\00"
@str.9 = [43 x i8] c"4: \09To find whether queue is empty or not.\00"
@str.10 = [15 x i8] c"-1: \09To exit.\0A\00"
define void @choices() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.6, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.7, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([84 x i8], [84 x i8]* @str.8, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.9, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.10, i64 0, i64 0))
ret void
}