1. CPSC 388 – Compiler Design and Construction Code Generation

2.  Global Variables  Functions (entry and exit)  Statements  Expressions  Assume only scalar variables, no arrays (you figure out arrays)  Generate MIPS assembly code for Spim  http://pages.cs.wisc.edu/~larus/spim.html

3. Spim Interpreter spim –file  is the name file containing MIPS assembly code  Program will run, giving output and errors to screen  Also has graphical interface

4. Some Spim Registers RegisterPurpose $spStack pointer $fpFrame pointer $raReturn address $v0, $a0Used for output and return value $t0-$t7temporaries

5. Helps for Generating Assembly Code  Constants Used SP, FP, RA, V0, A0, T0, T1, TRUE, FALSE  Methods Used generate(opcode, arg1, arg2, arg3) generateIndexed(opcode,R1,R2,offset) genPush(R1) genPop(R1) String nextLabel() genLabel(label)

6. Global Variables  For each global variable, v:.data.align 2 # align on word boundary _v:.space N N is the size of the variable in bytes  int: 4 bytes  arrays: 4*(size of array)

7. Global Variable Example  Give source code int x; int y[10];  Generate code.data.align 2 _x:.space 4.data.align 2 _y:.space 40

8. Code Generation for Functions  For each Function Function preamble Function entry (setup AR) Function body (function’s statements) Function exit (restore stack, return to caller)

9. Function Preamble  For the main function generate:.text.globl main main:  All other functions:.text _ : Where is the function name

10. Function Entry Caller’s AR parameters <- FP <- SP Caller’s AR parameters <- FP <- SP return add Control link Space for Local vars New AR

11. Function Entry Steps  Push RA sw$ra, 0($sp) subu$sp, $sp, 4  Push CL sw$fp, 0($sp) subu$sp, $sp, 4  Set FP addu$fp, $sp,  Push space for local vars subu$sp, $sp,

12. Function Body  No need for code from DeclListNode  Call codeGen() for statement nodes in StmtListNode FnBodyNode DeclListNodeStmtListNode

13. Function Exit  Pop AR  Jump to RA field lw$ra, - ($fp) move$t0, $fp lw$fp, - ($fp) move$sp, $t0 jr$ra Caller’s AR parameters <- FP <- SP return add Control link Space for Local vars New AR

14. Function Returns  Return statement  End of function  Two ways to handle this Generate return code once and have return statements jump to this code (op code is ‘b’ for branch) Generate return code for each return statement and end of function

15. Return Statement’s value  Return statements can return a a value from an ExpNode  ExpNodes will push values onto the stack  Return statement should pop the top of stack and place return value in register V0 before the rest of return code

16. Statements  Write a different codeGen() method for each kind of statement in AST  Hard to debug assembly code  Alternate method: Write codeGen() for the WriteIntStmtNode and WriteStrStmtNode classes first (maybe one method) Test codeGen() for other kinds of statements and expressions by writing a c- program that computes and prints a value.

17. Write Statement  Call codeGen for expression being printed Leaves value on top of stack (if int) Leaves address on top of stack (if String)  Pop top of stack into A0 (register used for output)  Set register V0 to  1 of int  4 if String  Generate: syscall

18. Write Statement Example myExp.codeGen(); genPop(A0); if ( type is int) generate(“li”,V0,1); else if (type is String) generate(“li”,V0,4); generate(“syscall”);

19. If Statement Two Methods for Generating code Numeric Method Control-Flow Method IfStmtNode DeclListNodeStmtListNodeExpNode

20. Numeric Method for If Statements  Evaluate the condition, leave value on stack  Pop top of stack into register T0  Jump to FalseLabel if T0==FALSE  Code for statement list  FalseLabel: Note: Every Label in assembly code must be unique! I’m Using FalseLabel but the actual label is generated using genLabel()

21. You Try It  Write the actual code needed for IfStmtNode  What is the form for IfElseStmtNode?  What is the form for WhileStmtNode?

22. Return Stmt  Call codeGen() for expNode child (leaves result value on stack)  Pop value off stack into V0  Generate code for actual return Pop AR Jump to address in RA ReturnStmtNode ExpNode ReturnStmtNode

23. Read Statement  Code: li$v0, 5 syscall  Loads special value 5 into register V0, then does syscall.  5 tells syscall to read in an integer and store it back in V0  Need to write code to copy value from V0 back into address represented by ExpNode ReadStmtNode ExpNode

24. ReadStmtNode Examples int x; int *p; int **q; *q=p=&x; scanf(“%d”,&x); scanf(“%d”,p); scanf(“%d”,*q);  All three calls to scanf read in a value into variable x. The value of the expression is the address of x.  To store value into address do: Generate code to compute value of expression (value is pushed onto stack) Pop the value into T0 Store from V0 to address in T0

25. ReadStmtNode Example generate(“li”,V0,5); generate(“syscall”); myExp.codeGen(); genPop(T0); generateIndexed(“sw”,V0,T0,0);

26. Identifiers in Code Generation  Function call (id is name of function)  Expressions (can be just a name (id) or an id can be one of the operands)  Assignment statements (id of left- hand side) Need to jump-and-link to instruction using the name of function Generate code to fetch current value and push onto stack Generate code to fetch the address of variable and push address onto stack

27. IdNode  Needs several methods genJumpAndLink() generate jump and link code for given IdNode codeGen() pushes value of IdNode expression onto stack genAddr() pushes address of IdNode onto stack

28. genJumpAndLink() for IdNode  simply generate a jump-and-link instruction (with opcode jal ) using label as target of the jump.  If the called function is "main", the label is just "main". For all other functions, the label is of the form: _

29. codeGen() for IdNode  copy the value of the global / local variable into a register (e.g., T0), then push the value onto the stack  Different for local or global variables Examples: lw $t0 _g // load global g into T0 lw $t0 -4($fp) // load local into T0  How do you tell if variable is local or global? – Using Symbol Table

30. genAddr() for IdNode  load the address of the identifier into a register then push onto the stack  Uses opcode for loading address la rather than loading values lw  Different for locals or globals Examples: la $t0, _g // global la $t0, -8($fp) // local

31. AssignStmtNode  Push the address of the left-hand-side expression onto the stack.  Evaluate the right-hand-side expression, leaving the value on the stack.  Store the top-of-stack value into the second-from-the top address. AssignStmtNode ExpNode

32. Expression Node codeGen  Always generate code to leave value of expression on top of stack  Literals IntLitNode, StrLitNode  Function Call  Non short-circuited operators  Short-circuited operators

33. IntLitNode  generate code to push the literal value onto the stack  Generated code should look like: li $t0, # load value into T0 sw $t0, ($sp) # push onto stack subu $sp, $sp, 4

34. StrLitNode  Store string literal in data area  Push address of string onto stack  Two string lits should be equal if they contain the same characters  This means store only a single instance of a string literal no matter how often it appears in user code

35. Storing String Literals  Code to store a string literal in data area.data :.asciiz  needs to be a new label; e.g., returned by a call to nextLabel.  needs to be a string in quotes. You should be storing string literals that way, so just write out the value of the string literal, quotes and all.

36. Storing Strings Once  To avoid storing the same string literal value more than once, keep a hashtable in which the keys are the string literals, and the associated information is the static- data-area label.  When you process a string literal, look it up in the hashtable: if it is there, use its associated label; otherwise, generate code to store it in the static data area, and add it to the hashtable.

37. Pushing StrLitNodes onto stack  Generated Code:.text la $t0, #load addr into $t0 sw $t0, ($sp) #push onto stack subu $sp, $sp, 4

38. CallExpNode  Code Should: Evaluate each actual parameter, pushing the values onto the stack; Jump and link (jump to the called function, leaving the return address in the RA register). Push the returned value (which will be in register V0) onto the stack. CallExpNode ExpListNodeIdNode  Since the codeGen method for an expression generates code to evaluate the expression, leaving the value on the stack, all we need to do for step 1 is call the codeGen method of the ExpListNode (which will in turn call the codeGen methods of each ExpNode in the list). For step 2, we just call the genJumpAndLink method of the IdNode. For step 3, we just call genPush(V0).

39. Also CallStmtNode  CallExpNode pushes value onto stack (may be void, i.e. garbage from V0)  CallStmtNode MUST pop value off stack CallExpNode ExpListNodeIdNode CallStmtNode

40. Non-Short Circuited ExpNodes  Plus, Minus, …, Not, Less, Equals,…  All do Same basic sequence of tasks Call each child's codeGen method to generate code that will evaluate the operand(s), leaving the value(s) on the stack. Generate code to pop the operand value(s) off the stack into register(s) (e.g., T0 and T1). Remember that if there are two operands, the right one will be on the top of the stack. Generate code to perform the operation (see Spim documentation for a list of opcodes). Generate code to push the result onto the stack.

41. Note on SPIM op-codes  The NOT opcode is a bit-wise note (flips bits), this won’t work for the Not boolean operations  Suggest using seq opcode SeqRdest, Rsrc1, Src2

42. Example AddExpNode public void codeGen() { // step 1: evaluate both operands myExp1.codeGen(); myExp2.codeGen(); // step 2: pop values in T0 and T1 genPop(T1); genPop(T0); // step 3: do the addition (T0 = T0 + T1) generate("add", T0, T0, T1); // step 4: push result genPush(T0) } AddExpNode ExpNode

43. Short-Circuited Operators  AndNode and OrNode  Short-Circuit means the right operand is evaluated ONLY if it is needed to be evaluated  Example: (J != 0) && (I/J > Epsilon)

44. AndNode Procedure Evaluate left operand If left operand is true then Evaluate right operand Expression value is value of right operand Else Expression value is false

45. OrNode Procedure Evaluate left operand If left operand is false evaluate right operand expression is value of right operand Else expression is true

46. Short-Circuit Nodes  Need to do jump depending on values of sub-expressions  Look at if-node code for example of this

47. You Try It  Write code for AndExpNode

48. If Statement Two Methods for Generating code Numeric Method  Evaluate condition, pop off stack, jump on particular value Control-Flow Method  Evaluate condition and jump to TrueLabel on true or FalseLabel on false (i.e. ALWAYS do a jump)  Requires a new method for Expression Nodes (i.e. don’t put value on the stack, instead do jump)  Call New method genJumpCode(LabelTrue,LabelFalse) IfStmtNode DeclListNodeStmtListNodeExpNode

49. codeGen for IfStmtNode (control- flow method) public void codeGen() { String trueLab = nextLabel(); String doneLab = nextLab(); myExp.genJumpCode(trueLab, doneLab); genLabel(trueLab); myStmtList.codeGen(); genLabel(doneLab); }

50. genJumpCode() for IdNode  Old way lw$t0, push$t0  New way lw$t0, beq$t0, FALSE, falseLab btrueLab

51. genJumpCode() for LessNode  Old Way -- code to eval operands -- pop values into T1, T0 slt$t2, $t0, $t1 push$t2  New Way -- code to eval operands -- pop values into T1, T0 blt $t0, $t1, trueLab B falseLab

52. genJumpCode() for Short-Circuited Operators (AndExpNode)  Call genJumpCode() of left child. If child is false then jump to false label If child is true jump to right child  Generate label for right child  Call genJumpCode() of right child. If child is false jump to false label If child is true jump to true label AndExpNode ExpNode

53. genJumpCode() for AndExpNode Public void genJumpCode(String trueLab, String falseLab) { String newLab=nextLabel(); myExp1.genJumpCode(newLab,falseLab); genLabel(newLab); myExp2.genJumpCode(trueLab,falseLab); }

54. Example with genJumpCode If (a && b>0) { … IfStmtNode DeclListNode AndExpNode StmtListNode IdNodeLessExpNode … …

55. genJumpCode() Example  IfStmtNode creates two labels, trueLab, doneLab calls AndNode’s genJumpCode(trueLabel,doneLabel) Generate trueLab --code for StmtListNode Generate doneLabel  AndNode creates a label newLabel, calls IdNode’s genJumpCode(newLabel,doneLabel) Generate newLabel Call LessNode’s genJumpCode(trueLab,doneLab)

56. You Try It  What is the form of the code for genJumpCode() For an OrNode For a NotNode

57. Comparing Numeric and Control- Flow methods  Numeric Method -- code to evaluate left operand, leaving value on stack Pop into T0 Goto trueLab if t0==FALSE Push FALSE Goto doneLab trueLab: -- code to evalute right operand, leaving value on stack doneLab:  Control-Flow Method --code to evaluate left operand, including jumps to newLab and falseLab newLab: --code to evaluate right operand, including jumps to trueLab and falseLab

58. You Try It  Compare two approaches for OrNode and NotNode