This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/23361] Can't eliminate empty loops with power of two step and variable bounds
- From: "pinskia at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 12 Aug 2005 18:57:21 -0000
- Subject: [Bug tree-optimization/23361] Can't eliminate empty loops with power of two step and variable bounds
- References: <20050812185248.23361.chris@bubblescope.net>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From pinskia at gcc dot gnu dot org 2005-08-12 18:57 -------
With -funsafe-loop-optimizations we remove them.
Using -Wunsafe-loop-optimizations, we get:
t.c:2: warning: cannot optimize loop, the loop counter may overflow
I mentioned this before to transform the loops such that we know if they overflow or not and Zdenek
said it was not useful which I feel is still wrong.
--
What |Removed |Added
----------------------------------------------------------------------------
Component|rtl-optimization |tree-optimization
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23361