Nios/linklist len

In this problem, we will be working with a simple linked list. Each list element only contains a single word that is a pointer to the next node in the list. A pointer with value 0 (null pointer) indicates that the current node is the end of the list.

Write a function that will find the length of the linked list beginning at the node passed to the function as the first argument. A null pointer should return length 0. Do not attempt to detect cycles in the linked list (Cycles should cause your function to run forever.)

struct node { node *next; };
unsigned int listlen(node* list);

Expected solution length: Around 10 lines.

Sample Input

A -> B -> C -> null

Sample Output

.data
A: .word B
B: .word C
C: .word 0
.text
.global _start
    movia r4, A
    call listlen
1:  br 1b  # done

.global listlen
listlen:

Write your solution here

Upload a source file...

nios/linklist_len

nios/linklist_delPrevious

Nextnios/memcpy

Nios/linklist len

From ASMBits

Sample Input

Sample Output

Write your solution here

Or upload a file

Solution