#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*/ TEST_shoud_be_a_circular_list();
int /*<<< orphan*/ TEST_shoud_not_be_a_circular_list();
int /*<<< orphan*/ TEST_should_add_node_at_beginning_of_list();
int /*<<< orphan*/ TEST_should_add_node_at_end_of_list();
int /*<<< orphan*/ TEST_should_add_node_at_mid_of_list();
int /*<<< orphan*/ TEST_should_delete_all_occurences_on_a_number();
int /*<<< orphan*/ TEST_should_delete_numbers_first_occurence();
int /*<<< orphan*/ TEST_should_find_number_in_list();
int /*<<< orphan*/ TEST_should_make_a_circular_list_acircular();
int /*<<< orphan*/ TEST_should_not_find_number_in_list();
int /*<<< orphan*/ TEST_should_setup_and_confim_via_printing();
int /*<<< orphan*/ TEST_stack_should_be_reverse_of_the_list();
int /*<<< orphan*/ printf(char *, int);
void fireTests() {
  printf("\n\nFiring test %d\n", 1);
  TEST_should_setup_and_confim_via_printing();
  printf("\n\nFiring test %d\n", 2);
  TEST_should_find_number_in_list();
  printf("\n\nFiring test %d\n", 3);
  TEST_should_delete_numbers_first_occurence();
  printf("\n\nFiring test %d\n", 4);
  TEST_should_delete_all_occurences_on_a_number();
  printf("\n\nFiring test %d\n", 5);
  TEST_shoud_not_be_a_circular_list();
  printf("\n\nFiring test %d\n", 6);
  TEST_shoud_be_a_circular_list();
  printf("\n\nFiring test %d\n", 7);
  TEST_should_not_find_number_in_list();
  printf("\n\nFiring test %d\n", 8);
  TEST_stack_should_be_reverse_of_the_list();
  printf("\n\nFiring test %d\n", 9);
  TEST_should_make_a_circular_list_acircular();
  printf("\n\nFiring test %d\n", 10);
  TEST_should_add_node_at_beginning_of_list();
  printf("\n\nFiring test %d\n", 11);
  TEST_should_add_node_at_mid_of_list();
  printf("\n\nFiring test %d\n", 12);
  TEST_should_add_node_at_end_of_list();
}


x86 assembly (clang, -O0):
<fireTests>:
push   %rbp
mov    %rsp,%rbp
lea    0xe25(%rip),%rdi
mov    $0x1,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10b0 <TEST_should_setup_and_confim_via_printing@plt>
lea    0xe0d(%rip),%rdi
mov    $0x2,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10c0 <TEST_should_find_number_in_list@plt>
lea    0xdf5(%rip),%rdi
mov    $0x3,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10e0 <TEST_should_delete_numbers_first_occurence@plt>
lea    0xddd(%rip),%rdi
mov    $0x4,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1060 <TEST_should_delete_all_occurences_on_a_number@plt>
lea    0xdc5(%rip),%rdi
mov    $0x5,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1090 <TEST_shoud_not_be_a_circular_list@plt>
lea    0xdad(%rip),%rdi
mov    $0x6,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10a0 <TEST_shoud_be_a_circular_list@plt>
lea    0xd95(%rip),%rdi
mov    $0x7,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1040 <TEST_should_not_find_number_in_list@plt>
lea    0xd7d(%rip),%rdi
mov    $0x8,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1070 <TEST_stack_should_be_reverse_of_the_list@plt>
lea    0xd65(%rip),%rdi
mov    $0x9,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1080 <TEST_should_make_a_circular_list_acircular@plt>
lea    0xd4d(%rip),%rdi
mov    $0xa,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10d0 <TEST_should_add_node_at_beginning_of_list@plt>
lea    0xd35(%rip),%rdi
mov    $0xb,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   1030 <TEST_should_add_node_at_mid_of_list@plt>
lea    0xd1d(%rip),%rdi
mov    $0xc,%esi
call   1050 <printf@plt>
mov    $0x0,%al
call   10f0 <TEST_should_add_node_at_end_of_list@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<fireTests>:
push   %rbx
lea    0xe28(%rip),%rbx
mov    %rbx,%rdi
mov    $0x1,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   10b0 <TEST_should_setup_and_confim_via_printing@plt>
mov    %rbx,%rdi
mov    $0x2,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   10c0 <TEST_should_find_number_in_list@plt>
mov    %rbx,%rdi
mov    $0x3,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   10e0 <TEST_should_delete_numbers_first_occurence@plt>
mov    %rbx,%rdi
mov    $0x4,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1060 <TEST_should_delete_all_occurences_on_a_number@plt>
mov    %rbx,%rdi
mov    $0x5,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1090 <TEST_shoud_not_be_a_circular_list@plt>
mov    %rbx,%rdi
mov    $0x6,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   10a0 <TEST_shoud_be_a_circular_list@plt>
mov    %rbx,%rdi
mov    $0x7,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1040 <TEST_should_not_find_number_in_list@plt>
mov    %rbx,%rdi
mov    $0x8,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1070 <TEST_stack_should_be_reverse_of_the_list@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1080 <TEST_should_make_a_circular_list_acircular@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   10d0 <TEST_should_add_node_at_beginning_of_list@plt>
mov    %rbx,%rdi
mov    $0xb,%esi
call   1050 <printf@plt>
xor    %eax,%eax
call   1030 <TEST_should_add_node_at_mid_of_list@plt>
mov    %rbx,%rdi
mov    $0xc,%esi
call   1050 <printf@plt>
xor    %eax,%eax
pop    %rbx
jmp    10f0 <TEST_should_add_node_at_end_of_list@plt>

LLVM IR (-O0):
@.str = [18 x i8] c"\0A\0AFiring test %d\0A\00"
define void @fireTests() {
%1 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 1)
%2 = call i32 (...) @TEST_should_setup_and_confim_via_printing()
%3 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 2)
%4 = call i32 (...) @TEST_should_find_number_in_list()
%5 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 3)
%6 = call i32 (...) @TEST_should_delete_numbers_first_occurence()
%7 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 4)
%8 = call i32 (...) @TEST_should_delete_all_occurences_on_a_number()
%9 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 5)
%10 = call i32 (...) @TEST_shoud_not_be_a_circular_list()
%11 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 6)
%12 = call i32 (...) @TEST_shoud_be_a_circular_list()
%13 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 7)
%14 = call i32 (...) @TEST_should_not_find_number_in_list()
%15 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 8)
%16 = call i32 (...) @TEST_stack_should_be_reverse_of_the_list()
%17 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 9)
%18 = call i32 (...) @TEST_should_make_a_circular_list_acircular()
%19 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 10)
%20 = call i32 (...) @TEST_should_add_node_at_beginning_of_list()
%21 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 11)
%22 = call i32 (...) @TEST_should_add_node_at_mid_of_list()
%23 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 12)
%24 = call i32 (...) @TEST_should_add_node_at_end_of_list()
ret void
}

LLVM IR (-O2):
@.str = [18 x i8] c"\0A\0AFiring test %d\0A\00"
define void @fireTests() {
%1 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 1)
%2 = tail call i32 (...) @TEST_should_setup_and_confim_via_printing()
%3 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 2)
%4 = tail call i32 (...) @TEST_should_find_number_in_list()
%5 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 3)
%6 = tail call i32 (...) @TEST_should_delete_numbers_first_occurence()
%7 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 4)
%8 = tail call i32 (...) @TEST_should_delete_all_occurences_on_a_number()
%9 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 5)
%10 = tail call i32 (...) @TEST_shoud_not_be_a_circular_list()
%11 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 6)
%12 = tail call i32 (...) @TEST_shoud_be_a_circular_list()
%13 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 7)
%14 = tail call i32 (...) @TEST_should_not_find_number_in_list()
%15 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 8)
%16 = tail call i32 (...) @TEST_stack_should_be_reverse_of_the_list()
%17 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 9)
%18 = tail call i32 (...) @TEST_should_make_a_circular_list_acircular()
%19 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 10)
%20 = tail call i32 (...) @TEST_should_add_node_at_beginning_of_list()
%21 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 11)
%22 = tail call i32 (...) @TEST_should_add_node_at_mid_of_list()
%23 = tail call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str, i64 0, i64 0), i32 12)
%24 = tail call i32 (...) @TEST_should_add_node_at_end_of_list()
ret void
}