This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug fortran/57071] Optimize (-1)**k to 1 - 2 * mod(K, 2)
- From: "tkoenig at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Sat, 27 Apr 2013 23:19:13 +0000
- Subject: [Bug fortran/57071] Optimize (-1)**k to 1 - 2 * mod(K, 2)
- Auto-submitted: auto-generated
- References: <bug-57071-4 at http dot gcc dot gnu dot org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=57071
--- Comment #8 from Thomas Koenig <tkoenig at gcc dot gnu.org> 2013-04-27 23:19:13 UTC ---
While special-casing power, it might also make sense
to translate 2**n to ishft(1,n).