2003-10-23 01:00:57 +02:00
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 2003, 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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2007-03-17 18:15:16 +01:00
|
|
|
#include "libtorrent/pch.hpp"
|
|
|
|
|
2004-11-30 12:17:32 +01:00
|
|
|
#include <vector>
|
2003-10-23 01:00:57 +02:00
|
|
|
#include <iostream>
|
|
|
|
#include <iomanip>
|
2004-01-12 21:31:27 +01:00
|
|
|
#include <limits>
|
2006-04-25 23:04:48 +02:00
|
|
|
#include <boost/bind.hpp>
|
2004-01-12 21:31:27 +01:00
|
|
|
|
2003-10-23 01:00:57 +02:00
|
|
|
#include "libtorrent/peer_connection.hpp"
|
2003-12-22 08:14:35 +01:00
|
|
|
#include "libtorrent/identify_client.hpp"
|
2004-01-04 05:29:13 +01:00
|
|
|
#include "libtorrent/entry.hpp"
|
|
|
|
#include "libtorrent/bencode.hpp"
|
2004-01-18 20:12:18 +01:00
|
|
|
#include "libtorrent/alert_types.hpp"
|
2004-01-25 19:18:36 +01:00
|
|
|
#include "libtorrent/invariant_check.hpp"
|
2004-01-26 18:39:44 +01:00
|
|
|
#include "libtorrent/io.hpp"
|
2006-07-08 21:41:39 +02:00
|
|
|
#include "libtorrent/file.hpp"
|
2004-04-17 14:29:35 +02:00
|
|
|
#include "libtorrent/version.hpp"
|
2006-11-14 01:08:16 +01:00
|
|
|
#include "libtorrent/extensions.hpp"
|
2006-10-11 16:02:21 +02:00
|
|
|
#include "libtorrent/aux_/session_impl.hpp"
|
2007-04-10 23:23:13 +02:00
|
|
|
#include "libtorrent/policy.hpp"
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
using boost::bind;
|
|
|
|
using boost::shared_ptr;
|
2006-10-11 16:02:21 +02:00
|
|
|
using libtorrent::aux::session_impl;
|
2004-10-14 03:17:04 +02:00
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
namespace libtorrent
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void intrusive_ptr_add_ref(peer_connection const* c)
|
|
|
|
{
|
|
|
|
assert(c->m_refs >= 0);
|
|
|
|
assert(c != 0);
|
|
|
|
++c->m_refs;
|
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void intrusive_ptr_release(peer_connection const* c)
|
|
|
|
{
|
|
|
|
assert(c->m_refs > 0);
|
|
|
|
assert(c != 0);
|
2006-05-28 21:03:54 +02:00
|
|
|
if (--c->m_refs == 0)
|
2006-04-25 23:04:48 +02:00
|
|
|
delete c;
|
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
peer_connection::peer_connection(
|
2006-10-11 16:02:21 +02:00
|
|
|
session_impl& ses
|
2006-04-25 23:04:48 +02:00
|
|
|
, boost::weak_ptr<torrent> tor
|
|
|
|
, shared_ptr<stream_socket> s
|
2007-02-12 06:46:29 +01:00
|
|
|
, tcp::endpoint const& remote
|
2007-04-10 23:23:13 +02:00
|
|
|
, tcp::endpoint const& proxy
|
|
|
|
, policy::peer* peerinfo)
|
2005-08-19 01:55:32 +02:00
|
|
|
:
|
|
|
|
#ifndef NDEBUG
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_choke(time_now() - hours(1))
|
2006-04-25 23:04:48 +02:00
|
|
|
,
|
2005-08-19 01:55:32 +02:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
m_ses(ses)
|
2006-10-11 16:02:21 +02:00
|
|
|
, m_max_out_request_queue(m_ses.settings().max_out_request_queue)
|
|
|
|
, m_timeout(m_ses.settings().peer_timeout)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_last_piece(time_now())
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_packet_size(0)
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_recv_pos(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_current_send_buffer(0)
|
2006-04-30 02:39:18 +02:00
|
|
|
, m_write_pos(0)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_last_receive(time_now())
|
|
|
|
, m_last_sent(time_now())
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_socket(s)
|
2005-11-02 17:28:39 +01:00
|
|
|
, m_remote(remote)
|
2007-02-12 06:46:29 +01:00
|
|
|
, m_remote_proxy(proxy)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_torrent(tor)
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_active(true)
|
|
|
|
, m_peer_interested(false)
|
|
|
|
, m_peer_choked(true)
|
|
|
|
, m_interesting(false)
|
|
|
|
, m_choked(true)
|
2004-03-21 03:03:37 +01:00
|
|
|
, m_failed(false)
|
2004-01-28 12:37:46 +01:00
|
|
|
, m_num_pieces(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_desired_queue_size(2)
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_free_upload(0)
|
|
|
|
, m_trust_points(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_assume_fifo(false)
|
2004-01-12 21:31:27 +01:00
|
|
|
, m_num_invalid_requests(0)
|
2004-01-20 23:59:21 +01:00
|
|
|
, m_disconnecting(false)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_became_uninterested(time_now())
|
|
|
|
, m_became_uninteresting(time_now())
|
2005-11-02 17:28:39 +01:00
|
|
|
, m_connecting(true)
|
|
|
|
, m_queued(true)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_writing(false)
|
|
|
|
, m_reading(false)
|
2006-11-14 01:08:16 +01:00
|
|
|
, m_prefer_whole_pieces(false)
|
|
|
|
, m_request_large_blocks(false)
|
2007-02-01 08:33:04 +01:00
|
|
|
, m_non_prioritized(false)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_refs(0)
|
2006-12-04 21:42:47 +01:00
|
|
|
, m_upload_limit(resource_request::inf)
|
|
|
|
, m_download_limit(resource_request::inf)
|
2007-04-10 23:23:13 +02:00
|
|
|
, m_peer_info(peerinfo)
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
, m_in_constructor(true)
|
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2007-01-29 08:39:33 +01:00
|
|
|
std::fill(m_country, m_country + 2, 0);
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
m_logger = m_ses.create_log(m_remote.address().to_string() + "_"
|
2006-11-15 22:39:58 +01:00
|
|
|
+ boost::lexical_cast<std::string>(m_remote.port()), m_ses.listen_port());
|
2006-04-25 23:04:48 +02:00
|
|
|
(*m_logger) << "*** OUTGOING CONNECTION\n";
|
|
|
|
#endif
|
2004-01-25 19:18:36 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-01-15 17:45:34 +01:00
|
|
|
std::fill(m_peer_id.begin(), m_peer_id.end(), 0);
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->ready_for_connections())
|
2004-06-14 01:30:42 +02:00
|
|
|
init();
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2003-12-07 06:53:04 +01:00
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
peer_connection::peer_connection(
|
2006-10-11 16:02:21 +02:00
|
|
|
session_impl& ses
|
2007-04-10 23:23:13 +02:00
|
|
|
, boost::shared_ptr<stream_socket> s
|
|
|
|
, policy::peer* peerinfo)
|
2005-08-19 01:55:32 +02:00
|
|
|
:
|
|
|
|
#ifndef NDEBUG
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_choke(time_now() - hours(1))
|
2006-04-25 23:04:48 +02:00
|
|
|
,
|
2005-08-19 01:55:32 +02:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
m_ses(ses)
|
2006-10-11 16:02:21 +02:00
|
|
|
, m_max_out_request_queue(m_ses.settings().max_out_request_queue)
|
|
|
|
, m_timeout(m_ses.settings().peer_timeout)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_last_piece(time_now())
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_packet_size(0)
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_recv_pos(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_current_send_buffer(0)
|
2006-04-30 02:39:18 +02:00
|
|
|
, m_write_pos(0)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_last_receive(time_now())
|
|
|
|
, m_last_sent(time_now())
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_socket(s)
|
|
|
|
, m_active(false)
|
|
|
|
, m_peer_interested(false)
|
|
|
|
, m_peer_choked(true)
|
|
|
|
, m_interesting(false)
|
|
|
|
, m_choked(true)
|
2004-03-21 03:03:37 +01:00
|
|
|
, m_failed(false)
|
2004-01-28 12:37:46 +01:00
|
|
|
, m_num_pieces(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_desired_queue_size(2)
|
2004-01-04 05:29:13 +01:00
|
|
|
, m_free_upload(0)
|
|
|
|
, m_trust_points(0)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_assume_fifo(false)
|
2004-01-12 21:31:27 +01:00
|
|
|
, m_num_invalid_requests(0)
|
2004-01-20 23:59:21 +01:00
|
|
|
, m_disconnecting(false)
|
2007-04-05 00:27:36 +02:00
|
|
|
, m_became_uninterested(time_now())
|
|
|
|
, m_became_uninteresting(time_now())
|
2005-11-02 17:28:39 +01:00
|
|
|
, m_connecting(false)
|
|
|
|
, m_queued(false)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_writing(false)
|
|
|
|
, m_reading(false)
|
2006-11-14 01:08:16 +01:00
|
|
|
, m_prefer_whole_pieces(false)
|
|
|
|
, m_request_large_blocks(false)
|
2007-02-01 08:33:04 +01:00
|
|
|
, m_non_prioritized(false)
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_refs(0)
|
2006-12-04 21:42:47 +01:00
|
|
|
, m_upload_limit(resource_request::inf)
|
|
|
|
, m_download_limit(resource_request::inf)
|
2007-04-10 23:23:13 +02:00
|
|
|
, m_peer_info(peerinfo)
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
, m_in_constructor(true)
|
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2007-01-29 08:39:33 +01:00
|
|
|
std::fill(m_country, m_country + 2, 0);
|
2006-04-25 23:04:48 +02:00
|
|
|
m_remote = m_socket->remote_endpoint();
|
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
assert(m_socket->remote_endpoint() == remote());
|
|
|
|
m_logger = m_ses.create_log(remote().address().to_string() + "_"
|
2006-11-15 22:39:58 +01:00
|
|
|
+ boost::lexical_cast<std::string>(remote().port()), m_ses.listen_port());
|
2006-04-25 23:04:48 +02:00
|
|
|
(*m_logger) << "*** INCOMING CONNECTION\n";
|
|
|
|
#endif
|
2007-01-10 16:02:25 +01:00
|
|
|
|
2004-01-15 17:45:34 +01:00
|
|
|
std::fill(m_peer_id.begin(), m_peer_id.end(), 0);
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2007-03-21 03:09:50 +01:00
|
|
|
void peer_connection::update_interest()
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
|
|
|
bool interested = false;
|
|
|
|
const std::vector<bool>& we_have = t->pieces();
|
|
|
|
for (int j = 0; j != (int)we_have.size(); ++j)
|
|
|
|
{
|
|
|
|
if (!we_have[j]
|
|
|
|
&& t->piece_priority(j) > 0
|
|
|
|
&& m_have_piece[j])
|
|
|
|
{
|
|
|
|
interested = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2007-04-12 12:21:55 +02:00
|
|
|
try
|
|
|
|
{
|
|
|
|
if (!interested)
|
|
|
|
send_not_interested();
|
|
|
|
else
|
|
|
|
t->get_policy().peer_is_interesting(*this);
|
|
|
|
}
|
|
|
|
catch (std::exception& e)
|
|
|
|
{
|
|
|
|
#ifndef NDEBUG
|
|
|
|
std::cerr << e.what() << std::endl;
|
|
|
|
assert(false);
|
|
|
|
#endif
|
|
|
|
}
|
2007-03-21 03:09:50 +01:00
|
|
|
|
|
|
|
assert(is_interesting() == interested);
|
|
|
|
}
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
void peer_connection::add_extension(boost::shared_ptr<peer_plugin> ext)
|
|
|
|
{
|
|
|
|
m_extensions.push_back(ext);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2004-06-14 01:30:42 +02:00
|
|
|
void peer_connection::init()
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
assert(t->valid_metadata());
|
|
|
|
assert(t->ready_for_connections());
|
|
|
|
|
|
|
|
m_have_piece.resize(t->torrent_file().num_pieces(), false);
|
2004-06-14 01:30:42 +02:00
|
|
|
|
|
|
|
// now that we have a piece_picker,
|
|
|
|
// update it with this peers pieces
|
|
|
|
|
|
|
|
// build a vector of all pieces
|
2006-04-25 23:04:48 +02:00
|
|
|
m_num_pieces = 0;
|
2007-03-15 23:03:56 +01:00
|
|
|
bool interesting = false;
|
|
|
|
for (int i = 0; i < int(m_have_piece.size()); ++i)
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
|
|
|
if (m_have_piece[i])
|
|
|
|
{
|
|
|
|
++m_num_pieces;
|
2007-03-15 23:03:56 +01:00
|
|
|
t->peer_has(i);
|
|
|
|
// if the peer has a piece and we don't, the peer is interesting
|
|
|
|
if (!t->have_piece(i)
|
2007-03-21 03:09:50 +01:00
|
|
|
&& t->picker().piece_priority(i) != 0)
|
2007-03-15 23:03:56 +01:00
|
|
|
interesting = true;
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-03-15 23:03:56 +01:00
|
|
|
if (m_num_pieces == int(m_have_piece.size()))
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2004-06-14 01:30:42 +02:00
|
|
|
(*m_logger) << " *** THIS IS A SEED ***\n";
|
|
|
|
#endif
|
2007-04-13 02:22:03 +02:00
|
|
|
assert(m_peer_info);
|
|
|
|
m_peer_info->seed = true;
|
2004-06-14 01:30:42 +02:00
|
|
|
// if we're a seed too, disconnect
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->is_seed())
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2004-06-14 01:30:42 +02:00
|
|
|
(*m_logger) << " we're also a seed, disconnecting\n";
|
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
throw std::runtime_error("seed to seed connection redundant, disconnecting");
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (interesting)
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().peer_is_interesting(*this);
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
peer_connection::~peer_connection()
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2006-06-12 01:24:36 +02:00
|
|
|
// INVARIANT_CHECK;
|
2006-06-25 00:30:59 +02:00
|
|
|
assert(m_disconnecting);
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2005-01-10 12:14:22 +01:00
|
|
|
if (m_logger)
|
|
|
|
{
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2005-01-10 12:14:22 +01:00
|
|
|
<< " *** CONNECTION CLOSED\n";
|
|
|
|
}
|
|
|
|
#endif
|
2005-10-01 17:12:10 +02:00
|
|
|
#ifndef NDEBUG
|
2007-04-12 12:21:55 +02:00
|
|
|
if (m_peer_info)
|
|
|
|
assert(m_peer_info->connection == 0);
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
if (t) assert(t->connection_for(remote()) != this);
|
2005-10-01 17:12:10 +02:00
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-03-11 15:56:48 +01:00
|
|
|
void peer_connection::announce_piece(int index)
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
// optimization, don't send have messages
|
|
|
|
// to peers that already have the piece
|
|
|
|
if (has_piece(index)) return;
|
2006-11-19 16:29:58 +01:00
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-11-19 16:29:58 +01:00
|
|
|
<< " ==> HAVE [ piece: " << index << "]\n";
|
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
write_have(index);
|
2006-11-19 16:29:58 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
assert(t->have_piece(index));
|
|
|
|
#endif
|
2004-03-11 15:56:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool peer_connection::has_piece(int i) const
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
assert(t->valid_metadata());
|
2004-03-11 15:56:48 +01:00
|
|
|
assert(i >= 0);
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(i < t->torrent_file().num_pieces());
|
2004-03-11 15:56:48 +01:00
|
|
|
return m_have_piece[i];
|
|
|
|
}
|
|
|
|
|
2005-09-27 10:07:24 +02:00
|
|
|
std::deque<piece_block> const& peer_connection::request_queue() const
|
|
|
|
{
|
|
|
|
return m_request_queue;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::deque<piece_block> const& peer_connection::download_queue() const
|
2004-03-11 15:56:48 +01:00
|
|
|
{
|
|
|
|
return m_download_queue;
|
|
|
|
}
|
|
|
|
|
2005-09-27 10:07:24 +02:00
|
|
|
std::deque<peer_request> const& peer_connection::upload_queue() const
|
2004-03-11 15:56:48 +01:00
|
|
|
{
|
|
|
|
return m_requests;
|
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::add_stat(size_type downloaded, size_type uploaded)
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-03-11 15:56:48 +01:00
|
|
|
m_statistics.add_stat(downloaded, uploaded);
|
|
|
|
}
|
|
|
|
|
2005-09-27 10:07:24 +02:00
|
|
|
std::vector<bool> const& peer_connection::get_bitfield() const
|
2004-03-11 15:56:48 +01:00
|
|
|
{
|
|
|
|
return m_have_piece;
|
|
|
|
}
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
void peer_connection::received_valid_data(int index)
|
2004-03-11 15:56:48 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
try { (*i)->on_piece_pass(index); } catch (std::exception&) {}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2004-03-11 15:56:48 +01:00
|
|
|
m_trust_points++;
|
2006-04-25 23:04:48 +02:00
|
|
|
// TODO: make this limit user settable
|
2004-03-11 15:56:48 +01:00
|
|
|
if (m_trust_points > 20) m_trust_points = 20;
|
|
|
|
}
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
void peer_connection::received_invalid_data(int index)
|
2004-03-11 15:56:48 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
try { (*i)->on_piece_failed(index); } catch (std::exception&) {}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2004-03-21 03:03:37 +01:00
|
|
|
// we decrease more than we increase, to keep the
|
|
|
|
// allowed failed/passed ratio low.
|
2006-04-25 23:04:48 +02:00
|
|
|
// TODO: make this limit user settable
|
2004-03-21 03:03:37 +01:00
|
|
|
m_trust_points -= 2;
|
|
|
|
if (m_trust_points < -7) m_trust_points = -7;
|
2004-03-11 15:56:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
int peer_connection::trust_points() const
|
|
|
|
{
|
|
|
|
return m_trust_points;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_type peer_connection::total_free_upload() const
|
|
|
|
{
|
|
|
|
return m_free_upload;
|
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::add_free_upload(size_type free_upload)
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-03-11 15:56:48 +01:00
|
|
|
m_free_upload += free_upload;
|
|
|
|
}
|
|
|
|
|
2004-01-08 14:03:38 +01:00
|
|
|
// verifies a piece to see if it is valid (is within a valid range)
|
|
|
|
// and if it can correspond to a request generated by libtorrent.
|
|
|
|
bool peer_connection::verify_piece(const peer_request& p) const
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
|
|
|
assert(t->valid_metadata());
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2004-01-08 14:03:38 +01:00
|
|
|
return p.piece >= 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& p.piece < t->torrent_file().num_pieces()
|
2004-01-08 14:03:38 +01:00
|
|
|
&& p.length > 0
|
|
|
|
&& p.start >= 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& (p.length == t->block_size()
|
|
|
|
|| (p.length < t->block_size()
|
2006-11-14 01:08:16 +01:00
|
|
|
&& p.piece == t->torrent_file().num_pieces()-1
|
|
|
|
&& p.start + p.length == t->torrent_file().piece_size(p.piece))
|
|
|
|
|| (m_request_large_blocks
|
|
|
|
&& p.length <= t->torrent_file().piece_size(p.piece)))
|
2006-04-25 23:04:48 +02:00
|
|
|
&& p.start + p.length <= t->torrent_file().piece_size(p.piece)
|
2006-11-14 01:08:16 +01:00
|
|
|
&& (p.start % t->block_size() == 0);
|
2004-01-08 14:03:38 +01:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
struct disconnect_torrent
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
disconnect_torrent(boost::weak_ptr<torrent>& t): m_t(&t) {}
|
|
|
|
~disconnect_torrent() { if (m_t) m_t->reset(); }
|
|
|
|
void cancel() { m_t = 0; }
|
|
|
|
private:
|
|
|
|
boost::weak_ptr<torrent>* m_t;
|
|
|
|
};
|
|
|
|
|
|
|
|
void peer_connection::attach_to_torrent(sha1_hash const& ih)
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(!m_disconnecting);
|
|
|
|
m_torrent = m_ses.find_torrent(ih);
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
|
2006-05-28 21:03:54 +02:00
|
|
|
if (t && t->is_aborted())
|
|
|
|
{
|
|
|
|
m_torrent.reset();
|
|
|
|
t.reset();
|
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!t)
|
|
|
|
{
|
|
|
|
// we couldn't find the torrent!
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << " couldn't find a torrent with the given info_hash\n";
|
|
|
|
#endif
|
|
|
|
throw std::runtime_error("got info-hash that is not in our session");
|
|
|
|
}
|
|
|
|
|
|
|
|
disconnect_torrent disconnect(m_torrent);
|
|
|
|
if (t->is_paused())
|
|
|
|
{
|
|
|
|
// paused torrents will not accept
|
|
|
|
// incoming connections
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << " rejected connection to paused torrent\n";
|
|
|
|
#endif
|
|
|
|
throw std::runtime_error("connection rejected by paused torrent");
|
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// check to make sure we don't have another connection with the same
|
|
|
|
// info_hash and peer_id. If we do. close this connection.
|
|
|
|
t->attach_peer(this);
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// if the torrent isn't ready to accept
|
|
|
|
// connections yet, we'll have to wait with
|
|
|
|
// our initialization
|
|
|
|
if (t->ready_for_connections()) init();
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// assume the other end has no pieces
|
|
|
|
// if we don't have valid metadata yet,
|
|
|
|
// leave the vector unallocated
|
|
|
|
assert(m_num_pieces == 0);
|
|
|
|
std::fill(m_have_piece.begin(), m_have_piece.end(), false);
|
|
|
|
disconnect.cancel();
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// message handlers
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// -----------------------------
|
|
|
|
// --------- KEEPALIVE ---------
|
|
|
|
// -----------------------------
|
|
|
|
|
|
|
|
void peer_connection::incoming_keepalive()
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== KEEPALIVE\n";
|
2006-04-25 23:04:48 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ----------- CHOKE -----------
|
|
|
|
// -----------------------------
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_choke()
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-01-05 00:51:54 +01:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_choke()) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== CHOKE\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
|
|
|
m_peer_choked = true;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().choked(*this);
|
2006-12-16 03:19:53 +01:00
|
|
|
|
2006-12-04 13:20:34 +01:00
|
|
|
if (!t->is_seed())
|
2004-01-04 06:28:24 +01:00
|
|
|
{
|
2006-12-16 03:19:53 +01:00
|
|
|
piece_picker& p = t->picker();
|
2006-12-04 13:20:34 +01:00
|
|
|
// remove all pieces from this peers download queue and
|
|
|
|
// remove the 'downloading' flag from piece_picker.
|
|
|
|
for (std::deque<piece_block>::iterator i = m_download_queue.begin();
|
|
|
|
i != m_download_queue.end(); ++i)
|
|
|
|
{
|
2006-12-16 03:19:53 +01:00
|
|
|
p.abort_download(*i);
|
2006-12-04 13:20:34 +01:00
|
|
|
}
|
|
|
|
for (std::deque<piece_block>::const_iterator i = m_request_queue.begin()
|
|
|
|
, end(m_request_queue.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
// since this piece was skipped, clear it and allow it to
|
|
|
|
// be requested from other peers
|
2006-12-16 03:19:53 +01:00
|
|
|
p.abort_download(*i);
|
2006-12-04 13:20:34 +01:00
|
|
|
}
|
2005-09-27 10:07:24 +02:00
|
|
|
}
|
2006-12-15 03:26:11 +01:00
|
|
|
|
2006-12-15 18:47:21 +01:00
|
|
|
m_download_queue.clear();
|
|
|
|
m_request_queue.clear();
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2004-01-04 06:28:24 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ---------- UNCHOKE ----------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_unchoke()
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2003-12-07 06:53:04 +01:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_unchoke()) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== UNCHOKE\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
|
|
|
m_peer_choked = false;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().unchoked(*this);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// -------- INTERESTED ---------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_interested()
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_interested()) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== INTERESTED\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
|
|
|
m_peer_interested = true;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().interested(*this);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-12-07 06:53:04 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ------ NOT INTERESTED -------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_not_interested()
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_not_interested()) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
m_became_uninterested = time_now();
|
2004-02-01 14:48:30 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// clear the request queue if the client isn't interested
|
|
|
|
m_requests.clear();
|
2007-02-12 06:46:29 +01:00
|
|
|
// setup_send();
|
2003-12-18 04:30:41 +01:00
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== NOT_INTERESTED\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
m_peer_interested = false;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().not_interested(*this);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ----------- HAVE ------------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_have(int index)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_have(index)) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2004-06-28 22:23:42 +02:00
|
|
|
<< " <== HAVE [ piece: " << index << "]\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// if we got an invalid message, abort
|
|
|
|
if (index >= (int)m_have_piece.size() || index < 0)
|
|
|
|
throw protocol_error("got 'have'-message with higher index "
|
|
|
|
"than the number of pieces");
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
if (m_have_piece[index])
|
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2006-04-25 23:04:48 +02:00
|
|
|
(*m_logger) << " got redundant HAVE message for index: " << index << "\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_have_piece[index] = true;
|
2004-01-28 12:37:46 +01:00
|
|
|
|
2004-06-14 01:30:42 +02:00
|
|
|
// only update the piece_picker if
|
2006-12-04 13:20:34 +01:00
|
|
|
// we have the metadata and if
|
|
|
|
// we're not a seed (in which case
|
|
|
|
// we won't have a piece picker)
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->valid_metadata())
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
|
|
|
++m_num_pieces;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->peer_has(index);
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!t->have_piece(index)
|
2006-12-04 13:20:34 +01:00
|
|
|
&& !t->is_seed()
|
2005-05-25 12:01:01 +02:00
|
|
|
&& !is_interesting()
|
2007-03-15 23:03:56 +01:00
|
|
|
&& t->picker().piece_priority(index) != 0)
|
2006-04-25 23:04:48 +02:00
|
|
|
t->get_policy().peer_is_interesting(*this);
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
2004-01-12 21:31:27 +01:00
|
|
|
|
2007-03-28 03:06:15 +02:00
|
|
|
if (is_seed())
|
2004-01-12 21:31:27 +01:00
|
|
|
{
|
2007-04-13 02:22:03 +02:00
|
|
|
assert(m_peer_info);
|
|
|
|
m_peer_info->seed = true;
|
2007-03-28 03:06:15 +02:00
|
|
|
if (t->is_seed())
|
|
|
|
{
|
|
|
|
throw protocol_error("seed to seed connection redundant, disconnecting");
|
|
|
|
}
|
2004-01-12 21:31:27 +01:00
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// --------- BITFIELD ----------
|
|
|
|
// -----------------------------
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_bitfield(std::vector<bool> const& bitfield)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_bitfield(bitfield)) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " <== BITFIELD ";
|
2007-03-28 22:54:51 +02:00
|
|
|
|
|
|
|
for (int i = 0; i < int(bitfield.size()); ++i)
|
|
|
|
{
|
|
|
|
if (bitfield[i]) (*m_logger) << "1";
|
|
|
|
else (*m_logger) << "0";
|
|
|
|
}
|
|
|
|
(*m_logger) << "\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// if we don't have the metedata, we cannot
|
|
|
|
// verify the bitfield size
|
|
|
|
if (t->valid_metadata()
|
|
|
|
&& (bitfield.size() / 8) != (m_have_piece.size() / 8))
|
2006-11-14 01:08:16 +01:00
|
|
|
throw protocol_error("got bitfield with invalid size: "
|
|
|
|
+ boost::lexical_cast<std::string>(bitfield.size() / 8)
|
|
|
|
+ "bytes. expected: "
|
|
|
|
+ boost::lexical_cast<std::string>(m_have_piece.size() / 8)
|
|
|
|
+ "bytes");
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2004-06-14 01:30:42 +02:00
|
|
|
// if we don't have metadata yet
|
|
|
|
// just remember the bitmask
|
|
|
|
// don't update the piecepicker
|
|
|
|
// (since it doesn't exist yet)
|
2007-03-17 00:28:26 +01:00
|
|
|
if (!t->ready_for_connections())
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
m_have_piece = bitfield;
|
|
|
|
m_num_pieces = std::count(bitfield.begin(), bitfield.end(), true);
|
2007-04-13 03:53:25 +02:00
|
|
|
|
|
|
|
if (m_peer_info) m_peer_info->seed = true;
|
2004-06-14 01:30:42 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-04-13 03:53:25 +02:00
|
|
|
int num_pieces = std::count(bitfield.begin(), bitfield.end(), true);
|
|
|
|
if (num_pieces == int(m_have_piece.size()))
|
|
|
|
{
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << " *** THIS IS A SEED ***\n";
|
|
|
|
#endif
|
2007-04-13 03:57:16 +02:00
|
|
|
// if this is a web seed. we don't have a peer_info struct
|
|
|
|
if (m_peer_info) m_peer_info->seed = true;
|
2007-04-13 03:53:25 +02:00
|
|
|
// if we're a seed too, disconnect
|
|
|
|
if (t->is_seed())
|
|
|
|
{
|
|
|
|
throw protocol_error("seed to seed connection redundant, disconnecting");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-02-12 06:46:29 +01:00
|
|
|
// let the torrent know which pieces the
|
|
|
|
// peer has
|
|
|
|
bool interesting = false;
|
2004-01-25 19:18:36 +01:00
|
|
|
for (int i = 0; i < (int)m_have_piece.size(); ++i)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
bool have = bitfield[i];
|
2004-01-05 00:51:54 +01:00
|
|
|
if (have && !m_have_piece[i])
|
|
|
|
{
|
|
|
|
m_have_piece[i] = true;
|
2004-01-28 12:37:46 +01:00
|
|
|
++m_num_pieces;
|
2007-02-12 06:46:29 +01:00
|
|
|
t->peer_has(i);
|
2007-03-15 23:03:56 +01:00
|
|
|
if (!t->have_piece(i) && t->picker().piece_priority(i) != 0)
|
2007-02-12 06:46:29 +01:00
|
|
|
interesting = true;
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
else if (!have && m_have_piece[i])
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2004-07-01 09:12:17 +02:00
|
|
|
// this should probably not be allowed
|
2004-01-05 00:51:54 +01:00
|
|
|
m_have_piece[i] = false;
|
2004-01-28 12:37:46 +01:00
|
|
|
--m_num_pieces;
|
2006-04-25 23:04:48 +02:00
|
|
|
t->peer_lost(i);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (interesting) t->get_policy().peer_is_interesting(*this);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-12-17 20:03:23 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ---------- REQUEST ----------
|
|
|
|
// -----------------------------
|
2003-12-17 20:03:23 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_request(peer_request const& r)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-01-05 00:51:54 +01:00
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_request(r)) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!t->valid_metadata())
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
|
|
|
// if we don't have valid metadata yet,
|
|
|
|
// we shouldn't get a request
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2004-06-28 22:23:42 +02:00
|
|
|
<< " <== UNEXPECTED_REQUEST [ "
|
2004-06-14 01:30:42 +02:00
|
|
|
"piece: " << r.piece << " | "
|
|
|
|
"s: " << r.start << " | "
|
|
|
|
"l: " << r.length << " | "
|
|
|
|
"i: " << m_peer_interested << " | "
|
2006-04-25 23:04:48 +02:00
|
|
|
"t: " << (int)t->torrent_file().piece_size(r.piece) << " | "
|
|
|
|
"n: " << t->torrent_file().num_pieces() << " ]\n";
|
2004-06-14 01:30:42 +02:00
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-10-11 16:02:21 +02:00
|
|
|
if (int(m_requests.size()) > m_ses.settings().max_allowed_in_request_queue)
|
2004-02-20 16:22:23 +01:00
|
|
|
{
|
|
|
|
// don't allow clients to abuse our
|
|
|
|
// memory consumption.
|
|
|
|
// ignore requests if the client
|
|
|
|
// is making too many of them.
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2004-06-28 22:23:42 +02:00
|
|
|
<< " <== TOO MANY REQUESTS [ "
|
2004-06-14 01:30:42 +02:00
|
|
|
"piece: " << r.piece << " | "
|
|
|
|
"s: " << r.start << " | "
|
|
|
|
"l: " << r.length << " | "
|
|
|
|
"i: " << m_peer_interested << " | "
|
2006-04-25 23:04:48 +02:00
|
|
|
"t: " << (int)t->torrent_file().piece_size(r.piece) << " | "
|
|
|
|
"n: " << t->torrent_file().num_pieces() << " ]\n";
|
2004-06-14 01:30:42 +02:00
|
|
|
#endif
|
2004-02-20 16:22:23 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// make sure this request
|
2004-11-30 12:17:32 +01:00
|
|
|
// is legal and that the peer
|
2004-01-05 00:51:54 +01:00
|
|
|
// is not choked
|
|
|
|
if (r.piece >= 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& r.piece < t->torrent_file().num_pieces()
|
|
|
|
&& t->have_piece(r.piece)
|
2004-01-05 00:51:54 +01:00
|
|
|
&& r.start >= 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& r.start < t->torrent_file().piece_size(r.piece)
|
2004-01-05 00:51:54 +01:00
|
|
|
&& r.length > 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& r.length + r.start <= t->torrent_file().piece_size(r.piece)
|
2004-01-05 00:51:54 +01:00
|
|
|
&& m_peer_interested)
|
|
|
|
{
|
2006-11-19 16:29:58 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-11-19 16:29:58 +01:00
|
|
|
<< " <== REQUEST [ piece: " << r.piece << " | s: " << r.start << " | l: " << r.length << " ]\n";
|
|
|
|
#endif
|
2004-01-05 00:51:54 +01:00
|
|
|
// if we have choked the client
|
|
|
|
// ignore the request
|
2004-01-05 02:30:34 +01:00
|
|
|
if (m_choked)
|
|
|
|
return;
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
m_requests.push_back(r);
|
2006-05-15 00:30:05 +02:00
|
|
|
fill_send_buffer();
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2004-06-28 22:23:42 +02:00
|
|
|
<< " <== INVALID_REQUEST [ "
|
2004-01-05 02:30:34 +01:00
|
|
|
"piece: " << r.piece << " | "
|
|
|
|
"s: " << r.start << " | "
|
|
|
|
"l: " << r.length << " | "
|
|
|
|
"i: " << m_peer_interested << " | "
|
2006-04-25 23:04:48 +02:00
|
|
|
"t: " << (int)t->torrent_file().piece_size(r.piece) << " | "
|
2006-11-19 16:29:58 +01:00
|
|
|
"n: " << t->torrent_file().num_pieces() << " | "
|
|
|
|
"h: " << t->have_piece(r.piece) << " ]\n";
|
2004-01-05 02:30:34 +01:00
|
|
|
#endif
|
2004-01-12 21:31:27 +01:00
|
|
|
|
|
|
|
++m_num_invalid_requests;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->alerts().should_post(alert::debug))
|
2004-01-08 14:03:38 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
t->alerts().post_alert(invalid_request_alert(
|
2004-01-08 14:03:38 +01:00
|
|
|
r
|
2006-04-25 23:04:48 +02:00
|
|
|
, t->get_handle()
|
2005-11-02 17:28:39 +01:00
|
|
|
, m_remote
|
2004-03-28 19:45:37 +02:00
|
|
|
, m_peer_id
|
2006-04-25 23:04:48 +02:00
|
|
|
, "peer sent an illegal piece request, ignoring"));
|
2004-01-08 14:03:38 +01:00
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_piece_fragment()
|
|
|
|
{
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_piece = time_now();
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
2006-12-22 01:45:43 +01:00
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
struct check_postcondition
|
|
|
|
{
|
|
|
|
check_postcondition(boost::shared_ptr<torrent> const& t_
|
|
|
|
, bool init_check = true): t(t_) { if (init_check) check(); }
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2006-12-22 01:45:43 +01:00
|
|
|
~check_postcondition() { check(); }
|
|
|
|
|
|
|
|
void check()
|
|
|
|
{
|
|
|
|
if (!t->is_seed())
|
|
|
|
{
|
|
|
|
const int blocks_per_piece = static_cast<int>(
|
|
|
|
t->torrent_file().piece_length() / t->block_size());
|
|
|
|
|
|
|
|
std::vector<piece_picker::downloading_piece> const& dl_queue
|
|
|
|
= t->picker().get_download_queue();
|
|
|
|
|
|
|
|
for (std::vector<piece_picker::downloading_piece>::const_iterator i =
|
|
|
|
dl_queue.begin(); i != dl_queue.end(); ++i)
|
|
|
|
{
|
|
|
|
assert(int(i->finished_blocks.count()) < blocks_per_piece);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
shared_ptr<torrent> t;
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ----------- PIECE -----------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_piece(peer_request const& p, char const* data)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2007-04-02 22:00:24 +02:00
|
|
|
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_piece(p, data)) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2006-12-11 13:48:33 +01:00
|
|
|
#ifndef NDEBUG
|
2006-12-22 01:45:43 +01:00
|
|
|
check_postcondition post_checker_(t);
|
2006-12-11 13:48:33 +01:00
|
|
|
t->check_invariant();
|
|
|
|
#endif
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " <== PIECE [ piece: " << p.piece << " | "
|
|
|
|
"s: " << p.start << " | "
|
|
|
|
"l: " << p.length << " | "
|
|
|
|
"ds: " << statistics().download_rate() << " | "
|
|
|
|
"qs: " << m_desired_queue_size << " ]\n";
|
|
|
|
#endif
|
2003-12-07 06:53:04 +01:00
|
|
|
|
2004-01-08 14:03:38 +01:00
|
|
|
if (!verify_piece(p))
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2004-06-28 22:23:42 +02:00
|
|
|
<< " <== INVALID_PIECE [ piece: " << p.piece << " | "
|
2004-01-08 14:03:38 +01:00
|
|
|
"start: " << p.start << " | "
|
|
|
|
"length: " << p.length << " ]\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
throw protocol_error("got invalid piece packet");
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-12-04 21:42:47 +01:00
|
|
|
// if we're already seeding, don't bother,
|
|
|
|
// just ignore it
|
2006-12-16 03:19:53 +01:00
|
|
|
if (t->is_seed())
|
|
|
|
{
|
|
|
|
t->received_redundant_data(p.length);
|
|
|
|
return;
|
|
|
|
}
|
2006-12-04 21:42:47 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
piece_picker& picker = t->picker();
|
2006-12-11 13:48:33 +01:00
|
|
|
piece_manager& fs = t->filesystem();
|
2007-01-01 22:04:30 +01:00
|
|
|
policy& pol = t->get_policy();
|
2004-01-13 04:08:59 +01:00
|
|
|
|
2006-12-11 16:43:27 +01:00
|
|
|
std::vector<piece_block> finished_blocks;
|
2006-04-25 23:04:48 +02:00
|
|
|
piece_block block_finished(p.piece, p.start / t->block_size());
|
2006-12-21 12:37:03 +01:00
|
|
|
assert(p.start % t->block_size() == 0);
|
|
|
|
assert(p.length == t->block_size()
|
|
|
|
|| p.length == t->torrent_file().total_size() % t->block_size());
|
|
|
|
|
|
|
|
std::deque<piece_block>::iterator b
|
|
|
|
= std::find(
|
|
|
|
m_download_queue.begin()
|
|
|
|
, m_download_queue.end()
|
|
|
|
, block_finished);
|
2003-12-08 22:59:48 +01:00
|
|
|
|
2007-02-15 04:03:50 +01:00
|
|
|
// if there's another peer that needs to do another
|
|
|
|
// piece request, this will point to it
|
|
|
|
peer_connection* request_peer = 0;
|
|
|
|
|
2006-12-21 12:37:03 +01:00
|
|
|
if (b != m_download_queue.end())
|
|
|
|
{
|
|
|
|
if (m_assume_fifo)
|
2005-08-04 00:51:21 +02:00
|
|
|
{
|
2006-12-21 23:20:28 +01:00
|
|
|
for (std::deque<piece_block>::iterator i = m_download_queue.begin();
|
2006-12-21 12:37:03 +01:00
|
|
|
i != b; ++i)
|
2006-04-25 23:04:48 +02:00
|
|
|
{
|
2006-12-21 12:37:03 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-12-21 12:37:03 +01:00
|
|
|
<< " *** SKIPPED_PIECE [ piece: " << i->piece_index << " | "
|
|
|
|
"b: " << i->block_index << " ] ***\n";
|
|
|
|
#endif
|
|
|
|
// since this piece was skipped, clear it and allow it to
|
|
|
|
// be requested from other peers
|
|
|
|
// TODO: send cancel?
|
|
|
|
picker.abort_download(*i);
|
2006-11-14 01:08:16 +01:00
|
|
|
}
|
2006-12-21 12:37:03 +01:00
|
|
|
|
|
|
|
// remove the request that just finished
|
|
|
|
// from the download queue plus the
|
|
|
|
// skipped blocks.
|
|
|
|
m_download_queue.erase(m_download_queue.begin()
|
|
|
|
, boost::next(b));
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-12-21 12:37:03 +01:00
|
|
|
m_download_queue.erase(b);
|
2004-01-13 04:08:59 +01:00
|
|
|
}
|
2006-12-21 12:37:03 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// cancel the block from the
|
|
|
|
// peer that has taken over it.
|
|
|
|
boost::optional<tcp::endpoint> peer
|
|
|
|
= t->picker().get_downloader(block_finished);
|
|
|
|
if (peer)
|
2006-11-14 01:08:16 +01:00
|
|
|
{
|
2006-12-21 12:37:03 +01:00
|
|
|
assert(!t->picker().is_finished(block_finished));
|
|
|
|
peer_connection* pc = t->connection_for(*peer);
|
|
|
|
if (pc && pc != this)
|
|
|
|
{
|
|
|
|
pc->cancel_request(block_finished);
|
2007-02-15 04:03:50 +01:00
|
|
|
request_peer = pc;
|
2006-12-21 12:37:03 +01:00
|
|
|
}
|
2006-11-14 01:08:16 +01:00
|
|
|
}
|
2004-01-13 04:08:59 +01:00
|
|
|
else
|
|
|
|
{
|
2006-12-21 12:37:03 +01:00
|
|
|
if (t->alerts().should_post(alert::debug))
|
|
|
|
{
|
|
|
|
t->alerts().post_alert(
|
|
|
|
peer_error_alert(
|
|
|
|
m_remote
|
|
|
|
, m_peer_id
|
|
|
|
, "got a block that was not requested"));
|
|
|
|
}
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << " *** The block we just got was not in the "
|
|
|
|
"request queue ***\n";
|
|
|
|
#endif
|
2004-01-13 04:08:59 +01:00
|
|
|
}
|
2006-12-21 12:37:03 +01:00
|
|
|
}
|
2003-12-08 22:59:48 +01:00
|
|
|
|
2006-12-21 12:37:03 +01:00
|
|
|
// if the block we got is already finished, then ignore it
|
|
|
|
if (picker.is_finished(block_finished))
|
|
|
|
{
|
|
|
|
t->received_redundant_data(t->block_size());
|
2007-02-12 06:46:29 +01:00
|
|
|
pol.block_finished(*this, block_finished);
|
2006-12-16 04:55:20 +01:00
|
|
|
send_block_requests();
|
2007-02-15 04:03:50 +01:00
|
|
|
|
|
|
|
if (request_peer && !request_peer->has_peer_choked() && !t->is_seed())
|
|
|
|
{
|
|
|
|
request_a_block(*t, *request_peer);
|
|
|
|
request_peer->send_block_requests();
|
|
|
|
}
|
2006-12-21 12:37:03 +01:00
|
|
|
return;
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
2006-12-21 12:37:03 +01:00
|
|
|
|
|
|
|
fs.write(data, p.piece, p.start, p.length);
|
2005-08-04 00:51:21 +02:00
|
|
|
|
2006-12-21 12:37:03 +01:00
|
|
|
picker.mark_as_finished(block_finished, m_remote);
|
2006-11-14 01:08:16 +01:00
|
|
|
|
2007-01-01 12:54:31 +01:00
|
|
|
try
|
|
|
|
{
|
2007-01-01 22:04:30 +01:00
|
|
|
pol.block_finished(*this, block_finished);
|
2007-01-01 12:54:31 +01:00
|
|
|
send_block_requests();
|
|
|
|
}
|
|
|
|
catch (std::exception const&) {}
|
|
|
|
|
2007-02-15 04:03:50 +01:00
|
|
|
if (request_peer && !request_peer->has_peer_choked() && !t->is_seed())
|
|
|
|
{
|
|
|
|
request_a_block(*t, *request_peer);
|
|
|
|
request_peer->send_block_requests();
|
|
|
|
}
|
|
|
|
|
2006-12-22 01:45:43 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
try
|
|
|
|
{
|
|
|
|
#endif
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
bool was_seed = t->is_seed();
|
|
|
|
bool was_finished = picker.num_filtered() + t->num_pieces()
|
|
|
|
== t->torrent_file().num_pieces();
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// did we just finish the piece?
|
2004-01-08 14:03:38 +01:00
|
|
|
if (picker.is_piece_finished(p.piece))
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2006-12-22 01:45:43 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
check_postcondition post_checker2_(t, false);
|
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
bool verified = t->verify_piece(p.piece);
|
2004-01-05 00:51:54 +01:00
|
|
|
if (verified)
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2006-12-06 00:53:56 +01:00
|
|
|
// the following call may cause picker to become invalid
|
|
|
|
// in case we just became a seed
|
2006-04-25 23:04:48 +02:00
|
|
|
t->announce_piece(p.piece);
|
|
|
|
assert(t->valid_metadata());
|
2007-03-29 02:52:16 +02:00
|
|
|
// if we just became a seed, picker is now invalid, since it
|
2006-12-06 00:53:56 +01:00
|
|
|
// is deallocated by the torrent once it starts seeding
|
2005-06-11 01:12:50 +02:00
|
|
|
if (!was_finished
|
2006-12-06 00:53:56 +01:00
|
|
|
&& (t->is_seed()
|
|
|
|
|| picker.num_filtered() + t->num_pieces()
|
|
|
|
== t->torrent_file().num_pieces()))
|
2005-06-11 01:12:50 +02:00
|
|
|
{
|
|
|
|
// torrent finished
|
|
|
|
// i.e. all the pieces we're interested in have
|
|
|
|
// been downloaded. Release the files (they will open
|
|
|
|
// in read only mode if needed)
|
2006-12-12 03:28:53 +01:00
|
|
|
try { t->finished(); }
|
2007-04-12 12:21:55 +02:00
|
|
|
catch (std::exception& e)
|
2006-12-12 03:28:53 +01:00
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
std::cerr << e.what() << std::endl;
|
2006-12-12 03:28:53 +01:00
|
|
|
assert(false);
|
2007-04-12 12:21:55 +02:00
|
|
|
#endif
|
2006-12-12 03:28:53 +01:00
|
|
|
}
|
2005-06-11 01:12:50 +02:00
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
t->piece_failed(p.piece);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2006-12-21 23:20:28 +01:00
|
|
|
|
2007-03-27 09:04:31 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
try
|
|
|
|
{
|
|
|
|
#endif
|
|
|
|
|
2007-01-01 22:04:30 +01:00
|
|
|
pol.piece_finished(p.piece, verified);
|
2004-01-18 11:22:18 +01:00
|
|
|
|
2007-03-27 09:04:31 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
}
|
|
|
|
catch (std::exception const& e)
|
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
std::cerr << e.what() << std::endl;
|
2007-03-27 09:04:31 +02:00
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
try
|
|
|
|
{
|
|
|
|
#endif
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!was_seed && t->is_seed())
|
2004-01-18 11:22:18 +01:00
|
|
|
{
|
|
|
|
assert(verified);
|
2006-04-25 23:04:48 +02:00
|
|
|
t->completed();
|
2004-01-18 11:22:18 +01:00
|
|
|
}
|
2007-03-27 09:04:31 +02:00
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
}
|
|
|
|
catch (std::exception const& e)
|
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
std::cerr << e.what() << std::endl;
|
2007-03-27 09:04:31 +02:00
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2006-12-31 15:48:18 +01:00
|
|
|
|
2006-12-21 03:44:00 +01:00
|
|
|
#ifndef NDEBUG
|
2006-12-22 01:45:43 +01:00
|
|
|
}
|
|
|
|
catch (std::exception const& e)
|
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
std::cerr << e.what() << std::endl;
|
2006-12-22 01:45:43 +01:00
|
|
|
assert(false);
|
|
|
|
}
|
2006-12-21 03:44:00 +01:00
|
|
|
#endif
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
// -----------------------------
|
|
|
|
// ---------- CANCEL -----------
|
|
|
|
// -----------------------------
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_cancel(peer_request const& r)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-04-02 22:00:24 +02:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if ((*i)->on_cancel(r)) return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " <== CANCEL [ piece: " << r.piece << " | s: " << r.start << " | l: " << r.length << " ]\n";
|
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
std::deque<peer_request>::iterator i
|
|
|
|
= std::find(m_requests.begin(), m_requests.end(), r);
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2004-01-05 00:51:54 +01:00
|
|
|
if (i != m_requests.end())
|
|
|
|
{
|
|
|
|
m_requests.erase(i);
|
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
else
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " *** GOT CANCEL NOT IN THE QUEUE\n";
|
2004-01-05 00:51:54 +01:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-11-05 00:27:06 +01:00
|
|
|
|
2005-09-15 00:45:22 +02:00
|
|
|
// -----------------------------
|
|
|
|
// --------- DHT PORT ----------
|
|
|
|
// -----------------------------
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::incoming_dht_port(int listen_port)
|
2005-09-15 00:45:22 +02:00
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2005-09-15 00:45:22 +02:00
|
|
|
<< " <== DHT_PORT [ p: " << listen_port << " ]\n";
|
2006-08-01 17:27:08 +02:00
|
|
|
#endif
|
|
|
|
#ifndef TORRENT_DISABLE_DHT
|
2006-10-11 16:02:21 +02:00
|
|
|
m_ses.add_dht_node(udp::endpoint(
|
2006-08-01 17:27:08 +02:00
|
|
|
m_remote.address(), listen_port));
|
2005-09-15 00:45:22 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::add_request(piece_block const& block)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2003-12-01 22:27:27 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(t->valid_metadata());
|
|
|
|
assert(block.piece_index >= 0);
|
|
|
|
assert(block.piece_index < t->torrent_file().num_pieces());
|
|
|
|
assert(block.block_index >= 0);
|
|
|
|
assert(block.block_index < t->torrent_file().piece_size(block.piece_index));
|
|
|
|
assert(!t->picker().is_downloading(block));
|
2004-01-05 00:51:54 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
t->picker().mark_as_downloading(block, m_remote);
|
|
|
|
m_request_queue.push_back(block);
|
2004-01-05 00:51:54 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::cancel_request(piece_block const& block)
|
2004-01-05 00:51:54 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(t->valid_metadata());
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(block.piece_index >= 0);
|
|
|
|
assert(block.piece_index < t->torrent_file().num_pieces());
|
|
|
|
assert(block.block_index >= 0);
|
|
|
|
assert(block.block_index < t->torrent_file().piece_size(block.piece_index));
|
|
|
|
assert(t->picker().is_downloading(block));
|
2004-06-14 01:30:42 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
t->picker().abort_download(block);
|
2004-01-07 01:48:02 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
std::deque<piece_block>::iterator it
|
|
|
|
= std::find(m_download_queue.begin(), m_download_queue.end(), block);
|
|
|
|
if (it == m_download_queue.end())
|
2004-06-14 01:30:42 +02:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
it = std::find(m_request_queue.begin(), m_request_queue.end(), block);
|
|
|
|
assert(it != m_request_queue.end());
|
|
|
|
if (it == m_request_queue.end()) return;
|
|
|
|
m_request_queue.erase(it);
|
|
|
|
// since we found it in the request queue, it means it hasn't been
|
|
|
|
// sent yet, so we don't have to send a cancel.
|
|
|
|
return;
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
m_download_queue.erase(it);
|
2004-06-14 01:30:42 +02:00
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
int block_offset = block.block_index * t->block_size();
|
|
|
|
int block_size
|
|
|
|
= std::min((int)t->torrent_file().piece_size(block.piece_index)-block_offset,
|
|
|
|
t->block_size());
|
|
|
|
assert(block_size > 0);
|
|
|
|
assert(block_size <= t->block_size());
|
2004-01-08 14:03:38 +01:00
|
|
|
|
|
|
|
peer_request r;
|
|
|
|
r.piece = block.piece_index;
|
|
|
|
r.start = block_offset;
|
|
|
|
r.length = block_size;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
write_cancel(r);
|
2004-01-25 19:18:36 +01:00
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " ==> CANCEL [ piece: " << block.piece_index << " | s: "
|
|
|
|
<< block_offset << " | l: " << block_size << " | " << block.block_index << " ]\n";
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2004-01-12 21:31:27 +01:00
|
|
|
void peer_connection::send_choke()
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
if (m_choked) return;
|
2006-04-25 23:04:48 +02:00
|
|
|
write_choke();
|
2004-01-04 05:29:13 +01:00
|
|
|
m_choked = true;
|
2005-03-19 13:22:40 +01:00
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " ==> CHOKE\n";
|
2005-08-19 01:55:32 +02:00
|
|
|
#endif
|
|
|
|
#ifndef NDEBUG
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_choke = time_now();
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2004-01-12 21:31:27 +01:00
|
|
|
m_num_invalid_requests = 0;
|
2004-01-04 05:29:13 +01:00
|
|
|
m_requests.clear();
|
|
|
|
}
|
|
|
|
|
2004-01-12 21:31:27 +01:00
|
|
|
void peer_connection::send_unchoke()
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2005-08-19 01:55:32 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
// TODO: once the policy lowers the interval for optimistic
|
|
|
|
// unchoke, increase this value that interval
|
|
|
|
// this condition cannot be guaranteed since if peers disconnect
|
|
|
|
// a new one will be unchoked ignoring when it was last choked
|
2007-04-05 00:27:36 +02:00
|
|
|
//assert(time_now() - m_last_choke > seconds(9));
|
2005-08-19 01:55:32 +02:00
|
|
|
#endif
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
if (!m_choked) return;
|
2006-04-25 23:04:48 +02:00
|
|
|
write_unchoke();
|
2004-01-04 05:29:13 +01:00
|
|
|
m_choked = false;
|
2005-03-19 13:22:40 +01:00
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " ==> UNCHOKE\n";
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2004-01-12 21:31:27 +01:00
|
|
|
void peer_connection::send_interested()
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
if (m_interesting) return;
|
2006-04-25 23:04:48 +02:00
|
|
|
write_interested();
|
2004-01-04 05:29:13 +01:00
|
|
|
m_interesting = true;
|
2005-03-19 13:22:40 +01:00
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " ==> INTERESTED\n";
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2004-01-12 21:31:27 +01:00
|
|
|
void peer_connection::send_not_interested()
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
if (!m_interesting) return;
|
2006-04-25 23:04:48 +02:00
|
|
|
write_not_interested();
|
2004-01-04 05:29:13 +01:00
|
|
|
m_interesting = false;
|
2004-02-01 14:48:30 +01:00
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
m_became_uninteresting = time_now();
|
2004-02-01 14:48:30 +01:00
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string() << " ==> NOT_INTERESTED\n";
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::send_block_requests()
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2007-01-01 12:54:31 +01:00
|
|
|
INVARIANT_CHECK;
|
2006-12-27 16:14:17 +01:00
|
|
|
|
|
|
|
if (has_peer_choked()) return;
|
2004-01-25 19:18:36 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
2006-12-27 16:14:17 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(!has_peer_choked());
|
2004-01-08 14:03:38 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if ((int)m_download_queue.size() >= m_desired_queue_size) return;
|
|
|
|
|
|
|
|
while (!m_request_queue.empty()
|
|
|
|
&& (int)m_download_queue.size() < m_desired_queue_size)
|
|
|
|
{
|
|
|
|
piece_block block = m_request_queue.front();
|
|
|
|
|
|
|
|
int block_offset = block.block_index * t->block_size();
|
2006-11-14 01:08:16 +01:00
|
|
|
int block_size = std::min((int)t->torrent_file().piece_size(
|
2006-04-25 23:04:48 +02:00
|
|
|
block.piece_index) - block_offset, t->block_size());
|
|
|
|
assert(block_size > 0);
|
|
|
|
assert(block_size <= t->block_size());
|
|
|
|
|
|
|
|
peer_request r;
|
|
|
|
r.piece = block.piece_index;
|
|
|
|
r.start = block_offset;
|
|
|
|
r.length = block_size;
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
m_request_queue.pop_front();
|
|
|
|
m_download_queue.push_back(block);
|
|
|
|
/*
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-11-14 01:08:16 +01:00
|
|
|
<< " *** REQUEST-QUEUE** [ "
|
|
|
|
"piece: " << block.piece_index << " | "
|
|
|
|
"block: " << block.block_index << " ]\n";
|
|
|
|
#endif
|
|
|
|
*/
|
|
|
|
// if we are requesting large blocks, merge the smaller
|
|
|
|
// blocks that are in the same piece into larger requests
|
|
|
|
if (m_request_large_blocks)
|
|
|
|
{
|
|
|
|
while (!m_request_queue.empty()
|
|
|
|
&& m_request_queue.front().piece_index == r.piece
|
|
|
|
&& m_request_queue.front().block_index == block.block_index + 1)
|
|
|
|
{
|
|
|
|
block = m_request_queue.front();
|
|
|
|
m_request_queue.pop_front();
|
|
|
|
m_download_queue.push_back(block);
|
|
|
|
/*
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-11-14 01:08:16 +01:00
|
|
|
<< " *** REQUEST-QUEUE** [ "
|
|
|
|
"piece: " << block.piece_index << " | "
|
|
|
|
"block: " << block.block_index << " ]\n";
|
|
|
|
#endif
|
|
|
|
*/
|
|
|
|
block_offset = block.block_index * t->block_size();
|
|
|
|
block_size = std::min((int)t->torrent_file().piece_size(
|
|
|
|
block.piece_index) - block_offset, t->block_size());
|
|
|
|
assert(block_size > 0);
|
|
|
|
assert(block_size <= t->block_size());
|
|
|
|
|
|
|
|
r.length += block_size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(verify_piece(r));
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
bool handled = false;
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
if (handled = (*i)->write_request(r)) break;
|
|
|
|
}
|
|
|
|
if (!handled) write_request(r);
|
|
|
|
#else
|
|
|
|
write_request(r);
|
|
|
|
#endif
|
|
|
|
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " ==> REQUEST [ "
|
2006-11-14 01:08:16 +01:00
|
|
|
"piece: " << r.piece << " | "
|
|
|
|
"s: " << r.start << " | "
|
|
|
|
"l: " << r.length << " | "
|
|
|
|
"ds: " << statistics().download_rate() << " B/s | "
|
2006-04-25 23:04:48 +02:00
|
|
|
"qs: " << m_desired_queue_size << " ]\n";
|
|
|
|
#endif
|
|
|
|
}
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_piece = time_now();
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void close_socket_ignore_error(boost::shared_ptr<stream_socket> s)
|
|
|
|
{
|
2006-11-14 01:08:16 +01:00
|
|
|
asio::error_code e;
|
|
|
|
s->close(e);
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::disconnect()
|
|
|
|
{
|
|
|
|
boost::intrusive_ptr<peer_connection> me(this);
|
|
|
|
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
if (m_disconnecting) return;
|
|
|
|
m_disconnecting = true;
|
2006-12-15 18:47:21 +01:00
|
|
|
m_ses.m_io_service.post(boost::bind(&close_socket_ignore_error, m_socket));
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
|
|
|
|
if (t)
|
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
if (t->has_picker())
|
2006-04-25 23:04:48 +02:00
|
|
|
{
|
|
|
|
piece_picker& picker = t->picker();
|
2007-04-12 12:21:55 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
while (!m_download_queue.empty())
|
|
|
|
{
|
|
|
|
picker.abort_download(m_download_queue.back());
|
|
|
|
m_download_queue.pop_back();
|
|
|
|
}
|
|
|
|
while (!m_request_queue.empty())
|
|
|
|
{
|
|
|
|
picker.abort_download(m_request_queue.back());
|
|
|
|
m_request_queue.pop_back();
|
|
|
|
}
|
|
|
|
}
|
2006-12-11 16:43:27 +01:00
|
|
|
|
|
|
|
t->remove_peer(this);
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
m_torrent.reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
m_ses.close_connection(me);
|
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::set_upload_limit(int limit)
|
|
|
|
{
|
|
|
|
assert(limit >= -1);
|
2007-04-03 01:10:11 +02:00
|
|
|
if (limit == -1) limit = resource_request::inf;
|
|
|
|
if (limit < 10) limit = 10;
|
|
|
|
m_upload_limit = limit;
|
2007-04-03 00:25:58 +02:00
|
|
|
m_bandwidth_limit[upload_channel].throttle(m_upload_limit);
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::set_download_limit(int limit)
|
|
|
|
{
|
|
|
|
assert(limit >= -1);
|
2007-04-03 01:10:11 +02:00
|
|
|
if (limit == -1) limit = resource_request::inf;
|
|
|
|
if (limit < 10) limit = 10;
|
|
|
|
m_download_limit = limit;
|
2007-04-03 00:25:58 +02:00
|
|
|
m_bandwidth_limit[download_channel].throttle(m_download_limit);
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-25 19:18:36 +01:00
|
|
|
size_type peer_connection::share_diff() const
|
2004-01-12 04:05:10 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
|
|
|
float ratio = t->ratio();
|
2004-01-12 04:05:10 +01:00
|
|
|
|
|
|
|
// if we have an infinite ratio, just say we have downloaded
|
|
|
|
// much more than we have uploaded. And we'll keep uploading.
|
2004-11-18 23:33:50 +01:00
|
|
|
if (ratio == 0.f)
|
|
|
|
return std::numeric_limits<size_type>::max();
|
2004-01-12 04:05:10 +01:00
|
|
|
|
|
|
|
return m_free_upload
|
2004-01-25 19:18:36 +01:00
|
|
|
+ static_cast<size_type>(m_statistics.total_payload_download() * ratio)
|
2004-01-12 04:05:10 +01:00
|
|
|
- m_statistics.total_payload_upload();
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::cut_receive_buffer(int size, int packet_size)
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
assert(packet_size > 0);
|
2006-04-25 23:04:48 +02:00
|
|
|
assert((int)m_recv_buffer.size() >= size);
|
2007-02-12 06:46:29 +01:00
|
|
|
// TODO: replace with memmov
|
2006-04-25 23:04:48 +02:00
|
|
|
std::copy(m_recv_buffer.begin() + size, m_recv_buffer.begin() + m_recv_pos, m_recv_buffer.begin());
|
|
|
|
|
|
|
|
assert(m_recv_pos >= size);
|
|
|
|
m_recv_pos -= size;
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
std::fill(m_recv_buffer.begin() + m_recv_pos, m_recv_buffer.end(), 0);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
m_packet_size = packet_size;
|
2007-02-12 06:46:29 +01:00
|
|
|
if (m_packet_size >= m_recv_pos) m_recv_buffer.resize(m_packet_size);
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::second_tick(float tick_interval)
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
ptime now(time_now());
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
|
|
|
on_tick();
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
|
|
for (extension_list_t::iterator i = m_extensions.begin()
|
|
|
|
, end(m_extensions.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
(*i)->tick();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2007-02-25 06:20:14 +01:00
|
|
|
m_statistics.second_tick(tick_interval);
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!t->valid_metadata()) return;
|
|
|
|
|
|
|
|
// calculate the desired download queue size
|
2006-10-11 16:02:21 +02:00
|
|
|
const float queue_time = m_ses.settings().request_queue_time;
|
2006-04-25 23:04:48 +02:00
|
|
|
// (if the latency is more than this, the download will stall)
|
|
|
|
// so, the queue size is queue_time * down_rate / 16 kiB
|
|
|
|
// (16 kB is the size of each request)
|
|
|
|
// the minimum number of requests is 2 and the maximum is 48
|
|
|
|
// the block size doesn't have to be 16. So we first query the
|
|
|
|
// torrent for it
|
2006-11-14 01:08:16 +01:00
|
|
|
const int block_size = m_request_large_blocks
|
|
|
|
? t->torrent_file().piece_length() : t->block_size();
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(block_size > 0);
|
2005-09-21 23:44:38 +02:00
|
|
|
|
2006-04-27 02:39:21 +02:00
|
|
|
m_desired_queue_size = static_cast<int>(queue_time
|
2006-04-25 23:04:48 +02:00
|
|
|
* statistics().download_rate() / block_size);
|
2006-05-15 00:30:05 +02:00
|
|
|
if (m_desired_queue_size > m_max_out_request_queue)
|
|
|
|
m_desired_queue_size = m_max_out_request_queue;
|
|
|
|
if (m_desired_queue_size < min_request_queue)
|
|
|
|
m_desired_queue_size = min_request_queue;
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2005-09-21 23:44:38 +02:00
|
|
|
if (!m_download_queue.empty()
|
2006-10-11 16:02:21 +02:00
|
|
|
&& now - m_last_piece > seconds(m_ses.settings().piece_timeout))
|
2005-09-21 23:44:38 +02:00
|
|
|
{
|
|
|
|
// this peer isn't sending the pieces we've
|
|
|
|
// requested (this has been observed by BitComet)
|
|
|
|
// in this case we'll clear our download queue and
|
|
|
|
// re-request the blocks.
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " *** PIECE_REQUESTS TIMED OUT [ " << (int)m_download_queue.size()
|
2007-04-05 00:27:36 +02:00
|
|
|
<< " " << total_seconds(now - m_last_piece) << "] ***\n";
|
2005-09-21 23:44:38 +02:00
|
|
|
#endif
|
|
|
|
|
2007-02-12 10:20:49 +01:00
|
|
|
if (t->is_seed())
|
2005-09-21 23:44:38 +02:00
|
|
|
{
|
2007-02-12 10:20:49 +01:00
|
|
|
m_download_queue.clear();
|
|
|
|
m_request_queue.clear();
|
2005-09-21 23:44:38 +02:00
|
|
|
}
|
2007-02-12 10:20:49 +01:00
|
|
|
else
|
2005-09-27 10:07:24 +02:00
|
|
|
{
|
2007-02-12 10:20:49 +01:00
|
|
|
piece_picker& picker = t->picker();
|
|
|
|
while (!m_download_queue.empty())
|
|
|
|
{
|
|
|
|
picker.abort_download(m_download_queue.back());
|
|
|
|
m_download_queue.pop_back();
|
|
|
|
}
|
|
|
|
while (!m_request_queue.empty())
|
|
|
|
{
|
|
|
|
picker.abort_download(m_request_queue.back());
|
|
|
|
m_request_queue.pop_back();
|
|
|
|
}
|
2005-09-27 10:07:24 +02:00
|
|
|
|
2007-02-12 10:20:49 +01:00
|
|
|
// TODO: If we have a limited number of upload
|
|
|
|
// slots, choke this peer
|
|
|
|
|
|
|
|
m_assume_fifo = true;
|
2005-09-21 23:44:38 +02:00
|
|
|
|
2007-02-12 10:20:49 +01:00
|
|
|
request_a_block(*t, *this);
|
|
|
|
send_block_requests();
|
|
|
|
}
|
2004-08-08 23:26:40 +02:00
|
|
|
}
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
// If the client sends more data
|
|
|
|
// we send it data faster, otherwise, slower.
|
|
|
|
// It will also depend on how much data the
|
|
|
|
// client has sent us. This is the mean to
|
2004-01-14 13:53:17 +01:00
|
|
|
// maintain the share ratio given by m_ratio
|
|
|
|
// with all peers.
|
2004-03-07 21:50:56 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->is_seed() || is_choked() || t->ratio() == 0.0f)
|
2004-02-23 23:54:54 +01:00
|
|
|
{
|
|
|
|
// if we have downloaded more than one piece more
|
|
|
|
// than we have uploaded OR if we are a seed
|
|
|
|
// have an unlimited upload rate
|
2007-04-03 00:25:58 +02:00
|
|
|
m_bandwidth_limit[upload_channel].throttle(m_upload_limit);
|
2004-02-23 23:54:54 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-11-20 22:03:58 +01:00
|
|
|
size_type bias = 0x10000 + 2 * t->block_size() + m_free_upload;
|
2004-02-23 23:54:54 +01:00
|
|
|
|
2004-03-07 21:50:56 +01:00
|
|
|
double break_even_time = 15; // seconds.
|
|
|
|
size_type have_uploaded = m_statistics.total_payload_upload();
|
|
|
|
size_type have_downloaded = m_statistics.total_payload_download();
|
2004-02-23 23:54:54 +01:00
|
|
|
double download_speed = m_statistics.download_rate();
|
|
|
|
|
2004-03-07 21:50:56 +01:00
|
|
|
size_type soon_downloaded =
|
|
|
|
have_downloaded + (size_type)(download_speed * break_even_time*1.5);
|
|
|
|
|
2006-12-04 21:42:47 +01:00
|
|
|
if (t->ratio() != 1.f)
|
2006-04-25 23:04:48 +02:00
|
|
|
soon_downloaded = (size_type)(soon_downloaded*(double)t->ratio());
|
2004-03-07 21:50:56 +01:00
|
|
|
|
2007-04-03 00:25:58 +02:00
|
|
|
double upload_speed_limit = std::min((soon_downloaded - have_uploaded
|
|
|
|
+ bias) / break_even_time, double(m_upload_limit));
|
2004-02-23 23:54:54 +01:00
|
|
|
|
2004-03-27 23:02:31 +01:00
|
|
|
upload_speed_limit = std::min(upload_speed_limit,
|
|
|
|
(double)std::numeric_limits<int>::max());
|
2004-02-23 23:54:54 +01:00
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
m_bandwidth_limit[upload_channel].throttle(
|
|
|
|
std::min(std::max((int)upload_speed_limit, 20)
|
|
|
|
, m_upload_limit));
|
2004-02-23 23:54:54 +01:00
|
|
|
}
|
2006-12-04 21:42:47 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
fill_send_buffer();
|
2004-03-07 21:50:56 +01:00
|
|
|
/*
|
2004-01-25 19:18:36 +01:00
|
|
|
size_type diff = share_diff();
|
2003-12-07 06:53:04 +01:00
|
|
|
|
2004-02-24 13:45:05 +01:00
|
|
|
enum { block_limit = 2 }; // how many blocks difference is considered unfair
|
2004-01-14 12:46:26 +01:00
|
|
|
|
2004-02-24 13:45:05 +01:00
|
|
|
// if the peer has been choked, send the current piece
|
2004-02-23 23:54:54 +01:00
|
|
|
// as fast as possible
|
|
|
|
if (diff > block_limit*m_torrent->block_size() || m_torrent->is_seed() || is_choked())
|
2003-12-09 19:09:34 +01:00
|
|
|
{
|
2004-01-04 05:29:13 +01:00
|
|
|
// if we have downloaded more than one piece more
|
2004-01-05 00:51:54 +01:00
|
|
|
// than we have uploaded OR if we are a seed
|
|
|
|
// have an unlimited upload rate
|
2004-03-28 19:45:37 +02:00
|
|
|
m_ul_bandwidth_quota.wanted = std::numeric_limits<int>::max();
|
2003-12-09 19:09:34 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2004-01-12 04:05:10 +01:00
|
|
|
float ratio = m_torrent->ratio();
|
2004-01-04 05:29:13 +01:00
|
|
|
// if we have downloaded too much, response with an
|
|
|
|
// upload rate of 10 kB/s more than we dowlload
|
|
|
|
// if we have uploaded too much, send with a rate of
|
|
|
|
// 10 kB/s less than we receive
|
|
|
|
int bias = 0;
|
2004-01-14 13:19:51 +01:00
|
|
|
if (diff > -block_limit*m_torrent->block_size())
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2004-01-12 21:31:27 +01:00
|
|
|
bias = static_cast<int>(m_statistics.download_rate() * ratio) / 2;
|
2004-01-04 05:29:13 +01:00
|
|
|
if (bias < 10*1024) bias = 10*1024;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2004-01-12 21:31:27 +01:00
|
|
|
bias = -static_cast<int>(m_statistics.download_rate() * ratio) / 2;
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2004-03-28 19:45:37 +02:00
|
|
|
m_ul_bandwidth_quota.wanted = static_cast<int>(m_statistics.download_rate()) + bias;
|
2004-01-12 04:05:10 +01:00
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
// the maximum send_quota given our download rate from this peer
|
2004-03-28 19:45:37 +02:00
|
|
|
if (m_ul_bandwidth_quota.wanted < 256) m_ul_bandwidth_quota.wanted = 256;
|
2003-12-09 19:09:34 +01:00
|
|
|
}
|
2004-03-07 21:50:56 +01:00
|
|
|
*/
|
2003-12-08 02:37:30 +01:00
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::fill_send_buffer()
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
if (!t) return;
|
2005-03-12 13:18:07 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// only add new piece-chunks if the send buffer is small enough
|
|
|
|
// otherwise there will be no end to how large it will be!
|
|
|
|
// TODO: the buffer size should probably be dependent on the transfer speed
|
|
|
|
while (!m_requests.empty()
|
|
|
|
&& (send_buffer_size() < t->block_size() * 6)
|
|
|
|
&& !m_choked)
|
2003-10-30 00:28:09 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(t->valid_metadata());
|
|
|
|
peer_request& r = m_requests.front();
|
|
|
|
|
|
|
|
assert(r.piece >= 0);
|
|
|
|
assert(r.piece < (int)m_have_piece.size());
|
|
|
|
assert(t->have_piece(r.piece));
|
|
|
|
assert(r.start + r.length <= t->torrent_file().piece_size(r.piece));
|
|
|
|
assert(r.length > 0 && r.start >= 0);
|
|
|
|
|
|
|
|
write_piece(r);
|
|
|
|
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2007-04-10 09:52:58 +02:00
|
|
|
(*m_logger) << time_now_string()
|
2006-04-25 23:04:48 +02:00
|
|
|
<< " ==> PIECE [ piece: " << r.piece << " | s: " << r.start
|
|
|
|
<< " | l: " << r.length << " ]\n";
|
|
|
|
#endif
|
|
|
|
|
|
|
|
m_requests.erase(m_requests.begin());
|
|
|
|
|
|
|
|
if (m_requests.empty()
|
|
|
|
&& m_num_invalid_requests > 0
|
|
|
|
&& is_peer_interested()
|
|
|
|
&& !is_seed())
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
// this will make the peer clear
|
|
|
|
// its download queue and re-request
|
|
|
|
// pieces. Hopefully it will not
|
|
|
|
// send invalid requests then
|
|
|
|
send_choke();
|
|
|
|
send_unchoke();
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
}
|
2003-10-30 00:28:09 +01:00
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
void peer_connection::assign_bandwidth(int channel, int amount)
|
|
|
|
{
|
2007-01-30 18:56:42 +01:00
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << "bandwidth [ " << channel << " ] + " << amount << "\n";
|
|
|
|
#endif
|
|
|
|
|
|
|
|
m_bandwidth_limit[channel].assign(amount);
|
|
|
|
if (channel == upload_channel)
|
|
|
|
{
|
|
|
|
m_writing = false;
|
|
|
|
setup_send();
|
|
|
|
}
|
|
|
|
else if (channel == download_channel)
|
|
|
|
{
|
|
|
|
m_reading = false;
|
|
|
|
setup_receive();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::expire_bandwidth(int channel, int amount)
|
|
|
|
{
|
2007-01-30 18:56:42 +01:00
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
m_bandwidth_limit[channel].expire(amount);
|
|
|
|
if (channel == upload_channel)
|
|
|
|
{
|
|
|
|
setup_send();
|
|
|
|
}
|
|
|
|
else if (channel == download_channel)
|
|
|
|
{
|
|
|
|
setup_receive();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::setup_send()
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (m_writing) return;
|
2007-01-10 16:02:25 +01:00
|
|
|
|
|
|
|
shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
|
|
|
|
if (m_bandwidth_limit[upload_channel].quota_left() == 0
|
|
|
|
&& (!m_send_buffer[m_current_send_buffer].empty()
|
|
|
|
|| !m_send_buffer[(m_current_send_buffer + 1) & 1].empty())
|
|
|
|
&& !m_connecting
|
|
|
|
&& t)
|
|
|
|
{
|
|
|
|
// in this case, we have data to send, but no
|
|
|
|
// bandwidth. So, we simply request bandwidth
|
|
|
|
// from the torrent
|
|
|
|
assert(t);
|
|
|
|
if (m_bandwidth_limit[upload_channel].max_assignable() > 0)
|
|
|
|
{
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << "req bandwidth [ " << upload_channel << " ]\n";
|
|
|
|
#endif
|
|
|
|
|
2007-03-28 21:11:30 +02:00
|
|
|
// peers that we are not interested in are non-prioritized
|
|
|
|
t->request_bandwidth(upload_channel, self()
|
|
|
|
, !(is_interesting() && !has_peer_choked()));
|
2007-01-10 16:02:25 +01:00
|
|
|
m_writing = true;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!can_write()) return;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(!m_writing);
|
2003-11-09 19:17:09 +01:00
|
|
|
|
2006-04-30 02:39:18 +02:00
|
|
|
int sending_buffer = (m_current_send_buffer + 1) & 1;
|
|
|
|
if (m_send_buffer[sending_buffer].empty())
|
|
|
|
{
|
2007-02-12 06:46:29 +01:00
|
|
|
// this means we have to swap buffer, because there's no
|
2006-04-30 02:39:18 +02:00
|
|
|
// previous buffer we're still waiting for.
|
|
|
|
std::swap(m_current_send_buffer, sending_buffer);
|
|
|
|
m_write_pos = 0;
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
// send the actual buffer
|
2006-04-30 02:39:18 +02:00
|
|
|
if (!m_send_buffer[sending_buffer].empty())
|
2006-04-25 23:04:48 +02:00
|
|
|
{
|
|
|
|
int amount_to_send
|
2007-01-10 16:02:25 +01:00
|
|
|
= std::min(m_bandwidth_limit[upload_channel].quota_left()
|
2006-04-30 02:39:18 +02:00
|
|
|
, (int)m_send_buffer[sending_buffer].size() - m_write_pos);
|
2003-10-30 00:28:09 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(amount_to_send > 0);
|
2006-04-30 02:39:18 +02:00
|
|
|
|
|
|
|
assert(m_write_pos < (int)m_send_buffer[sending_buffer].size());
|
|
|
|
m_socket->async_write_some(asio::buffer(
|
|
|
|
&m_send_buffer[sending_buffer][m_write_pos], amount_to_send)
|
|
|
|
, bind(&peer_connection::on_send_data, self(), _1, _2));
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
m_writing = true;
|
|
|
|
}
|
|
|
|
}
|
2003-12-22 08:14:35 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
void peer_connection::setup_receive()
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
2003-12-08 22:59:48 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (m_reading) return;
|
2007-01-10 16:02:25 +01:00
|
|
|
|
|
|
|
shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
|
|
|
|
if (m_bandwidth_limit[download_channel].quota_left() == 0
|
|
|
|
&& !m_connecting
|
|
|
|
&& t)
|
|
|
|
{
|
|
|
|
assert(t);
|
|
|
|
if (m_bandwidth_limit[download_channel].max_assignable() > 0)
|
|
|
|
{
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
|
|
(*m_logger) << "req bandwidth [ " << download_channel << " ]\n";
|
|
|
|
#endif
|
2007-02-01 08:33:04 +01:00
|
|
|
t->request_bandwidth(download_channel, self(), m_non_prioritized);
|
2007-01-10 16:02:25 +01:00
|
|
|
m_reading = true;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!can_read()) return;
|
|
|
|
|
|
|
|
assert(m_packet_size > 0);
|
|
|
|
int max_receive = std::min(
|
2007-01-10 16:02:25 +01:00
|
|
|
m_bandwidth_limit[download_channel].quota_left()
|
2006-04-25 23:04:48 +02:00
|
|
|
, m_packet_size - m_recv_pos);
|
2007-01-10 16:02:25 +01:00
|
|
|
assert(max_receive > 0);
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
assert(m_recv_pos >= 0);
|
|
|
|
assert(m_packet_size > 0);
|
|
|
|
assert(max_receive > 0);
|
|
|
|
|
|
|
|
assert(can_read());
|
|
|
|
m_socket->async_read_some(asio::buffer(&m_recv_buffer[m_recv_pos]
|
|
|
|
, max_receive), bind(&peer_connection::on_receive_data, self(), _1, _2));
|
|
|
|
m_reading = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::reset_recv_buffer(int packet_size)
|
|
|
|
{
|
|
|
|
assert(packet_size > 0);
|
2007-02-12 06:46:29 +01:00
|
|
|
if (m_recv_pos > m_packet_size)
|
|
|
|
{
|
|
|
|
cut_receive_buffer(m_packet_size, packet_size);
|
|
|
|
return;
|
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
m_recv_pos = 0;
|
|
|
|
m_packet_size = packet_size;
|
2006-05-28 21:03:54 +02:00
|
|
|
if (int(m_recv_buffer.size()) < m_packet_size)
|
|
|
|
m_recv_buffer.resize(m_packet_size);
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void peer_connection::send_buffer(char const* begin, char const* end)
|
|
|
|
{
|
2006-05-02 01:34:37 +02:00
|
|
|
std::vector<char>& buf = m_send_buffer[m_current_send_buffer];
|
|
|
|
buf.insert(buf.end(), begin, end);
|
2006-04-25 23:04:48 +02:00
|
|
|
setup_send();
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: change this interface to automatically call setup_send() when the
|
|
|
|
// return value is destructed
|
|
|
|
buffer::interval peer_connection::allocate_send_buffer(int size)
|
|
|
|
{
|
2006-05-02 01:34:37 +02:00
|
|
|
std::vector<char>& buf = m_send_buffer[m_current_send_buffer];
|
|
|
|
buf.resize(buf.size() + size);
|
|
|
|
buffer::interval ret(&buf[0] + buf.size() - size, &buf[0] + buf.size());
|
2006-04-30 02:39:18 +02:00
|
|
|
return ret;
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class T>
|
|
|
|
struct set_to_zero
|
|
|
|
{
|
|
|
|
set_to_zero(T& v, bool cond): m_val(v), m_cond(cond) {}
|
|
|
|
void fire() { if (!m_cond) return; m_cond = false; m_val = 0; }
|
|
|
|
~set_to_zero() { if (m_cond) m_val = 0; }
|
|
|
|
private:
|
|
|
|
T& m_val;
|
|
|
|
bool m_cond;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// --------------------------
|
|
|
|
// RECEIVE DATA
|
|
|
|
// --------------------------
|
|
|
|
|
|
|
|
// throws exception when the client should be disconnected
|
2006-11-14 01:08:16 +01:00
|
|
|
void peer_connection::on_receive_data(const asio::error_code& error
|
2006-04-25 23:04:48 +02:00
|
|
|
, std::size_t bytes_transferred) try
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
assert(m_reading);
|
|
|
|
m_reading = false;
|
|
|
|
// correct the dl quota usage, if not all of the buffer was actually read
|
2007-01-10 16:02:25 +01:00
|
|
|
m_bandwidth_limit[download_channel].use_quota(bytes_transferred);
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
if (error)
|
|
|
|
{
|
2005-03-19 13:22:40 +01:00
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2006-11-14 01:08:16 +01:00
|
|
|
(*m_logger) << "**ERROR**: " << error.message() << "\n";
|
2005-03-19 13:22:40 +01:00
|
|
|
#endif
|
2006-04-25 23:04:48 +02:00
|
|
|
on_receive(error, bytes_transferred);
|
2006-11-14 01:08:16 +01:00
|
|
|
throw std::runtime_error(error.message());
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
2004-03-28 19:45:37 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (m_disconnecting) return;
|
|
|
|
|
|
|
|
assert(m_packet_size > 0);
|
|
|
|
assert(bytes_transferred > 0);
|
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_receive = time_now();
|
2006-04-25 23:04:48 +02:00
|
|
|
m_recv_pos += bytes_transferred;
|
2007-02-12 06:46:29 +01:00
|
|
|
assert(m_recv_pos <= int(m_recv_buffer.size()));
|
2006-04-25 23:04:48 +02:00
|
|
|
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
on_receive(error, bytes_transferred);
|
2003-10-23 01:00:57 +02:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
assert(m_packet_size > 0);
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
setup_receive();
|
|
|
|
}
|
2006-07-08 21:41:39 +02:00
|
|
|
catch (file_error& e)
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
if (!t)
|
|
|
|
{
|
|
|
|
m_ses.connection_failed(m_socket, remote(), e.what());
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (t->alerts().should_post(alert::fatal))
|
|
|
|
{
|
|
|
|
t->alerts().post_alert(
|
|
|
|
file_error_alert(t->get_handle()
|
|
|
|
, std::string("torrent paused: ") + e.what()));
|
|
|
|
}
|
|
|
|
t->pause();
|
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
catch (std::exception& e)
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), e.what());
|
|
|
|
}
|
|
|
|
catch (...)
|
|
|
|
{
|
|
|
|
// all exceptions should derive from std::exception
|
|
|
|
assert(false);
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), "connection failed for unkown reason");
|
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-03-28 19:45:37 +02:00
|
|
|
bool peer_connection::can_write() const
|
2004-01-04 05:29:13 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
// if we have requests or pending data to be sent or announcements to be made
|
|
|
|
// we want to send data
|
2006-05-15 00:30:05 +02:00
|
|
|
return (!m_send_buffer[m_current_send_buffer].empty()
|
2006-04-30 12:28:45 +02:00
|
|
|
|| !m_send_buffer[(m_current_send_buffer + 1) & 1].empty())
|
2007-01-10 16:02:25 +01:00
|
|
|
&& m_bandwidth_limit[upload_channel].quota_left() > 0
|
2006-04-25 23:04:48 +02:00
|
|
|
&& !m_connecting;
|
2004-03-28 19:45:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool peer_connection::can_read() const
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-01-10 16:02:25 +01:00
|
|
|
return m_bandwidth_limit[download_channel].quota_left() > 0
|
|
|
|
&& !m_connecting;
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
|
|
|
|
2005-11-02 17:28:39 +01:00
|
|
|
void peer_connection::connect()
|
|
|
|
{
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
2006-04-25 23:04:48 +02:00
|
|
|
(*m_ses.m_logger) << "CONNECTING: " << m_remote.address().to_string() << "\n";
|
2005-11-02 17:28:39 +01:00
|
|
|
#endif
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
|
|
assert(t);
|
|
|
|
|
2005-11-02 17:28:39 +01:00
|
|
|
m_queued = false;
|
|
|
|
assert(m_connecting);
|
2007-02-27 18:21:46 +01:00
|
|
|
m_socket->open(t->get_interface().protocol());
|
2006-04-25 23:04:48 +02:00
|
|
|
m_socket->bind(t->get_interface());
|
2007-02-12 06:46:29 +01:00
|
|
|
if (m_remote_proxy != tcp::endpoint())
|
|
|
|
{
|
|
|
|
m_socket->async_connect(m_remote_proxy
|
|
|
|
, bind(&peer_connection::on_connection_complete, self(), _1));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_socket->async_connect(m_remote
|
|
|
|
, bind(&peer_connection::on_connection_complete, self(), _1));
|
|
|
|
}
|
2005-11-02 17:28:39 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->alerts().should_post(alert::debug))
|
2005-11-02 17:28:39 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
t->alerts().post_alert(peer_error_alert(
|
2005-11-02 17:28:39 +01:00
|
|
|
m_remote, m_peer_id, "connecting to peer"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-11-14 01:08:16 +01:00
|
|
|
void peer_connection::on_connection_complete(asio::error_code const& e) try
|
2005-11-02 17:28:39 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
|
2005-11-02 17:28:39 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (e)
|
|
|
|
{
|
2005-11-02 17:28:39 +01:00
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
2006-11-15 22:39:58 +01:00
|
|
|
(*m_ses.m_logger) << "CONNECTION FAILED: " << m_remote.address().to_string()
|
|
|
|
<< ": " << e.message() << "\n";
|
2005-11-02 17:28:39 +01:00
|
|
|
#endif
|
2006-11-14 01:08:16 +01:00
|
|
|
m_ses.connection_failed(m_socket, m_remote, e.message().c_str());
|
2006-04-25 23:04:48 +02:00
|
|
|
return;
|
|
|
|
}
|
2005-11-02 17:28:39 +01:00
|
|
|
|
2006-05-29 19:50:57 +02:00
|
|
|
if (m_disconnecting) return;
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_receive = time_now();
|
2006-05-28 21:03:54 +02:00
|
|
|
|
2005-11-02 17:28:39 +01:00
|
|
|
// this means the connection just succeeded
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
|
|
|
(*m_ses.m_logger) << "COMPLETED: " << m_remote.address().to_string() << "\n";
|
|
|
|
#endif
|
|
|
|
|
|
|
|
m_ses.connection_completed(self());
|
2006-11-20 22:03:58 +01:00
|
|
|
m_connecting = false;
|
2006-04-25 23:04:48 +02:00
|
|
|
on_connected();
|
2006-05-02 01:34:37 +02:00
|
|
|
setup_send();
|
2007-01-10 16:02:25 +01:00
|
|
|
setup_receive();
|
2006-04-25 23:04:48 +02:00
|
|
|
}
|
|
|
|
catch (std::exception& ex)
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), ex.what());
|
|
|
|
}
|
|
|
|
catch (...)
|
|
|
|
{
|
|
|
|
// all exceptions should derive from std::exception
|
|
|
|
assert(false);
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), "connection failed for unkown reason");
|
2005-11-02 17:28:39 +01:00
|
|
|
}
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
// --------------------------
|
|
|
|
// SEND DATA
|
|
|
|
// --------------------------
|
|
|
|
|
|
|
|
// throws exception when the client should be disconnected
|
2006-11-14 01:08:16 +01:00
|
|
|
void peer_connection::on_send_data(asio::error_code const& error
|
2006-04-25 23:04:48 +02:00
|
|
|
, std::size_t bytes_transferred) try
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
2004-01-25 19:18:36 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(m_writing);
|
|
|
|
m_writing = false;
|
2007-01-10 16:02:25 +01:00
|
|
|
|
|
|
|
m_bandwidth_limit[upload_channel].use_quota(bytes_transferred);
|
2006-04-30 02:39:18 +02:00
|
|
|
m_write_pos += bytes_transferred;
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (error)
|
2006-05-29 19:50:57 +02:00
|
|
|
{
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
2006-11-14 01:08:16 +01:00
|
|
|
(*m_logger) << "**ERROR**: " << error.message() << "\n";
|
2006-05-29 19:50:57 +02:00
|
|
|
#endif
|
2006-11-14 01:08:16 +01:00
|
|
|
throw std::runtime_error(error.message());
|
2006-05-29 19:50:57 +02:00
|
|
|
}
|
2006-04-25 23:04:48 +02:00
|
|
|
if (m_disconnecting) return;
|
2005-09-14 21:33:16 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(!m_connecting);
|
2006-04-30 02:39:18 +02:00
|
|
|
assert(bytes_transferred > 0);
|
2004-01-04 05:29:13 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
int sending_buffer = (m_current_send_buffer + 1) & 1;
|
2006-04-30 02:39:18 +02:00
|
|
|
|
|
|
|
assert(int(m_send_buffer[sending_buffer].size()) >= m_write_pos);
|
|
|
|
if (int(m_send_buffer[sending_buffer].size()) == m_write_pos)
|
|
|
|
{
|
|
|
|
m_send_buffer[sending_buffer].clear();
|
|
|
|
m_write_pos = 0;
|
|
|
|
}
|
2004-01-12 21:31:27 +01:00
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
m_last_sent = time_now();
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
on_sent(error, bytes_transferred);
|
|
|
|
fill_send_buffer();
|
|
|
|
setup_send();
|
|
|
|
}
|
|
|
|
catch (std::exception& e)
|
|
|
|
{
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), e.what());
|
|
|
|
}
|
|
|
|
catch (...)
|
|
|
|
{
|
|
|
|
// all exceptions should derive from std::exception
|
|
|
|
assert(false);
|
|
|
|
session_impl::mutex_t::scoped_lock l(m_ses.m_mutex);
|
|
|
|
m_ses.connection_failed(m_socket, remote(), "connection failed for unkown reason");
|
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-01-17 21:04:19 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
void peer_connection::check_invariant() const
|
|
|
|
{
|
2007-04-12 12:21:55 +02:00
|
|
|
if (m_peer_info)
|
|
|
|
assert(m_peer_info->connection == this
|
|
|
|
|| m_peer_info->connection == 0);
|
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
2006-05-28 21:03:54 +02:00
|
|
|
if (!t)
|
|
|
|
{
|
2006-10-11 16:02:21 +02:00
|
|
|
typedef session_impl::torrent_map torrent_map;
|
2006-05-28 21:03:54 +02:00
|
|
|
torrent_map& m = m_ses.m_torrents;
|
|
|
|
for (torrent_map::iterator i = m.begin(), end(m.end()); i != end; ++i)
|
|
|
|
{
|
|
|
|
torrent& t = *i->second;
|
|
|
|
assert(t.connection_for(m_remote) != this);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (!m_in_constructor && t->connection_for(remote()) != this)
|
|
|
|
{
|
|
|
|
assert(false);
|
|
|
|
}
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2006-12-30 00:40:56 +01:00
|
|
|
// expensive when using checked iterators
|
|
|
|
/*
|
2006-04-25 23:04:48 +02:00
|
|
|
if (t->valid_metadata())
|
|
|
|
{
|
|
|
|
int piece_count = std::count(m_have_piece.begin()
|
|
|
|
, m_have_piece.end(), true);
|
|
|
|
if (m_num_pieces != piece_count)
|
2003-11-05 00:27:06 +01:00
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
assert(false);
|
2003-11-05 00:27:06 +01:00
|
|
|
}
|
2004-01-04 05:29:13 +01:00
|
|
|
}
|
2006-12-30 00:40:56 +01:00
|
|
|
*/
|
2006-04-30 12:28:45 +02:00
|
|
|
assert(m_write_pos <= int(m_send_buffer[
|
|
|
|
(m_current_send_buffer + 1) & 1].size()));
|
2006-12-16 04:34:56 +01:00
|
|
|
|
2006-12-18 02:24:35 +01:00
|
|
|
// extremely expensive invariant check
|
|
|
|
/*
|
2006-12-16 04:34:56 +01:00
|
|
|
if (!t->is_seed())
|
|
|
|
{
|
|
|
|
piece_picker& p = t->picker();
|
|
|
|
const std::vector<piece_picker::downloading_piece>& dlq = p.get_download_queue();
|
|
|
|
const int blocks_per_piece = static_cast<int>(
|
|
|
|
t->torrent_file().piece_length() / t->block_size());
|
|
|
|
|
|
|
|
for (std::vector<piece_picker::downloading_piece>::const_iterator i =
|
|
|
|
dlq.begin(); i != dlq.end(); ++i)
|
|
|
|
{
|
|
|
|
for (int j = 0; j < blocks_per_piece; ++j)
|
|
|
|
{
|
|
|
|
if (std::find(m_request_queue.begin(), m_request_queue.end()
|
|
|
|
, piece_block(i->index, j)) != m_request_queue.end()
|
|
|
|
||
|
|
|
|
std::find(m_download_queue.begin(), m_download_queue.end()
|
|
|
|
, piece_block(i->index, j)) != m_download_queue.end())
|
|
|
|
{
|
|
|
|
assert(i->info[j].peer == m_remote);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-12-16 04:55:20 +01:00
|
|
|
assert(i->info[j].peer != m_remote || i->finished_blocks[j]);
|
2006-12-16 04:34:56 +01:00
|
|
|
}
|
2006-12-16 04:36:33 +01:00
|
|
|
}
|
2006-12-16 04:34:56 +01:00
|
|
|
}
|
|
|
|
}
|
2006-12-18 02:24:35 +01:00
|
|
|
*/
|
2003-11-05 00:27:06 +01:00
|
|
|
}
|
2004-01-25 19:18:36 +01:00
|
|
|
#endif
|
2003-10-23 01:00:57 +02:00
|
|
|
|
2004-02-01 14:48:30 +01:00
|
|
|
bool peer_connection::has_timed_out() const
|
|
|
|
{
|
2006-06-29 01:27:44 +02:00
|
|
|
// TODO: the timeout should be called by an event
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-02-12 06:46:29 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
// allow step debugging without timing out
|
|
|
|
return false;
|
|
|
|
#endif
|
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
ptime now(time_now());
|
2005-09-21 23:44:38 +02:00
|
|
|
|
2005-04-03 17:44:17 +02:00
|
|
|
// if the socket is still connecting, don't
|
|
|
|
// consider it timed out. Because Windows XP SP2
|
|
|
|
// may delay connection attempts.
|
|
|
|
if (m_connecting) return false;
|
|
|
|
|
2004-02-01 14:48:30 +01:00
|
|
|
// if the peer hasn't said a thing for a certain
|
|
|
|
// time, it is considered to have timed out
|
|
|
|
time_duration d;
|
2007-04-05 00:27:36 +02:00
|
|
|
d = time_now() - m_last_receive;
|
2004-02-01 14:48:30 +01:00
|
|
|
if (d > seconds(m_timeout)) return true;
|
2005-09-21 23:44:38 +02:00
|
|
|
|
2004-02-01 14:48:30 +01:00
|
|
|
// if the peer hasn't become interested and we haven't
|
2005-09-21 23:44:38 +02:00
|
|
|
// become interested in the peer for 10 minutes, it
|
2004-02-01 14:48:30 +01:00
|
|
|
// has also timed out.
|
|
|
|
time_duration d1;
|
|
|
|
time_duration d2;
|
2005-09-21 23:44:38 +02:00
|
|
|
d1 = now - m_became_uninterested;
|
|
|
|
d2 = now - m_became_uninteresting;
|
2006-04-25 23:04:48 +02:00
|
|
|
// TODO: these timeouts should be user settable
|
2004-02-01 14:48:30 +01:00
|
|
|
if (!m_interesting
|
|
|
|
&& !m_peer_interested
|
2005-09-21 23:44:38 +02:00
|
|
|
&& d1 > minutes(10)
|
|
|
|
&& d2 > minutes(10))
|
2004-02-01 14:48:30 +01:00
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
2005-09-21 23:44:38 +02:00
|
|
|
|
2004-02-01 14:48:30 +01:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-01-04 05:29:13 +01:00
|
|
|
void peer_connection::keep_alive()
|
2003-10-23 01:00:57 +02:00
|
|
|
{
|
2004-01-25 19:18:36 +01:00
|
|
|
INVARIANT_CHECK;
|
|
|
|
|
2007-04-05 00:27:36 +02:00
|
|
|
time_duration d;
|
|
|
|
d = time_now() - m_last_sent;
|
|
|
|
if (total_seconds(d) < m_timeout / 2) return;
|
2004-01-24 18:14:03 +01:00
|
|
|
|
2006-04-25 23:04:48 +02:00
|
|
|
if (m_connecting) return;
|
|
|
|
|
|
|
|
write_keepalive();
|
2003-10-23 01:00:57 +02:00
|
|
|
}
|
2004-01-12 21:31:27 +01:00
|
|
|
|
|
|
|
bool peer_connection::is_seed() const
|
|
|
|
{
|
2006-04-25 23:04:48 +02:00
|
|
|
INVARIANT_CHECK;
|
2004-10-18 00:23:08 +02:00
|
|
|
// if m_num_pieces == 0, we probably doesn't have the
|
|
|
|
// metadata yet.
|
|
|
|
return m_num_pieces == (int)m_have_piece.size() && m_num_pieces > 0;
|
2004-01-12 21:31:27 +01:00
|
|
|
}
|
2004-01-04 06:53:01 +01:00
|
|
|
}
|
2005-03-19 13:22:40 +01:00
|
|
|
|