Miss Dada  🏳️‍⚧️

You are not benchmarking anything, it gets optimized away

That's the point :)

It doesn't get optimized away in real code tho, so what are the benchmarks for?

Not following... raindrops exercise from exercism.io is a fizzbuzz problem. It's remainder of 3, 5 and/or 7 (non-2^n constant in HD). This would be optimized away in real code too, as this is an optimization the compiler performs. Benches are for fun, as is looking as --emit asm.

You're literally benchmarking an empty function. You're never using the result of your rem calls, so the compiler optimizes it away. You need to return the value or use `test::black_box`.

https://gist.github.com/sgrif/979b36a145c93a5c6cc67296dc4f0a49 … will actually benchmark the functions for an unknown value of `n` (and you'll see that the builtin mod3 is faster than remu3)