{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

extra - (c Eliminate redundent expressions via global...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Exercise: Compiler Analyses And Optimizations 1. Given the following C code. x = 1; y = 2; i = 0; L: if (i > 100) goto E x = x + y; y = x-y; z = x + 1; if (y > 50) goto E i = i + 1; goto L E: z := 2 * x (a) Eliminate useless code from the given input. (b) Eliminate redundent expressions via value numbering.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (c) Eliminate redundent expressions via global available expression analysis. (d) Perform live variable analysis. (e) Apply graph coloring based register allocation. How many registers do you need for the above code? (f) Convert the above code to SSA 1...
View Full Document

  • Spring '08
  • register allocation, Eliminate useless code, redundent expressions, live variable analysis, global available expression

{[ snackBarMessage ]}

Ask a homework question - tutors are online