#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 */
struct linkedList {
  int dummy;
};

/* Variables and functions */
int /*<<< orphan*/ printList(struct linkedList *);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ removeFrontList(struct linkedList *);
void removeFrontListTest(struct linkedList *lst) {
  printf("\n\nTesting removeFrontList...\nCalling removeFrontList(lst)\n");
  removeFrontList(lst);
  printf("The list content should be: [2]\n");
  printf("Call printList function...\n");
  printList(lst);
  printf("\n\nCalling removeFrontList(lst)\n");
  removeFrontList(lst);
  printf("The list content should be empty.\n");
  printf("Call printList function...\n");
  printList(lst);
}


x86 assembly (clang, -O0):
<removeFrontListTest>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
lea    0xebd(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1040 <removeFrontList@plt>
lea    0xee3(%rip),%rdi
call   1030 <printf@plt>
lea    0xef8(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1050 <printList@plt>
lea    0xeff(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1040 <removeFrontList@plt>
lea    0xf0a(%rip),%rdi
call   1030 <printf@plt>
lea    0xec2(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1050 <printList@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<removeFrontListTest>:
push   %r14
push   %rbx
push   %rax
mov    %rdi,%rbx
lea    0xec2(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1040 <removeFrontList@plt>
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3d(%rip),%r14
mov    %r14,%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1050 <printList@plt>
lea    0xee5(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1040 <removeFrontList@plt>
lea    0xef0(%rip),%rdi
call   1030 <puts@plt>
mov    %r14,%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
add    $0x8,%rsp
pop    %rbx
pop    %r14
jmp    1050 <printList@plt>

LLVM IR (-O0):
%struct.linkedList = type { i32 }
@.str = [59 x i8] c"\0A\0ATesting removeFrontList...\0ACalling removeFrontList(lst)\0A\00"
@.str.1 = [33 x i8] c"The list content should be: [2]\0A\00"
@.str.2 = [28 x i8] c"Call printList function...\0A\00"
@.str.3 = [32 x i8] c"\0A\0ACalling removeFrontList(lst)\0A\00"
@.str.4 = [35 x i8] c"The list content should be empty.\0A\00"
define void @removeFrontListTest(%struct.linkedList* %0) {
%2 = alloca %struct.linkedList*
store %struct.linkedList* %0, %struct.linkedList** %2
%3 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str, i64 0, i64 0))
%4 = load %struct.linkedList*, %struct.linkedList** %2
%5 = call i32 @removeFrontList(%struct.linkedList* %4)
%6 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.1, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.2, i64 0, i64 0))
%8 = load %struct.linkedList*, %struct.linkedList** %2
%9 = call i32 @printList(%struct.linkedList* %8)
%10 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.3, i64 0, i64 0))
%11 = load %struct.linkedList*, %struct.linkedList** %2
%12 = call i32 @removeFrontList(%struct.linkedList* %11)
%13 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.4, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.2, i64 0, i64 0))
%15 = load %struct.linkedList*, %struct.linkedList** %2
%16 = call i32 @printList(%struct.linkedList* %15)
ret void
}

LLVM IR (-O2):
%struct.linkedList = type { i32 }
@str = [58 x i8] c"\0A\0ATesting removeFrontList...\0ACalling removeFrontList(lst)\00"
@str.5 = [32 x i8] c"The list content should be: [2]\00"
@str.7 = [31 x i8] c"\0A\0ACalling removeFrontList(lst)\00"
@str.8 = [34 x i8] c"The list content should be empty.\00"
@str.9 = [27 x i8] c"Call printList function...\00"
define void @removeFrontListTest(%struct.linkedList* %0) {
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @removeFrontList(%struct.linkedList* %0)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.5, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.9, i64 0, i64 0))
%6 = tail call i32 @printList(%struct.linkedList* %0)
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.7, i64 0, i64 0))
%8 = tail call i32 @removeFrontList(%struct.linkedList* %0)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.8, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.9, i64 0, i64 0))
%11 = tail call i32 @printList(%struct.linkedList* %0)
ret void
}