Question

The following code searches an area of memory and counts the number of times a memory block is equal to a key word: mov X1, XZR search: ldur X5, [X3, #0] // load item cmp X5, X3 // compare with the key b.ne no_match // check for match addi X1, X1, #1 // count matches no_match: addi X3, X3, #8 // next item cmp X3, X4 // compare with the boundary b.le search // continue until all items Assume the code is executed on the python simulator that reports cycle count in the same way as project 3. How many stalls will be inserted during one iteration on a match case? How many stalls will be inserted during one iteration on a no match case?

          The following code searches an area of memory and counts the number of times a memory block is equal to a key word:
mov X1, XZR
search:
ldur X5, [X3, #0]          // load item
cmp X5, X3                  // compare with the key
b.ne no_match             // check for match
addi X1, X1, #1            // count matches
no_match:
addi X3, X3, #8            // next item
cmp X3, X4                  // compare with the boundary
b.le search                    // continue until all items
Assume the code is executed on the python simulator that reports cycle count in the same way as project 3.
How many stalls will be inserted during one iteration on a match case?
How many stalls will be inserted during one iteration on a no match case?

Added by Elizabeth P.

Question

Please give Ace some feedback