Consider the following high-level recursive procedure: long long int flong long int n, long long int k long long int b b k+2; if (n=-O) b = 8; else b = b + 4 * n + f (n-1, k+1); return b + k; Translate the high-level procedure f into ARMv8 assembly language. · Pay particular attention to properly saving and restoring registers across procedure calls; Use the ARMv8 preserved register convention Clearly comment your code;. Assume that the procedure starts at address 0x00400100;. Keep local variable b in X19; Assume n and k are passed in XO and X1 respectively and that the result is returned in X2
+5
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Consider the following high-level recursive procedure: long long int flong long int n, long long int k long long int b b k+2; if (n=-O) b = ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Home » Computers & Technology » Consider the following high-level recursive procedure: long long int flong long int n, long long int k long long int b b k+2; if (n=-O) b = 8; else b = b + 4 * n + f (n-1, k+1); return b + k;