#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_flip();
int /*<<< orphan*/ test_flip_all();
int /*<<< orphan*/ test_flip_none();
int /*<<< orphan*/ test_pancake_sort();
int /*<<< orphan*/ test_pancake_sort_all_equal();
int /*<<< orphan*/ test_pancake_sort_reverse_sorted();
int /*<<< orphan*/ test_pancake_sort_sorted();
int main() {
  int counter = 0;
  if (!test_flip()) {
    printf("Flip test failed!\n");
    counter++;
  }
  if (!test_flip_all()) {
    printf("Flip all test failed!\n");
    counter++;
  }
  if (!test_flip_none()) {
    printf("Flip none test failed!\n");
    counter++;
  }
  if (!test_pancake_sort()) {
    printf("Pancake sort test failed!\n");
    counter++;
  }
  if (!test_pancake_sort_sorted()) {
    printf("Pancake sort already sorted test failed!\n");
    counter++;
  }
  if (!test_pancake_sort_reverse_sorted()) {
    printf("Pancake sort reverse sorted test failed!\n");
    counter++;
  }
  if (!test_pancake_sort_all_equal()) {
    printf("Pancake sort all equal 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   1080 <test_flip@plt>
cmp    $0x0,%eax
jne    11bd <main+0x3d>
lea    0xe53(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1030 <test_flip_all@plt>
cmp    $0x0,%eax
jne    11e4 <main+0x64>
lea    0xe3f(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1060 <test_flip_none@plt>
cmp    $0x0,%eax
jne    120b <main+0x8b>
lea    0xe2f(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1040 <test_pancake_sort@plt>
cmp    $0x0,%eax
jne    1232 <main+0xb2>
lea    0xe20(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1090 <test_pancake_sort_sorted@plt>
cmp    $0x0,%eax
jne    1259 <main+0xd9>
lea    0xe14(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   1070 <test_pancake_sort_reverse_sorted@plt>
cmp    $0x0,%eax
jne    1280 <main+0x100>
lea    0xe17(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    $0x0,%al
call   10a0 <test_pancake_sort_all_equal@plt>
cmp    $0x0,%eax
jne    12a7 <main+0x127>
lea    0xe1a(%rip),%rdi
mov    $0x0,%al
call   1050 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
mov    -0x8(%rbp),%esi
lea    0xe25(%rip),%rdi
mov    $0x0,%al
call   1050 <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   1090 <test_flip@plt>
test   %eax,%eax
jne    11af <main+0x1f>
lea    0xe6d(%rip),%rdi
call   1030 <puts@plt>
mov    $0x1,%ebx
xor    %eax,%eax
call   1040 <test_flip_all@plt>
test   %eax,%eax
jne    11c9 <main+0x39>
lea    0xe63(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1070 <test_flip_none@plt>
test   %eax,%eax
jne    11e3 <main+0x53>
lea    0xe5f(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1050 <test_pancake_sort@plt>
test   %eax,%eax
jne    11fd <main+0x6d>
lea    0xe5c(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   10a0 <test_pancake_sort_sorted@plt>
test   %eax,%eax
jne    1217 <main+0x87>
lea    0xe5c(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   1080 <test_pancake_sort_reverse_sorted@plt>
test   %eax,%eax
jne    1231 <main+0xa1>
lea    0xe6b(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
xor    %eax,%eax
call   10b0 <test_pancake_sort_all_equal@plt>
test   %eax,%eax
jne    124b <main+0xbb>
lea    0xe7a(%rip),%rdi
call   1030 <puts@plt>
add    $0x1,%ebx
lea    0xdae(%rip),%rdi
mov    %ebx,%esi
xor    %eax,%eax
call   1060 <printf@plt>
xor    %eax,%eax
pop    %rbx
ret

LLVM IR (-O0):
@.str = [19 x i8] c"Flip test failed!\0A\00"
@.str.1 = [23 x i8] c"Flip all test failed!\0A\00"
@.str.2 = [24 x i8] c"Flip none test failed!\0A\00"
@.str.3 = [27 x i8] c"Pancake sort test failed!\0A\00"
@.str.4 = [42 x i8] c"Pancake sort already sorted test failed!\0A\00"
@.str.5 = [42 x i8] c"Pancake sort reverse sorted test failed!\0A\00"
@.str.6 = [37 x i8] c"Pancake sort all equal test failed!\0A\00"
@.str.7 = [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_flip()
%4 = icmp ne i32 %3, 0
br i1 %4, label %9, label %5
5: ; preds = %0
%6 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([19 x i8], [19 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_flip_all()
%11 = icmp ne i32 %10, 0
br i1 %11, label %16, label %12
12: ; preds = %9
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 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_flip_none()
%18 = icmp ne i32 %17, 0
br i1 %18, label %23, label %19
19: ; preds = %16
%20 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([24 x i8], [24 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_pancake_sort()
%25 = icmp ne i32 %24, 0
br i1 %25, label %30, label %26
26: ; preds = %23
%27 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 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_pancake_sort_sorted()
%32 = icmp ne i32 %31, 0
br i1 %32, label %37, label %33
33: ; preds = %30
%34 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 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 = call i32 (...) @test_pancake_sort_reverse_sorted()
%39 = icmp ne i32 %38, 0
br i1 %39, label %44, label %40
40: ; preds = %37
%41 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.5, i64 0, i64 0))
%42 = load i32, i32* %2
%43 = add nsw i32 %42, 1
store i32 %43, i32* %2
br label %44
44: ; preds = %40, %37
%45 = call i32 (...) @test_pancake_sort_all_equal()
%46 = icmp ne i32 %45, 0
br i1 %46, label %51, label %47
47: ; preds = %44
%48 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.6, i64 0, i64 0))
%49 = load i32, i32* %2
%50 = add nsw i32 %49, 1
store i32 %50, i32* %2
br label %51
51: ; preds = %47, %44
%52 = load i32, i32* %2
%53 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.7, i64 0, i64 0), i32 %52)
%54 = load i32, i32* %1
ret i32 %54
}

LLVM IR (-O2):
@.str.7 = [18 x i8] c"%d tests failed.\0A\00"
@str = [18 x i8] c"Flip test failed!\00"
@str.8 = [22 x i8] c"Flip all test failed!\00"
@str.9 = [23 x i8] c"Flip none test failed!\00"
@str.10 = [26 x i8] c"Pancake sort test failed!\00"
@str.11 = [41 x i8] c"Pancake sort already sorted test failed!\00"
@str.12 = [41 x i8] c"Pancake sort reverse sorted test failed!\00"
@str.13 = [36 x i8] c"Pancake sort all equal test failed!\00"
define i32 @main() {
%1 = tail call i32 (...) @test_flip()
%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 ([18 x i8], [18 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_flip_all()
%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 ([22 x i8], [22 x i8]* @str.8, 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_flip_none()
%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 ([23 x i8], [23 x i8]* @str.9, 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_pancake_sort()
%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 ([26 x i8], [26 x i8]* @str.10, 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_pancake_sort_sorted()
%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 ([41 x i8], [41 x i8]* @str.11, 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 (...) @test_pancake_sort_reverse_sorted()
%36 = icmp eq i32 %35, 0
br i1 %36, label %37, label %40
37: ; preds = %33
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.12, i64 0, i64 0))
%39 = add nuw nsw i32 %34, 1
br label %40
40: ; preds = %37, %33
%41 = phi i32 [ %34, %33 ], [ %39, %37 ]
%42 = tail call i32 (...) @test_pancake_sort_all_equal()
%43 = icmp eq i32 %42, 0
br i1 %43, label %44, label %47
44: ; preds = %40
%45 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.13, i64 0, i64 0))
%46 = add nuw nsw i32 %41, 1
br label %47
47: ; preds = %44, %40
%48 = phi i32 [ %41, %40 ], [ %46, %44 ]
%49 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @.str.7, i64 0, i64 0), i32 %48)
ret i32 0
}