100 lines
3.8 KiB
C++
100 lines
3.8 KiB
C++
/*
|
|
|
|
Copyright (c) 2012, Arvid Norberg
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in
|
|
the documentation and/or other materials provided with the distribution.
|
|
* Neither the name of the author nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#include "libtorrent/peer_list.hpp"
|
|
#include "libtorrent/hasher.hpp"
|
|
#include "libtorrent/broadcast_socket.hpp" // for supports_ipv6()
|
|
#include "setup_transfer.hpp"
|
|
#include "libtorrent/aux_/disable_warnings_push.hpp"
|
|
#include <boost/crc.hpp>
|
|
#include "libtorrent/aux_/disable_warnings_pop.hpp"
|
|
|
|
#include "test.hpp"
|
|
|
|
using namespace lt;
|
|
|
|
namespace {
|
|
std::uint32_t hash_buffer(char const* buf, int len)
|
|
{
|
|
boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;
|
|
crc.process_block(buf, buf + len);
|
|
return crc.checksum();
|
|
}
|
|
} // anonymous namespace
|
|
|
|
TORRENT_TEST(peer_priority)
|
|
{
|
|
// when the IP is the same, we hash the ports, sorted
|
|
std::uint32_t p = peer_priority(
|
|
ep("230.12.123.3", 0x4d2), ep("230.12.123.3", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer("\x01\x2c\x04\xd2", 4));
|
|
|
|
// when we're in the same /24, we just hash the IPs
|
|
p = peer_priority(ep("230.12.123.1", 0x4d2), ep("230.12.123.3", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer("\xe6\x0c\x7b\x01\xe6\x0c\x7b\x03", 8));
|
|
|
|
// when we're in the same /16, we just hash the IPs masked by
|
|
// 0xffffff55
|
|
p = peer_priority(ep("230.12.23.1", 0x4d2), ep("230.12.123.3", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer("\xe6\x0c\x17\x01\xe6\x0c\x7b\x01", 8));
|
|
|
|
// when we're in different /16, we just hash the IPs masked by
|
|
// 0xffff5555
|
|
p = peer_priority(ep("230.120.23.1", 0x4d2), ep("230.12.123.3", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer("\xe6\x0c\x51\x01\xe6\x78\x15\x01", 8));
|
|
|
|
// test vectors from BEP 40
|
|
TEST_EQUAL(peer_priority(ep("123.213.32.10", 0), ep("98.76.54.32", 0))
|
|
, 0xec2d7224);
|
|
|
|
TEST_EQUAL(peer_priority(
|
|
ep("123.213.32.10", 0), ep("123.213.32.234", 0))
|
|
, 0x99568189);
|
|
|
|
if (supports_ipv6())
|
|
{
|
|
// IPv6 has a twice as wide mask, and we only care about the top 64 bits
|
|
// when the IPs are the same, just hash the ports
|
|
p = peer_priority(
|
|
ep("ffff:ffff:ffff:ffff::1", 0x4d2), ep("ffff:ffff:ffff:ffff::1", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer("\x01\x2c\x04\xd2", 4));
|
|
|
|
// these IPs don't belong to the same /32, so apply the full mask
|
|
// 0xffffffff55555555
|
|
p = peer_priority(
|
|
ep("ffff:ffff:ffff:ffff::1", 0x4d2), ep("ffff:0fff:ffff:ffff::1", 0x12c));
|
|
TEST_EQUAL(p, hash_buffer(
|
|
"\xff\xff\x0f\xff\x55\x55\x55\x55\x00\x00\x00\x00\x00\x00\x00\x01"
|
|
"\xff\xff\xff\xff\x55\x55\x55\x55\x00\x00\x00\x00\x00\x00\x00\x01", 32));
|
|
}
|
|
}
|