#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_heapify();
int /*<<< orphan*/ test_heapsort();
int /*<<< orphan*/ test_heapsort_all_equal();
int /*<<< orphan*/ test_heapsort_reverse_sorted();
int /*<<< orphan*/ test_heapsort_sorted();
int main() {
  int counter = 0;
  if (!test_heapify()) {
    printf("Heapify test failed!\n");
    counter++;
  }
  if (!test_heapsort_sorted()) {
    printf("Heapsort already sorted test failed!\n");
    counter++;
  }
  if (!test_heapsort_reverse_sorted()) {
    printf("Heapsort already reverse sorted test failed!\n");
    counter++;
  }
  if (!test_heapsort_all_equal()) {
    printf("Heapsort all elements equal test failed!\n");
    counter++;
  }
  if (!test_heapsort()) {
    printf("Heapsort test failed!\n");
    counter++;
  }
  printf("%d tests failed.\n", counter);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
movl   $0x0,-0x8(%rbp)
mov    $0x0,%al
call   1040 <test_heapify@plt>
cmp    $0x0,%eax
jne    119d <main+0x3d>
lea    0xe73(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1070 <test_heapsort_sorted@plt>
cmp    $0x0,%eax
jne    11c4 <main+0x64>
lea    0xe62(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1080 <test_heapsort_reverse_sorted@plt>
cmp    $0x0,%eax
jne    11eb <main+0x8b>
lea    0xe61(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1050 <test_heapsort_all_equal@plt>
cmp    $0x0,%eax
jne    1212 <main+0xb2>
lea    0xe68(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1060 <test_heapsort@plt>
cmp    $0x0,%eax
jne    1239 <main+0xd9>
lea    0xe6b(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    -0x8(%rbp),%esi
lea    0xe68(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x4(%rbp),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
xor    %ebx,%ebx
xor    %eax,%eax
call   1050 <test_heapify@plt>
test   %eax,%eax
jne    118f <main+0x1f>
lea    0xe8d(%rip),%rdi
call   1030 <puts@plt>
mov    $0x1,%ebx
xor    %eax,%eax
call   1080 <test_heapsort_sorted@plt>
test   %eax,%eax
jne    11a9 <main+0x39>
lea    0xe86(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1090 <test_heapsort_reverse_sorted@plt>
test   %eax,%eax
jne    11c3 <main+0x53>
lea    0xe91(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1060 <test_heapsort_all_equal@plt>
test   %eax,%eax
jne    11dd <main+0x6d>
lea    0xea4(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1070 <test_heapsort@plt>
test   %eax,%eax
jne    11f7 <main+0x87>
lea    0xeb3(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
lea    0xe02(%rip),%rdi
mov    %ebx,%esi
xor    %eax,%eax
call   1040 <printf@plt>
xor    %eax,%eax
pop    %rbx
ret

LLVM IR (-O0):
@.str = [22 x i8] c"Heapify test failed!\0A\00"
@.str.1 = [38 x i8] c"Heapsort already sorted test failed!\0A\00"
@.str.2 = [46 x i8] c"Heapsort already reverse sorted test failed!\0A\00"
@.str.3 = [42 x i8] c"Heapsort all elements equal test failed!\0A\00"
@.str.4 = [23 x i8] c"Heapsort test failed!\0A\00"
@.str.5 = [18 x i8] c"%d tests failed.\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
store i32 0, i32* %1
store i32 0, i32* %2
%3 = call i32 (...) @test_heapify()
%4 = icmp ne i32 %3, 0
br i1 %4, label %9, label %5
5: ; preds = %0
%6 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @.str, i64 0, i64 0))
%7 = load i32, i32* %2
%8 = add nsw i32 %7, 1
store i32 %8, i32* %2
br label %9
9: ; preds = %5, %0
%10 = call i32 (...) @test_heapsort_sorted()
%11 = icmp ne i32 %10, 0
br i1 %11, label %16, label %12
12: ; preds = %9
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.1, i64 0, i64 0))
%14 = load i32, i32* %2
%15 = add nsw i32 %14, 1
store i32 %15, i32* %2
br label %16
16: ; preds = %12, %9
%17 = call i32 (...) @test_heapsort_reverse_sorted()
%18 = icmp ne i32 %17, 0
br i1 %18, label %23, label %19
19: ; preds = %16
%20 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.2, i64 0, i64 0))
%21 = load i32, i32* %2
%22 = add nsw i32 %21, 1
store i32 %22, i32* %2
br label %23
23: ; preds = %19, %16
%24 = call i32 (...) @test_heapsort_all_equal()
%25 = icmp ne i32 %24, 0
br i1 %25, label %30, label %26
26: ; preds = %23
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.3, i64 0, i64 0))
%28 = load i32, i32* %2
%29 = add nsw i32 %28, 1
store i32 %29, i32* %2
br label %30
30: ; preds = %26, %23
%31 = call i32 (...) @test_heapsort()
%32 = icmp ne i32 %31, 0
br i1 %32, label %37, label %33
33: ; preds = %30
%34 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.4, i64 0, i64 0))
%35 = load i32, i32* %2
%36 = add nsw i32 %35, 1
store i32 %36, i32* %2
br label %37
37: ; preds = %33, %30
%38 = load i32, i32* %2
%39 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.5, i64 0, i64 0), i32 %38)
%40 = load i32, i32* %1
ret i32 %40
}

LLVM IR (-O2):
@.str.5 = [18 x i8] c"%d tests failed.\0A\00"
@str = [21 x i8] c"Heapify test failed!\00"
@str.6 = [37 x i8] c"Heapsort already sorted test failed!\00"
@str.7 = [45 x i8] c"Heapsort already reverse sorted test failed!\00"
@str.8 = [41 x i8] c"Heapsort all elements equal test failed!\00"
@str.9 = [22 x i8] c"Heapsort test failed!\00"
define i32 @main() {
%1 = tail call i32 (...) @test_heapify()
%2 = icmp eq i32 %1, 0
br i1 %2, label %3, label %5
3: ; preds = %0
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @str, i64 0, i64 0))
br label %5
5: ; preds = %3, %0
%6 = phi i32 [ 0, %0 ], [ 1, %3 ]
%7 = tail call i32 (...) @test_heapsort_sorted()
%8 = icmp eq i32 %7, 0
br i1 %8, label %9, label %12
9: ; preds = %5
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.6, i64 0, i64 0))
%11 = add nuw nsw i32 %6, 1
br label %12
12: ; preds = %9, %5
%13 = phi i32 [ %6, %5 ], [ %11, %9 ]
%14 = tail call i32 (...) @test_heapsort_reverse_sorted()
%15 = icmp eq i32 %14, 0
br i1 %15, label %16, label %19
16: ; preds = %12
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.7, i64 0, i64 0))
%18 = add nuw nsw i32 %13, 1
br label %19
19: ; preds = %16, %12
%20 = phi i32 [ %13, %12 ], [ %18, %16 ]
%21 = tail call i32 (...) @test_heapsort_all_equal()
%22 = icmp eq i32 %21, 0
br i1 %22, label %23, label %26
23: ; preds = %19
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.8, i64 0, i64 0))
%25 = add nuw nsw i32 %20, 1
br label %26
26: ; preds = %23, %19
%27 = phi i32 [ %20, %19 ], [ %25, %23 ]
%28 = tail call i32 (...) @test_heapsort()
%29 = icmp eq i32 %28, 0
br i1 %29, label %30, label %33
30: ; preds = %26
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.9, i64 0, i64 0))
%32 = add nuw nsw i32 %27, 1
br label %33
33: ; preds = %30, %26
%34 = phi i32 [ %27, %26 ], [ %32, %30 ]
%35 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @.str.5, i64 0, i64 0), i32 %34)
ret i32 0
}