#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 EXIT_SUCCESS;
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ runTests(int);
int /*<<< orphan*/ srand(int);
int main(int argc, char *argv[]) {
  srand(1927);
  printf("* Testing part one...\n");
  runTests(0);
  printf("* Passed part one! That's meh for me.\n");
  printf("* Testing part two...\n");
  runTests(1);
  printf("* All tests passed! Asian father approves if your solution is "
         "efficient.\n");
  return EXIT_SUCCESS;
}


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    $0x787,%edi
call   1040 <srand@plt>
lea    0xea9(%rip),%rdi
call   1030 <printf@plt>
xor    %edi,%edi
call   1050 <runTests@plt>
lea    0xead(%rip),%rdi
call   1030 <printf@plt>
lea    0xec8(%rip),%rdi
call   1030 <printf@plt>
mov    $0x1,%edi
call   1050 <runTests@plt>
lea    0xec9(%rip),%rdi
call   1030 <printf@plt>
mov    0x2e48(%rip),%rax
mov    (%rax),%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
mov    $0x787,%edi
call   1040 <srand@plt>
lea    0xebe(%rip),%rdi
call   1030 <puts@plt>
xor    %edi,%edi
call   1050 <runTests@plt>
lea    0xec1(%rip),%rdi
call   1030 <puts@plt>
lea    0xedb(%rip),%rdi
call   1030 <puts@plt>
mov    $0x1,%edi
call   1050 <runTests@plt>
lea    0xedb(%rip),%rdi
call   1030 <puts@plt>
mov    0x2e5d(%rip),%rax
mov    (%rax),%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [23 x i8] c"* Testing part one...\0A\00"
@.str.1 = [39 x i8] c"* Passed part one! That's meh for me.\0A\00"
@.str.2 = [23 x i8] c"* Testing part two...\0A\00"
@.str.3 = [74 x i8] c"* All tests passed! Asian father approves if your solution is efficient.\0A\00"
@EXIT_SUCCESS = global i32 0
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 @srand(i32 1927)
%7 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str, i64 0, i64 0))
%8 = call i32 @runTests(i32 0)
%9 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.1, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.2, i64 0, i64 0))
%11 = call i32 @runTests(i32 1)
%12 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.3, i64 0, i64 0))
%13 = load i32, i32* @EXIT_SUCCESS
ret i32 %13
}

LLVM IR (-O2):
@EXIT_SUCCESS = global i32 0
@str = [22 x i8] c"* Testing part one...\00"
@str.4 = [38 x i8] c"* Passed part one! That's meh for me.\00"
@str.5 = [22 x i8] c"* Testing part two...\00"
@str.6 = [73 x i8] c"* All tests passed! Asian father approves if your solution is efficient.\00"
define i32 @main(i32 %0, i8** nocapture readnone %1) {
%3 = tail call i32 @srand(i32 1927)
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str, i64 0, i64 0))
%5 = tail call i32 @runTests(i32 0)
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.4, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.5, i64 0, i64 0))
%8 = tail call i32 @runTests(i32 1)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.6, i64 0, i64 0))
%10 = load i32, i32* @EXIT_SUCCESS
ret i32 %10
}