Re:How undefined signed overflow enables optimizations in GCC
by stouset on Friday February 26, 2016 @01:39PM
(#11183122)
> If the machine is two's complement (which is the vast majority of them), then you'd expect that behaviour. If it's sign-magnitude or one's complement or saturating, then the behaviour would be different but still consistent.
How is this different in practice from undefined behavior, other than the compiler can't take advantage of it for optimizations?
How is this different in practice from undefined behavior, other than the compiler can't take advantage of it for optimizations?