#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 *);
int /*<<< orphan*/ test_c_algorithms();
int /*<<< orphan*/ test_c_array();
int /*<<< orphan*/ test_c_deque();
int /*<<< orphan*/ test_c_map();
int /*<<< orphan*/ test_c_set();
int /*<<< orphan*/ test_c_slist();
int main(int argc, char **argv) {
  printf("Performing test for dynamic array\n");
  test_c_array();
  printf("Performing test for deque\n");
  test_c_deque();
  printf("Performing test for sets\n");
  test_c_set();
  printf("Performing test for map\n");
  test_c_map();
  printf("Performing test for slist\n");
  test_c_slist();
  printf("Performing algorithms tests\n");
  test_c_algorithms();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    %edi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
lea    0xe73(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1090 <test_c_array@plt>
lea    0xe83(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1080 <test_c_deque@plt>
lea    0xe8b(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1040 <test_c_set@plt>
lea    0xe92(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1070 <test_c_map@plt>
lea    0xe98(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1050 <test_c_slist@plt>
lea    0xea0(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1030 <test_c_algorithms@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xe88(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1090 <test_c_array@plt>
lea    0xe97(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1080 <test_c_deque@plt>
lea    0xe9e(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1050 <test_c_set@plt>
lea    0xea4(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1070 <test_c_map@plt>
lea    0xea9(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1060 <test_c_slist@plt>
lea    0xeb0(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1030 <test_c_algorithms@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [35 x i8] c"Performing test for dynamic array\0A\00"
@.str.1 = [27 x i8] c"Performing test for deque\0A\00"
@.str.2 = [26 x i8] c"Performing test for sets\0A\00"
@.str.3 = [25 x i8] c"Performing test for map\0A\00"
@.str.4 = [27 x i8] c"Performing test for slist\0A\00"
@.str.5 = [29 x i8] c"Performing algorithms tests\0A\00"
define i32 @main(i32 %0, i8** %1) {
%3 = alloca i32
%4 = alloca i32
%5 = alloca i8**
store i32 0, i32* %3
store i32 %0, i32* %4
store i8** %1, i8*** %5
%6 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0))
%7 = call i32 (...) @test_c_array()
%8 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.1, i64 0, i64 0))
%9 = call i32 (...) @test_c_deque()
%10 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.2, i64 0, i64 0))
%11 = call i32 (...) @test_c_set()
%12 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.3, i64 0, i64 0))
%13 = call i32 (...) @test_c_map()
%14 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.4, i64 0, i64 0))
%15 = call i32 (...) @test_c_slist()
%16 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.5, i64 0, i64 0))
%17 = call i32 (...) @test_c_algorithms()
ret i32 0
}

LLVM IR (-O2):
@str = [34 x i8] c"Performing test for dynamic array\00"
@str.6 = [26 x i8] c"Performing test for deque\00"
@str.7 = [25 x i8] c"Performing test for sets\00"
@str.8 = [24 x i8] c"Performing test for map\00"
@str.9 = [26 x i8] c"Performing test for slist\00"
@str.10 = [28 x i8] c"Performing algorithms tests\00"
define i32 @main(i32 %0, i8** nocapture readnone %1) {
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str, i64 0, i64 0))
%4 = tail call i32 (...) @test_c_array()
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.6, i64 0, i64 0))
%6 = tail call i32 (...) @test_c_deque()
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.7, i64 0, i64 0))
%8 = tail call i32 (...) @test_c_set()
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.8, i64 0, i64 0))
%10 = tail call i32 (...) @test_c_map()
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.9, i64 0, i64 0))
%12 = tail call i32 (...) @test_c_slist()
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.10, i64 0, i64 0))
%14 = tail call i32 (...) @test_c_algorithms()
ret i32 0
}