Hello all,
I'm not sure whether this has been posted before, but gcc creates
slightly inefficient code for large integers in several cases:
unsigned long long val;
void example1() {
val += 0x8000ULL;
}
On x86 this results in the following assembly:
addl $0, val
adcl $32768, val+4
re
Snapshot gcc-4.7-20130817 is now available on
ftp://gcc.gnu.org/pub/gcc/snapshots/4.7-20130817/
and on various mirrors, see http://gcc.gnu.org/mirrors.html for details.
This snapshot has been generated from the GCC 4.7 SVN branch
with the following options: svn://gcc.gnu.org/svn/gcc/branches
