This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Alias analysis speedups
- From: Toon Moene <toon at moene dot indiv dot nluug dot nl>
- To: law at redhat dot com
- Cc: Diego Novillo <dnovillo at redhat dot com>, Graham Stott<graham dot stott at btinternet dot com>, "gcc-patches at gcc dot gnu dot org"<gcc-patches at gcc dot gnu dot org>
- Date: Fri, 21 Feb 2003 21:03:01 +0100
- Subject: Re: [tree-ssa] Alias analysis speedups
- Organization: Moene Computational Physics, Maartensdijk, The Netherlands
- References: <200302211634.h1LGYVDd006190@localhost.redhat.com>
law at redhat dot com wrote:
In message <1045844562 dot 8671 dot 18 dot camel at shadowfax>, Diego Novillo writes:
>Mixed blessing in this case. Better alias info may lead to longer
>compile times and memory problems. Hence our PHI pruning heuristics.
Yes, but those are very extreme cases.
"Elk nadeel hep se foordeel" :-)
What would this mean for an extremely non-aliasing language like Fortran ?
Inquiring minds want to know ...
--
Toon Moene - mailto:toon at moene dot indiv dot nluug dot nl - phoneto: +31 346 214290
Saturnushof 14, 3738 XG Maartensdijk, The Netherlands
Maintainer, GNU Fortran 77: http://gcc.gnu.org/onlinedocs/g77_news.html
GNU Fortran 95: http://gcc-g95.sourceforge.net/ (under construction)