premiere
/
premiere-libtorrent
2
2
Fork 1
Code Issues Pull Requests Releases Wiki Activity

use hardware optimized CRC32C function in DHT

This commit is contained in:
Arvid Norberg 2015-01-05 13:50:42 +00:00
parent 2e48f0f89e
commit a462f58372
1 changed files with 11 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
src/kademlia/node_id.cpp
View File

@ -32,7 +32,6 @@ POSSIBILITY OF SUCH DAMAGE.
#include <algorithm> #include <algorithm>
#include <ctime> #include <ctime>
#include <boost/crc.hpp>
#include "libtorrent/kademlia/node_id.hpp" #include "libtorrent/kademlia/node_id.hpp"
#include "libtorrent/kademlia/node_entry.hpp" #include "libtorrent/kademlia/node_entry.hpp"
@ -42,6 +41,7 @@ POSSIBILITY OF SUCH DAMAGE.
#include "libtorrent/socket_io.hpp" // for hash_address #include "libtorrent/socket_io.hpp" // for hash_address
#include "libtorrent/random.hpp" // for random #include "libtorrent/random.hpp" // for random
#include "libtorrent/hasher.hpp" // for hasher #include "libtorrent/hasher.hpp" // for hasher
#include "libtorrent/crc32c.hpp" // for crc32c
namespace libtorrent { namespace dht namespace libtorrent { namespace dht
{ {
@ -131,12 +131,16 @@ node_id generate_id_impl(address const& ip_, boost::uint32_t r)
ip[0] |= (r & 0x7) << 5; ip[0] |= (r & 0x7) << 5;
// this is the crc32c (Castagnoli) polynomial // this is the crc32c (Castagnoli) polynomial
// TODO: 2 this could be optimized if SSE 4.2 is boost::uint32_t c;
// available. It could also be optimized given if (num_octets == 4)
// that we have a fixed length {
boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc; c = crc32c_32(*reinterpret_cast<boost::uint32_t*>(ip));
crc.process_block(ip, ip + num_octets); }
boost::uint32_t c = crc.checksum(); else
{
TORRENT_ASSERT(num_octets == 8);
c = crc32c(reinterpret_cast<boost::uint64_t*>(ip), 1);
}
node_id id; node_id id;
id[0] = (c >> 24) & 0xff; id[0] = (c >> 24) & 0xff;