#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*/ testAddNode();
int /*<<< orphan*/ testContainsBSTree();
int /*<<< orphan*/ testLeftMost();
int /*<<< orphan*/ testRemoveLeftMost();
int /*<<< orphan*/ testRemoveNode();
void test() {
  printf("testAddNode\n");
  testAddNode();
  printf("\n");
  printf("testContainsBSTree\n");
  testContainsBSTree();
  printf("\n");
  printf("testLeftMost\n");
  testLeftMost();
  printf("\n");
  printf("testRemoveLeftMost\n");
  testRemoveLeftMost();
  printf("\n");
  printf("testRemoveNode\n");
  testRemoveNode();
  printf("\n");
}


x86 assembly (clang, -O0):
<test>:
push   %rbp
mov    %rsp,%rbp
lea    0xe95(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1040 <testAddNode@plt>
lea    0xe8d(%rip),%rdi
call   1050 <printf@plt>
lea    0xe83(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1030 <testContainsBSTree@plt>
lea    0xe6e(%rip),%rdi
call   1050 <printf@plt>
lea    0xe78(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1070 <testLeftMost@plt>
lea    0xe4f(%rip),%rdi
call   1050 <printf@plt>
lea    0xe67(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1060 <testRemoveLeftMost@plt>
lea    0xe30(%rip),%rdi
call   1050 <printf@plt>
lea    0xe5c(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1080 <testRemoveNode@plt>
lea    0xe11(%rip),%rdi
call   1050 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<test>:
push   %rax
lea    0xe88(%rip),%rdi
call   1050 <puts@plt>
xor    %eax,%eax
call   1060 <testAddNode@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xe77(%rip),%rdi
call   1050 <puts@plt>
xor    %eax,%eax
call   1040 <testContainsBSTree@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xe6d(%rip),%rdi
call   1050 <puts@plt>
xor    %eax,%eax
call   1080 <testLeftMost@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xe5d(%rip),%rdi
call   1050 <puts@plt>
xor    %eax,%eax
call   1070 <testRemoveLeftMost@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xe53(%rip),%rdi
call   1050 <puts@plt>
xor    %eax,%eax
call   1090 <testRemoveNode@plt>
mov    $0xa,%edi
pop    %rax
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [13 x i8] c"testAddNode\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [20 x i8] c"testContainsBSTree\0A\00"
@.str.3 = [14 x i8] c"testLeftMost\0A\00"
@.str.4 = [20 x i8] c"testRemoveLeftMost\0A\00"
@.str.5 = [16 x i8] c"testRemoveNode\0A\00"
define void @test() {
%1 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str, i64 0, i64 0))
%2 = call i32 (...) @testAddNode()
%3 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.2, i64 0, i64 0))
%5 = call i32 (...) @testContainsBSTree()
%6 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.3, i64 0, i64 0))
%8 = call i32 (...) @testLeftMost()
%9 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.4, i64 0, i64 0))
%11 = call i32 (...) @testRemoveLeftMost()
%12 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.5, i64 0, i64 0))
%14 = call i32 (...) @testRemoveNode()
%15 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [12 x i8] c"testAddNode\00"
@str.6 = [19 x i8] c"testContainsBSTree\00"
@str.7 = [13 x i8] c"testLeftMost\00"
@str.8 = [19 x i8] c"testRemoveLeftMost\00"
@str.9 = [15 x i8] c"testRemoveNode\00"
define void @test() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 (...) @testAddNode()
%3 = tail call i32 @putchar(i32 10)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([19 x i8], [19 x i8]* @str.6, i64 0, i64 0))
%5 = tail call i32 (...) @testContainsBSTree()
%6 = tail call i32 @putchar(i32 10)
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.7, i64 0, i64 0))
%8 = tail call i32 (...) @testLeftMost()
%9 = tail call i32 @putchar(i32 10)
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([19 x i8], [19 x i8]* @str.8, i64 0, i64 0))
%11 = tail call i32 (...) @testRemoveLeftMost()
%12 = tail call i32 @putchar(i32 10)
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.9, i64 0, i64 0))
%14 = tail call i32 (...) @testRemoveNode()
%15 = tail call i32 @putchar(i32 10)
ret void
}