#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 /*<<< orphan*/ vetor;

/* Variables and functions */
int buscaSequencialRecursiva(int *, int /*<<< orphan*/, int, size_t);
int /*<<< orphan*/ printf(char *, int, int);
int main() {
  int vetor[] = {1, 2, 3, 4, 5, 6, 7, 8};
  size_t n = sizeof(vetor) / sizeof(vetor[0]);
  printf("Valor %d no índice %d\n", 1,
         buscaSequencialRecursiva(vetor, 0, 1, n));
  printf("Valor %d no índice %d\n", 10,
         buscaSequencialRecursiva(vetor, 0, 10, n));
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x30,%rsp
mov    0xed1(%rip),%rax
mov    %rax,-0x20(%rbp)
mov    0xece(%rip),%rax
mov    %rax,-0x18(%rbp)
mov    0xecb(%rip),%rax
mov    %rax,-0x10(%rbp)
mov    0xec8(%rip),%rax
mov    %rax,-0x8(%rbp)
movq   $0x8,-0x28(%rbp)
lea    -0x20(%rbp),%rdi
mov    -0x28(%rbp),%rcx
xor    %esi,%esi
mov    $0x1,%edx
call   1040 <buscaSequencialRecursiva@plt>
mov    %eax,%edx
lea    0xea7(%rip),%rdi
mov    $0x1,%esi
call   1030 <printf@plt>
lea    -0x20(%rbp),%rdi
mov    -0x28(%rbp),%rcx
xor    %esi,%esi
mov    $0xa,%edx
call   1040 <buscaSequencialRecursiva@plt>
mov    %eax,%edx
lea    0xe80(%rip),%rdi
mov    $0xa,%esi
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x30,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r14
push   %rbx
sub    $0x28,%rsp
movaps 0xee2(%rip),%xmm0
movaps %xmm0,0x10(%rsp)
movaps 0xec6(%rip),%xmm0
movaps %xmm0,(%rsp)
mov    %rsp,%r14
mov    $0x8,%ecx
mov    %r14,%rdi
xor    %esi,%esi
mov    $0x1,%edx
call   1040 <buscaSequencialRecursiva@plt>
lea    0xec4(%rip),%rbx
mov    %rbx,%rdi
mov    $0x1,%esi
mov    %eax,%edx
call   1030 <printf@plt>
mov    $0x8,%ecx
mov    %r14,%rdi
xor    %esi,%esi
mov    $0xa,%edx
call   1040 <buscaSequencialRecursiva@plt>
mov    %rbx,%rdi
mov    $0xa,%esi
mov    %eax,%edx
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x28,%rsp
pop    %rbx
pop    %r14
ret

LLVM IR (-O0):
@__const.main.vetor = [8 x i32] [i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7, i32 8]
@.str = [24 x i8] c"Valor %d no \C3\ADndice %d\0A\00"
define i32 @main() {
%1 = alloca [8 x i32]
%2 = alloca i64
%3 = bitcast [8 x i32]* %1 to i8*
store i64 8, i64* %2
%4 = getelementptr inbounds [8 x i32], [8 x i32]* %1, i64 0, i64 0
%5 = load i64, i64* %2
%6 = call i32 @buscaSequencialRecursiva(i32* %4, i32 0, i32 1, i64 %5)
%7 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str, i64 0, i64 0), i32 1, i32 %6)
%8 = getelementptr inbounds [8 x i32], [8 x i32]* %1, i64 0, i64 0
%9 = load i64, i64* %2
%10 = call i32 @buscaSequencialRecursiva(i32* %8, i32 0, i32 10, i64 %9)
%11 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str, i64 0, i64 0), i32 10, i32 %10)
ret i32 0
}

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