1. Lecture 4: Advanced Instructions, Control, and Branching cont. EEN 312: Processors: Hardware, Software, and Interfacing Department of Electrical and Computer Engineering Spring 2014, Dr. Rozier (UM)

2. COURSE PLAN FOR TODAY 1.Control Instructions 2.Basic Memory Access

3. CONTROL INSTRUCTIONS

4. Branching Branches allow us to transfer control of the program to a new address. – b ( ) – bl ( ) b start bl start

5. Branch (b) Branch, possibly conditionally, to a new address. beq subroutine @ If Z=1, branch Good practice to use bal instead of b.

6. Branch with link (bl) Branch, possibly conditionally, to a new address. – Before the branch is complete, store the PC in the LR. – Allows easy return from the branch. bleq subroutine @ If Z=1, branch, saving the PC

7. Branch with link (bl) How do we get back once we’ve saved the PC? mov pc, lr Moves the contents of the link register to the program counter.

8. Goto vs. Subroutine b – Allows us to transfer control of the program without returning. bl – Allows us to transfer control of the program, with returning.

9. Implementing If Statements C code: if (i == j) f = g+h; else f = g - h; ARM code cmp r0, r1 @ Set flags via r0-r1 and discard bne Else add r2, r3, r4 @ r2 = r3 + r4 bal Exit Else: sub r2, r3, r4 @ r2 = r3 - r4 Exit:

10. Implementing Loop Statements C code: while (i < j) i += 1; ARM code Loop: cmp r0, r1 bge Exit add r0, r0, #1 bal Loop Exit: i < j? i=i+1 i<j Exit i>=j

11. What about a Case Statement? Say we have a case statement: switch(x) { case 0: foo(); break; case 1: bar(); break; case 2: baz(); break; case 3: qux(); break; }

12. Jump Tables Set up a portion of memory as such: If our case variable is stored in r0… – r0 << #2 is the index into our jump table of the function address. Memory LocationContents 0x???? + 0address of foo 0x???? + 4address of bar 0x???? + 8address of baz 0x???? + 12address of qux

13. Cases Statements as Jump Tables (assume r0 holds the switch variable) ldr r1, =jumptable ldr pc, [r1, r0, lsl #2] Wasn’t that easy?

14. Jump Table Exercise Convert the follow C-style code into ARMv6 instructions: x = getPrime(); switch(x) { case 1: firstPrime(); break; case 3: secondPrime(); break; case 5: thirdPrime(); break; case 7: fourthPrime(); break; default: notFirstFourPrimes(); }

15. Pseudo-Instructions Notice the use of: – ldr r0, =casetable – We saw this before in helloworld.s What is really going on here?

16. Pseudo-Instructions Code as we wrote it: Disasembled code: ldrr1,=string swi0 movr7,#1 swi0 0x8080ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x8090muleqr1r4r0

17. This is weird… Let’s play with gdb… x/x 0x8090 0x8090 :0x00010094 x/x 0x10094 0x10094 :“Hello World!\nA\025”

18. Looking back at the assembled code… While at instruction 0x8080 p/x $pc 0x8080 ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x8090muleqr1r4r0

19. Looking back at the assembled code… While at instruction 0x8080 p/x $pc+8 0x8088 0x8080ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x8090muleqr1r4r0 The real value of $pc +4

20. Looking back at the assembled code… While at instruction 0x8080 p/x $pc+8 0x8088 p/x ($pc+8)+8 0x8090 0x8080ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x8090muleqr1r4r0

21. So why does it show up as muleq? Representing instructions – Condition Field 0000 – EQ – 0000 | 000000 | 0 | 0 |????|????|????| 1001|???? mul r1, r4, r0 mul{ }{S} rd, rm, rs Cond000000ASRdRnRs1001Rm Instruc000000000000???? 1001???? Hex00010094 Bin0000 00010000 10010100

22. So why does it show up as muleq? Representing instructions mul r1, r4, r0 mul{ }{S} rd, rm, rs mul 0001, 0100, 0000 Cond000000ASRdRnRs1001Rm Instruc000000000000???? 1001???? Hex00010094 Bin0000 00010000 10010100

24. So what is this? Code as we wrote it: Disasembled code: ldrr1,=string swi0 movr7,#1 swi0 0x8080ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x8090muleqr1r4r0

25. The problem with immediates The fact that instructions, AND all their arguments, must take up only 32 bits limits the size of immediates to 1 byte. – Range 0 – 255. – Hello world was in 0x10094 – PC was at 0x8088 – Max offset with immediate value? 0x8088 + 0xFF = 0x8187

26. Enter, the Literal Pool 0x8080ldrr1,[pc,#8] 0x8084svc0x0 0x8088movr7#1 0x808csvc0x0 0x809000010094 Last instruction in basic block Literal Pool

27. Basic Blocks A basic block is a sequence of instructions with – No embedded branches (except at end) – No branch targets (except at beginning) A compiler identifies basic blocks for optimization An advanced processor can accelerate execution of basic blocks

28. So how do we use the Literal Pool? We’ve been using it all along. ldr r0, =string ldr r0, [pc, #8]

29. What about procedures? Implement the following: foo(int x) { x = x + 1 } main() { x = 1; foo(x); }

30. What about procedures? Implement the following: int foo(int x) { if (x < 5) x = foo(x+1); return(x) } main() { x = 1; x = foo(x); }

31. The problem with Procedures When we never branch back, who cares what state the registers are in? If we branch and return, we expect our registers to be in the state that we left them! – Procedures need to use registers too!

32. A Call Chain Image by David Thomas

33. Procedure Calling 1.Place parameters for procedure in registers 2.Transfer control to procedure 3.Procedure acquires storage 4.Procedure performs function. 5.Procedure places return value in appropriate register 6.Return control

34. The Stack Region of memory managed with stack discipline. Accessed with push and pop

35. The Stack

36. Procedure Call Example 0x000 0x004 0x008 push {lr} bl procedure_2 pop {pc} 0x100 0x104 0x108 0x10c 0x110 0x114 0x118 lr0x080 sp0x100 pcx

37. Procedure Call Example 0x000 0x004 0x008 push {lr} bl procedure_2 pop {pc} 0x1000x080 0x104 0x108 0x10c 0x110 0x114 0x118 lr0x080 sp0x104 pcx

38. Procedure Call Example 0x000 0x004 0x008 push {lr} bl procedure_2 pop {pc} 0x1000x080 0x1040x008 0x1080xa4f 0x10c0xfff 0x1100xcc4 0x1140xbeef 0x1180xdead lr0x008 sp0x104 pcx

39. Procedure Call Example 0x000 0x004 0x008 push {lr} bl procedure_2 pop {pc} 0x1000x080 0x1040x008 0x1080xa4f 0x10c0xfff 0x1100xcc4 0x1140xbeef 0x1180xdead lr0x080 sp0x100 pcx

40. Stack Frames Stack frames “belong” to a procedure. Store local variables here (they go out of scope automatically) Can communicate with other procedures with a stack frame.

41. Communicating with Procedures 0x100lr 0x104return 0 0x108return 1 0x10c 0x110 0x114 0x118 Caller sets up stack frame

42. Communicating with Procedures 0x100lr 0x104return 0 0x108return 1 0x10c 0x110 0x114 0x118 Callee stores values before return

43. Procedures and Register Use What if we want to use some registers in the procedure? Caller could have data in it!

44. Stack Discipline and ABI Stack Discipline is important Define an Application Binary Interface – How should procedures communicate? How should the be called? Consistency, following standards, is the key.

45. Conventions and Discipline Caller Caller saves temporary values in its frame before the call. Caller restores values in its frame after the call. Callee Callee saves temporary values in its frame before using. Callee restores values in its frame after using.

47. WRAP UP

48. For next time More on stacks, procedures, and calling.