hw

:material-circle-edit-outline: 约 8 个字 :fontawesome-solid-code: 35 行代码

hw2

slli x30, x5, 3 // x30 = f*8
add x30, x10, x30 // x30 = &A[f]
slli x31, x6, 3 // x31 = g*8
add x31, x11, x31 // x31 = &B[g]
ld x5, 0(x30) // f = A[f]
//注意ld这一步，之前都是在操作地址。ld把真值都进来了

addi x12, x30, 8
ld x30, 0(x12)
add x30, x30, x5
sd x30, 0(x31)

2.29
// IMPORTANT! Stack pointer must reamin a multiple 
of 16!!!! 
fib: 
beq x10, x0, done // If n==0, return 0 
addi x5, x0, 1 
beq x10, x5, done // If n==1, return 1 
addi x2, x2, -16 // Allocate 2 words of stack 
space 
sd x1, 0(x2) // Save the return address 
sd x10, 8(x2) // Save the current n 
addi x10, x10, -1 // x10 = n-1 
jal x1, fib // fib(n-1) 
ld x5, 8(x2) // Load old n from the stack 
sd x10, 8(x2) // Push fib(n-1) onto the stack 
addi x10, x5, -2 // x10 = n-2 
jal x1, fib // Call fib(n-2) 
ld x5, 8(x2) // x5 = fib(n-1) 
add x10, x10, x5 // x10 = fib(n-1)+fib(n-2) 
// Clean up: 
ld x1, 0(x2) // Load saved return address 
addi x2, x2, 16 // Pop two words from the stack 
done: 
jalr x0, x1 

上面这个不太会