Re:Nearly all binary search and merge sort implementations a...
by ChuckMcM on Monday January 30, 2012 @07:44PM
(#3531246)
Would be interested in seeing the profile. Re-ordering it to the following (which the compiler might do too)
Should compute in a single cycle if the register coloring is working in the pipeline. The <reg> >> 1 come out of the barrel shifter stage, the low&high&1 resolves in the load, so you end up with a single sum of three operands. Since its being stored in a separate register that would avoid a write stall in the pipeline as well.
[ Parent
| on HN ]
There are no comments on this comment yet.