1. Spring 2014Jim Hogg - UW - CSE - P501K-1 CSE P501 – Compiler Construction Mapping source code to x86 Basic statements and expressions Objects, method calls, and dynamic dispatch

2. Spring 2014Jim Hogg - UW - CSE - P501K-2 Review: Variables For MiniJava, data is held in either A stack frame - for variables local to the method An object - for fields Local variables accessed via ebp ('above' ebp) eg: mov eax, [ebp - 12] Fields accessed via object address in a register Instead of ebp pointing to start of frame, use ecx pointing to start of object Details later

3. How to translate language constructs from MiniJava into assembly code? X = Y, X op Y, IF-THEN, IF-THEN-ELSE, WHILE, etc If you know assembler code for any chip, the translation templates should be obvious If you don't know assembler code, imagine translating MiniJava constructs into a primitive language whose only control flow is GOTO Spring 2014Jim Hogg - UW - CSE - P501K-3 Basic Statements and Expressions

4. Conventions in Examples Examples show code snippets in isolation Real code generator needs to deal with things like: Which registers are in use at which point in the program Which registers to spill into memory (pushed onto stack or stored in stack frame) when a new register is needed and no free ones are available Register eax used below as a generic example Rename as needed for more complex code Examples include a few peephole optimizations Spring 2014Jim Hogg - UW - CSE - P501K-4

5. Spring 2014Jim Hogg - UW - CSE - P501K-5 Code Generation for Constants Source 17 Idea Realize constant value in a register x86 mov eax, 17 Peephole Optimization if constant is 0, then: xor eax, eax

6. Spring 2014Jim Hogg - UW - CSE - P501K-6 Assignment Statement Source var = exp;// var is a local variable x86 mov [ebp-offset var ], eax

7. Spring 2014Jim Hogg - UW - CSE - P501K-7 Unary Minus Source -exp x86 neg eax Optimization Collapse -(-exp) to exp Unary plus is a no-op

8. Spring 2014Jim Hogg - UW - CSE - P501K-8 Binary + Source exp1 + exp2 x86 add eax, edx Optimizations If exp2 is a simple variable or constant: add eax, exp2 Change exp1 + (-exp2) into exp1 - exp2 If exp2 is 1 then: inc eax

9. Spring 2014Jim Hogg - UW - CSE - P501K-9 Binary -, * Same as + Use sub for – (but not commutative!) Use imul for * Optimizations Use left shift to multiply by powers of 2 If your multiplier is really slow or you’ve got free scalar units and multiplier is busy, consider: 10*x = (8*x)+(2*x) But this may perform worse on a different micro-architecture Use x+x instead of 2*x, etc (faster) Use dec for x-1

10. Spring 2014Jim Hogg - UW - CSE - P501K-10 Integer Division Slow on x86 Divides 64-bit integer in edx:eax by a 32-bit integer (eg, in ebx) ~50 clock latency Source exp1 / exp2 x86 cdq; extend eax into edx:eax, clobbers edx idiv ebx; => quotient in eax; remainder in edx

11. Spring 2014Jim Hogg - UW - CSE - P501K-11 Control Flow Basic idea: decompose higher level operation into jmps and conditional jmps In following slides, j false is used to mean jump when a condition is false No such instruction on x86! Will have to use appropriate instructions to set condition codes, followed by conditional jumps Normally wouldn’t actually generate the value “true” or “false” in a register

12. Spring 2014Jim Hogg - UW - CSE - P501K-12 While Source while (cond) stm x86 loop: j false done jmp loop done: Note In generated asm code we’ll need to create a unique label name for each loop, conditional statement, etc. eg: L123:

13. Spring 2014Jim Hogg - UW - CSE - P501K-13 Optimization for While Put the test at the end jmp test loop: test: j true loop Why bother? Pulls one jmp instruction out of the loop May avoid pipeline stall on jmp on each iteration But many chips assume backwards-branch is always taken Hardware branch-predictor will 'tune in' to the pattern Easy to do from AST or other IR; not so easy if generating code on- the-fly (eg, recursive-descent, 1-pass compiler)

14. Spring 2014Jim Hogg - UW - CSE - P501K-14 Do-While Source do stm while (cond); x86 loop: j true loop

15. Spring 2014Jim Hogg - UW - CSE - P501K-15 IF-THEN Source if (cond) stm x86 j false skip skip:

16. Spring 2014Jim Hogg - UW - CSE - P501K-16 IF-THEN-ELSE Source if (cond) stm1 else stm2 x86 j false else jmp done else: done:

17. Spring 2014Jim Hogg - UW - CSE - P501K-17 Jump Chaining Observation: naïve code gen can will produce jumps to jumps Optimization: if a jump targets an unconditional jump, change target of first jump to the target of the second Repeat until no further changes

18. Spring 2014Jim Hogg - UW - CSE - P501K-18 IF-ELSEIF-ELSE Source if (cond1) stm1 else if (cond2) stm2 else stm3 x86 j false elseif jmp done elseif: j false else jmp done else: jmp done done: Note: jump-to-next redundancy

19. Spring 2014Jim Hogg - UW - CSE - P501K-19 Boolean Expressions What do we do with this? x > y Expression evaluates to true or false Could generate the value in a register (eg: 0|1) But normally we don’t want/need the value; we’re only trying to decide whether to jump Eg: if (exp1 > exp2) stm cmpeax, edx jle L123 L123:

20. Spring 2014Jim Hogg - UW - CSE - P501K-20 Boolean Operators: ! Source ! exp eg: if (!exp) stm To compile: jnz L123, where L123 is label after stm

21. Spring 2014Jim Hogg - UW - CSE - P501K-21 Boolean Operators: && and || In C/C++/Java/C#, these are short-circuit operators Right operand is evaluated only if needed if (cond1 || cond2) if cond1 evaluates to true, then no need to evaluate cond2 if (cond1 && cond2) if cond1 evaluates to false, then no need to evaluate cond2 if (p != null && p.x == 2)... this check relies upon short-circuit evaluation! Basically, generate if statements that jump appropriately and only evaluate operands when needed

22. Spring 2014Jim Hogg - UW - CSE - P501K-22 Example: Code for && Source if (exp1 && exp2) stm x86 j false skip j false skip skip:

23. Spring 2014Jim Hogg - UW - CSE - P501K-23 Example: Code for || Source if (exp1 || exp2) stm x86 j true doit j false skip doit: skip:

24. Spring 2014Jim Hogg - UW - CSE - P501K-24 Realizing Boolean Values If a boolean value needs to be stored in a variable or method call parameter, generate code to create result Typical representations: 0 for false, +1 or -1 for true C specifies 0 and 1 if stored; we’ll use that Best choice can depend on machine instructions; normally some convention is established during the primeval history of the architecture (eg: VAX blbc)

25. Spring 2014Jim Hogg - UW - CSE - P501K-25 Boolean Values: Example Source var = bexp ; x86 j false genFalse mov eax, 1 jmp storeIt genFalse: mov eax, 0 storeIt:mov [ebp+offset var ], eax

26. Spring 2014Jim Hogg - UW - CSE - P501K-26 Better, If Enough Registers Source var = bexp ; x86 xor eax, eax j false storeIt inc eax storeIt:mov [ebp+offset var ], eax Or use conditional move instruction; avoids pipeline stalls mov eax, 1; assume bexp true cmovzeax, 0 mov [ebp+offset var ], eax

27. Spring 2014Jim Hogg - UW - CSE - P501K-27 Alternatively: setcc Source var = x < y; x86 mov eax, [ebp+offset x ] ; load x cmp eax, [ebp+offset y ] ; compare to y setl al; set AL to 0|1 if less than movzx eax,al ; zero-extend to 32 bits mov [ebp+offset var ],eax ; generated by asg stm Gnu mnemonic for movzx (byte->dbl word) is movzbl Or use conditional move (cmovcc) instruction for sequences like: x = y < z ? y : z

28. Spring 2014Jim Hogg - UW - CSE - P501K-28 Other Control Flow: switch Naïve: generate a chain of nested if-then-else’s Better: switch is intended to allow an O(1) selection, provided the set of switch values is reasonably compact Idea: create a 1-D array of jumps or labels and use the switch expression to select the right one Also need to generate an IF check that expression lies within bounds

29. Spring 2014 Jim Hogg - UW - CSE - P501K-29 Switch Source switch (exp) { case 0: stms0; case 1: stms1; case 2: stms2; } X86-ish “if (eax 2) jmp done” mov eax, swtab[eax * 4] jmp eax L0: jmp done L1: jmp done L2: jmp done done:.data swtabdd L0; switch table dd L1 dd L Assume no "fallthru"

30. Spring 2014Jim Hogg - UW - CSE - P501K-30 Arrays C/C++/Java have 1-dimensional arrays 0-origin array with n elements contains variables: a[0] … a[n-1] C/C++ n-dimensional arrays Multiple dimensions; row major order Java n-dimensional "jagged" arrays

31. Spring 2014Jim Hogg - UW - CSE - P501K-31 0-Origin 1-D Integer Arrays Source exp1[exp2] x86 address is [eax+4*edx]; 4 bytes per element 01234 contiguous cells in memory

32. Spring 2014Jim Hogg - UW - CSE - P501K-32 2-D Arrays C, etc (the curly-brace languages) use row-major order Fortran (and Excel) uses column-major order Exercises: What is the layout? How do you calculate location of a[i, j]? What happens when you pass array references between Fortran and C code? Java has "jagged" arrays - array of arrays 0,00,10,20,30,4 1,01,11,21,31,4... 1 5 -4 23 1 2 6 3 99 Java jagged arrays int[][] array = {{3, 4, 5}, {77, 50}}; int[][] a = { {1,5,-4,23}, {1,2,6,3}, {99} }

33. How to find A[row, col] Spring 2014Jim Hogg - UW - CSE - P501K-33 0,00,10,20,30,4 1,01,11,21,31,4 2,02,12,22,32,4 3,03,13,23,33,4 row column row-major layout 0,00,10,20,30,4 1,01,11,21,31,4 2,02,12,22,32,4 int A[row, col] = @A + (row * numcols + col) * 4// 0-based A[row, col] = @A + (row – rowmin) * (colmax – colmin + 1) * elemsize + (col – colmin) * elemsize

34. Spring 2014Jim Hogg - UW - CSE - P501K-34 Code Generation for Objects Representation Method calls Inheritance and overriding Strategies for implementing code generators Code improvement – optimization Next