Re:Rust, Zig, and the Futility of “Replacing” C
by CyberRabbi on Sunday February 28, 2021 @04:15PM
(#26297135)
That’s actually trivial using unsigned arithmetic and two’s complement representation for signed integers, its also equally efficient[1]. Unsigned arithmetic is fully defined in c, including checking for overflow.
[1] gcc for example generates optimal code when doing checked addition: https://godbolt.org/z/9jnesx
Re:Rust, Zig, and the Futility of “Replacing” C
by c-cube on Sunday February 28, 2021 @08:28PM
(#26298827)
But that's my point; how can you be sure the compiler will emit the right code instead of assuming that the addition does not overflow and then proceed on pruning the test, since overflow on signed integers is not defined?
Re:Rust, Zig, and the Futility of “Replacing” C
by ghoward on Sunday February 28, 2021 @09:52PM
(#26299227)
You implement it by using unsigned arithmetic, then checking that the sign bit flipped. See https://git.yzena.com/Yzena/Yc/src/branch/master/include/yc/... .
It's a bit more subtle than that, but that is completely devoid of Undefined, Unspecified, and Implementation-Defined Behavior.
Semantics of loops might also be tricky. In fact rust struggles with LLVM's optimizer already on some infinite loops because C++ and rust diverge in semantics there.