#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 showSucess(int id) {
  switch (id) {
  case 0: {
    printf("\nWell! Node added with successfully!\n");
    break;
  }
  case 1: {
    printf("\nGood! Node removed with successfully!\n");
    break;
  }
  case 2: {
    printf("\nHahaha! The list it is free now!\n");
    break;
  }
  }
  return;
}


x86 assembly (clang, -O0):
<showSucess>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %edi,-0x4(%rbp)
mov    -0x4(%rbp),%eax
mov    %eax,-0x8(%rbp)
test   %eax,%eax
je     1150 <showSucess+0x40>
jmp    112e <showSucess+0x1e>
mov    -0x8(%rbp),%eax
sub    $0x1,%eax
je     1161 <showSucess+0x51>
jmp    113f <showSucess+0x2f>
mov    -0x8(%rbp),%eax
sub    $0x2,%eax
je     1172 <showSucess+0x62>
jmp    117e <showSucess+0x6e>
lea    0xea9(%rip),%rdi
call   1030 <printf@plt>
jmp    117e <showSucess+0x6e>
lea    0xebe(%rip),%rdi
call   1030 <printf@plt>
jmp    117e <showSucess+0x6e>
lea    0xed5(%rip),%rdi
call   1030 <printf@plt>
add    $0x10,%rsp
pop    %rbp
ret

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

LLVM IR (-O0):
@.str = [38 x i8] c"\0AWell! Node added with successfully!\0A\00"
@.str.1 = [40 x i8] c"\0AGood! Node removed with successfully!\0A\00"
@.str.2 = [35 x i8] c"\0AHahaha! The list it is free now!\0A\00"
define void @showSucess(i32 %0) {
%2 = alloca i32
store i32 %0, i32* %2
%3 = load i32, i32* %2
switch i32 %3, label %10 [
i32 0, label %4
i32 1, label %6
i32 2, label %8
]
4: ; preds = %1
%5 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str, i64 0, i64 0))
br label %10
6: ; preds = %1
%7 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.1, i64 0, i64 0))
br label %10
8: ; preds = %1
%9 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.2, i64 0, i64 0))
br label %10
10: ; preds = %1, %8, %6, %4
ret void
}

LLVM IR (-O2):
@str = [34 x i8] c"\0AHahaha! The list it is free now!\00"
@str.3 = [39 x i8] c"\0AGood! Node removed with successfully!\00"
@str.4 = [37 x i8] c"\0AWell! Node added with successfully!\00"
@reltable.showSucess = [3 x i32] [i32 trunc (i64 sub (i64 ptrtoint ([37 x i8]* @str.4 to i64), i64 ptrtoint ([3 x i32]* @reltable.showSucess to i64)) to i32), i32 trunc (i64 sub (i64 ptrtoint ([39 x i8]* @str.3 to i64), i64 ptrtoint ([3 x i32]* @reltable.showSucess to i64)) to i32), i32 trunc (i64 sub (i64 ptrtoint ([34 x i8]* @str to i64), i64 ptrtoint ([3 x i32]* @reltable.showSucess to i64)) to i32)]
define void @showSucess(i32 %0) {
%2 = icmp ult i32 %0, 3
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 ([3 x i32]* @reltable.showSucess to i8*), i64 %5)
%7 = tail call i32 @puts(i8* dereferenceable(1) %6)
br label %8
8: ; preds = %1, %3
ret void
}