Im trying to work with nasm from C and just having a hard time with the basics of nasm. Im trying to convert a simple while loop like this
while(j < k)
{k = k + 1;
j = j + 2;
count = count + 1;
}
I know that it will look something like
Loopee:
????
add dword [k], 1
add dword [j], 2
add dword [count], 1
but I'm not sure how to structure the while loop where it only loops until j is no longer less than k.