CSc 453 Intermediate Code Generation Saumya Debray The

CSc 453 Intermediate Code Generation Saumya Debray The University of Arizona Tucson

Overview l Intermediate representations span the gap between the source and target languages: l l closer to target language; (more or less) machine independent; allows many optimizations to be done in a machineindependent way. Implementable via syntax directed translation, so can be folded into the parsing process. CSc 453: Intermediate Code Generation 2

Types of Intermediate Languages l High Level Representations (e. g. , syntax trees): l l closer to the source language easy to generate from an input program code optimizations may not be straightforward. Low Level Representations (e. g. , 3 -address code, RTL): l closer to the target machine; l easier for optimizations, final code generation; CSc 453: Intermediate Code Generation 3

Syntax Trees A syntax tree shows the structure of a program by abstracting away irrelevant details from a parse tree. l Each node represents a computation to be performed; l The children of the node represents what that computation is performed on. Syntax trees decouple parsing from subsequent processing. CSc 453: Intermediate Code Generation 4

Syntax Trees: Example Grammar : Parse tree: E E+T | T T T*F | F F ( E ) | id Input: id + id * id Syntax tree: CSc 453: Intermediate Code Generation 5

Syntax Trees: Structure l Expressions: l l leaves: identifiers or constants; internal nodes are labeled with operators; the children of a node are its operands. Statements: l l a node’s label indicates what kind of statement it is; the children correspond to the components of the statement. CSc 453: Intermediate Code Generation 6

Constructing Syntax Trees General Idea: construct bottom-up using synthesized attributes. E→E+E { $$ = mk. Tree(PLUS, $1, $3); } S → if ‘(‘ E ‘)’ S Opt. Else { $$ = mk. Tree(IF, $3, $5, $6); } Opt. Else → else S { $$ = $2; } | /* epsilon */ { $$ = NULL; } S → while ‘(‘ E ‘)’ S { $$ = mk. Tree(WHILE, $3, $5); } mk. Tree(Node. Type, Child 1, Child 2, …) allocates space for the tree node and fills in its node type as well as its children. CSc 453: Intermediate Code Generation 7

Three Address Code l l l Low-level IR instructions are of the form ‘x = y op z, ’ where x, y, z are variables, constants, or “temporaries”. At most one operator allowed on RHS, so no ‘built-up” expressions. Instead, expressions are computed using temporaries (compiler-generated variables). CSc 453: Intermediate Code Generation 8

Three Address Code: Example l Source: if ( x + y*z > x*y + z) a = 0; l Three Address Code: tmp 1 = y*z tmp 2 = x+tmp 1 // x + y*z tmp 3 = x*y tmp 4 = tmp 3+z // x*y + z if (tmp 2 <= tmp 4) goto L a = 0 L: CSc 453: Intermediate Code Generation 9

An Intermediate Instruction Set l Assignment: l l x = y op z (op binary) x = op y (op unary); x=y l if ( x op y ) goto L label); goto L Pointer and indexed assignments: l l l x = y[ z ] = x x = &y x = *y *y = x. Procedure call/return: l l l Jumps: l l (L a l l (x is the kth Type Conversion: l l param x, k param) retval x call p enter p leave p return retrieve x x = cvt_A_to_B y (A, B base types) e. g. : cvt_int_to_float Miscellaneous l label L CSc 453: Intermediate Code Generation 10

Three Address Code: Representation l Each instruction represented as a structure called a quadruple (or “quad”): l l contains info about the operation, up to 3 operands. for operands: use a bit to indicate whether constant or ST pointer. E. g. : if ( x y ) goto L x=y+z CSc 453: Intermediate Code Generation 11

Code Generation: Approach l function prototypes, global declarations: l l save information in the global symbol table. function definitions: l l l function name, return type, argument type and number saved in global table (if not already there); process formals, local declarations into local symbol table; process body: l l l construct syntax tree; traverse syntax tree and generate code for the function; deallocate syntax tree and local symbol table. CSc 453: Intermediate Code Generation 12

Code Generation: Approach Recursively traverse syntax tree: l l l Node type determines action at each node; Code for each node is a (doubly linked) list of three-address instructions; Generate code for each node after processing its children code. Gen_stmt(syn. Tree_node S) { switch (S. nodetype) { case FOR: … ; break; case WHILE : … ; break; case IF: … ; break; case ‘=‘ : … ; break; … } code. Gen_expr(syn. Tree_node E) { switch (E. nodetype) { case ‘+’: … ; break; case ‘*’ : … ; break; case ‘–’: … ; break; case ‘/’ : … ; break; … } recursively process the CSc 453: Intermediate Code Generation children, then generate code for this node and glue it all together. 13

Intermediate Code Generation Auxiliary Routines: l struct symtab_entry *newtemp(typename t) creates a symbol table entry for new temporary variable each time it is called, and returns a pointer to this ST entry. l struct instr *newlabel() returns a new label instruction each time it is called. l struct instr *newinstr(arg 1, arg 2, …) creates a new instruction, fills it in with the arguments supplied, and returns a pointer to the result. CSc 453: Intermediate Code Generation 14

Intermediate Code Generation… l l struct symtab_entry *newtemp( t ) { struct symtab_entry *ntmp = malloc( … ); /* check: ntmp == NULL? */ ntmp->name = …create a new name that doesn’t conflict… ntmp->type = t; ntmp->scope = LOCAL; return ntmp; } struct instr *newinstr(op. Type, src 1, src 2, dest) { struct instr *ninstr = malloc( … ); /* check: ninstr == NULL? */ ninstr->op = op. Type; ninstr->src 1 = src 1; ninstr->src 2 = src 2; ninstr->dest = dest; return ninstr; } CSc 453: Intermediate Code Generation 15

Intermediate Code for a Function Code generated for a function f: l begin with ‘enter f ’, where f is a pointer to the function’s symbol table entry: l l l this is followed by code for the function body; l l this allocates the function’s activation record; activation record size obtained from f ’s symbol table information; generated using code. Gen_stmt(…) discussed soon] [to be each return in the body (incl. any implicit return at the end of the function body) are translated to the code CSc 453: Intermediate Code Generation leave f /* clean up: f a pointer to the function’s symbol table entry 16

Simple Expressions Syntax tree node for expressions augmented with the following fields: l l l type: the type of the expression (or “error”); code: a list of intermediate code instructions for evaluating the expression. place: the location where the value of the expression will be kept at runtime CSc 453: Intermediate Code Generation 17

Simple Expressions Syntax tree node for expressions augmented with the following fields: l l l type: the type of the expression (or “error”); code: a list of intermediate code instructions for evaluating the expression. place: the location where the value of the expression will be kept at runtime l When generating intermediate code, the “place” field just refers to a symbol table entry for a variable or temporary that will hold that value; l The variable/temporary is mapped to an actual memory location when going from intermediate to final code. CSc 453: Intermediate Code Generation 18

Simple Expressions 1 Integer constants Syntax tree node E E intcon Action during intermediate code generation code. Gen_expr(E) { /* E. nodetype == INTCON; */ E. place = newtemp(E. type); src dest intcon. val); op E. place, E. code = newinstr(ASSG, /* E. place = intcon. val; */ } CSc 453: Intermediate Code Generation 19

Simple Expressions 2: l-values (1) Scalar variables Syntax tree node E E id Action during intermediate code generation code. Gen_expr(E) { /* E. nodetype == ID; */ E. place = id. place; /* E. place is just the location of id (nothing more to do) */ E. code = NULL; } CSc 453: Intermediate Code Generation 20

Simple Expressions 2: l-values (2) Array elements Syntax tree node E E E 1 [] E 2 Action during intermediate code generation code. Gen_expr(E) /* E. nodetype == ARRAY_REF; */ { SIZEOF(E 1. elt_type) depends on target architecture. code. Gen_expr(E 1); Fill in this value at final code. Gen_expr(E 2); generation time tmp 1 = newtemp( address ); /* Source: … A[e] … */ tmp 0 = value of e tmp 2 = 4 * tmp 0 } tmp 1 = addr(A) + tmp 2 address of A[e] = tmp 1 tmp 2 = newtemp( address ); E. place = tmp 1 E. code = E 1. code E 2. code newinstr( tmp 2, MULT, E 2. place, SIZEOF(E 1. elt_type) ) newinstr( tmp 1, ADD, E 1. loc, tmp 2) /* value of A[e] is at *tmp 1 */ CSc 453: Intermediate Code Generation 21

Simple Expressions 2: l-values (3) Structure fields Syntax tree node E E E 1 . id Action during intermediate code generation code. Gen_expr(E) /* E. nodetype == STRUCT_REF; */ { OFFSET(E, id) depends on target architecture. code. Gen_expr(E 1); Fill in this value at final code tmp 1 = newtemp( address ); generation time E. place = tmp 1 E. code = E 1. code newinstr( tmp 1, ADD, E 1. loc, OFFSET(E, id) ) } /* Source: … S. a … */ let = offset of a tmp 1 = addr(S) + address of S. a = tmp 1 /* value of S. a is at *tmp 1 */ CSc 453: Intermediate Code Generation 22

Simple Expressions 3 Syntax tree node E code. Gen_expr(E) { /* E. nodetype == UNARY_MINUS */ code. Gen_expr(E 1); /* recursively traverse E 1, generate code for it */ E. place = newtemp( E. type ); /* allocate space to hold E’s value */ E. code = E 1. code newinstr(UMINUS, E 1. place, NULL, E. place); } E – E 1 E E 1 Action during intermediate code generation + E 2 code. Gen_expr(E) { /* E. nodetype == ‘+’ … other binary operators are similar */ code. Gen_expr(E 1); code. Gen_expr(E 2); /* generate code for E 1 and E 2 */ E. place = newtemp( E. type ); /* allocate space to hold E’s value */ E. code = E 1. code E 2. code newinstr(PLUS, E 1. place, E 2. place, E. place ); } CSc 453: Intermediate Code Generation 23

Assignments S: LHS = RHS Code structure: evaluate LHS evaluate RHS copy value of RHS into LHS code. Gen_stmt(S): /* base case: S. nodetype = ‘S’ */ code. Gen_expr(LHS); code. Gen_expr(RHS); S. code = LHS. code RHS. code newinstr(ASSG, LHS. place, RHS. place) ; CSc 453: Intermediate Code Generation 24

Logical Expressions 1 l Syntax tree node: relop E 1 l l E 2 Naïve but Simple Code (TRUE=1, FALSE=0): t 1 = { evaluate E 1 t 2 = { evaluate E 2 t 3 = 1 /* TRUE */ if ( t 1 relop t 2 ) goto L t 3 = 0 /* FALSE */ L: … Disadvantage: lots of unnecessary memory references. CSc 453: Intermediate Code Generation 25

Logical Expressions 2 l l Observation: Logical expressions are used mainly to direct flow of control. Intuition: “tell” the logical expression where to branch based on its truth value. l When generating code for B, use two inherited attributes, true. Dst and false. Dst. Each is (a pointer to) a label instruction. E. g. : for a statement if ( B ) S 1 else S 2 : B. true. Dst = start of S 1 B. false. Dst = start of S 2 l The code generated for B jumps to the appropriate label. CSc 453: Intermediate Code Generation 26

Logical Expressions 2: cont’d Syntax tree: relop E 1 Example: E 2 code. Gen_bool(B, true. Dst, false. Dst): /* base case: B. nodetype == relop */ B. code = E 1. code E 2. code newinstr(relop, E 1. place, E 2. place, true. Dst) newinstr(GOTO, false. Dst, NULL); B x+y > 2*z. Suppose true. Dst = Lbl 1, false. Dst = Lbl 2. E 1 x+y, E 1. place = tmp 1, E 1. code ‘tmp 1 = x + y’ E 2 2*z, E 2. place = tmp 2, E 2. code ‘tmp 2 = 2 * z’ B. code = E 1. code E 2. code ‘if (tmp 1 > tmp 2) goto Lbl 1’ goto Lbl 2 = ‘tmp 1 = x + y’ , ‘tmp 2 = 2 * z’, ‘if (tmp 1 > tmp 2) goto Lbl 1’ , goto Lbl 2 CSc 453: Intermediate Code Generation 27

Short Circuit Evaluation && B 1 B 2 || B 1 B 2 code. Gen_bool (B, true. Dst, false. Dst): /* recursive case 1: B. nodetype == ‘&&’ */ L 1 = newlabel( ); code. Gen_bool(B 1, L 1, false. Dst); code. Gen_bool(B 2, true. Dst, false. Dst); B. code = B 1. code L 1 B 2. code; code. Gen_bool (B, true. Dst, false. Dst): /* recursive case 2: B. nodetype == ‘||’ */ L 1 = newlabel( ); code. Gen_bool(B 1, true. Dst, L 1); code. Gen_bool(B 2, true. Dst, false. Dst); B. code = B 1. code L 1 B 2. code; CSc 453: Intermediate Code Generation 28

Conditionals Syntax Tree: S: B l if S 1 S 2 Code Structure: code to evaluate B Lthen: code for S 1 goto Lafter Lelse: code for S 2 Lafter : … code. Gen_stmt(S): /* S. nodetype == ‘IF’ */ Lthen = newlabel(); Lelse = newlabel(); Lafter = newlabel(); code. Gen_bool(B, Lthen , Lelse); code. Gen_stmt(S 1); code. Gen_stmt(S 2); S. code = B. code Lthen S 1. code newinstr(GOTO, Lafter) Lelse S 2. code Lafter ; CSc 453: Intermediate Code Generation 29

Loops 1 S: B while S 1 Code Structure: Ltop : code to evaluate B if ( !B ) goto Lafter Lbody: code for S 1 goto Ltop Lafter: … code. Gen_stmt(S): /* S. nodetype == ‘WHILE’ */ Ltop = newlabel(); Lbody = newlabel(); Lafter = newlabel(); code. Gen_bool(B, Lbody, Lafter); code. Gen_stmt(S 1); S. code = Ltop B. code Lbody S 1. code newinstr(GOTO, Ltop) Lafter ; CSc 453: Intermediate Code Generation 30

Loops 2 S: B while S 1 Code Structure: goto Leval Ltop : code for S 1 Leval: code to evaluate B if ( B ) goto Ltop Lafter: This code executes fewer branch ops. code. Gen_stmt(S): /* S. nodetype = ‘WHILE’ */ Ltop = newlabel(); Leval = newlabel(); Lafter = newlabel(); code. Gen_bool(B, Ltop, Lafter); code. Gen_stmt(S 1); S. code = newinstr(GOTO, Leval) Ltop S 1. code Leval B. code Lafter ; CSc 453: Intermediate Code Generation 31

Handling a Sequence of Statements S: S 1 seq S 2 code. Gen_stmt(S): /* S. nodetype == 1 SEQ’ */ code. Gen_stmt(S 1); code. Gen_stmt(S 2); S. code = S 1. code S 2. code CSc 453: Intermediate Code Generation 32

Multi-way Branches: switch statements Goal: l generate code to (efficiently) choose amongst a fixed set of alternatives based on the value of an expression. Implementation Choices: l l linear search l best for a small number of case labels ( 3 or 4) l cost increases with no. of case labels; later cases more expensive. binary search l best for a moderate number of case labels ( 4 – 8) l cost increases with no. of case labels. jump tables l best for large no. of case labels ( 8) l may take a large amount of space if the labels are not well CSc 453: Intermediate Code Generation 33 -clustered.

Background: Jump Tables l A jump table is an array of code addresses: l l l Tbl[ i ] is the address of the code to execute if the expression evaluates to i. if the set of case labels have “holes”, the correspond jump table entries point to the default case. Bounds checks: l l Before indexing into a jump table, we must check that the expression value is within the proper bounds (if not, jump to the default case). The check lower_bound exp_value upper bound can be implemented using a single unsigned comparison. CSc 453: Intermediate Code Generation 34

Jump Tables: cont’d l Given a switch with max. and min. case labels cmax and cmin, the jump table is accessed as follows: Instruction t 0 value of expression t 0 = t 0 – cmin if (t 0 u cmax – cmin) goto Default. Case t 1 = Jmp. Tbl_Base. Addr t 1 += 4*t 0 jmp *t 1 Cost (cycles) … 1 4 to 6 1 1 3 to 5 : 10 to 14 CSc 453: Intermediate Code Generation 35

Jump Tables: Space Costs l A jump table with max. and min. case labels cmax and cmin needs cmax – cmin entries. This can be wasteful if the entries aren’t “dense enough”, e. g. : switch (x) { case 1: … case 1000000: … } l Define the density of a set of case labels as density = no. of case labels / (cmax – cmin ) l Compilers will not generate a jump table if density below some threshold (typically, 0. 5). CSc 453: Intermediate Code Generation 36

Switch Statements: Overall Algorithm if no. of case labels is small ( ~ 8), use linear or binary search. l l l use no. of case labels to decide between the two. if density threshold (~ 0. 5) : l generate a jump table; else : l l l divide the set of case labels into sub-ranges s. t. each sub-range has density threshold; generate code to use binary search to choose amongst the sub-ranges; handle each sub-range recursively. CSc 453: Intermediate Code Generation 37

Function Calls l Caller: l evaluate actual parameters, place them where the callee expects them: l l /* x is the kth actual parameter of the save appropriate machine state (e. g. , return address) and transfer control to the callee: l l param x, k call */ call p Callee: l allocate space for activation record, save calleesaved registers as needed, update stack/frame pointers: l enter p CSc 453: Intermediate Code Generation 38

Function Returns l Callee: l restore callee-saved registers; place return value (if any) where caller can find it; update stack/frame pointers: l l l transfer control back to caller: l l retval x; leave p return Caller: l save value returned by callee (if any) into x: l retrieve x CSc 453: Intermediate Code Generation 39

Function Call/Return: Example l l Source: x = f(0, y+1) + 1; Intermediate Code: Caller: t 1 = y+1 param t 1, 2 param 0, 1 call f retrieve t 2 x = t 2+1 l Intermediate Code: Callee: enter f … retval t 27 leave f return /* set up activation record */ /* code for f’s body */ /* return the value of t 27 */ /* clean up activation record */ CSc 453: Intermediate Code Generation 40

Intermediate Code for Function Calls l non-void return type: E call f (sym. tbl. ptr) arguments (list of expressions) Code Structure: … evaluate actuals … param xk R-to-L … param x 1 call f retrieve t 0 /* t 0 a temporary var */ code. Gen_expr(E): /* E. nodetype = FUNCALL */ code. Gen_expr_list(arguments); E. place = newtemp( f. return. Type ); E. code = …code to evaluate the arguments… param xk … param x 1 call f, k retrieve E. place; CSc 453: Intermediate Code Generation 41

Intermediate Code for Function Calls l void return type: S call f (sym. tbl. ptr) arguments (list of expressions) Code Structure: … evaluate actuals … param xk R-to-L … param x 1 call f retrieve t 0 /* t 0 a temporary var */ code. Gen_stmt(S): /* S. nodetype = FUNCALL */ code. Gen_expr_list(arguments); E. place = newtemp( f. return. Type ); S. code = …code to evaluate the arguments… param xk … param x 1 call f, k retrieve E. place; void return type f has no return value no need to allocate space for one, or to retrieve any return value. CSc 453: Intermediate Code Generation 42

Reusing Temporaries Storage usage can be reduced considerably by reusing space for temporaries: l l l For each type T, keep a “free list” of temporaries of type T; newtemp(T) first checks the appropriate free list to see if it can reuse any temps; allocates new storage if not. putting temps on the free list: l l distinguish between user variables (not freed) and compiler-generated temps (freed); free a temp after the point of its last use (i. e. , when its value is no longer needed). CSc 453: Intermediate Code Generation 43