Tail-recursive Fibonacci sequence in x86-64 Assembly

fibonacci.asm

section .text
global fibonacci
fibonacci:
	enter 0, 0
	mov rsi, 1
	mov rdx, 0
	call fibonacci_loop
	leave
	ret

fibonacci_loop:
	cmp rdi, 0
	jle .base_case
.recursive_case:
	; rsi, rdx = rsi + rdx, rsi
	mov rax, rdx
	mov rdx, rsi
	add rsi, rax
	; rdi--
	dec rdi
	; tail call
	jmp fibonacci_loop
.base_case:
	mov rax, rdx
	ret

main.c

#include <inttypes.h>
#include <stdint.h>
#include <stdio.h>

uint64_t fibonacci(uint64_t n);

int main()
{
	for (unsigned int i = 0; i < 10; i++) {
		printf("fibonacci(%u) = %"PRIu64"\n", i, fibonacci(i));
	}
	return 0;
}

Makefile

all: a.out

%.o: %.asm
	nasm -f elf64 -o $@ $<

a.out: fibonacci.o main.c
	$(CC) *.o main.c

clean:
	@rm -f *.o a.out

.PHONY: all clean