Professional blog

Pre-Lab Reading:

Please watch the video that is posted on this week’s outline on ARM Load & Store operations.
Read the “DaveSpace ARM Tutorial,” pay more attention on the sections “Single register data transfer” and “Addressing modes”.
Read the Raspberry Pi tutorial on memory and load/store.  Also look at Chapter 8 – Arrays and Structures.
Read through the following tutorial on ARM Load & Store (memory read and memory write) and try the code shown in the tutorial:

Because ARM processors can only perform data processing on registers, interactions with memory only come in two flavors: (1) loading values from memory into registers, and (2) storing values into memory from registers.
The basic instructions for that are ldr (LoaD Register) and str (STore Register), which load and store words. Again, the most general form uses two registers and an Op2:

Here op is either ldr or str. Because they’re so similar in syntax, we will just use ldr for the remainder of the discussion on syntax, except when things are different. The condition flag again goes directly behind the base opcode. The type refers to the datatype to load (or store), which can be words, halfwords or bytes. The word forms do not use any extension, halfwords use -h or -sh, and bytes use -b and -sb. The extra s is to indicate a signed byte or halfword. We only use the word format in our labs. Because the registers are 32-bit, the top bits need to be sign-extended or zero-extended, depending on the desired datatype.

The first register here, Rd can be either the destination or source register. The thing between brackets always denotes the memory address; ldr means load from memory, in which case Rd is the destination, and str means store to memory, so Rd would be the source there. Rn is known as the base register, for reasons that we will go into later, and Op2 often serves as an offset. The combination works very much like array indexing and pointer arithmetic in C and C++.

As we discussed in class, there are three generally ways to access memory. The first available form is register indirect addressing, which gets the address from a register, like ‘ldr Rd, [Rn]’. An extension of this is pre-indexed addressing, which adds an offset to the base register before the load. The base form of this is ‘ldr Rd, [Rn, Op2]’. This is very much like array accesses. For example, ‘ldr r1, [r0, r2, lsl #2]’ corresponds to r0_w[r2*4]: a word-array load using r2’s value times 4 as the index/offset.

And then there are the so-called write-back modes. In the pre-index mode, the final address was made up of Rn+Op2, but that had no effect on Rn. With write-back, the final address is put in Rn. This can be useful for walking through arrays because you won’t need an actual index.
There are two forms of write-back, pre-indexing and post-indexing. Pre-indexing write-back works much like the normal write-back and is indicated by an exclamation mark after the brackets: ‘ldr Rd, [Rn, Op2]!’. Post-indexing doesn’t add Op2 to the address (and Rn) until after the memory access; its format is ‘ldr Rd, [Rn], Op2’.

.balign 4
/* Declares an array with fixed values as listed (primes) */
primes: .word 2,3,5,7,11,13,17 
/* Allocates space for 7 new values (7 * 4), uninitialized */
copy_primes: .skip 28 
Debugging and Inspecting Arrays with gdb – try it!!!
You might start by using the debugger to see how the register values change with the different indexing options for load / store. To use the debugger, we need to assemble our code with an additional directive which gdb will use. Use:
as –g –o copy_primes.o copy_primes.s
ld –o copy_primes copy_primes.o
Once you have linked your code, invoke gdb, inspect the code, disassemble the code, and set some break points:
gdb copy_primes
(gdb) list
(gdb) disassemble _start
(gdb) b _start
(gdb) b end
(gdb) q
For example, here’s an interaction that shows how the index incrementing works as we store the primes back into the the copy_primes array:
(gdb)r
(gdb)s
(gdb) info registers r0
r0             0x205d8    132568

Pre-lab reading: 

For the “DaveSpace ARM Tutorial,” read the sections “Multiple Register Data Transfer”, “The Stack”, and “A Call Chain”.
Read Chapter 9 and Chapter 10 of the ARM assembler in Raspberry Pi.

The first four registers r0-r3 (a1-a4) are used to pass argument values into a subroutine and to return a result value from a function. They may also be used to hold intermediate values within a routine (but, in general, only between subroutine calls). These values may be erased (not restored by functions on return). Saving values prior to a function call is the responsibility of the caller.

Register r12 (IP) may be used by a linker as a scratch register between a routine and any subroutine it calls. It can also be used within a routine to hold intermediate values between subroutine calls.
The role of register r9 is platform specific. A platform that has no need for such a special register may designate r9 as an additional callee-saved variable register, v6.
Typically, the registers r4-r8, r10 and r11 (v1-v5, v7 and v8) are used to hold the values of a routine’s local variables.  A subroutine must preserve the contents of the registers r4-r8, r10, r11 and SP. Preserving the original values in these registers and restoring the values prior to the return is the responsibility of the callee.
In all variants of the procedure call standard, registers r12-r15 have special roles. In these roles they are labeled IP, SP, LR and PC.

In the C programming language, it would look like this:
int mult(x, y) {
  if (y == 0)
    return 0;
  return mult(x, y-1) + x;
}

The same code in Python is :
def mult(x, y):
  “”” assuming y >=0 and is an integer “””
  if y == 0: 
    return 0
  return x + mult (x, y -1)

print(“mult(4, 3)”, 4*3, mult(4, 3))

Note that this is somewhat easier than general recursive functions as we don’t have to save any local values to the stack other than the return addresses. 

AAL5 Part 2: Modify your code from Lab #4 Part 1 so that it now has a “main”, really a starting point like _start, and a separate function “largest” that take 3 parameters (r0, r1, r2) and returns the largest of the three in r4.  The “main” will load these values from memory, call the function and then store the result back into memory.

As this function is a “leaf” function, and should only use R0-R3, it can be written more simply than recursive example in part 1 as it will not need to save and restore values from the stack. Still, your code must use stmfd to call the function and ldmfd to pop the activation record. 
AAL5 Part 3: The sum of numbers between 0 and n is the nth triangle number tri(n), sometimes represented as . Triangle numbers can be calculated recursively via tri(n) = tri(n-1) + n. Write the code that it now has a “main” that simply calls a RECURSIVE triangle function with a single parameter of 12 (that is retrieved from a memory labeled “trinput”).  This function will return the 12th triangle value and the main will then store only this one value back into memory in a memory location labeled “trinumber”. This recursive function implements the loop construction from lab 4. Triangle will have to save at least one parameter to the runtime stack in addition to the return addresses. [Hint: write this function in python first!!!]

AAL5 Part 4: Write code that has a “main” that simply calls a RECURSIVE fibonacci function with a single parameter of 16 (that is retrieved from a memory labeled “fibinput”.  This function will return the 16th fibonacci value and the main will then store only this one value back into memory in a memory location labeled “fibnumber”. Fibonacci will have to save at least the two parameters to the runtime stack in addition to the return addresses.
The KEYs of doing this lab successfully!!!
Start early
Test and do “stepwise refinement”
Be ready to use gdb to debug, even you believe your code never has bugs
Here is what the recursive Python version of the code might look like: 
def fib(n):
  if n     return 1
  return fib(n – 1) + fib (n -2) 

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.

Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.

Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Hac habitasse platea dictumst vestibulum rhoncus est pellentesque. Amet dictum sit amet justo donec enim diam vulputate ut. Neque convallis a cras semper auctor neque vitae. Elit at imperdiet dui accumsan. Nisl condimentum id venenatis a condimentum vitae sapien pellentesque. Imperdiet massa tincidunt nunc pulvinar sapien et ligula. Malesuada fames ac turpis egestas maecenas pharetra convallis posuere. Et ultrices neque ornare aenean euismod. Suscipit tellus mauris a diam maecenas sed enim. Potenti nullam ac tortor vitae purus faucibus ornare. Morbi tristique senectus et netus et malesuada. Morbi tristique senectus et netus et malesuada. Tellus pellentesque eu tincidunt tortor aliquam. Sit amet purus gravida quis blandit. Nec feugiat in fermentum posuere urna. Vel orci porta non pulvinar neque laoreet suspendisse interdum. Ultricies tristique nulla aliquet enim tortor at auctor urna. Orci sagittis eu volutpat odio facilisis mauris sit amet.

Tellus molestie nunc non blandit massa enim nec dui. Tellus molestie nunc non blandit massa enim nec dui. Ac tortor vitae purus faucibus ornare suspendisse sed nisi. Pharetra et ultrices neque ornare aenean euismod. Pretium viverra suspendisse potenti nullam ac tortor vitae. Morbi quis commodo odio aenean sed. At consectetur lorem donec massa sapien faucibus et. Nisi quis eleifend quam adipiscing vitae proin sagittis nisl rhoncus. Duis at tellus at urna condimentum mattis pellentesque. Vivamus at augue eget arcu dictum varius duis at. Justo donec enim diam vulputate ut. Blandit libero volutpat sed cras ornare arcu. Ac felis donec et odio pellentesque diam volutpat commodo. Convallis a cras semper auctor neque. Tempus iaculis urna id volutpat lacus. Tortor consequat id porta nibh.

Singapore University of Social Sciences