This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Speeding things up
- From: law at redhat dot com
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: Daniel Berlin <dberlin at dberlin dot org>, gcc-patches at gcc dot gnu dot org
- Date: Wed, 29 Jan 2003 19:16:11 -0700
- Subject: Re: [tree-ssa] Speeding things up
- Reply-to: law at redhat dot com
In message <20030130005504.GA6116@tornado.toronto.redhat.com>, Diego Novillo wr
ites:
>On Wed, 29 Jan 2003, Daniel Berlin wrote:
>
>> By the by, if you had mentioned this problem on the public mailing list,
>> you probably would have gotten a lot more help a lot quicker.
>> I've mentioned this problem to Diego before, as well.
>>
>And I never saw your patch to compute_may_aliases that traversed
>PTA sets instead ;)
:-) I was just about to point out that from what I can tell in our
sources that the PTA walks the same set of loops and is thus
subject to the same behavior -- all of it.
All the current PTA code does is disambiguate more cases in
may_alias_p and change how we record aliases.
Jeff