[Bug middle-end/24427] missing optimization opportunity with binary operators

[sayle at gcc dot gnu dot org]

------- Comment #3 from sayle at gcc dot gnu dot org  2006-02-13 18:33 -------
Subject: Bug 24427

Author: sayle
Date: Mon Feb 13 18:33:32 2006
New Revision: 110918

URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=110918
Log:

        PR middle-end/24427
        * fold-const.c (fold_binary) <BIT_IOR_EXPR>: Transform (X&C1)|C2
        into (X,C2) if C1 is a subset of the bits of C2.  Transform
        (X&C1)|C2 into X|C2 if C1|C2 == ~0.  Canonicalize (X&C1)|C2 as
        (X&(C1&~C2))|C2.
        <BIT_AND_EXPR>: Canonicalize (X|C1)&C2 as (X&C2)|(C1&C2).

        * gcc.dg/tree-ssa/andor-1.c: New test case.


Added:
    trunk/gcc/testsuite/gcc.dg/tree-ssa/andor-1.c
Modified:
    trunk/gcc/ChangeLog
    trunk/gcc/fold-const.c
    trunk/gcc/testsuite/ChangeLog


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=24427