#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 */
typedef int uint64_t;

/* Variables and functions */
int /*<<< orphan*/ isPrime(int);
int /*<<< orphan*/ printf(char *, int, int /*<<< orphan*/);
int main() {
  uint64_t n;
  for (n = 2; n < 22; n++) {
    printf("Is %llu prime: %d\n", n, isPrime(n));
  }
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
movl   $0x2,-0x8(%rbp)
cmpl   $0x16,-0x8(%rbp)
jge    116d <main+0x4d>
mov    -0x8(%rbp),%eax
mov    %eax,-0xc(%rbp)
mov    -0x8(%rbp),%edi
call   1040 <isPrime@plt>
mov    -0xc(%rbp),%esi
mov    %eax,%edx
lea    0xea6(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%eax
add    $0x1,%eax
mov    %eax,-0x8(%rbp)
jmp    1136 <main+0x16>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbx
mov    $0x2,%edi
call   1040 <isPrime@plt>
lea    0xece(%rip),%rbx
mov    %rbx,%rdi
mov    $0x2,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x3,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x3,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x4,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x4,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x5,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x5,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x6,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x6,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x7,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x7,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x8,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x8,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x9,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x9,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xa,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xb,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xb,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xc,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xc,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xd,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xd,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xe,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xe,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0xf,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0xf,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x10,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x10,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x11,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x11,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x12,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x12,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x13,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x13,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x14,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x14,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x15,%edi
call   1040 <isPrime@plt>
mov    %rbx,%rdi
mov    $0x15,%esi
mov    %eax,%edx
call   1030 <printf@plt>
xor    %eax,%eax
pop    %rbx
ret

LLVM IR (-O0):
@.str = [19 x i8] c"Is %llu prime: %d\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
store i32 0, i32* %1
store i32 2, i32* %2
br label %3
3: ; preds = %11, %0
%4 = load i32, i32* %2
%5 = icmp slt i32 %4, 22
br i1 %5, label %6, label %14
6: ; preds = %3
%7 = load i32, i32* %2
%8 = load i32, i32* %2
%9 = call i32 @isPrime(i32 %8)
%10 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 %7, i32 %9)
br label %11
11: ; preds = %6
%12 = load i32, i32* %2
%13 = add nsw i32 %12, 1
store i32 %13, i32* %2
br label %3
14: ; preds = %3
ret i32 0
}

LLVM IR (-O2):
@.str = [19 x i8] c"Is %llu prime: %d\0A\00"
define i32 @main() {
%1 = tail call i32 @isPrime(i32 2)
%2 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 2, i32 %1)
%3 = tail call i32 @isPrime(i32 3)
%4 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 3, i32 %3)
%5 = tail call i32 @isPrime(i32 4)
%6 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 4, i32 %5)
%7 = tail call i32 @isPrime(i32 5)
%8 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 5, i32 %7)
%9 = tail call i32 @isPrime(i32 6)
%10 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 6, i32 %9)
%11 = tail call i32 @isPrime(i32 7)
%12 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 7, i32 %11)
%13 = tail call i32 @isPrime(i32 8)
%14 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 8, i32 %13)
%15 = tail call i32 @isPrime(i32 9)
%16 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 9, i32 %15)
%17 = tail call i32 @isPrime(i32 10)
%18 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 10, i32 %17)
%19 = tail call i32 @isPrime(i32 11)
%20 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 11, i32 %19)
%21 = tail call i32 @isPrime(i32 12)
%22 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 12, i32 %21)
%23 = tail call i32 @isPrime(i32 13)
%24 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 13, i32 %23)
%25 = tail call i32 @isPrime(i32 14)
%26 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 14, i32 %25)
%27 = tail call i32 @isPrime(i32 15)
%28 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 15, i32 %27)
%29 = tail call i32 @isPrime(i32 16)
%30 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 16, i32 %29)
%31 = tail call i32 @isPrime(i32 17)
%32 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 17, i32 %31)
%33 = tail call i32 @isPrime(i32 18)
%34 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 18, i32 %33)
%35 = tail call i32 @isPrime(i32 19)
%36 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 19, i32 %35)
%37 = tail call i32 @isPrime(i32 20)
%38 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 20, i32 %37)
%39 = tail call i32 @isPrime(i32 21)
%40 = tail call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str, i64 0, i64 0), i32 21, i32 %39)
ret i32 0
}