Jorg Brown 586952f4ce Optimize std::midpoint for integers
Same idea as the current algorithm, that is, add (half of the difference between a and b) to a.

But we use a different technique for computing the difference: we compute b - a into a pair of integers that are named "sign_bit" and "diff". We have to use a pair because subtracting two 32-bit integers produces a 33-bit result.

Computing half of that is a simple matter of shifting diff right by 1, and adding sign_bit shifted left by 31. llvm knows how to do that with one instruction: shld.

The only tricky part is that if the difference is odd and negative, then shifting it by one isn't the same as dividing it by two - shifting a negative one produces a negative one, for example. So there's one more adjustment: if the sign bit and the low bit of diff are one, we add one.

For a demonstration of the codegen difference, see https://godbolt.org/z/7ar3K9 , which also has a built-in test.

Differential Revision: https://reviews.llvm.org/D69459
2019-11-04 19:00:23 -08:00
..
2019-08-20 10:19:55 +00:00
2019-08-12 07:51:05 +00:00
2019-07-11 23:13:38 +00:00
2019-06-13 22:27:24 +00:00
2019-09-07 22:18:20 +00:00
2019-08-12 07:51:05 +00:00
2019-06-21 15:20:55 +00:00
ios
2019-05-29 16:01:36 +00:00
2019-08-20 18:21:06 +00:00
2019-07-01 16:13:31 +00:00
2019-10-22 15:16:49 +00:00
2019-09-26 14:51:10 +00:00
new
2019-09-26 14:51:10 +00:00
2019-11-04 19:00:23 -08:00
2019-05-29 16:01:36 +00:00
2019-05-29 16:01:36 +00:00
2019-05-29 02:38:19 +00:00
2019-07-14 21:29:39 +00:00