Difference: CS255Part4 (1 vs. 2)

Revision 22008-02-25 - ChenDing

Line: 1 to 1
 

Part 4: Data Flow (15%)

Changed:
<
<
The optimizations in this phase involve data flow analysis. You need to implement the following parts in gcc.

  • Constant propagation

  • Avail (455 only, Bonus for 255)
>
>
You are asked to implement and use data flow analysis in the last phase before the competition, in particular, implement the following parts in your cs255 pass.
 
Added:
>
>
  • Def-use graphs
 
  • Dead code elimination
Added:
>
>
  • Constant propagation (required for 455, Bonus for 255)
  -- XiaomingGu - 25 Feb 2008

Revision 12008-02-25 - XiaomingGu

Line: 1 to 1
Added:
>
>

Part 4: Data Flow (15%)

The optimizations in this phase involve data flow analysis. You need to implement the following parts in gcc.

  • Constant propagation

  • Avail (455 only, Bonus for 255)

  • Dead code elimination

-- XiaomingGu - 25 Feb 2008

 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback