[Bug tree-optimization/23361] Can't eliminate empty loops with power of two step and variable bounds

["rguenth at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>]

------- Comment #12 from rguenth at gcc dot gnu dot org  2007-02-09 13:29 -------
Subject: Bug 23361

Author: rguenth
Date: Fri Feb  9 13:29:11 2007
New Revision: 121742

URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=121742
Log:
2007-02-09  Zdenek Dvorak  <dvorakz@suse.cz>
        Richard Guenther  <rguenther@suse.de>

        PR middle-end/23361
        * fold-const.c (fold_comparison): Handle obfuscated comparisons
        against INT_MIN/INT_MAX.
        * tree-ssa-loop-ivcanon.c (remove_empty_loop): Print to dump
        file if a loop is removed.

        * gcc.dg/fold-compare-3.c: New testcase.
        * gcc.dg/tree-ssa/loop-24.c: Likewise.

Added:
    trunk/gcc/testsuite/gcc.dg/fold-compare-3.c
    trunk/gcc/testsuite/gcc.dg/tree-ssa/loop-24.c
Modified:
    trunk/gcc/ChangeLog
    trunk/gcc/fold-const.c
    trunk/gcc/testsuite/ChangeLog
    trunk/gcc/tree-ssa-loop-ivcanon.c


-- 


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