http://gcc.gnu.org/bugzilla/show_bug.cgi?id=31261
Jakub Jelinek changed:
What|Removed |Added
Status|ASSIGNED|RESOLVED
Resolution|
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=31261
--- Comment #5 from Jakub Jelinek 2010-09-30
19:21:44 UTC ---
Author: jakub
Date: Thu Sep 30 19:21:34 2010
New Revision: 164761
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=164761
Log:
PR tree-optimization/31261
* fold-const.c (
--- Comment #4 from trt at acm dot org 2007-03-21 18:28 ---
I think this could be generalized to more operators, e.g.
(y | (x & 7)) & 7
^ (bitwise or, xor, multiply, ...)
This optimization could be for "e & M" where e contains a subexpression of the
form "t & N" which can
--- Comment #3 from jakub at gcc dot gnu dot org 2007-03-21 15:05 ---
Created an attachment (id=13244)
--> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=13244&action=view)
gcc43-pr31261.patch
Patch I'm testing ATM.
--
jakub at gcc dot gnu dot org changed:
What|Remo
--- Comment #2 from rguenth at gcc dot gnu dot org 2007-03-19 11:19 ---
You would need to enhance associate_trees () or the reassoc pass to fix this.
--
rguenth at gcc dot gnu dot org changed:
What|Removed |Added
---
--- Comment #1 from rguenth at gcc dot gnu dot org 2007-03-19 11:17 ---
(x & 7) + 8 & 7 is actually ((x & 7) + 8) & 7
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=31261
