Assignment Answer I.ppt

CS202 Computer Organization and System Architecture SJTU 2010 CSE 202Review On Chapter II Haojin Zhu CSE Department of SJTU Question 2.6 Solution: Solution 1: sll $t0, $t3, 9 # shift $t3 left by 9, store in $t0 srl $t0, $t0, 15 # shift $t0 right by 15 Solution 2: andi $t1, $t3, 000000000111111…111000000 9 17 6 Srl $t0, $t1, 6 2.15 Allocating Space on the Stack The segment of the stack containing a procedure’s saved registers and local variables is its procedure frame (aka activation record) The frame pointer ($fp) points to the first word of the frame of a procedure – providing a stable “base” register for the procedure $fp is initialized using $sp on a call and $sp is restored using $fp on a return low addr high addr $sp Saved argument regs (if any) Saved return addr Saved local regs (if any) Local arrays & structures (if any) $fp Allocating Space on the Heap Static data segment for constants and other static variables (e.g., arrays) Dynamic data segment (aka heap) for structures that grow and shrink (e.g., linked lists) Allocate space on the heap with malloc() and free it with free() Memory 0x 0000 0000 Text (Your code) Reserved Static data 0x 0040 0000 0x 1000 0000 0x 1000 8000 0x 7f f f f f f c Stack Dynamic data (heap) $sp $gp PC Solution set_array: addi $sp, $sp, -52 # move stack pointer sw $fp, 48($sp) # save frame pointer sw $ra, 44($sp) # save return address sw $a0, 40($sp) # save parameter (num) addi $fp, $sp, 48 # establish frame pointer add $s0, $zero, $zero # i = 0 addi $t0, $zero, 10 # max iterations is 10 Solution: cont’d loop: sll $t1, $s0, 2 # $t1 = i * 4 add $t2, $sp, $t1 # $t2 = address of array[i] add $a0, $a0, $zero # pass num as parameter add $a1, $s0, $zero # pass i as parameter jal co