Re: GCSE with SSA

anton@mips.complang.tuwien.ac.at (Anton Ertl)
11 Feb 2003 01:30:19 -0500

          From comp.compilers
Related articles
GCSE with SSA stefan.heimann@web.de (Stefan Heimann) (2003-02-06)
Re: GCSE with SSA anton@mips.complang.tuwien.ac.at (2003-02-11)
| List of all articles for this month |
From: anton@mips.complang.tuwien.ac.at (Anton Ertl)
Newsgroups: comp.compilers
Date: 11 Feb 2003 01:30:19 -0500
Organization: Institut fuer Computersprachen, Technische Universitaet Wien
References: 03-02-021
Keywords: analysis
Posted-Date: 11 Feb 2003 01:30:19 EST

Stefan Heimann <stefan.heimann@web.de> writes:
>I'm searching docs about global common subexpression elimination based
>on static single assignment form.
>
>I know that there are some papers about PRE based on SSA, and I know
>that PRE also eliminates common subexpression, but I need information
>about GCSE.


AFAIK the optimization GCSE in gcc-3.2 uses lazy code motion, a
variant of PRE. What kind of GCSE are you interested in that is not
PRE, and why?


- anton
--
M. Anton Ertl
anton@mips.complang.tuwien.ac.at
http://www.complang.tuwien.ac.at/anton/home.html

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.