#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_dlist();
int /*<<< orphan*/ test_many_expressions();
int /*<<< orphan*/ test_stack();
int /*<<< orphan*/ test_tree();
int main(int argc, char *argv[]) {
  test_dlist();
  printf("dlist complete\n");
  test_tree();
  printf("tree complete\n");
  test_stack();
  printf("stack complete\n");
  test_many_expressions();
  printf("expressions complete\n");
  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)
mov    $0x0,%al
call   1050 <test_dlist@plt>
lea    0xe8c(%rip),%rdi
call   1040 <printf@plt>
mov    $0x0,%al
call   1070 <test_tree@plt>
lea    0xe89(%rip),%rdi
call   1040 <printf@plt>
mov    $0x0,%al
call   1060 <test_stack@plt>
lea    0xe85(%rip),%rdi
call   1040 <printf@plt>
mov    $0x0,%al
call   1030 <test_many_expressions@plt>
lea    0xe82(%rip),%rdi
call   1040 <printf@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
xor    %eax,%eax
call   1050 <test_dlist@plt>
lea    0xea1(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1070 <test_tree@plt>
lea    0xe9d(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1060 <test_stack@plt>
lea    0xe98(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
call   1030 <test_many_expressions@plt>
lea    0xe94(%rip),%rdi
call   1040 <puts@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [16 x i8] c"dlist complete\0A\00"
@.str.1 = [15 x i8] c"tree complete\0A\00"
@.str.2 = [16 x i8] c"stack complete\0A\00"
@.str.3 = [22 x i8] c"expressions complete\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 (...) @test_dlist()
%7 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str, i64 0, i64 0))
%8 = call i32 (...) @test_tree()
%9 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.1, i64 0, i64 0))
%10 = call i32 (...) @test_stack()
%11 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.2, i64 0, i64 0))
%12 = call i32 (...) @test_many_expressions()
%13 = call i32 @printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str.3, i64 0, i64 0))
ret i32 0
}

LLVM IR (-O2):
@str = [15 x i8] c"dlist complete\00"
@str.4 = [14 x i8] c"tree complete\00"
@str.5 = [15 x i8] c"stack complete\00"
@str.6 = [21 x i8] c"expressions complete\00"
define i32 @main(i32 %0, i8** nocapture readnone %1) {
%3 = tail call i32 (...) @test_dlist()
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str, i64 0, i64 0))
%5 = tail call i32 (...) @test_tree()
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.4, i64 0, i64 0))
%7 = tail call i32 (...) @test_stack()
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.5, i64 0, i64 0))
%9 = tail call i32 (...) @test_many_expressions()
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @str.6, i64 0, i64 0))
ret i32 0
}