This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/29680] [4.3 Regression] Misscompilation of spec2006 gcc
- From: "dnovillo at redhat dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 9 Nov 2006 15:08:52 -0000
- Subject: [Bug tree-optimization/29680] [4.3 Regression] Misscompilation of spec2006 gcc
- References: <bug-29680-5077@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #22 from dnovillo at redhat dot com 2006-11-09 15:08 -------
Subject: Re: [4.3 Regression] Misscompilation
of spec2006 gcc
Daniel Berlin wrote on 11/09/06 10:05:
> One thing i'm going to try later is to try to partition all the
> stores/load statements and figure out how many symbols it takes to
> represent the results exactly (IE one symbol for each set of
> statements that must interfere with each other, where each statement
> can be in multiple partitions).
>
This is what I'm doing in memory SSA. More details later this week
after I'm done testing and such. The difference is that partitioning is
embedded in the actual SSA form and the partitioning heuristic can be
changed independently of the renamer. This will let us play with a
slider-style throttling for precision/compile-time.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=29680