Part $3$: Linked List Selection Sort $-$Extra Credit

Part $3$ requires that you sort a linked list of structs based on the value of one of the struct elements. $$A complete program in C is provided in listSort.c$.$

Compile and execute the C program so you understand what the behavior looks like. $$

Examine the program so you understand the code.

Translate the selectionsort function from listSort.c to assembly using listsort.og as a starting point.

The provided listsort.og$$contains the c code as comments, labels, and other helpful comments to help you structure your code.

Rename listsort.og to listsort.asm

Translate any missing helper functions.

Do not modify listmain.asm

You can modify listmain.asm for debug and testing purposes.

Your code in listsort.asm must not depend on any edits you made to listmain.asm for proper operation.

Your code must be in listsort.asm. The listmain.asm file: $.$text

$.$globl main

main:

li sp$,0$x$7$ffffe$00$

addi sp$,$sp$,-16$

# studentlist $=$ createList$($studentArr$,$ SIZE$)$;

li a$1,10$

la a$0,$ studentArr

jal createList

sw a$0,12($sp$)$

# sort$($&studentlist$)$;

addi a$0,$sp$,12$

jal sort

# printList$($studentlist$)$;

lw a$0,12($sp$)$

jal printList

# return

li a$7,10$

ecall

$.$globl addStudent

# asm is nutty as the struct was passed in the registers.

addStudent:

addi sp$,$sp$,-16$

sw ra$,12($sp$)$

sw s$0,8($sp$)$

sw s$1,4($sp$)$

mv s$1,$a$0$

mv s$0,$a$1$

li a$0,20$

jal malloc

lw a$2,0($s$0)$

lw a$3,4($s$0)$

lw a$4,8($s$0)$

lw a$5,12($s$0)$

sw a$2,0($a$0)$

sw a$3,4($a$0)$

sw a$4,8($a$0)$

sw a$5,12($a$0)$

sw s$1,16($a$0)$

lw ra$,12($sp$)$

lw s$0,8($sp$)$

lw s$1,4($sp$)$

addi sp$,$sp$,16$

jr ra

$.$globl createList

createList:

blez a$1,$endcreateList

addi sp$,$sp$,-48$

sw ra$,44($sp$)$

sw s$0,40($sp$)$

sw s$1,36($sp$)$

mv s$0,$a$0$

slli s$1,$a$1,2$

add s$1,$s$1,$a$1$

slli s$1,$s$1,2$

add s$1,$a$0,$s$1$

li a$0,0$

cloop:

lw a$1,0($s$0)$

lw a$2,4($s$0)$

lw a$3,8($s$0)$

lw a$4,12($s$0)$

lw a$5,16($s$0)$

sw a$1,0($sp$)$

sw a$2,4($sp$)$

sw a$3,8($sp$)$

sw a$4,12($sp$)$

sw a$5,16($sp$)$

mv a$1,$sp

jal addStudent

addi s$0,$s$0,20$

bne s$0,$s$1,$cloop

lw ra$,44($sp$)$

lw s$0,40($sp$)$

lw s$1,36($sp$)$

addi sp$,$sp$,48$

jr ra

endcreateList:

li a$0,0$

ret

$.$globl printList

printList:

beqz a$0,$endprintList

addi sp$,$sp$,-16$

sw ra$,12($sp$)$

sw s$0,8($sp$)$

mv s$0,$a$0$

lw a$0,8($s$0)$

jal printint

li a$0,0$x$20$

jal printchar

mv a$0,$s$0$

jal printstring

li a$0,0$x$20$

jal printchar

lw a$0,12($s$0)$

jal printint

li a$0,\text{'}$

$\text{'}$

jal printchar

lw a$0,16($s$0)$

jal printList

lw ra$,12($sp$)$

lw s$0,8($sp$)$

addi sp$,$sp$,16$

jr ra

endprintList:

ret

#essentially swizzles the next pointers of the args.

$.$globl swapNodes

swapNodes:

sw a$2,0($a$0)$

sw a$1,16($a$3)$

lw a$5,16($a$2)$

lw a$4,16($a$1)$

sw a$4,16($a$2)$

sw a$5,16($a$1)$

ret

$.$globl sort

sort:

addi sp$,$sp$,-16$

sw ra$,12($sp$)$

sw s$0,8($sp$)$

mv s$0,$a$0$

lw a$0,0($a$0)$

beqz a$0,$sortbasecase

jal recurSelectionSort

sw a$0,0($s$0)$

sortbasecase:

lw ra$,12($sp$)$

lw s$0,8($sp$)$

addi sp$,$sp$,16$

jr ra

$.$globl malloc

malloc:

# loosely simulates sbrk system call

# a$0=$ amount of memory in bytes

# a$0=$ address to the allocated block

li a$7,9$

ecall

ret

$.$globl printchar

printchar:

li a$7,11$

ecall

ret

$.$globl printint

printint:

li a$7,1$

ecall

ret

$.$globl printstring

printstring:

li a$7,4$

ecall

ret

$.$globl studentArr

$.$data

studentArr:

$.$string "Dougy"

$.$word $13$

$.$word $2122$

$.$word $0$

$.$string "Timmy"

$.$word $15$

$.$word $2122$

$.$word $0$

$.$string "Emily"

$.$word $18$

$.$word $2123$

$.$word $0$

$.$string "Jimmy"

$.$word $14$

$.$word $2120$

$.$word $0$

$.$string "Kimmy"

$.$word $11$

$.$word $2123$

$.$word $0$

$.$string "Carlo"

$.$word $19$

$.$word $2123$

$.$word $0$

$.$string "Vicky"

$.$word $22$

$.$word $2120$

$.$word $0$

$.$string "Anton"

$.$word $12$

$.$word $2322$

$.$word $0$

$.$string "Brady"

$.$word $10$

$.$word $2120$

$.$word $0$

$.$string "Sonya"

$.$word $16$

$.$word $2123$

$.$word $0$ I need the listsort.asm file. The one I made was not sorting the list in order I kept getting: $16$ Sonya $2123$

$12$ Anton $2322$

$19$ Carlo $2123$

$22$ Vicky $2120$

$10$ Brady $2120$

$11$ Kimmy $2123$

$14$ Jimmy $2120$

$18$ Emily $2123$

$15$ Timmy $2122$

$13$ Dougy