#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*/ addFrontList(struct linkedList *, int);
int /*<<< orphan*/ printList(struct linkedList *);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ removeBackList(struct linkedList *);
void removeBackListTest(struct linkedList *lst) {
  printf("\nTesting removeBackList...\n");
  printf("Add 3 to the front of the list...\n");
  addFrontList(lst, 3);
  printf("Add 4 to the front of the list...\n");
  addFrontList(lst, 4);
  printf("Add 10 to the front of the list...\n");
  addFrontList(lst, 10);
  printf("The list content should be: [10->4->3]\n");
  printList(lst);
  printf("\n\nCalling removeBackList(lst)\n");
  removeBackList(lst);
  printf("The list content should be: [10->4]\n");
  printList(lst);
  printf("\n\nCalling removeBackList(lst)\n");
  removeBackList(lst);
  printf("The list content should be: [10]\n");
  printList(lst);
  printf("\n\nCalling removeBackList(lst)\n");
  removeBackList(lst);
  printf("The list content should be empty!\n");
  printList(lst);
}


x86 assembly (clang, -O0):
<removeBackListTest>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %rdi,-0x8(%rbp)
lea    0xead(%rip),%rdi
call   1040 <printf@plt>
lea    0xebd(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
mov    $0x3,%esi
call   1050 <addFrontList@plt>
lea    0xec6(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
mov    $0x4,%esi
call   1050 <addFrontList@plt>
lea    0xecf(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
mov    $0xa,%esi
call   1050 <addFrontList@plt>
lea    0xed9(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1060 <printList@plt>
lea    0xeec(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1030 <removeBackList@plt>
lea    0xef6(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1060 <printList@plt>
lea    0xec2(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1030 <removeBackList@plt>
lea    0xef1(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1060 <printList@plt>
lea    0xe98(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1030 <removeBackList@plt>
lea    0xee9(%rip),%rdi
call   1040 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1060 <printList@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<removeBackListTest>:
push   %r14
push   %rbx
push   %rax
mov    %rdi,%rbx
lea    0xeb2(%rip),%rdi
call   1030 <puts@plt>
lea    0xec1(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    $0x3,%esi
call   1050 <addFrontList@plt>
lea    0xeca(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    $0x4,%esi
call   1050 <addFrontList@plt>
lea    0xed3(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1050 <addFrontList@plt>
lea    0xedd(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1060 <printList@plt>
lea    0xf35(%rip),%r14
mov    %r14,%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1040 <removeBackList@plt>
lea    0xed9(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1060 <printList@plt>
mov    %r14,%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1040 <removeBackList@plt>
lea    0xed9(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1060 <printList@plt>
mov    %r14,%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1040 <removeBackList@plt>
lea    0xef4(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
add    $0x8,%rsp
pop    %rbx
pop    %r14
jmp    1060 <printList@plt>

LLVM IR (-O0):
%struct.linkedList = type { i32 }
@.str = [28 x i8] c"\0ATesting removeBackList...\0A\00"
@.str.1 = [35 x i8] c"Add 3 to the front of the list...\0A\00"
@.str.2 = [35 x i8] c"Add 4 to the front of the list...\0A\00"
@.str.3 = [36 x i8] c"Add 10 to the front of the list...\0A\00"
@.str.4 = [40 x i8] c"The list content should be: [10->4->3]\0A\00"
@.str.5 = [31 x i8] c"\0A\0ACalling removeBackList(lst)\0A\00"
@.str.6 = [37 x i8] c"The list content should be: [10->4]\0A\00"
@.str.7 = [34 x i8] c"The list content should be: [10]\0A\00"
@.str.8 = [35 x i8] c"The list content should be empty!\0A\00"
define void @removeBackListTest(%struct.linkedList* %0) {
%2 = alloca %struct.linkedList*
store %struct.linkedList* %0, %struct.linkedList** %2
%3 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.1, i64 0, i64 0))
%5 = load %struct.linkedList*, %struct.linkedList** %2
%6 = call i32 @addFrontList(%struct.linkedList* %5, i32 3)
%7 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.2, i64 0, i64 0))
%8 = load %struct.linkedList*, %struct.linkedList** %2
%9 = call i32 @addFrontList(%struct.linkedList* %8, i32 4)
%10 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.3, i64 0, i64 0))
%11 = load %struct.linkedList*, %struct.linkedList** %2
%12 = call i32 @addFrontList(%struct.linkedList* %11, i32 10)
%13 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.4, i64 0, i64 0))
%14 = load %struct.linkedList*, %struct.linkedList** %2
%15 = call i32 @printList(%struct.linkedList* %14)
%16 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.5, i64 0, i64 0))
%17 = load %struct.linkedList*, %struct.linkedList** %2
%18 = call i32 @removeBackList(%struct.linkedList* %17)
%19 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.6, i64 0, i64 0))
%20 = load %struct.linkedList*, %struct.linkedList** %2
%21 = call i32 @printList(%struct.linkedList* %20)
%22 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.5, i64 0, i64 0))
%23 = load %struct.linkedList*, %struct.linkedList** %2
%24 = call i32 @removeBackList(%struct.linkedList* %23)
%25 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.7, i64 0, i64 0))
%26 = load %struct.linkedList*, %struct.linkedList** %2
%27 = call i32 @printList(%struct.linkedList* %26)
%28 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.5, i64 0, i64 0))
%29 = load %struct.linkedList*, %struct.linkedList** %2
%30 = call i32 @removeBackList(%struct.linkedList* %29)
%31 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.8, i64 0, i64 0))
%32 = load %struct.linkedList*, %struct.linkedList** %2
%33 = call i32 @printList(%struct.linkedList* %32)
ret void
}

LLVM IR (-O2):
%struct.linkedList = type { i32 }
@str = [27 x i8] c"\0ATesting removeBackList...\00"
@str.9 = [34 x i8] c"Add 3 to the front of the list...\00"
@str.10 = [34 x i8] c"Add 4 to the front of the list...\00"
@str.11 = [35 x i8] c"Add 10 to the front of the list...\00"
@str.12 = [39 x i8] c"The list content should be: [10->4->3]\00"
@str.14 = [36 x i8] c"The list content should be: [10->4]\00"
@str.16 = [33 x i8] c"The list content should be: [10]\00"
@str.17 = [30 x i8] c"\0A\0ACalling removeBackList(lst)\00"
@str.18 = [34 x i8] c"The list content should be empty!\00"
define void @removeBackListTest(%struct.linkedList* %0) {
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.9, i64 0, i64 0))
%4 = tail call i32 @addFrontList(%struct.linkedList* %0, i32 3)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.10, i64 0, i64 0))
%6 = tail call i32 @addFrontList(%struct.linkedList* %0, i32 4)
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.11, i64 0, i64 0))
%8 = tail call i32 @addFrontList(%struct.linkedList* %0, i32 10)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.12, i64 0, i64 0))
%10 = tail call i32 @printList(%struct.linkedList* %0)
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.17, i64 0, i64 0))
%12 = tail call i32 @removeBackList(%struct.linkedList* %0)
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.14, i64 0, i64 0))
%14 = tail call i32 @printList(%struct.linkedList* %0)
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.17, i64 0, i64 0))
%16 = tail call i32 @removeBackList(%struct.linkedList* %0)
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.16, i64 0, i64 0))
%18 = tail call i32 @printList(%struct.linkedList* %0)
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.17, i64 0, i64 0))
%20 = tail call i32 @removeBackList(%struct.linkedList* %0)
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.18, i64 0, i64 0))
%22 = tail call i32 @printList(%struct.linkedList* %0)
ret void
}