Write the assembly code in AT&T syntax for the functions recursive, iterative, and closed, intended for people to be able to read it, not in assembly compiled and generated by a machine.

Question

Write the assembly code in AT&T syntax for the functions recursive, iterative, and closed, intended for people to be able to read it, not in assembly compiled and generated by a machine. They are in C. Write the assembly code for the functions as separate assignments. Please provide source code and screenshots.

Function Code:

#include <inttypes.h>

#include <math.h>

uint64_t fibonacci_recursive(uint64_t n);

uint64_t fibonacci_iterative(uint64_t n);

uint64_t fibonacci_closed(uint64_t n);

double phi;

int main() {

uint64_t n;

scanf("%" SCNu64, &n);

phi = (1.0 + sqrt(5.0)) / 2.0;

printf("Recursive: %" PRIu64 "\n", fibonacci_recursive(n));

printf("Iterative: %" PRIu64 "\n", fibonacci_iterative(n));

printf("Closed: %" PRIu64 "\n", fibonacci_closed(n));

return 0;

}

uint64_t fibonacci_recursive(uint64_t n)

{

if(n == 0)

return 0;

else if (n == 1)

return 1;

return (fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2));

}

uint64_t fibonacci_iterative(uint64_t n)

{

uint64_t fn = 1, fn_1 = 0;

for(int i = 2; i <= n; i++)

{

uint64_t temp = fn + fn_1;

fn_1 = fn;

fn = temp;

}

return fn;

}

uint64_t fibonacci_closed(uint64_t n)

{

return (pow(phi,n) - pow(-1,n)/pow(phi,n))/sqrt(5);

}

main.c Code:

#include <stdio.h>

#include <inttypes.h>

#include <math.h>

uint64_t fibonacci_recursive(uint64_t n);

uint64_t fibonacci_iterative(uint64_t n);

uint64_t fibonacci_closed(uint64_t n);

double phi;

int main() {

uint64_t n;

scanf("%" SCNu64, &n);

phi = (1.0 + sqrt(5.0)) / 2.0;

printf("Recursive: %" PRIu64 "\n", fibonacci_recursive(n));

printf("Iterative: %" PRIu64 "\n", fibonacci_iterative(n));

printf("Closed: %" PRIu64 "\n", fibonacci_closed(n));

return 0;

}

Answer 1

fibonacci_recursive(long long):

    push  rbp  #

    mov  rbp, rsp #,

    push  rbx  #

    sub  rsp, 24 #,

    mov  QWORD PTR [rbp-24], rdi # n, n

    cmp  QWORD PTR [rbp-24], 0  # n,

    jne  .L2   #,

    mov  eax, 0  # _5,

    jmp  .L3   #

.L2:

    cmp  QWORD PTR [rbp-24], 1  # n,

    jne  .L4   #,

    mov  eax, 1  # _5,

    jmp  .L3   #

.L4:

    mov  rax, QWORD PTR [rbp-24] # tmp88, n

    sub  rax, 1  # _1,

    mov  rdi, rax #, _1

    call  fibonacci_recursive(long long)    #

    mov  rbx, rax # _2,

    mov  rax, QWORD PTR [rbp-24] # tmp89, n

    sub  rax, 2  # _3,

    mov  rdi, rax #, _3

    call  fibonacci_recursive(long long)    #

    add  rax, rbx # _5, _2

.L3:

    mov  rbx, QWORD PTR [rbp-8]  #,

    leave 

    ret  

fibonacci_iterative(long long):

    push  rbp  #

    mov  rbp, rsp #,

    mov  QWORD PTR [rbp-40], rdi # n, n

    mov  QWORD PTR [rbp-8], 1   # fn,

    mov  QWORD PTR [rbp-16], 0  # fn_1,

    mov  DWORD PTR [rbp-20], 2  # i,

    jmp  .L2   #

.L3:

    mov  rdx, QWORD PTR [rbp-8]  # tmp89, fn

    mov  rax, QWORD PTR [rbp-16] # tmp90, fn_1

    add  rax, rdx # tmp88, tmp89

    mov  QWORD PTR [rbp-32], rax # temp, tmp88

    mov  rax, QWORD PTR [rbp-8]  # tmp91, fn

    mov  QWORD PTR [rbp-16], rax # fn_1, tmp91

    mov  rax, QWORD PTR [rbp-32] # tmp92, temp

    mov  QWORD PTR [rbp-8], rax  # fn, tmp92

    add  DWORD PTR [rbp-20], 1  # i,

.L2:

    mov  eax, DWORD PTR [rbp-20] # tmp93, i

    cdqe

    cmp  QWORD PTR [rbp-40], rax # n, _1

    jge  .L3   #,

    mov  rax, QWORD PTR [rbp-8]  # _9, fn

    pop  rbp   #

    ret 

phi:

    .zero 8

fibonacci_closed(long long):

    push  rbp  #

    mov  rbp, rsp #,

    push  r12  #

    push  rbx  #

    sub  rsp, 16 #,

    mov  QWORD PTR [rbp-24], rdi # n, n

    mov  rax, QWORD PTR phi[rip] # phi.0_1, phi

    mov  rdx, QWORD PTR [rbp-24] # tmp93, n

    mov  rdi, rdx #, tmp93

    movq  xmm0, rax   #, phi.0_1

    call  __gnu_cxx::__promote_2<decltype (((__gnu_cxx::__promote_2<double, std::__is_integer<double>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0))), std::__is_integer<decltype (((__gnu_cxx::__promote_2<double, std::__is_integer<double>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0)))>::__value>::__type std::pow<double, long long>(double, long long) #

    movq  rbx, xmm0   # _2,

    mov  rax, QWORD PTR [rbp-24] # tmp94, n

    mov  rsi, rax #, tmp94

    mov  edi, -1 #,

    call  __gnu_cxx::__promote_2<decltype (((__gnu_cxx::__promote_2<int, std::__is_integer<int>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0))), std::__is_integer<decltype (((__gnu_cxx::__promote_2<int, std::__is_integer<int>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0)))>::__value>::__type std::pow<int, long long>(int, long long) #

    movq  r12, xmm0   # _3,

    mov  rax, QWORD PTR phi[rip] # phi.1_4, phi

    mov  rdx, QWORD PTR [rbp-24] # tmp95, n

    mov  rdi, rdx #, tmp95

    movq  xmm0, rax   #, phi.1_4

    call  __gnu_cxx::__promote_2<decltype (((__gnu_cxx::__promote_2<double, std::__is_integer<double>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0))), std::__is_integer<decltype (((__gnu_cxx::__promote_2<double, std::__is_integer<double>::__value>::__type)(0))+((__gnu_cxx::__promote_2<long long, std::__is_integer<long long>::__value>::__type)(0)))>::__value>::__type std::pow<double, long long>(double, long long) #

    movq  xmm1, r12   # _3, _3

    divsd xmm1, xmm0  # _3, _5

    movq  xmm2, rbx   # _2, _2

    subsd xmm2, xmm1  # _2, _6

    movsd QWORD PTR [rbp-32], xmm2   # %sfp, _2

    mov  edi, 5  #,

    call  __gnu_cxx::__enable_if<std::__is_integer<int>::__value, double>::__type std::sqrt<int>(int)   #

    movsd xmm1, QWORD PTR [rbp-32]   # _7, %sfp

    divsd xmm1, xmm0  # _7, _8

    cvttsd2si   rax, xmm1  # _16, _9

    add  rsp, 16 #,

    pop  rbx   #

    pop  r12   #

    pop  rbp   #

    ret