This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/32120] missed PRE/FRE of a*2+4 and (a+2)*2
- From: "rguenth at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Mon, 05 Mar 2012 17:32:52 +0000
- Subject: [Bug tree-optimization/32120] missed PRE/FRE of a*2+4 and (a+2)*2
- Auto-submitted: auto-generated
- References: <bug-32120-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=32120
Richard Guenther <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |matz at gcc dot gnu.org
--- Comment #9 from Richard Guenther <rguenth at gcc dot gnu.org> 2012-03-05 17:32:52 UTC ---
(In reply to comment #8)
> I still have an unfinished patch to convert SCCVN to
> http://dl.acm.org/citation.cfm?id=512536
>
> This actually makes it significantly easier to integrate better
> congruence finding (and lets us use predicates properly during value
> numbering).
> It also was significantly faster in large functions (also functiojns
> containing large SCC's) due to a significantly better iteration
> strategy (it will only iterate values that are changing, while SCCVN
> will iterate all values in an SCC).
>
> I'm happy to attach the patch if you like :)
I think you sent it to me once and Micha has implemented the predication
bits ontop of it (well, sort of IIRC).
Richard.