On 05/23/2017 11:37 AM, Stefan Koch wrote:
The compiler does indeed seem to optimize the code somewhat.
Although the generated asm still looks wired.
That call enters a different overload:
uint mulu(uint x, uint y, ref bool overflow)
ulong r = ulong(x) * ulong(y);
if (r > uint.max)
overflow = true;
which is of efficiency comparable with code using seto. I'm not too
worried about that. https://goo.gl/eRXUpr is of interest.