NASM assembly — Recursive greatest common divisor function

Written in NASM.
Recursive function named gcd that uses Euclid’s algorithm to compute the greatest common divisor of two integers.
More detailed requirements in the attachment.