#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_array_add();
int /*<<< orphan*/ test_array_clone();
int /*<<< orphan*/ test_array_contains();
int /*<<< orphan*/ test_array_delete();
int /*<<< orphan*/ test_array_get();
int /*<<< orphan*/ test_array_map();
int /*<<< orphan*/ test_array_set();
int /*<<< orphan*/ test_hashmap();
int /*<<< orphan*/ test_hashmap_delete();
int /*<<< orphan*/ test_hashmap_get();
int /*<<< orphan*/ test_hashmap_keys();
int /*<<< orphan*/ test_hashmap_size();
int /*<<< orphan*/ test_hashmap_str();
int /*<<< orphan*/ test_hashmap_str_str();
int /*<<< orphan*/ test_hashmap_update();
int /*<<< orphan*/ test_list_delete();
int /*<<< orphan*/ test_list_empty();
int /*<<< orphan*/ test_list_pop_back();
int /*<<< orphan*/ test_list_pop_empty();
int /*<<< orphan*/ test_list_push();
int /*<<< orphan*/ test_list_push_back();
int /*<<< orphan*/ test_list_reverse();
int /*<<< orphan*/ test_tree();
int /*<<< orphan*/ test_tree_contains();
int /*<<< orphan*/ test_tree_delete();
void test_containers() {
  printf("\n");
  printf("###########################\n");
  printf("### Testing containers/ ###\n");
  printf("###########################\n");
  printf("\n~~~ Testing List ~~~\n");
  test_list_push();
  test_list_push_back();
  test_list_pop_back();
  test_list_empty();
  test_list_pop_empty();
  test_list_delete();
  test_list_reverse();
  printf("\n~~~ Testing Array ~~~\n");
  test_array_set();
  test_array_get();
  test_array_add();
  test_array_map();
  test_array_delete();
  test_array_contains();
  test_array_clone();
  printf("\n~~~ Testing HashMap ~~~\n");
  test_hashmap();
  test_hashmap_get();
  test_hashmap_update();
  test_hashmap_str_str();
  test_hashmap_delete();
  test_hashmap_size();
  test_hashmap_keys();
  test_hashmap_str();
  printf("\n~~~ Testing Tree ~~~\n");
  test_tree();
  test_tree_contains();
  test_tree_delete();
}


x86 assembly (clang, -O0):
<test_containers>:
push   %rbp
mov    %rsp,%rbp
lea    0xd8d(%rip),%rdi
call   1060 <printf@plt>
lea    0xd49(%rip),%rdi
call   1060 <printf@plt>
lea    0xd5a(%rip),%rdi
call   1060 <printf@plt>
lea    0xd31(%rip),%rdi
call   1060 <printf@plt>
lea    0xd5f(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1080 <test_list_push@plt>
mov    $0x0,%al
call   10e0 <test_list_push_back@plt>
mov    $0x0,%al
call   1180 <test_list_pop_back@plt>
mov    $0x0,%al
call   11a0 <test_list_empty@plt>
mov    $0x0,%al
call   10d0 <test_list_pop_empty@plt>
mov    $0x0,%al
call   1040 <test_list_delete@plt>
mov    $0x0,%al
call   1120 <test_list_reverse@plt>
lea    0xd39(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1090 <test_array_set@plt>
mov    $0x0,%al
call   10c0 <test_array_get@plt>
mov    $0x0,%al
call   1070 <test_array_add@plt>
mov    $0x0,%al
call   1130 <test_array_map@plt>
mov    $0x0,%al
call   1160 <test_array_delete@plt>
mov    $0x0,%al
call   1030 <test_array_contains@plt>
mov    $0x0,%al
call   11c0 <test_array_clone@plt>
lea    0xd14(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   1170 <test_hashmap@plt>
mov    $0x0,%al
call   1140 <test_hashmap_get@plt>
mov    $0x0,%al
call   1190 <test_hashmap_update@plt>
mov    $0x0,%al
call   10a0 <test_hashmap_str_str@plt>
mov    $0x0,%al
call   10f0 <test_hashmap_delete@plt>
mov    $0x0,%al
call   1050 <test_hashmap_size@plt>
mov    $0x0,%al
call   10b0 <test_hashmap_keys@plt>
mov    $0x0,%al
call   1100 <test_hashmap_str@plt>
lea    0xcea(%rip),%rdi
call   1060 <printf@plt>
mov    $0x0,%al
call   11b0 <test_tree@plt>
mov    $0x0,%al
call   1110 <test_tree_contains@plt>
mov    $0x0,%al
call   1150 <test_tree_delete@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_containers>:
push   %rbx
mov    $0xa,%edi
call   1050 <putchar@plt>
lea    0xd5a(%rip),%rbx
mov    %rbx,%rdi
call   1070 <puts@plt>
lea    0xd2f(%rip),%rdi
call   1070 <puts@plt>
mov    %rbx,%rdi
call   1070 <puts@plt>
lea    0xd53(%rip),%rdi
call   1070 <puts@plt>
xor    %eax,%eax
call   1090 <test_list_push@plt>
xor    %eax,%eax
call   10f0 <test_list_push_back@plt>
xor    %eax,%eax
call   1190 <test_list_pop_back@plt>
xor    %eax,%eax
call   11b0 <test_list_empty@plt>
xor    %eax,%eax
call   10e0 <test_list_pop_empty@plt>
xor    %eax,%eax
call   1040 <test_list_delete@plt>
xor    %eax,%eax
call   1130 <test_list_reverse@plt>
lea    0xd2c(%rip),%rdi
call   1070 <puts@plt>
xor    %eax,%eax
call   10a0 <test_array_set@plt>
xor    %eax,%eax
call   10d0 <test_array_get@plt>
xor    %eax,%eax
call   1080 <test_array_add@plt>
xor    %eax,%eax
call   1140 <test_array_map@plt>
xor    %eax,%eax
call   1170 <test_array_delete@plt>
xor    %eax,%eax
call   1030 <test_array_contains@plt>
xor    %eax,%eax
call   11d0 <test_array_clone@plt>
lea    0xd06(%rip),%rdi
call   1070 <puts@plt>
xor    %eax,%eax
call   1180 <test_hashmap@plt>
xor    %eax,%eax
call   1150 <test_hashmap_get@plt>
xor    %eax,%eax
call   11a0 <test_hashmap_update@plt>
xor    %eax,%eax
call   10b0 <test_hashmap_str_str@plt>
xor    %eax,%eax
call   1100 <test_hashmap_delete@plt>
xor    %eax,%eax
call   1060 <test_hashmap_size@plt>
xor    %eax,%eax
call   10c0 <test_hashmap_keys@plt>
xor    %eax,%eax
call   1110 <test_hashmap_str@plt>
lea    0xcdb(%rip),%rdi
call   1070 <puts@plt>
xor    %eax,%eax
call   11c0 <test_tree@plt>
xor    %eax,%eax
call   1120 <test_tree_contains@plt>
xor    %eax,%eax
pop    %rbx
jmp    1160 <test_tree_delete@plt>

LLVM IR (-O0):
@.str = [2 x i8] c"\0A\00"
@.str.1 = [29 x i8] c"###########################\0A\00"
@.str.2 = [29 x i8] c"### Testing containers/ ###\0A\00"
@.str.3 = [23 x i8] c"\0A~~~ Testing List ~~~\0A\00"
@.str.4 = [24 x i8] c"\0A~~~ Testing Array ~~~\0A\00"
@.str.5 = [26 x i8] c"\0A~~~ Testing HashMap ~~~\0A\00"
@.str.6 = [23 x i8] c"\0A~~~ Testing Tree ~~~\0A\00"
define void @test_containers() {
%1 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 (...) @test_list_push()
%7 = call i32 (...) @test_list_push_back()
%8 = call i32 (...) @test_list_pop_back()
%9 = call i32 (...) @test_list_empty()
%10 = call i32 (...) @test_list_pop_empty()
%11 = call i32 (...) @test_list_delete()
%12 = call i32 (...) @test_list_reverse()
%13 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.4, i64 0, i64 0))
%14 = call i32 (...) @test_array_set()
%15 = call i32 (...) @test_array_get()
%16 = call i32 (...) @test_array_add()
%17 = call i32 (...) @test_array_map()
%18 = call i32 (...) @test_array_delete()
%19 = call i32 (...) @test_array_contains()
%20 = call i32 (...) @test_array_clone()
%21 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.5, i64 0, i64 0))
%22 = call i32 (...) @test_hashmap()
%23 = call i32 (...) @test_hashmap_get()
%24 = call i32 (...) @test_hashmap_update()
%25 = call i32 (...) @test_hashmap_str_str()
%26 = call i32 (...) @test_hashmap_delete()
%27 = call i32 (...) @test_hashmap_size()
%28 = call i32 (...) @test_hashmap_keys()
%29 = call i32 (...) @test_hashmap_str()
%30 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.6, i64 0, i64 0))
%31 = call i32 (...) @test_tree()
%32 = call i32 (...) @test_tree_contains()
%33 = call i32 (...) @test_tree_delete()
ret void
}

LLVM IR (-O2):
@str.7 = [28 x i8] c"### Testing containers/ ###\00"
@str.8 = [28 x i8] c"###########################\00"
@str.9 = [22 x i8] c"\0A~~~ Testing List ~~~\00"
@str.10 = [23 x i8] c"\0A~~~ Testing Array ~~~\00"
@str.11 = [25 x i8] c"\0A~~~ Testing HashMap ~~~\00"
@str.12 = [22 x i8] c"\0A~~~ Testing Tree ~~~\00"
define void @test_containers() {
%1 = tail call i32 @putchar(i32 10)
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.8, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.7, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.8, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.9, i64 0, i64 0))
%6 = tail call i32 (...) @test_list_push()
%7 = tail call i32 (...) @test_list_push_back()
%8 = tail call i32 (...) @test_list_pop_back()
%9 = tail call i32 (...) @test_list_empty()
%10 = tail call i32 (...) @test_list_pop_empty()
%11 = tail call i32 (...) @test_list_delete()
%12 = tail call i32 (...) @test_list_reverse()
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.10, i64 0, i64 0))
%14 = tail call i32 (...) @test_array_set()
%15 = tail call i32 (...) @test_array_get()
%16 = tail call i32 (...) @test_array_add()
%17 = tail call i32 (...) @test_array_map()
%18 = tail call i32 (...) @test_array_delete()
%19 = tail call i32 (...) @test_array_contains()
%20 = tail call i32 (...) @test_array_clone()
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.11, i64 0, i64 0))
%22 = tail call i32 (...) @test_hashmap()
%23 = tail call i32 (...) @test_hashmap_get()
%24 = tail call i32 (...) @test_hashmap_update()
%25 = tail call i32 (...) @test_hashmap_str_str()
%26 = tail call i32 (...) @test_hashmap_delete()
%27 = tail call i32 (...) @test_hashmap_size()
%28 = tail call i32 (...) @test_hashmap_keys()
%29 = tail call i32 (...) @test_hashmap_str()
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.12, i64 0, i64 0))
%31 = tail call i32 (...) @test_tree()
%32 = tail call i32 (...) @test_tree_contains()
%33 = tail call i32 (...) @test_tree_delete()
ret void
}