@RichFelker It's defined for a different range of n. Are you sure qemu uses shifts only for non-overflowing x*2^n and not for byte-swaping?
-
-
-
@ch3root They claimed they wanted x*2^n. Doing this for byte-swapping is nonsense; that should be done in unsigned arithmetic. -
@RichFelker Given their further discussion of -fwrapv, I'm not sure what they really mean. -
@ch3root In any case, x*(1<<n) works for the exact ranges that "should work" if x<<n were defined arithmetically as x*2^n even for neg x.
End of conversation
New conversation -
-
-
@RichFelker whaaaaaa, that requires an extra four characters! -
@stephentyrone@RichFelker see also https://github.com/agl/curve25519-donna/issues/31 … (another one for@EWONTFIX?) -
@bmastenbrook Oh! I guess one shouldn't follow one's idols on GitHub either.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.