This is the mail archive of the
mailing list for the GCC project.
Re: [ tree-ssa ] Avoid useless reevaluations in CCP
- From: law at redhat dot com
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: "gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>
- Date: Wed, 19 Feb 2003 11:02:31 -0700
- Subject: Re: [ tree-ssa ] Avoid useless reevaluations in CCP
- Reply-to: law at redhat dot com
In message <1045623537 dot 2026 dot 41 dot camel at frodo>, Diego Novillo writes:
>On Fri, 2003-02-14 at 17:19, law at redhat dot com wrote:
>> Tree CCP has the nasty habit of performing pointless reevaluations of
>> statements. This can happen due to a couple of implementation details.
>There's a bit of algorithmic nonsense too. I've had this in my "list of
>things to check out eventually":
> author = "Eric Stoltz and Michael Wolfe and Michael P. Gerlek",
> title = "Constant propagation: a fresh, demand-driven look",
> booktitle = "Selected Areas in Cryptography",
> pages = "400-404",
> year = "1994"}
>They talk about CCP's tendency to evaluate things more than once.
Yea, but they never actually compare their scheme with the more
traditional schemes. You've got to love papers which present no
actual data :-) But yes, it looks promising.