#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 showWarn(int id) {
  switch (id) {
  case 0: {
    printf("\nHey! The list is full.\n");
    break;
  }
  case 1: {
    printf("\nOps, the list is empty!\n");
    break;
  }
  case 2: {
    printf("\nSorry but this node not found :(\n");
    break;
  }
  case 3: {
    printf("\nHey this node already exists.\n");
    break;
  }
  }
  return;
}


x86 assembly (clang, -O0):
<showWarn>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %edi,-0x4(%rbp)
mov    -0x4(%rbp),%eax
mov    %rax,-0x10(%rbp)
sub    $0x3,%rax
ja     117f <showWarn+0x6f>
mov    -0x10(%rbp),%rax
lea    0xec9(%rip),%rcx
movslq (%rcx,%rax,4),%rax
add    %rcx,%rax
jmp    *%rax
lea    0xec9(%rip),%rdi
call   1030 <printf@plt>
jmp    117f <showWarn+0x6f>
lea    0xed1(%rip),%rdi
call   1030 <printf@plt>
jmp    117f <showWarn+0x6f>
lea    0xeda(%rip),%rdi
call   1030 <printf@plt>
jmp    117f <showWarn+0x6f>
lea    0xeec(%rip),%rdi
call   1030 <printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<showWarn>:
cmp    $0x3,%edi
ja     112b <showWarn+0x1b>
movslq %edi,%rax
lea    0xf55(%rip),%rcx
movslq (%rcx,%rax,4),%rdi
add    %rcx,%rdi
jmp    1030 <puts@plt>
ret

LLVM IR (-O0):
@.str = [25 x i8] c"\0AHey! The list is full.\0A\00"
@.str.1 = [26 x i8] c"\0AOps, the list is empty!\0A\00"
@.str.2 = [35 x i8] c"\0ASorry but this node not found :(\0A\00"
@.str.3 = [32 x i8] c"\0AHey this node already exists.\0A\00"
define void @showWarn(i32 %0) {
%2 = alloca i32
store i32 %0, i32* %2
%3 = load i32, i32* %2
switch i32 %3, label %12 [
i32 0, label %4
i32 1, label %6
i32 2, label %8
i32 3, label %10
]
4: ; preds = %1
%5 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str, i64 0, i64 0))
br label %12
6: ; preds = %1
%7 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.1, i64 0, i64 0))
br label %12
8: ; preds = %1
%9 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.2, i64 0, i64 0))
br label %12
10: ; preds = %1
%11 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.3, i64 0, i64 0))
br label %12
12: ; preds = %1, %10, %8, %6, %4
ret void
}

LLVM IR (-O2):
@str = [31 x i8] c"\0AHey this node already exists.\00"
@str.4 = [34 x i8] c"\0ASorry but this node not found :(\00"
@str.5 = [25 x i8] c"\0AOps, the list is empty!\00"
@str.6 = [24 x i8] c"\0AHey! The list is full.\00"
@reltable.showWarn = [4 x i32] [i32 trunc (i64 sub (i64 ptrtoint ([24 x i8]* @str.6 to i64), i64 ptrtoint ([4 x i32]* @reltable.showWarn to i64)) to i32), i32 trunc (i64 sub (i64 ptrtoint ([25 x i8]* @str.5 to i64), i64 ptrtoint ([4 x i32]* @reltable.showWarn to i64)) to i32), i32 trunc (i64 sub (i64 ptrtoint ([34 x i8]* @str.4 to i64), i64 ptrtoint ([4 x i32]* @reltable.showWarn to i64)) to i32), i32 trunc (i64 sub (i64 ptrtoint ([31 x i8]* @str to i64), i64 ptrtoint ([4 x i32]* @reltable.showWarn to i64)) to i32)]
define void @showWarn(i32 %0) {
%2 = icmp ult i32 %0, 4
br i1 %2, label %3, label %8
3: ; preds = %1
%4 = sext i32 %0 to i64
%5 = shl i64 %4, 2
%6 = call i8* @llvm.load.relative.i64(i8* bitcast ([4 x i32]* @reltable.showWarn to i8*), i64 %5)
%7 = tail call i32 @puts(i8* dereferenceable(1) %6)
br label %8
8: ; preds = %1, %3
ret void
}