#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 lowerBinarySearch(int *, int, int, int /*<<< orphan*/, int);
int /*<<< orphan*/ printf(char *, int);
int upperBinarySearch(int *, int, int, int /*<<< orphan*/, int);
int main() {
  int n[] = {1, 1, 1, 3, 3, 3, 5, 5, 5};
  printf("%d\n", lowerBinarySearch(n, 9, 5, 0, 8));
  printf("%d\n", upperBinarySearch(n, 9, 5, 0, 8));
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x30,%rsp
movl   $0x0,-0x4(%rbp)
lea    -0x30(%rbp),%rdi
lea    0xea6(%rip),%rsi
mov    $0x24,%edx
call   1060 <memcpy@plt>
lea    -0x30(%rbp),%rdi
mov    $0x9,%esi
mov    $0x5,%edx
xor    %ecx,%ecx
mov    $0x8,%r8d
call   1050 <lowerBinarySearch@plt>
mov    %eax,%esi
lea    0xe9c(%rip),%rdi
call   1040 <printf@plt>
lea    -0x30(%rbp),%rdi
mov    $0x9,%esi
mov    $0x5,%edx
xor    %ecx,%ecx
mov    $0x8,%r8d
call   1030 <upperBinarySearch@plt>
mov    %eax,%esi
lea    0xe73(%rip),%rdi
call   1040 <printf@plt>
xor    %eax,%eax
add    $0x30,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r14
push   %rbx
sub    $0x28,%rsp
mov    0xee3(%rip),%eax
mov    %eax,0x20(%rsp)
movaps 0xec8(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xeac(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%r14
mov    %r14,%rdi
mov    $0x9,%esi
mov    $0x5,%edx
xor    %ecx,%ecx
mov    $0x8,%r8d
call   1050 <lowerBinarySearch@plt>
lea    0xea8(%rip),%rbx
mov    %rbx,%rdi
mov    %eax,%esi
call   1040 <printf@plt>
mov    %r14,%rdi
mov    $0x9,%esi
mov    $0x5,%edx
xor    %ecx,%ecx
mov    $0x8,%r8d
call   1030 <upperBinarySearch@plt>
mov    %rbx,%rdi
mov    %eax,%esi
call   1040 <printf@plt>
xor    %eax,%eax
add    $0x28,%rsp
pop    %rbx
pop    %r14
ret

LLVM IR (-O0):
@__const.main.n = [9 x i32] [i32 1, i32 1, i32 1, i32 3, i32 3, i32 3, i32 5, i32 5, i32 5]
@.str = [4 x i8] c"%d\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca [9 x i32]
store i32 0, i32* %1
%3 = bitcast [9 x i32]* %2 to i8*
%4 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%5 = call i32 @lowerBinarySearch(i32* %4, i32 9, i32 5, i32 0, i32 8)
%6 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 %5)
%7 = getelementptr inbounds [9 x i32], [9 x i32]* %2, i64 0, i64 0
%8 = call i32 @upperBinarySearch(i32* %7, i32 9, i32 5, i32 0, i32 8)
%9 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 %8)
ret i32 0
}

LLVM IR (-O2):
@__const.main.n = [9 x i32] [i32 1, i32 1, i32 1, i32 3, i32 3, i32 3, i32 5, i32 5, i32 5]
@.str = [4 x i8] c"%d\0A\00"
define i32 @main() {
%1 = alloca [9 x i32]
%2 = bitcast [9 x i32]* %1 to i8*
%3 = getelementptr inbounds [9 x i32], [9 x i32]* %1, i64 0, i64 0
%4 = call i32 @lowerBinarySearch(i32* %3, i32 9, i32 5, i32 0, i32 8)
%5 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 %4)
%6 = call i32 @upperBinarySearch(i32* %3, i32 9, i32 5, i32 0, i32 8)
%7 = call i32 @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 %6)
ret i32 0
}