http://gcc.gnu.org/bugzilla/show_bug.cgi?id=54682
--- Comment #3 from Oleg Endo ---
A related case from CSiBE, linux-2.4.23-pre3-testplatform/net/ipv4/igmp.c,
function _add_grhead:
.L275:
mov #0,r0
mov.b r11,@r8
mov.b r0,@(1,r8)
mov #0,r0<< red
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=54682
--- Comment #2 from Oleg Endo ---
A related case, but the other way around:
#include
std::bitset<32> make_bits (void)
{
std::bitset<32> r;
for (auto&& i : { 4, 5, 6, 10 })
if (i < r.size ())
r.set (i);
return r;
}
results in t
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=54682
--- Comment #1 from Oleg Endo 2012-10-10 22:17:13
UTC ---
Another thing that could be considered are T bit stores via the 'movt' insn.
For example:
movt r2 ! EX
< something else; r2, T not modified>
movt r4 ! EX
