392 lines
11 KiB
C++
392 lines
11 KiB
C++
/*
|
|
|
|
Copyright (c) 2007-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/pch.hpp"
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
#ifdef _MSC_VER
|
|
#pragma warning(push, 1)
|
|
#endif
|
|
|
|
#include <boost/shared_ptr.hpp>
|
|
#include <boost/enable_shared_from_this.hpp>
|
|
|
|
#ifdef _MSC_VER
|
|
#pragma warning(pop)
|
|
#endif
|
|
|
|
#include <vector>
|
|
#include <map>
|
|
#include <utility>
|
|
#include <numeric>
|
|
#include <cstdio>
|
|
|
|
#include "libtorrent/hasher.hpp"
|
|
#include "libtorrent/torrent.hpp"
|
|
#include "libtorrent/extensions.hpp"
|
|
#include "libtorrent/extensions/smart_ban.hpp"
|
|
#include "libtorrent/disk_io_thread.hpp"
|
|
#include "libtorrent/aux_/session_impl.hpp"
|
|
#include "libtorrent/peer_connection.hpp"
|
|
#include "libtorrent/peer_info.hpp"
|
|
#include "libtorrent/random.hpp"
|
|
|
|
//#define TORRENT_LOG_HASH_FAILURES
|
|
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
|
|
#include "libtorrent/peer_id.hpp" // sha1_hash
|
|
#include "libtorrent/escape_string.hpp" // to_hex
|
|
|
|
void log_hash_block(FILE** f, libtorrent::torrent const& t, int piece, int block
|
|
, libtorrent::address a, char const* bytes, int len, bool corrupt)
|
|
{
|
|
using namespace libtorrent;
|
|
|
|
mkdir("hash_failures", 0755);
|
|
|
|
if (*f == NULL)
|
|
{
|
|
char filename[1024];
|
|
snprintf(filename, sizeof(filename), "hash_failures/%s.log"
|
|
, to_hex(t.info_hash().to_string()).c_str());
|
|
*f = fopen(filename, "w");
|
|
}
|
|
|
|
file_storage const& fs = t.torrent_file().files();
|
|
std::vector<file_slice> files = fs.map_block(piece, block * 0x4000, len);
|
|
|
|
std::string fn = fs.file_path(fs.internal_at(files[0].file_index));
|
|
|
|
char filename[4094];
|
|
int offset = 0;
|
|
for (int i = 0; i < files.size(); ++i)
|
|
{
|
|
offset += snprintf(filename+offset, sizeof(filename)-offset
|
|
, "%s[%"PRId64",%d]", libtorrent::filename(fn).c_str(), files[i].offset, int(files[i].size));
|
|
if (offset >= sizeof(filename)) break;
|
|
}
|
|
|
|
fprintf(*f, "%s\t%04d\t%04d\t%s\t%s\t%s\n", to_hex(t.info_hash().to_string()).c_str(), piece
|
|
, block, corrupt ? " bad" : "good", print_address(a).c_str(), filename);
|
|
|
|
snprintf(filename, sizeof(filename), "hash_failures/%s_%d_%d_%s.block"
|
|
, to_hex(t.info_hash().to_string()).c_str(), piece, block, corrupt ? "bad" : "good");
|
|
FILE* data = fopen(filename, "w+");
|
|
fwrite(bytes, 1, len, data);
|
|
fclose(data);
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
namespace libtorrent {
|
|
|
|
class torrent;
|
|
|
|
namespace
|
|
{
|
|
|
|
struct smart_ban_plugin : torrent_plugin, boost::enable_shared_from_this<smart_ban_plugin>
|
|
{
|
|
smart_ban_plugin(torrent& t)
|
|
: m_torrent(t)
|
|
, m_salt(random())
|
|
{
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
m_log_file = NULL;
|
|
#endif
|
|
}
|
|
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
~smart_ban_plugin()
|
|
{ fclose(m_log_file); }
|
|
#endif
|
|
|
|
void on_piece_pass(int p)
|
|
{
|
|
#ifdef TORRENT_LOGGING
|
|
(*m_torrent.session().m_logger) << time_now_string() << " PIECE PASS [ p: " << p
|
|
<< " | block_hash_size: " << m_block_hashes.size() << " ]\n";
|
|
#endif
|
|
// has this piece failed earlier? If it has, go through the
|
|
// CRCs from the time it failed and ban the peers that
|
|
// sent bad blocks
|
|
std::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(piece_block(p, 0));
|
|
if (i == m_block_hashes.end() || int(i->first.piece_index) != p) return;
|
|
|
|
int size = m_torrent.torrent_file().piece_size(p);
|
|
peer_request r = {p, 0, (std::min)(16*1024, size)};
|
|
piece_block pb(p, 0);
|
|
while (size > 0)
|
|
{
|
|
if (i->first.block_index == pb.block_index)
|
|
{
|
|
m_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_ok_block
|
|
, shared_from_this(), *i, _1, _2));
|
|
m_block_hashes.erase(i++);
|
|
}
|
|
else
|
|
{
|
|
TORRENT_ASSERT(i->first.block_index > pb.block_index);
|
|
}
|
|
|
|
if (i == m_block_hashes.end() || int(i->first.piece_index) != p)
|
|
break;
|
|
|
|
r.start += 16*1024;
|
|
size -= 16*1024;
|
|
r.length = (std::min)(16*1024, size);
|
|
++pb.block_index;
|
|
}
|
|
|
|
#ifndef NDEBUG
|
|
// make sure we actually removed all the entries for piece 'p'
|
|
i = m_block_hashes.lower_bound(piece_block(p, 0));
|
|
TORRENT_ASSERT(i == m_block_hashes.end() || int(i->first.piece_index) != p);
|
|
#endif
|
|
|
|
if (m_torrent.is_seed())
|
|
{
|
|
std::map<piece_block, block_entry>().swap(m_block_hashes);
|
|
return;
|
|
}
|
|
}
|
|
|
|
void on_piece_failed(int p)
|
|
{
|
|
// The piece failed the hash check. Record
|
|
// the CRC and origin peer of every block
|
|
|
|
// if the torrent is aborted, no point in starting
|
|
// a bunch of read operations on it
|
|
if (m_torrent.is_aborted()) return;
|
|
|
|
std::vector<void*> downloaders;
|
|
m_torrent.picker().get_downloaders(downloaders, p);
|
|
|
|
int size = m_torrent.torrent_file().piece_size(p);
|
|
peer_request r = {p, 0, (std::min)(16*1024, size)};
|
|
piece_block pb(p, 0);
|
|
for (std::vector<void*>::iterator i = downloaders.begin()
|
|
, end(downloaders.end()); i != end; ++i)
|
|
{
|
|
if (*i != 0)
|
|
{
|
|
m_torrent.filesystem().async_read(r, boost::bind(&smart_ban_plugin::on_read_failed_block
|
|
, shared_from_this(), pb, ((policy::peer*)*i)->address(), _1, _2));
|
|
}
|
|
|
|
r.start += 16*1024;
|
|
size -= 16*1024;
|
|
r.length = (std::min)(16*1024, size);
|
|
++pb.block_index;
|
|
}
|
|
TORRENT_ASSERT(size <= 0);
|
|
}
|
|
|
|
private:
|
|
|
|
// this entry ties a specific block CRC to
|
|
// a peer.
|
|
struct block_entry
|
|
{
|
|
policy::peer* peer;
|
|
sha1_hash digest;
|
|
};
|
|
|
|
void on_read_failed_block(piece_block b, address a, int ret, disk_io_job const& j)
|
|
{
|
|
TORRENT_ASSERT(m_torrent.session().is_network_thread());
|
|
|
|
disk_buffer_holder buffer(m_torrent.session(), j.buffer);
|
|
|
|
// ignore read errors
|
|
if (ret != j.buffer_size) return;
|
|
|
|
hasher h;
|
|
h.update(j.buffer, j.buffer_size);
|
|
h.update((char const*)&m_salt, sizeof(m_salt));
|
|
|
|
std::pair<policy::iterator, policy::iterator> range
|
|
= m_torrent.get_policy().find_peers(a);
|
|
|
|
// there is no peer with this address anymore
|
|
if (range.first == range.second) return;
|
|
|
|
policy::peer* p = (*range.first);
|
|
block_entry e = {p, h.final()};
|
|
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
log_hash_block(&m_log_file, m_torrent, b.piece_index
|
|
, b.block_index, p->address(), j.buffer, j.buffer_size, true);
|
|
#endif
|
|
|
|
std::map<piece_block, block_entry>::iterator i = m_block_hashes.lower_bound(b);
|
|
|
|
if (i != m_block_hashes.end() && i->first == b && i->second.peer == p)
|
|
{
|
|
// this peer has sent us this block before
|
|
if (i->second.digest != e.digest)
|
|
{
|
|
// this time the digest of the block is different
|
|
// from the first time it sent it
|
|
// at least one of them must be bad
|
|
|
|
// verify that this is not a dangling pointer
|
|
// if the pointer is in the policy's list, it
|
|
// still live, if it's not, it has been removed
|
|
// and we can't use this pointer
|
|
if (!m_torrent.get_policy().has_peer(p)) return;
|
|
|
|
#if defined TORRENT_LOGGING || defined TORRENT_VERBOSE_LOGGING || defined TORRENT_ERROR_LOGGING
|
|
char const* client = "-";
|
|
peer_info info;
|
|
if (p->connection)
|
|
{
|
|
p->connection->get_peer_info(info);
|
|
client = info.client.c_str();
|
|
}
|
|
(*m_torrent.session().m_logger) << time_now_string() << " BANNING PEER [ p: " << b.piece_index
|
|
<< " | b: " << b.block_index
|
|
<< " | c: " << client
|
|
<< " | hash1: " << i->second.digest
|
|
<< " | hash2: " << e.digest
|
|
<< " | ip: " << p->ip() << " ]\n";
|
|
#endif
|
|
m_torrent.get_policy().ban_peer(p);
|
|
if (p->connection) p->connection->disconnect(
|
|
errors::peer_banned);
|
|
}
|
|
// we already have this exact entry in the map
|
|
// we don't have to insert it
|
|
return;
|
|
}
|
|
|
|
m_block_hashes.insert(i, std::pair<const piece_block, block_entry>(b, e));
|
|
|
|
#ifdef TORRENT_LOGGING
|
|
char const* client = "-";
|
|
peer_info info;
|
|
if (p->connection)
|
|
{
|
|
p->connection->get_peer_info(info);
|
|
client = info.client.c_str();
|
|
}
|
|
(*m_torrent.session().m_logger) << time_now_string() << " STORE BLOCK CRC [ p: " << b.piece_index
|
|
<< " | b: " << b.block_index
|
|
<< " | c: " << client
|
|
<< " | digest: " << e.digest
|
|
<< " | ip: " << p->ip() << " ]\n";
|
|
#endif
|
|
}
|
|
|
|
void on_read_ok_block(std::pair<piece_block, block_entry> b, int ret, disk_io_job const& j)
|
|
{
|
|
TORRENT_ASSERT(m_torrent.session().is_network_thread());
|
|
|
|
disk_buffer_holder buffer(m_torrent.session(), j.buffer);
|
|
|
|
// ignore read errors
|
|
if (ret != j.buffer_size) return;
|
|
|
|
hasher h;
|
|
h.update(j.buffer, j.buffer_size);
|
|
h.update((char const*)&m_salt, sizeof(m_salt));
|
|
sha1_hash ok_digest = h.final();
|
|
|
|
policy::peer* p = b.second.peer;
|
|
|
|
if (b.second.digest == ok_digest) return;
|
|
if (p == 0) return;
|
|
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
log_hash_block(&m_log_file, m_torrent, b.first.piece_index
|
|
, b.first.block_index, p->address(), j.buffer, j.buffer_size, false);
|
|
#endif
|
|
|
|
if (!m_torrent.get_policy().has_peer(p)) return;
|
|
|
|
#ifdef TORRENT_LOGGING
|
|
char const* client = "-";
|
|
peer_info info;
|
|
if (p->connection)
|
|
{
|
|
p->connection->get_peer_info(info);
|
|
client = info.client.c_str();
|
|
}
|
|
(*m_torrent.session().m_logger) << time_now_string() << " BANNING PEER [ p: " << b.first.piece_index
|
|
<< " | b: " << b.first.block_index
|
|
<< " | c: " << client
|
|
<< " | ok_digest: " << ok_digest
|
|
<< " | bad_digest: " << b.second.digest
|
|
<< " | ip: " << p->ip() << " ]\n";
|
|
#endif
|
|
m_torrent.get_policy().ban_peer(p);
|
|
if (p->connection) p->connection->disconnect(
|
|
errors::peer_banned);
|
|
}
|
|
|
|
torrent& m_torrent;
|
|
|
|
// This table maps a piece_block (piece and block index
|
|
// pair) to a peer and the block CRC. The CRC is calculated
|
|
// from the data in the block + the salt
|
|
std::map<piece_block, block_entry> m_block_hashes;
|
|
|
|
// This salt is a random value used to calculate the block CRCs
|
|
// Since the CRC function that is used is not a one way function
|
|
// the salt is required to avoid attacks where bad data is sent
|
|
// that is forged to match the CRC of the good data.
|
|
int m_salt;
|
|
|
|
#ifdef TORRENT_LOG_HASH_FAILURES
|
|
FILE* m_log_file;
|
|
#endif
|
|
};
|
|
|
|
} }
|
|
|
|
namespace libtorrent
|
|
{
|
|
|
|
boost::shared_ptr<torrent_plugin> create_smart_ban_plugin(torrent* t, void*)
|
|
{
|
|
return boost::shared_ptr<torrent_plugin>(new smart_ban_plugin(*t));
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|