mirror of
http://git.haproxy.org/git/haproxy.git/
synced 2025-01-15 18:20:52 +00:00
cbdc74b4b3
The code used to rely on BITS_PER_LONG to decide on the most efficient way to perform a 64-bit shift, but this macro is not defined (at best it's __BITS_PER_LONG) and it's likely that it's been like this since the early implementation of ebtrees designed on i386. Let's remove the test on this macro and rely on sizeof(long) instead, it also has the benefit of letting the compiler validate the two branches. This can be backported to all versions. Thanks to Ezequiel Garcia for reporting this one in issue #1369. |
||
---|---|---|
.. | ||
atomic-ops.h | ||
eb32sctree.h | ||
eb32tree.h | ||
eb64tree.h | ||
ebimtree.h | ||
ebistree.h | ||
ebmbtree.h | ||
ebpttree.h | ||
ebsttree.h | ||
ebtree.h | ||
ist.h | ||
lru.h | ||
mjson.h | ||
plock.h | ||
sha1.h | ||
slz-tables.h | ||
slz.h | ||
xxhash.h |