void test_fibonacci_recursive_with_two(void) {
  unsigned int number = 2;
  unsigned int result = fibonacci_recursive(number);
  ((void)((result == 1)
              ? ((void)0)
              : __test_fail("result == 1",
                            "/scratch/repos/new/home/jordi_armengol_estape/"
                            "c-scraper/outputs/2022-01-22/02-19-57/repos/"
                            "michaelreneer/Algorithms/refs/heads/master/c/test/"
                            "test_fibonacci_recursive.c",
                            __FUNCTION__, 21)));
}


x86 assembly (clang, -O0):
<test_fibonacci_recursive_with_two>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x2,-0x4(%rbp)
mov    -0x4(%rbp),%edi
mov    $0x0,%al
call   1040 <fibonacci_recursive@plt>
mov    %eax,-0x8(%rbp)
cmpl   $0x1,-0x8(%rbp)
jne    114b <test_fibonacci_recursive_with_two+0x2b>
jmp    116c <test_fibonacci_recursive_with_two+0x4c>
lea    0xeae(%rip),%rdi
lea    0xeb3(%rip),%rsi
lea    0xf53(%rip),%rdx
mov    $0x15,%ecx
mov    $0x0,%al
call   1030 <__test_fail@plt>
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_fibonacci_recursive_with_two>:
push   %rax
mov    $0x2,%edi
xor    %eax,%eax
call   1040 <fibonacci_recursive@plt>
cmp    $0x1,%eax
jne    1134 <test_fibonacci_recursive_with_two+0x14>
pop    %rax
ret
lea    0xec5(%rip),%rdi
lea    0xeca(%rip),%rsi
lea    0xf6a(%rip),%rdx
mov    $0x15,%ecx
xor    %eax,%eax
pop    %r8
jmp    1030 <__test_fail@plt>

LLVM IR (-O0):
@.str = [12 x i8] c"result == 1\00"
@.str.1 = [167 x i8] c"/scratch/repos/new/home/jordi_armengol_estape/c-scraper/outputs/2022-01-22/02-19-57/repos/michaelreneer/Algorithms/refs/heads/master/c/test/test_fibonacci_recursive.c\00"
@__FUNCTION__.test_fibonacci_recursive_with_two = [34 x i8] c"test_fibonacci_recursive_with_two\00"
define void @test_fibonacci_recursive_with_two() {
%1 = alloca i32
%2 = alloca i32
store i32 2, i32* %1
%3 = load i32, i32* %1
%4 = call i32 (i32, ...) bitcast (i32 (...)* @fibonacci_recursive to i32 (i32, ...)*)(i32 %3)
store i32 %4, i32* %2
%5 = load i32, i32* %2
%6 = icmp eq i32 %5, 1
br i1 %6, label %7, label %8
7: ; preds = %0
br label %10
8: ; preds = %0
%9 = call i32 (i8*, i8*, i8*, i32, ...) bitcast (i32 (...)* @__test_fail to i32 (i8*, i8*, i8*, i32, ...)*)(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([167 x i8], [167 x i8]* @.str.1, i64 0, i64 0), i8* getelementptr inbounds ([34 x i8], [34 x i8]* @__FUNCTION__.test_fibonacci_recursive_with_two, i64 0, i64 0), i32 21)
br label %10
10: ; preds = %8, %7
ret void
}

LLVM IR (-O2):
@.str = [12 x i8] c"result == 1\00"
@.str.1 = [167 x i8] c"/scratch/repos/new/home/jordi_armengol_estape/c-scraper/outputs/2022-01-22/02-19-57/repos/michaelreneer/Algorithms/refs/heads/master/c/test/test_fibonacci_recursive.c\00"
@__FUNCTION__.test_fibonacci_recursive_with_two = [34 x i8] c"test_fibonacci_recursive_with_two\00"
define void @test_fibonacci_recursive_with_two() {
%1 = tail call i32 (i32, ...) bitcast (i32 (...)* @fibonacci_recursive to i32 (i32, ...)*)(i32 2)
%2 = icmp eq i32 %1, 1
br i1 %2, label %5, label %3
3: ; preds = %0
%4 = tail call i32 (i8*, i8*, i8*, i32, ...) bitcast (i32 (...)* @__test_fail to i32 (i8*, i8*, i8*, i32, ...)*)(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str, i64 0, i64 0), i8* getelementptr inbounds ([167 x i8], [167 x i8]* @.str.1, i64 0, i64 0), i8* getelementptr inbounds ([34 x i8], [34 x i8]* @__FUNCTION__.test_fibonacci_recursive_with_two, i64 0, i64 0), i32 21)
br label %5
5: ; preds = %0, %3
ret void
}