Presentation is loading. Please wait.

Presentation is loading. Please wait.

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Advanced Compilers CMPSCI 710.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Advanced Compilers CMPSCI 710."— Presentation transcript:

1 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Advanced Compilers CMPSCI 710 Spring 2003 Partial Redundancy Elimination

2 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 2 Topics Last time Common subexpression elimination Value numbering Global CSE This time Partial redundancy elimination

3 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 3 Partial Redundancy Partial redundancy: Expression computed more than once on some path through control-flow graph Partial-redundancy elimination (PRE): Minimizes partial redundancies Inserts and deletes computations (adds temps)  Each path contains no more (usually fewer) occurrences of any computation than before Dominates global CSE & loop-invariant code motion

4 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 4 PRE Example

5 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 5 PRE: Problem Critical edge prevents redundancy elimination Connects node with two or more successors to one with two or more predecessors Why is it a problem?

6 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 6 PRE: Solution Split critical edges! Insert empty basic blocks Allows PRE to continue

7 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 7 Big Example: Critical Edges

8 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 8 Big Example: Critical Edges Removed

9 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 9 PRE Dataflow Equations First formulation [Morel & Renvoise 79] bidirectional dataflow analysis Ugly This version [Knoop et al. 92] Based on “lazy code motion” Places computations as late as possible Same reductions as classic algorithm Minimizes register pressure Most complex dataflow problem we’ve ever seen…

10 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 10 Step 1: Local Transparency Expression’s value is locally transparent in a basic block if No assignments to variables that occur in expression Set of locally transparent expressions: TRANSloc(i) Note: Ignore expressions in branches

11 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 11 Local Transparency TransLoc – no assignments to variables in expression

12 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 12 Step 2: Locally Anticipatable Expression is locally anticipatable in basic block if There is computation of expression in block Moving to beginning of block has no effect No uses of expression nor assignments of variable in block ahead of computation Set of locally anticipatable expressions: ANTloc(i)

13 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 13 Locally Anticipatable ANTloc – computes expr, can move to front

14 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 14 Step 3: Globally Anticipatable Expression’s value globally anticipatable on entry to basic block if Every path from that point includes computation of expression Expression yields same value all along path Set of globally anticipatable expressions: ANTin(i)

15 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 15 Globally Anticipatable Expressions: Dataflow Equations ANTout(exit) =  ANTin(i) = ANTloc(i) [ (TRANSloc(i) Å ANTout(i)) ANTout(i) = Å j 2 Succ(i) ANTin(j) What’s the analysis direction?

16 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 16 Globally Anticipatable ANTout(exit) =  ANTin(i) = ANTloc(i) [ (TRANSloc(i) Å ANTout(i)) ANTout(i) = Å j 2 Succ(i) ANTin(j)

17 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 17 Step 4: Earliest Expressions Expression is earliest at entrance to block if No block from entry to block both: Evaluates expression and Produces same value as at entrance to block Defined in terms of local transparency and globally anticipatable expressions EARLin(i) = [ j 2 Pred(i) EARLout(j) EARLout(i) = inv(TRANSloc(i)) [ (inv(ANTin(i)) Å EARLin(i)) Initialize EARLin(entry) = U exp

18 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 18 Early Expressions EARLin(i) = [ j 2 Pred(i) EARLout(j) EARLout(i) = inv(TRANSloc(i)) [ (inv(ANTin(i) Å EARLin(i))

19 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 19 PRE Transformation We’ll cut to the chase: Latest, Isolated expressions Use earliest, globally anticipatable OPT(i) = latest but not isolated = LATEin(i) Å inv(ISOLout(i)) REDN(i) = used but not optimal = ANTloc(i) Å inv(LATEin(i) [ ISOLout(i)) Insert fresh temporaries for OPT expressions, replace uses in REDN

20 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 20 OPT, REDN, PRE OPT(B1) = a+1 OPT(B2, B3a) = x*y REDN(B1) = a+1 REDN(B2, B4, B7) = x*y

21 U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 21 Conclusion PRE Subsumes global CSE & loop-invariant code motion Complex (but unidirectional) dataflow analysis problem Can only reduce number of computations and register pressure Next time Register allocation: ACDI ch.16, pp. 481-524

Download ppt "U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Advanced Compilers CMPSCI 710."

Similar presentations

8. Static Single Assignment Form Marcus Denker. © Marcus Denker SSA Roadmap  Static Single Assignment Form (SSA)  Converting to SSA Form  Examples.

8. Static Single Assignment Form Marcus Denker. © Marcus Denker SSA Roadmap  Static Single Assignment Form (SSA)  Converting to SSA Form  Examples.
Course Outline Traditional Static Program Analysis –Theory Compiler Optimizations; Control Flow Graphs Data-flow Analysis – today’s class –Classic analyses.

Course Outline Traditional Static Program Analysis –Theory Compiler Optimizations; Control Flow Graphs Data-flow Analysis – today’s class –Classic analyses.
Chapter 9 Code optimization Section 0 overview 1.Position of code optimizer 2.Purpose of code optimizer to get better efficiency –Run faster –Take less.

Chapter 9 Code optimization Section 0 overview 1.Position of code optimizer 2.Purpose of code optimizer to get better efficiency –Run faster –Take less.
Course Outline Traditional Static Program Analysis –Theory Compiler Optimizations; Control Flow Graphs Data-flow Analysis – today’s class –Classic analyses.

Course Outline Traditional Static Program Analysis –Theory Compiler Optimizations; Control Flow Graphs Data-flow Analysis – today’s class –Classic analyses.
SSA.

SSA.
Chapter 10 Code Optimization. A main goal is to achieve a better performance Front End Code Gen Intermediate Code source Code target Code user Machine-

Chapter 10 Code Optimization. A main goal is to achieve a better performance Front End Code Gen Intermediate Code source Code target Code user Machine-
Jeffrey D. Ullman Stanford University. 2  Generalizes: 1.Moving loop-invariant computations outside the loop. 2.Eliminating common subexpressions. 3.True.

Jeffrey D. Ullman Stanford University. 2  Generalizes: 1.Moving loop-invariant computations outside the loop. 2.Eliminating common subexpressions. 3.True.
Advanced Compiler Techniques LIU Xianhua School of EECS, Peking University Partial Redundancy Elimination.

Advanced Compiler Techniques LIU Xianhua School of EECS, Peking University Partial Redundancy Elimination.
Components of representation Control dependencies: sequencing of operations –evaluation of if & then –side-effects of statements occur in right order Data.

Components of representation Control dependencies: sequencing of operations –evaluation of if & then –side-effects of statements occur in right order Data.
School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) Dataflow Analysis Introduction Guo, Yao Part of the slides are adapted from.

School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) Dataflow Analysis Introduction Guo, Yao Part of the slides are adapted from.
Program Representations. Representing programs Goals.

Program Representations. Representing programs Goals.
1 CS 201 Compiler Construction Lecture 7 Code Optimizations: Partial Redundancy Elimination.

1 CS 201 Compiler Construction Lecture 7 Code Optimizations: Partial Redundancy Elimination.
1 Partial Redundancy Elimination Finding the Right Place to Evaluate Expressions Four Necessary Data-Flow Problems.

1 Partial Redundancy Elimination Finding the Right Place to Evaluate Expressions Four Necessary Data-Flow Problems.
School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) Partial Redundancy Elimination Guo, Yao.

School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) Partial Redundancy Elimination Guo, Yao.
Lazy Code Motion Comp 512 Spring 2011

Lazy Code Motion Comp 512 Spring 2011
05 May 20061 Lazy Code Motion in an SSA World A CS 526 Course Project Patrick Meredith Steven Lauterburg 05 May 2006.

05 May Lazy Code Motion in an SSA World A CS 526 Course Project Patrick Meredith Steven Lauterburg 05 May 2006.
Partial Redundancy Elimination & Lazy Code Motion

Partial Redundancy Elimination & Lazy Code Motion
Lazy Code Motion C OMP 512 Rice University Houston, Texas Fall 2003 Copyright 2003, Keith D. Cooper & Linda Torczon, all rights reserved. Students enrolled.

Lazy Code Motion C OMP 512 Rice University Houston, Texas Fall 2003 Copyright 2003, Keith D. Cooper & Linda Torczon, all rights reserved. Students enrolled.
Λλ Fernando Magno Quintão Pereira P ROGRAMMING L ANGUAGES L ABORATORY Universidade Federal de Minas Gerais - Department of Computer Science P ROGRAM A.

Λλ Fernando Magno Quintão Pereira P ROGRAMMING L ANGUAGES L ABORATORY Universidade Federal de Minas Gerais - Department of Computer Science P ROGRAM A.
Partial Redundancy Elimination. Partial-Redundancy Elimination Minimize the number of expression evaluations By moving around the places where an expression.

Partial Redundancy Elimination. Partial-Redundancy Elimination Minimize the number of expression evaluations By moving around the places where an expression.

Similar presentations

Ads by Google