#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 findEmptyIndex(int *);
char *test_findEmptyIndexInSolvedGrid() {
  static int grid[81] = {4, 9, 2, 3, 6, 8, 1, 7, 5, 8, 7, 6, 9, 5, 1, 2, 3,
                         4, 3, 1, 5, 2, 7, 4, 6, 8, 9, 9, 3, 4, 1, 2, 7, 8,
                         5, 6, 2, 5, 7, 8, 3, 6, 9, 4, 1, 1, 6, 8, 4, 9, 5,
                         3, 2, 7, 5, 2, 1, 6, 4, 3, 7, 9, 8, 7, 8, 3, 5, 1,
                         9, 4, 6, 2, 6, 4, 9, 7, 8, 2, 5, 1, 3};
  do {
    if (!(findEmptyIndex(grid) == -1))
      return "e: test_findEmptyIndexInSolvedGrid";
  } while (0);
  return 0;
}


x86 assembly (clang, -O0):
<test_findEmptyIndexInSolvedGrid>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
lea    0x2f11(%rip),%rdi
call   1030 <findEmptyIndex@plt>
cmp    $0xffffffff,%eax
je     113d <test_findEmptyIndexInSolvedGrid+0x2d>
lea    0xecc(%rip),%rax
mov    %rax,-0x8(%rbp)
jmp    114a <test_findEmptyIndexInSolvedGrid+0x3a>
jmp    1142 <test_findEmptyIndexInSolvedGrid+0x32>
movq   $0x0,-0x8(%rbp)
mov    -0x8(%rbp),%rax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_findEmptyIndexInSolvedGrid>:
push   %rax
lea    0x2f18(%rip),%rdi
call   1030 <findEmptyIndex@plt>
xor    %ecx,%ecx
cmp    $0xffffffff,%eax
lea    0xed7(%rip),%rax
cmovne %rax,%rcx
mov    %rcx,%rax
pop    %rcx
ret

LLVM IR (-O0):
@test_findEmptyIndexInSolvedGrid.grid = internal global [81 x i32] [i32 4, i32 9, i32 2, i32 3, i32 6, i32 8, i32 1, i32 7, i32 5, i32 8, i32 7, i32 6, i32 9, i32 5, i32 1, i32 2, i32 3, i32 4, i32 3, i32 1, i32 5, i32 2, i32 7, i32 4, i32 6, i32 8, i32 9, i32 9, i32 3, i32 4, i32 1, i32 2, i32 7, i32 8, i32 5, i32 6, i32 2, i32 5, i32 7, i32 8, i32 3, i32 6, i32 9, i32 4, i32 1, i32 1, i32 6, i32 8, i32 4, i32 9, i32 5, i32 3, i32 2, i32 7, i32 5, i32 2, i32 1, i32 6, i32 4, i32 3, i32 7, i32 9, i32 8, i32 7, i32 8, i32 3, i32 5, i32 1, i32 9, i32 4, i32 6, i32 2, i32 6, i32 4, i32 9, i32 7, i32 8, i32 2, i32 5, i32 1, i32 3]
@.str = [35 x i8] c"e: test_findEmptyIndexInSolvedGrid\00"
define i8* @test_findEmptyIndexInSolvedGrid() {
%1 = alloca i8*
br label %2
2: ; preds = %0
%3 = call i32 @findEmptyIndex(i32* getelementptr inbounds ([81 x i32], [81 x i32]* @test_findEmptyIndexInSolvedGrid.grid, i64 0, i64 0))
%4 = icmp eq i32 %3, -1
br i1 %4, label %6, label %5
5: ; preds = %2
store i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0), i8** %1
br label %8
6: ; preds = %2
br label %7
7: ; preds = %6
store i8* null, i8** %1
br label %8
8: ; preds = %7, %5
%9 = load i8*, i8** %1
ret i8* %9
}

LLVM IR (-O2):
@test_findEmptyIndexInSolvedGrid.grid = internal global [81 x i32] [i32 4, i32 9, i32 2, i32 3, i32 6, i32 8, i32 1, i32 7, i32 5, i32 8, i32 7, i32 6, i32 9, i32 5, i32 1, i32 2, i32 3, i32 4, i32 3, i32 1, i32 5, i32 2, i32 7, i32 4, i32 6, i32 8, i32 9, i32 9, i32 3, i32 4, i32 1, i32 2, i32 7, i32 8, i32 5, i32 6, i32 2, i32 5, i32 7, i32 8, i32 3, i32 6, i32 9, i32 4, i32 1, i32 1, i32 6, i32 8, i32 4, i32 9, i32 5, i32 3, i32 2, i32 7, i32 5, i32 2, i32 1, i32 6, i32 4, i32 3, i32 7, i32 9, i32 8, i32 7, i32 8, i32 3, i32 5, i32 1, i32 9, i32 4, i32 6, i32 2, i32 6, i32 4, i32 9, i32 7, i32 8, i32 2, i32 5, i32 1, i32 3]
@.str = [35 x i8] c"e: test_findEmptyIndexInSolvedGrid\00"
define i8* @test_findEmptyIndexInSolvedGrid() {
%1 = tail call i32 @findEmptyIndex(i32* getelementptr inbounds ([81 x i32], [81 x i32]* @test_findEmptyIndexInSolvedGrid.grid, i64 0, i64 0))
%2 = icmp eq i32 %1, -1
%3 = select i1 %2, i8* null, i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str, i64 0, i64 0)
ret i8* %3
}