3 ms·
> In practice, for anything which isn't a micro-benchmark, it's a negligible performance hit. Citation needed? Every paper I've seen has indicated a non-neglig
by pcwalton 11y ago
> In practice, for anything which isn't a micro-benchmark, it's a negligible performance hit.
Citation needed? Every paper I've seen has indicated a non-negligible performance hit in real apps.
> I see a strong correlation between people complaining about overflow checking overhead, and people who don't actually care about the safety features
I'm a counterexample.
- vardump 11y agoIt would be interesting to have support for saturated types as well. u8saturated 200 + u8saturated 200 = 255. That's often desired behavior. Saturated arithmetic is supported in hardware in SSE. Although not much point if the values need to be constantly shuffled between SSE and scalar registers...
- Manishearth 11y ago.saturating_add() exists. You can create a wrapper type around this and implement the Add/Sub/Mul traits.
- vardump 11y agoDoes it have branchless codegen?
- Manishearth 11y agoNot right now (I'm surprised that's the case, there should be intrinsics for it), but that could change.
- dbaupp 11y agoIt gets optimised to be branchless if LLVM thinks that will be faster, yes.
- nickpsecurity 11y agoParent might mean this: http://danluu.com/integer-overflow/ http://danluu.com/integer-overflow/ It starts with 2x like kibwen says. Then says those ops will only be small part of workload or something. Extrapolating lead to 5%. Article goes on from there. Not sure if it applies here but it matches the claim you quoted of micro vs macro benchmark.