| commit | cafa56ecd6d1a2d15e7c47d5ebbdb82d7be3f689 | [log] [tgz] |
|---|---|---|
| author | Willy Tarreau <w@1wt.eu> | Sat Feb 02 20:17:31 2019 +0100 |
| committer | Willy Tarreau <w@1wt.eu> | Mon Feb 04 05:09:15 2019 +0100 |
| tree | 2ee5124877a2a66fac670c0933ba337fafb433eb | |
| parent | 4ed84c96cf1f523f56cb869e1b98afa376139920 [diff] |
MINOR: tools: improve the popcount() operation
We'll call popcount() more often so better use a parallel method
than an iterative one. One optimal design is proposed at the site
below. It requires a fast multiplication though, but even without
it will still be faster than the iterative one, and all relevant
64 bit platforms do have a multiply unit.
https://graphics.stanford.edu/~seander/bithacks.html