This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/26656] Optimization flaw on conditionnal set of a bit.
- From: "dominic dot quiet at gmail dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 12 Mar 2006 22:25:31 -0000
- Subject: [Bug target/26656] Optimization flaw on conditionnal set of a bit.
- References: <bug-26656-12347@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #6 from dominic dot quiet at gmail dot com 2006-03-12 22:25 -------
Created an attachment (id=11033)
--> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=11033&action=view)
Fixed benchmark
I fixed my benchmark. You are right about the condition always being true after
127. I was using signed char... What was I thinking. :-S But I don't see any
problem about rand(). I added a display of the frequency of each value, and it
seems well balanced. Things are now reversed. When the condition is most likely
to be true or most likely to be false, the conditional jump gets faster,
instead of slower. But it is still overall slower.
--
dominic dot quiet at gmail dot com changed:
What |Removed |Added
----------------------------------------------------------------------------
Attachment #11030|0 |1
is obsolete| |
Attachment #11031|0 |1
is obsolete| |
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26656