3468 lines
135 KiB
HTML
3468 lines
135 KiB
HTML
<html><head>
|
|
<script type="text/javascript">
|
|
/* <![CDATA[ */
|
|
var expanded = -1
|
|
function expand(id) {
|
|
if (expanded != -1) {
|
|
var ctx = document.getElementById(expanded);
|
|
ctx.style.display = "none";
|
|
// if we're expanding the field that's already
|
|
// expanded, just collapse it
|
|
var no_expand = id == expanded;
|
|
expanded = -1;
|
|
if (no_expand) return;
|
|
}
|
|
var ctx = document.getElementById(id);
|
|
ctx.style.display = "table-row";
|
|
expanded = id;
|
|
}
|
|
/* ]]> */
|
|
</script>
|
|
|
|
</head><body>
|
|
<h1>libtorrent todo-list</h1>
|
|
<span style="color: #f77">2 important</span>
|
|
<span style="color: #3c3">6 relevant</span>
|
|
<span style="color: #77f">13 feasible</span>
|
|
<span style="color: #999">45 notes</span>
|
|
<table width="100%" border="1" style="border-collapse: collapse;"><tr style="background: #fdd"><td>relevance 4</td><td><a href="javascript:expand(0)">../src/session_impl.cpp:666</a></td><td>in order to support SSL over uTP, the utp_socket manager either needs to be able to receive packets on multiple ports, or we need to peek into the first few bytes the payload stream of a socket to determine whether or not it's an SSL connection. (The former is simpler but won't do as well with NATs)</td></tr><tr id="0" style="display: none;" colspan="3"><td colspan="3"><h2>in order to support SSL over uTP, the utp_socket manager either
|
|
needs to be able to receive packets on multiple ports, or we need to
|
|
peek into the first few bytes the payload stream of a socket to determine
|
|
whether or not it's an SSL connection. (The former is simpler but won't
|
|
do as well with NATs)</h2><h4>../src/session_impl.cpp:666</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> , m_optimistic_unchoke_time_scaler(0)
|
|
, m_disconnect_time_scaler(90)
|
|
, m_auto_scrape_time_scaler(180)
|
|
, m_next_explicit_cache_torrent(0)
|
|
, m_cache_rotation_timer(0)
|
|
, m_peak_up_rate(0)
|
|
, m_peak_down_rate(0)
|
|
, m_created(time_now_hires())
|
|
, m_last_tick(m_created)
|
|
, m_last_second_tick(m_created - milliseconds(900))
|
|
, m_last_disk_performance_warning(min_time())
|
|
, m_last_disk_queue_performance_warning(min_time())
|
|
, m_last_choke(m_created)
|
|
, m_next_rss_update(min_time())
|
|
#ifndef TORRENT_DISABLE_DHT
|
|
, m_dht_announce_timer(m_io_service)
|
|
, m_dht_interval_update_torrents(0)
|
|
#endif
|
|
, m_external_udp_port(0)
|
|
, m_udp_socket(m_io_service, m_half_open)
|
|
<div style="background: #ffff00" width="100%"> , m_utp_socket_manager(m_settings, m_udp_socket
|
|
</div> , boost::bind(&session_impl::incoming_connection, this, _1))
|
|
, m_boost_connections(0)
|
|
, m_timer(m_io_service)
|
|
, m_lsd_announce_timer(m_io_service)
|
|
, m_host_resolver(m_io_service)
|
|
, m_current_connect_attempts(0)
|
|
, m_tick_residual(0)
|
|
, m_non_filtered_torrents(0)
|
|
#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING || defined TORRENT_ERROR_LOGGING
|
|
, m_logpath(".")
|
|
#endif
|
|
#ifndef TORRENT_DISABLE_GEO_IP
|
|
, m_asnum_db(0)
|
|
, m_country_db(0)
|
|
#endif
|
|
, m_total_failed_bytes(0)
|
|
, m_total_redundant_bytes(0)
|
|
, m_pending_auto_manage(false)
|
|
, m_need_auto_manage(false)
|
|
, m_abort(false)
|
|
, m_paused(false)
|
|
, m_incoming_connection(false)
|
|
#if TORRENT_USE_ASSERTS && defined BOOST_HAS_PTHREADS
|
|
, m_network_thread(0)
|
|
#endif
|
|
{
|
|
#if TORRENT_USE_ASSERTS
|
|
m_posting_torrent_updates = false;
|
|
#endif
|
|
|
|
</pre></td></tr><tr style="background: #fdd"><td>relevance 4</td><td><a href="javascript:expand(1)">../src/settings.cpp:43</a></td><td>eliminate all use of this mechanism</td></tr><tr id="1" style="display: none;" colspan="3"><td colspan="3"><h2>eliminate all use of this mechanism</h2><h4>../src/settings.cpp:43</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#include "libtorrent/settings.hpp"
|
|
#include "libtorrent/lazy_entry.hpp"
|
|
#include "libtorrent/entry.hpp"
|
|
#include "libtorrent/assert.hpp"
|
|
|
|
#include <string>
|
|
|
|
namespace libtorrent
|
|
{
|
|
|
|
<div style="background: #ffff00" width="100%"> void load_struct(lazy_entry const& e, void* s, bencode_map_entry const* m, int num)
|
|
</div> {
|
|
for (int i = 0; i < num; ++i)
|
|
{
|
|
lazy_entry const* key = e.dict_find(m[i].name);
|
|
if (key == 0) continue;
|
|
void* dest = ((char*)s) + m[i].offset;
|
|
switch (m[i].type)
|
|
{
|
|
case std_string:
|
|
{
|
|
if (key->type() != lazy_entry::string_t) continue;
|
|
*((std::string*)dest) = key->string_value();
|
|
break;
|
|
}
|
|
case character:
|
|
case integer16:
|
|
case boolean:
|
|
case integer:
|
|
case size_integer:
|
|
case time_integer:
|
|
case floating_point:
|
|
{
|
|
if (key->type() != lazy_entry::int_t) continue;
|
|
size_type val = key->int_value();
|
|
switch (m[i].type)
|
|
{
|
|
case character: *((char*)dest) = char(val); break;
|
|
case integer16: *((boost::uint16_t*)dest) = boost::uint16_t(val); break;
|
|
case integer: *((int*)dest) = int(val); break;
|
|
case size_integer: *((size_type*)dest) = size_type(val); break;
|
|
</pre></td></tr><tr style="background: #fcc"><td>relevance 3</td><td><a href="javascript:expand(2)">../src/torrent.cpp:6170</a></td><td>if peer is a really good peer, maybe we shouldn't disconnect it</td></tr><tr id="2" style="display: none;" colspan="3"><td colspan="3"><h2>if peer is a really good peer, maybe we shouldn't disconnect it</h2><h4>../src/torrent.cpp:6170</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> return false;
|
|
}
|
|
TORRENT_ASSERT(m_connections.find(p) == m_connections.end());
|
|
m_connections.insert(p);
|
|
#ifdef TORRENT_DEBUG
|
|
error_code ec;
|
|
TORRENT_ASSERT(p->remote() == p->get_socket()->remote_endpoint(ec) || ec);
|
|
#endif
|
|
|
|
TORRENT_ASSERT(p->peer_info_struct() != NULL);
|
|
|
|
// we need to do this after we've added the peer to the policy
|
|
// since that's when the peer is assigned its peer_info object,
|
|
// which holds the rank
|
|
if (maybe_replace_peer)
|
|
{
|
|
// now, find the lowest rank peer and disconnect that
|
|
// if it's lower rank than the incoming connection
|
|
peer_connection* peer = find_lowest_ranking_peer();
|
|
|
|
<div style="background: #ffff00" width="100%"> if (peer && peer->peer_rank() < p->peer_rank())
|
|
</div> {
|
|
peer->disconnect(errors::too_many_connections);
|
|
p->peer_disconnected_other();
|
|
}
|
|
else
|
|
{
|
|
p->disconnect(errors::too_many_connections);
|
|
// we have to do this here because from the peer's point of
|
|
// it wasn't really attached to the torrent, but we do need
|
|
// to let policy know we're removing it
|
|
remove_peer(p);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
#if TORRENT_USE_INVARIANT_CHECKS
|
|
m_policy.check_invariant();
|
|
#endif
|
|
|
|
if (m_share_mode)
|
|
recalc_share_mode();
|
|
|
|
return true;
|
|
}
|
|
|
|
bool torrent::want_more_peers() const
|
|
{
|
|
return m_connections.size() < m_max_connections
|
|
&& !is_paused()
|
|
&& ((m_state != torrent_status::checking_files
|
|
</pre></td></tr><tr style="background: #fcc"><td>relevance 3</td><td><a href="javascript:expand(3)">../src/web_peer_connection.cpp:493</a></td><td>just make this peer not have the pieces associated with the file we just requested. Only when it doesn't have any of the file do the following</td></tr><tr id="3" style="display: none;" colspan="3"><td colspan="3"><h2>just make this peer not have the pieces
|
|
associated with the file we just requested. Only
|
|
when it doesn't have any of the file do the following</h2><h4>../src/web_peer_connection.cpp:493</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
++m_num_responses;
|
|
|
|
if (m_parser.connection_close())
|
|
{
|
|
incoming_choke();
|
|
if (m_num_responses == 1)
|
|
m_web.supports_keepalive = false;
|
|
}
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
peer_log("*** STATUS: %d %s", m_parser.status_code(), m_parser.message().c_str());
|
|
std::multimap<std::string, std::string> const& headers = m_parser.headers();
|
|
for (std::multimap<std::string, std::string>::const_iterator i = headers.begin()
|
|
, end(headers.end()); i != end; ++i)
|
|
peer_log(" %s: %s", i->first.c_str(), i->second.c_str());
|
|
#endif
|
|
// if the status code is not one of the accepted ones, abort
|
|
if (!is_ok_status(m_parser.status_code()))
|
|
{
|
|
<div style="background: #ffff00" width="100%"> int retry_time = atoi(m_parser.header("retry-after").c_str());
|
|
</div> if (retry_time <= 0) retry_time = m_ses.settings().urlseed_wait_retry;
|
|
// temporarily unavailable, retry later
|
|
t->retry_web_seed(this, retry_time);
|
|
std::string error_msg = to_string(m_parser.status_code()).elems
|
|
+ (" " + m_parser.message());
|
|
if (m_ses.m_alerts.should_post<url_seed_alert>())
|
|
{
|
|
m_ses.m_alerts.post_alert(url_seed_alert(t->get_handle(), m_url
|
|
, error_msg));
|
|
}
|
|
m_statistics.received_bytes(0, bytes_transferred);
|
|
disconnect(error_code(m_parser.status_code(), get_http_category()), 1);
|
|
#ifdef TORRENT_DEBUG
|
|
TORRENT_ASSERT(m_statistics.last_payload_downloaded()
|
|
+ m_statistics.last_protocol_downloaded()
|
|
== dl_target);
|
|
#endif
|
|
return;
|
|
}
|
|
if (is_redirect(m_parser.status_code()))
|
|
{
|
|
// this means we got a redirection request
|
|
// look for the location header
|
|
std::string location = m_parser.header("location");
|
|
m_statistics.received_bytes(0, bytes_transferred);
|
|
|
|
if (location.empty())
|
|
{
|
|
// we should not try this server again.
|
|
t->remove_web_seed(this);
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(4)">../src/gzip.cpp:132</a></td><td>it would be nice to use proper error handling here</td></tr><tr id="4" style="display: none;" colspan="3"><td colspan="3"><h2>it would be nice to use proper error handling here</h2><h4>../src/gzip.cpp:132</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> --size;
|
|
++buffer;
|
|
}
|
|
if (!size || *buffer) return -1;
|
|
|
|
--size;
|
|
++buffer;
|
|
}
|
|
|
|
if (flags & FHCRC)
|
|
{
|
|
if (size < 2) return -1;
|
|
|
|
size -= 2;
|
|
// buffer += 2;
|
|
}
|
|
|
|
return total_size - size;
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> TORRENT_EXTRA_EXPORT bool inflate_gzip(
|
|
</div> char const* in
|
|
, int size
|
|
, std::vector<char>& buffer
|
|
, int maximum_size
|
|
, std::string& error)
|
|
{
|
|
TORRENT_ASSERT(maximum_size > 0);
|
|
|
|
int header_len = gzip_header(in, size);
|
|
if (header_len < 0)
|
|
{
|
|
error = "invalid gzip header";
|
|
return true;
|
|
}
|
|
|
|
// start off with 4 kilobytes and grow
|
|
// if needed
|
|
boost::uint32_t destlen = 4096;
|
|
int ret = 0;
|
|
boost::uint32_t srclen = size - header_len;
|
|
in += header_len;
|
|
|
|
do
|
|
{
|
|
TORRENT_TRY {
|
|
buffer.resize(destlen);
|
|
} TORRENT_CATCH(std::exception& e) {
|
|
error = "out of memory: ";
|
|
error += e.what();
|
|
return true;
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(5)">../src/policy.cpp:155</a></td><td>this could be optimized if SSE 4.2 is available. It could also be optimized given that we have a fixed length</td></tr><tr id="5" style="display: none;" colspan="3"><td colspan="3"><h2>this could be optimized if SSE 4.2 is
|
|
available. It could also be optimized given
|
|
that we have a fixed length</h2><h4>../src/policy.cpp:155</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // 4. if IPs are not in the same /16, mask the IPs by 0xffff5555, hash them
|
|
// ordered, lowest first.
|
|
//
|
|
// * for IPv6 peers, just use the first 64 bits and widen the masks.
|
|
// like this: 0xffff5555 -> 0xffffffff55555555
|
|
// the lower 64 bits are always unmasked
|
|
//
|
|
// * for IPv6 addresses, compare /32 and /48 instead of /16 and /24
|
|
//
|
|
// * the two IP addresses that are used to calculate the rank must
|
|
// always be of the same address family
|
|
//
|
|
// * all IP addresses are in network byte order when hashed
|
|
boost::uint32_t peer_priority(tcp::endpoint e1, tcp::endpoint e2)
|
|
{
|
|
TORRENT_ASSERT(e1.address().is_v4() == e2.address().is_v4());
|
|
|
|
using std::swap;
|
|
|
|
// this is the crc32c (Castagnoli) polynomial
|
|
<div style="background: #ffff00" width="100%"> boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;
|
|
</div>
|
|
if (e1.address() == e2.address())
|
|
{
|
|
if (e1.port() > e2.port())
|
|
swap(e1, e2);
|
|
boost::uint16_t p[2];
|
|
p[0] = htons(e1.port());
|
|
p[1] = htons(e2.port());
|
|
crc.process_bytes((char const*)&p[0], 4);
|
|
}
|
|
#if TORRENT_USE_IPV6
|
|
else if (e1.address().is_v6())
|
|
{
|
|
const static boost::uint8_t v6mask[][8] = {
|
|
{ 0xff, 0xff, 0xff, 0xff, 0x55, 0x55, 0x55, 0x55 },
|
|
{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x55, 0x55 },
|
|
{ 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff }
|
|
};
|
|
|
|
if (e2 < e1) swap(e1, e2);
|
|
address_v6::bytes_type b1 = e1.address().to_v6().to_bytes();
|
|
address_v6::bytes_type b2 = e2.address().to_v6().to_bytes();
|
|
int mask = memcmp(&b1[0], &b2[0], 4) ? 0
|
|
: memcmp(&b1[0], &b2[0], 6) ? 1 : 2;
|
|
apply_mask(&b1[0], v6mask[mask], 8);
|
|
apply_mask(&b2[0], v6mask[mask], 8);
|
|
|
|
crc.process_bytes((char const*)&b1[0], 16);
|
|
crc.process_bytes((char const*)&b2[0], 16);
|
|
}
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(6)">../src/torrent.cpp:635</a></td><td>post alert</td></tr><tr id="6" style="display: none;" colspan="3"><td colspan="3"><h2>post alert</h2><h4>../src/torrent.cpp:635</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> state_updated();
|
|
|
|
set_state(torrent_status::downloading);
|
|
|
|
m_override_resume_data = true;
|
|
init();
|
|
}
|
|
|
|
#endif // if 0
|
|
|
|
void torrent::leave_seed_mode(bool seed)
|
|
{
|
|
if (!m_seed_mode) return;
|
|
|
|
if (!seed)
|
|
{
|
|
// this means the user promised we had all the
|
|
// files, but it turned out we didn't. This is
|
|
// an error.
|
|
|
|
<div style="background: #ffff00" width="100%">
|
|
</div>#if defined TORRENT_ERROR_LOGGING
|
|
debug_log("*** FAILED SEED MODE, rechecking");
|
|
#endif
|
|
}
|
|
|
|
#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING
|
|
debug_log("*** LEAVING SEED MODE (%s)", seed ? "as seed" : "as non-seed");
|
|
#endif
|
|
m_seed_mode = false;
|
|
// seed is false if we turned out not
|
|
// to be a seed after all
|
|
if (!seed)
|
|
{
|
|
set_state(torrent_status::downloading);
|
|
force_recheck();
|
|
}
|
|
m_num_verified = 0;
|
|
m_verified.clear();
|
|
}
|
|
|
|
void torrent::verified(int piece)
|
|
{
|
|
TORRENT_ASSERT(piece < int(m_verified.size()));
|
|
TORRENT_ASSERT(piece >= 0);
|
|
TORRENT_ASSERT(m_verified.get_bit(piece) == false);
|
|
++m_num_verified;
|
|
m_verified.set_bit(piece);
|
|
}
|
|
|
|
void torrent::start()
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(7)">../src/web_peer_connection.cpp:546</a></td><td>create a mapping of file-index to redirection URLs. Use that to form URLs instead. Support to reconnect to a new server without destructing this peer_connection</td></tr><tr id="7" style="display: none;" colspan="3"><td colspan="3"><h2>create a mapping of file-index to redirection URLs. Use that to form URLs instead. Support to reconnect to a new server without destructing this peer_connection</h2><h4>../src/web_peer_connection.cpp:546</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> t->remove_web_seed(this);
|
|
disconnect(errors::missing_location, 2);
|
|
#ifdef TORRENT_DEBUG
|
|
TORRENT_ASSERT(m_statistics.last_payload_downloaded()
|
|
+ m_statistics.last_protocol_downloaded()
|
|
== dl_target);
|
|
#endif
|
|
return;
|
|
}
|
|
|
|
bool single_file_request = false;
|
|
if (!m_path.empty() && m_path[m_path.size() - 1] != '/')
|
|
single_file_request = true;
|
|
|
|
// add the redirected url and remove the current one
|
|
if (!single_file_request)
|
|
{
|
|
TORRENT_ASSERT(!m_file_requests.empty());
|
|
int file_index = m_file_requests.front();
|
|
|
|
<div style="background: #ffff00" width="100%"> torrent_info const& info = t->torrent_file();
|
|
</div> std::string path = info.orig_files().file_path(file_index);
|
|
#ifdef TORRENT_WINDOWS
|
|
convert_path_to_posix(path);
|
|
#endif
|
|
path = escape_path(path.c_str(), path.length());
|
|
size_t i = location.rfind(path);
|
|
if (i == std::string::npos)
|
|
{
|
|
t->remove_web_seed(this);
|
|
disconnect(errors::invalid_redirection, 2);
|
|
#ifdef TORRENT_DEBUG
|
|
TORRENT_ASSERT(m_statistics.last_payload_downloaded()
|
|
+ m_statistics.last_protocol_downloaded()
|
|
== dl_target);
|
|
#endif
|
|
return;
|
|
}
|
|
location.resize(i);
|
|
}
|
|
t->add_web_seed(location, web_seed_entry::url_seed, m_external_auth, m_extra_headers);
|
|
t->remove_web_seed(this);
|
|
disconnect(errors::redirecting, 2);
|
|
#ifdef TORRENT_DEBUG
|
|
TORRENT_ASSERT(m_statistics.last_payload_downloaded()
|
|
+ m_statistics.last_protocol_downloaded()
|
|
== dl_target);
|
|
#endif
|
|
return;
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(8)">../src/kademlia/node.cpp:68</a></td><td>make this configurable in dht_settings</td></tr><tr id="8" style="display: none;" colspan="3"><td colspan="3"><h2>make this configurable in dht_settings</h2><h4>../src/kademlia/node.cpp:68</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">#include "libtorrent/kademlia/rpc_manager.hpp"
|
|
#include "libtorrent/kademlia/routing_table.hpp"
|
|
#include "libtorrent/kademlia/node.hpp"
|
|
#include "libtorrent/kademlia/dht_observer.hpp"
|
|
|
|
#include "libtorrent/kademlia/refresh.hpp"
|
|
#include "libtorrent/kademlia/get_peers.hpp"
|
|
#include "libtorrent/kademlia/get_item.hpp"
|
|
|
|
#ifdef TORRENT_USE_VALGRIND
|
|
#include <valgrind/memcheck.h>
|
|
#endif
|
|
|
|
namespace libtorrent { namespace dht
|
|
{
|
|
|
|
void incoming_error(entry& e, char const* msg, int error_code = 203);
|
|
|
|
using detail::write_endpoint;
|
|
|
|
<div style="background: #ffff00" width="100%">enum { announce_interval = 30 };
|
|
</div>
|
|
#ifdef TORRENT_DHT_VERBOSE_LOGGING
|
|
TORRENT_DEFINE_LOG(node)
|
|
|
|
extern int g_failed_announces;
|
|
extern int g_announces;
|
|
|
|
#endif
|
|
|
|
// remove peers that have timed out
|
|
void purge_peers(std::set<peer_entry>& peers)
|
|
{
|
|
for (std::set<peer_entry>::iterator i = peers.begin()
|
|
, end(peers.end()); i != end;)
|
|
{
|
|
// the peer has timed out
|
|
if (i->added + minutes(int(announce_interval * 1.5f)) < time_now())
|
|
{
|
|
#ifdef TORRENT_DHT_VERBOSE_LOGGING
|
|
TORRENT_LOG(node) << "peer timed out at: " << i->addr;
|
|
#endif
|
|
peers.erase(i++);
|
|
}
|
|
else
|
|
++i;
|
|
}
|
|
}
|
|
|
|
void nop() {}
|
|
|
|
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(9)">../src/kademlia/node_id.cpp:137</a></td><td>this could be optimized if SSE 4.2 is available. It could also be optimized given that we have a fixed length</td></tr><tr id="9" style="display: none;" colspan="3"><td colspan="3"><h2>this could be optimized if SSE 4.2 is
|
|
available. It could also be optimized given
|
|
that we have a fixed length</h2><h4>../src/kademlia/node_id.cpp:137</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> b6 = ip_.to_v6().to_bytes();
|
|
ip = &b6[0];
|
|
num_octets = 8;
|
|
mask = v6mask;
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
b4 = ip_.to_v4().to_bytes();
|
|
ip = &b4[0];
|
|
num_octets = 4;
|
|
mask = v4mask;
|
|
}
|
|
|
|
for (int i = 0; i < num_octets; ++i)
|
|
ip[i] &= mask[i];
|
|
|
|
ip[0] |= (r & 0x7) << 5;
|
|
|
|
// this is the crc32c (Castagnoli) polynomial
|
|
<div style="background: #ffff00" width="100%"> boost::crc_optimal<32, 0x1EDC6F41, 0xFFFFFFFF, 0xFFFFFFFF, true, true> crc;
|
|
</div> crc.process_block(ip, ip + num_octets);
|
|
boost::uint32_t c = crc.checksum();
|
|
node_id id;
|
|
|
|
id[0] = (c >> 24) & 0xff;
|
|
id[1] = (c >> 16) & 0xff;
|
|
id[2] = ((c >> 8) & 0xf8) | (random() & 0x7);
|
|
|
|
for (int i = 3; i < 19; ++i) id[i] = random() & 0xff;
|
|
id[19] = r & 0xff;
|
|
|
|
return id;
|
|
}
|
|
|
|
node_id generate_random_id()
|
|
{
|
|
char r[20];
|
|
for (int i = 0; i < 20; ++i) r[i] = random() & 0xff;
|
|
return hasher(r, 20).final();
|
|
}
|
|
|
|
// verifies whether a node-id matches the IP it's used from
|
|
// returns true if the node-id is OK coming from this source
|
|
// and false otherwise.
|
|
bool verify_id(node_id const& nid, address const& source_ip)
|
|
{
|
|
// no need to verify local IPs, they would be incorrect anyway
|
|
if (is_local(source_ip)) return true;
|
|
|
|
node_id h = generate_id_impl(source_ip, nid[19]);
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(10)">../src/http_seed_connection.cpp:117</a></td><td>in chunked encoding mode, this assert won't hold. the chunk headers should be subtracted from the receive_buffer_size</td></tr><tr id="10" style="display: none;" colspan="3"><td colspan="3"><h2>in chunked encoding mode, this assert won't hold.
|
|
the chunk headers should be subtracted from the receive_buffer_size</h2><h4>../src/http_seed_connection.cpp:117</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> boost::optional<piece_block_progress>
|
|
http_seed_connection::downloading_piece_progress() const
|
|
{
|
|
if (m_requests.empty())
|
|
return boost::optional<piece_block_progress>();
|
|
|
|
boost::shared_ptr<torrent> t = associated_torrent().lock();
|
|
TORRENT_ASSERT(t);
|
|
|
|
piece_block_progress ret;
|
|
|
|
peer_request const& pr = m_requests.front();
|
|
ret.piece_index = pr.piece;
|
|
if (!m_parser.header_finished())
|
|
{
|
|
ret.bytes_downloaded = 0;
|
|
}
|
|
else
|
|
{
|
|
int receive_buffer_size = receive_buffer().left() - m_parser.body_start();
|
|
<div style="background: #ffff00" width="100%"> TORRENT_ASSERT_VAL(receive_buffer_size <= t->block_size(), receive_buffer_size);
|
|
</div> ret.bytes_downloaded = t->block_size() - receive_buffer_size;
|
|
}
|
|
// this is used to make sure that the block_index stays within
|
|
// bounds. If the entire piece is downloaded, the block_index
|
|
// would otherwise point to one past the end
|
|
int correction = ret.bytes_downloaded ? -1 : 0;
|
|
ret.block_index = (pr.start + ret.bytes_downloaded + correction) / t->block_size();
|
|
ret.full_block_bytes = t->block_size();
|
|
const int last_piece = t->torrent_file().num_pieces() - 1;
|
|
if (ret.piece_index == last_piece && ret.block_index
|
|
== t->torrent_file().piece_size(last_piece) / t->block_size())
|
|
ret.full_block_bytes = t->torrent_file().piece_size(last_piece) % t->block_size();
|
|
return ret;
|
|
}
|
|
|
|
void http_seed_connection::write_request(peer_request const& r)
|
|
{
|
|
INVARIANT_CHECK;
|
|
|
|
boost::shared_ptr<torrent> t = associated_torrent().lock();
|
|
TORRENT_ASSERT(t);
|
|
|
|
TORRENT_ASSERT(t->valid_metadata());
|
|
// http_seeds don't support requesting more than one piece
|
|
// at a time
|
|
TORRENT_ASSERT(r.length <= t->torrent_file().piece_size(r.piece));
|
|
|
|
std::string request;
|
|
request.reserve(400);
|
|
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(11)">../src/peer_connection.cpp:2581</a></td><td>peers should really be corked/uncorked outside of all completed disk operations</td></tr><tr id="11" style="display: none;" colspan="3"><td colspan="3"><h2>peers should really be corked/uncorked outside of
|
|
all completed disk operations</h2><h4>../src/peer_connection.cpp:2581</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
|
|
|
if (is_disconnecting()) return;
|
|
|
|
#ifdef TORRENT_STATS
|
|
++m_ses.m_incoming_piece_picks;
|
|
#endif
|
|
request_a_block(*t, *this);
|
|
send_block_requests();
|
|
}
|
|
|
|
void peer_connection::on_disk_write_complete(int ret, disk_io_job const& j
|
|
, peer_request p, boost::shared_ptr<torrent> t)
|
|
{
|
|
#ifdef TORRENT_STATS
|
|
++m_ses.m_num_messages[aux::session_impl::on_disk_write_counter];
|
|
#endif
|
|
TORRENT_ASSERT(m_ses.is_network_thread());
|
|
|
|
// flush send buffer at the end of this scope
|
|
<div style="background: #ffff00" width="100%"> cork _c(*this);
|
|
</div>
|
|
INVARIANT_CHECK;
|
|
|
|
m_outstanding_writing_bytes -= p.length;
|
|
TORRENT_ASSERT(m_outstanding_writing_bytes >= 0);
|
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
|
// (*m_ses.m_logger) << time_now_string() << " *** DISK_WRITE_COMPLETE [ p: "
|
|
// << p.piece << " o: " << p.start << " ]\n";
|
|
#endif
|
|
|
|
if (!t)
|
|
{
|
|
disconnect(j.error);
|
|
return;
|
|
}
|
|
|
|
// in case the outstanding bytes just dropped down
|
|
// to allow to receive more data
|
|
setup_receive(read_async);
|
|
|
|
piece_block block_finished(p.piece, p.start / t->block_size());
|
|
|
|
if (ret == -1)
|
|
{
|
|
// handle_disk_error may disconnect us
|
|
t->handle_disk_error(j, this);
|
|
return;
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(12)">../src/session_impl.cpp:5544</a></td><td>report the proper address of the router as the source IP of this understanding of our external address, instead of the empty address</td></tr><tr id="12" style="display: none;" colspan="3"><td colspan="3"><h2>report the proper address of the router as the source IP of
|
|
this understanding of our external address, instead of the empty address</h2><h4>../src/session_impl.cpp:5544</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> void session_impl::on_port_mapping(int mapping, address const& ip, int port
|
|
, error_code const& ec, int map_transport)
|
|
{
|
|
TORRENT_ASSERT(is_network_thread());
|
|
|
|
TORRENT_ASSERT(map_transport >= 0 && map_transport <= 1);
|
|
|
|
if (mapping == m_udp_mapping[map_transport] && port != 0)
|
|
{
|
|
m_external_udp_port = port;
|
|
if (m_alerts.should_post<portmap_alert>())
|
|
m_alerts.post_alert(portmap_alert(mapping, port
|
|
, map_transport));
|
|
return;
|
|
}
|
|
|
|
if (mapping == m_tcp_mapping[map_transport] && port != 0)
|
|
{
|
|
if (ip != address())
|
|
{
|
|
<div style="background: #ffff00" width="100%"> set_external_address(ip, source_router, address());
|
|
</div> }
|
|
|
|
if (!m_listen_sockets.empty()) {
|
|
m_listen_sockets.front().external_address = ip;
|
|
m_listen_sockets.front().external_port = port;
|
|
}
|
|
if (m_alerts.should_post<portmap_alert>())
|
|
m_alerts.post_alert(portmap_alert(mapping, port
|
|
, map_transport));
|
|
return;
|
|
}
|
|
|
|
if (ec)
|
|
{
|
|
if (m_alerts.should_post<portmap_error_alert>())
|
|
m_alerts.post_alert(portmap_error_alert(mapping
|
|
, map_transport, ec));
|
|
}
|
|
else
|
|
{
|
|
if (m_alerts.should_post<portmap_alert>())
|
|
m_alerts.post_alert(portmap_alert(mapping, port
|
|
, map_transport));
|
|
}
|
|
}
|
|
|
|
session_status session_impl::status() const
|
|
{
|
|
// INVARIANT_CHECK;
|
|
TORRENT_ASSERT(is_network_thread());
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(13)">../src/session_impl.cpp:6333</a></td><td>we only need to do this if our global IPv4 address has changed since the DHT (currently) only supports IPv4. Since restarting the DHT is kind of expensive, it would be nice to not do it unnecessarily</td></tr><tr id="13" style="display: none;" colspan="3"><td colspan="3"><h2>we only need to do this if our global IPv4 address has changed
|
|
since the DHT (currently) only supports IPv4. Since restarting the DHT
|
|
is kind of expensive, it would be nice to not do it unnecessarily</h2><h4>../src/session_impl.cpp:6333</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">#endif
|
|
|
|
if (!m_external_ip.cast_vote(ip, source_type, source)) return;
|
|
|
|
#if defined TORRENT_VERBOSE_LOGGING
|
|
session_log(" external IP updated");
|
|
#endif
|
|
|
|
if (m_alerts.should_post<external_ip_alert>())
|
|
m_alerts.post_alert(external_ip_alert(ip));
|
|
|
|
for (torrent_map::iterator i = m_torrents.begin()
|
|
, end(m_torrents.end()); i != end; ++i)
|
|
{
|
|
i->second->new_external_ip();
|
|
}
|
|
|
|
// since we have a new external IP now, we need to
|
|
// restart the DHT with a new node ID
|
|
#ifndef TORRENT_DISABLE_DHT
|
|
<div style="background: #ffff00" width="100%"> if (m_dht)
|
|
</div> {
|
|
entry s = m_dht->state();
|
|
int cur_state = 0;
|
|
int prev_state = 0;
|
|
entry* nodes1 = s.find_key("nodes");
|
|
if (nodes1 && nodes1->type() == entry::list_t) cur_state = nodes1->list().size();
|
|
entry* nodes2 = m_dht_state.find_key("nodes");
|
|
if (nodes2 && nodes2->type() == entry::list_t) prev_state = nodes2->list().size();
|
|
if (cur_state > prev_state) m_dht_state = s;
|
|
start_dht(m_dht_state);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
void session_impl::free_disk_buffer(char* buf)
|
|
{
|
|
m_disk_thread.free_buffer(buf);
|
|
}
|
|
|
|
char* session_impl::allocate_disk_buffer(char const* category)
|
|
{
|
|
return m_disk_thread.allocate_buffer(category);
|
|
}
|
|
|
|
char* session_impl::allocate_buffer()
|
|
{
|
|
TORRENT_ASSERT(is_network_thread());
|
|
|
|
#ifdef TORRENT_DISK_STATS
|
|
TORRENT_ASSERT(m_buffer_allocations >= 0);
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(14)">../src/torrent.cpp:1032</a></td><td>make this depend on the error and on the filesystem the files are being downloaded to. If the error is no_space_left_on_device and the filesystem doesn't support sparse files, only zero the priorities of the pieces that are at the tails of all files, leaving everything up to the highest written piece in each file</td></tr><tr id="14" style="display: none;" colspan="3"><td colspan="3"><h2>make this depend on the error and on the filesystem the
|
|
files are being downloaded to. If the error is no_space_left_on_device
|
|
and the filesystem doesn't support sparse files, only zero the priorities
|
|
of the pieces that are at the tails of all files, leaving everything
|
|
up to the highest written piece in each file</h2><h4>../src/torrent.cpp:1032</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (c) c->disconnect(errors::no_memory);
|
|
return;
|
|
}
|
|
|
|
// notify the user of the error
|
|
if (alerts().should_post<file_error_alert>())
|
|
alerts().post_alert(file_error_alert(j.error_file, get_handle(), j.error));
|
|
|
|
// put the torrent in an error-state
|
|
set_error(j.error, j.error_file);
|
|
|
|
if (j.action == disk_io_job::write
|
|
&& (j.error == boost::system::errc::read_only_file_system
|
|
|| j.error == boost::system::errc::permission_denied
|
|
|| j.error == boost::system::errc::operation_not_permitted
|
|
|| j.error == boost::system::errc::no_space_on_device
|
|
|| j.error == boost::system::errc::file_too_large))
|
|
{
|
|
// if we failed to write, stop downloading and just
|
|
// keep seeding.
|
|
<div style="background: #ffff00" width="100%"> set_upload_mode(true);
|
|
</div> return;
|
|
}
|
|
|
|
// if the error appears to be more serious than a full disk, just pause the torrent
|
|
pause();
|
|
}
|
|
|
|
void torrent::on_disk_read_complete(int ret, disk_io_job const& j
|
|
, peer_request r, read_piece_struct* rp)
|
|
{
|
|
TORRENT_ASSERT(m_ses.is_network_thread());
|
|
|
|
disk_buffer_holder buffer(m_ses, j.buffer);
|
|
|
|
--rp->blocks_left;
|
|
if (ret != r.length)
|
|
{
|
|
rp->fail = true;
|
|
rp->error = j.error;
|
|
handle_disk_error(j);
|
|
}
|
|
else
|
|
{
|
|
std::memcpy(rp->piece_data.get() + r.start, j.buffer, r.length);
|
|
}
|
|
|
|
if (rp->blocks_left == 0)
|
|
{
|
|
int size = m_torrent_file->piece_size(r.piece);
|
|
if (rp->fail)
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(15)">../src/torrent.cpp:5431</a></td><td>save the send_stats state instead of throwing them away it may pose an issue when downgrading though</td></tr><tr id="15" style="display: none;" colspan="3"><td colspan="3"><h2>save the send_stats state instead of throwing them away
|
|
it may pose an issue when downgrading though</h2><h4>../src/torrent.cpp:5431</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> ? (1 << k) : 0;
|
|
bitmask.append(1, v);
|
|
TORRENT_ASSERT(bits == 8 || j == num_bitmask_bytes - 1);
|
|
}
|
|
piece_struct["bitmask"] = bitmask;
|
|
// push the struct onto the unfinished-piece list
|
|
up.push_back(piece_struct);
|
|
}
|
|
}
|
|
|
|
// save trackers
|
|
if (!m_trackers.empty())
|
|
{
|
|
entry::list_type& tr_list = ret["trackers"].list();
|
|
tr_list.push_back(entry::list_type());
|
|
int tier = 0;
|
|
for (std::vector<announce_entry>::const_iterator i = m_trackers.begin()
|
|
, end(m_trackers.end()); i != end; ++i)
|
|
{
|
|
// don't save trackers we can't trust
|
|
<div style="background: #ffff00" width="100%"> if (i->send_stats == false) continue;
|
|
</div> if (i->tier == tier)
|
|
{
|
|
tr_list.back().list().push_back(i->url);
|
|
}
|
|
else
|
|
{
|
|
tr_list.push_back(entry::list_t);
|
|
tr_list.back().list().push_back(i->url);
|
|
tier = i->tier;
|
|
}
|
|
}
|
|
}
|
|
|
|
// save web seeds
|
|
if (!m_web_seeds.empty())
|
|
{
|
|
entry::list_type& url_list = ret["url-list"].list();
|
|
entry::list_type& httpseed_list = ret["httpseeds"].list();
|
|
for (std::list<web_seed_entry>::const_iterator i = m_web_seeds.begin()
|
|
, end(m_web_seeds.end()); i != end; ++i)
|
|
{
|
|
if (i->type == web_seed_entry::url_seed)
|
|
url_list.push_back(i->url);
|
|
else if (i->type == web_seed_entry::http_seed)
|
|
httpseed_list.push_back(i->url);
|
|
}
|
|
}
|
|
|
|
// write have bitmask
|
|
// the pieces string has one byte per piece. Each
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(16)">../src/torrent.cpp:6338</a></td><td>should disconnect all peers that have the pieces we have not just seeds. It would be pretty expensive to check all pieces for all peers though</td></tr><tr id="16" style="display: none;" colspan="3"><td colspan="3"><h2>should disconnect all peers that have the pieces we have
|
|
not just seeds. It would be pretty expensive to check all pieces
|
|
for all peers though</h2><h4>../src/torrent.cpp:6338</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> TORRENT_ASSERT(m_state != torrent_status::finished && m_state != torrent_status::seeding);
|
|
|
|
set_state(torrent_status::finished);
|
|
set_queue_position(-1);
|
|
|
|
// we have to call completed() before we start
|
|
// disconnecting peers, since there's an assert
|
|
// to make sure we're cleared the piece picker
|
|
if (is_seed()) completed();
|
|
|
|
send_upload_only();
|
|
|
|
state_updated();
|
|
|
|
if (m_completed_time == 0)
|
|
m_completed_time = time(0);
|
|
|
|
// disconnect all seeds
|
|
if (settings().close_redundant_connections)
|
|
{
|
|
<div style="background: #ffff00" width="100%"> std::vector<peer_connection*> seeds;
|
|
</div> for (peer_iterator i = m_connections.begin();
|
|
i != m_connections.end(); ++i)
|
|
{
|
|
peer_connection* p = *i;
|
|
TORRENT_ASSERT(p->associated_torrent().lock().get() == this);
|
|
if (p->upload_only())
|
|
{
|
|
#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_ERROR_LOGGING
|
|
p->peer_log("*** SEED, CLOSING CONNECTION");
|
|
#endif
|
|
seeds.push_back(p);
|
|
}
|
|
}
|
|
std::for_each(seeds.begin(), seeds.end()
|
|
, boost::bind(&peer_connection::disconnect, _1, errors::torrent_finished, 0));
|
|
}
|
|
|
|
if (m_abort) return;
|
|
|
|
m_policy.recalculate_connect_candidates();
|
|
|
|
TORRENT_ASSERT(m_storage);
|
|
// we need to keep the object alive during this operation
|
|
m_storage->async_release_files(
|
|
boost::bind(&torrent::on_files_released, shared_from_this(), _1, _2));
|
|
|
|
// this torrent just completed downloads, which means it will fall
|
|
// under a different limit with the auto-manager. Make sure we
|
|
// update auto-manage torrents in that case
|
|
if (m_auto_managed)
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(17)">../src/torrent_info.cpp:183</a></td><td>we might save constructing a std::string if this would take a char const* instead</td></tr><tr id="17" style="display: none;" colspan="3"><td colspan="3"><h2>we might save constructing a std::string if this would take a char const* instead</h2><h4>../src/torrent_info.cpp:183</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
tmp_path += i[0];
|
|
tmp_path += i[1];
|
|
tmp_path += i[2];
|
|
tmp_path += i[3];
|
|
i += 3;
|
|
continue;
|
|
}
|
|
|
|
tmp_path += "_";
|
|
valid_encoding = false;
|
|
}
|
|
// the encoding was not valid utf-8
|
|
// save the original encoding and replace the
|
|
// commonly used path with the correctly
|
|
// encoded string
|
|
if (!valid_encoding) target = tmp_path;
|
|
return valid_encoding;
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> bool valid_path_element(std::string const& element)
|
|
</div> {
|
|
if (element.empty()
|
|
|| element == "." || element == ".."
|
|
|| element[0] == '/' || element[0] == '\\'
|
|
|| element[element.size()-1] == ':')
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
TORRENT_EXTRA_EXPORT void trim_path_element(std::string& element)
|
|
{
|
|
const int max_path_len = TORRENT_MAX_PATH;
|
|
|
|
// on windows, the max path is expressed in
|
|
// unicode characters, not bytes
|
|
#if defined TORRENT_WINDOWS && TORRENT_USE_WSTRING
|
|
std::wstring path_element;
|
|
utf8_wchar(element, path_element);
|
|
if (path_element.size() > max_path_len)
|
|
{
|
|
// truncate filenames that are too long. But keep extensions!
|
|
std::wstring ext;
|
|
wchar_t const* ext1 = wcsrchr(path_element.c_str(), '.');
|
|
if (ext1 != NULL) ext = ext1;
|
|
|
|
if (ext.size() > 15)
|
|
{
|
|
path_element.resize(max_path_len);
|
|
}
|
|
else
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(18)">../src/torrent_info.cpp:403</a></td><td>this logic should be a separate step done once the torrent is loaded, and the original filenames should be preserved!</td></tr><tr id="18" style="display: none;" colspan="3"><td colspan="3"><h2>this logic should be a separate step
|
|
done once the torrent is loaded, and the original
|
|
filenames should be preserved!</h2><h4>../src/torrent_info.cpp:403</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
while (*s1 != 0 || *s2 != 0)
|
|
{
|
|
c1 = to_lower(*s1);
|
|
c2 = to_lower(*s2);
|
|
if (c1 < c2) return true;
|
|
if (c1 > c2) return false;
|
|
++s1;
|
|
++s2;
|
|
}
|
|
return false;
|
|
}
|
|
};
|
|
|
|
bool extract_files(lazy_entry const& list, file_storage& target
|
|
, std::string const& root_dir, ptrdiff_t info_ptr_diff)
|
|
{
|
|
if (list.type() != lazy_entry::list_t) return false;
|
|
target.reserve(list.list_size());
|
|
|
|
<div style="background: #ffff00" width="100%"> std::set<std::string, string_less_no_case> files;
|
|
</div>
|
|
for (int i = 0, end(list.list_size()); i < end; ++i)
|
|
{
|
|
lazy_entry const* file_hash = 0;
|
|
time_t mtime = 0;
|
|
file_entry e;
|
|
lazy_entry const* fee = 0;
|
|
if (!extract_single_file(*list.list_at(i), e, root_dir
|
|
, &file_hash, &fee, &mtime))
|
|
return false;
|
|
|
|
// as long as this file already exists
|
|
// increase the counter
|
|
int cnt = 0;
|
|
if (!files.insert(e.path).second)
|
|
{
|
|
std::string base = remove_extension(e.path);
|
|
std::string ext = extension(e.path);
|
|
do
|
|
{
|
|
++cnt;
|
|
char new_ext[50];
|
|
snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str());
|
|
e.path = base + new_ext;
|
|
} while (!files.insert(e.path).second);
|
|
}
|
|
target.add_file(e, file_hash ? file_hash->string_ptr() + info_ptr_diff : 0);
|
|
|
|
// This is a memory optimization! Instead of having
|
|
// each entry keep a string for its filename, make it
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(19)">../src/torrent_info.cpp:439</a></td><td>once the filename renaming is removed from here this check can be removed as well</td></tr><tr id="19" style="display: none;" colspan="3"><td colspan="3"><h2>once the filename renaming is removed from here
|
|
this check can be removed as well</h2><h4>../src/torrent_info.cpp:439</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // increase the counter
|
|
int cnt = 0;
|
|
if (!files.insert(e.path).second)
|
|
{
|
|
std::string base = remove_extension(e.path);
|
|
std::string ext = extension(e.path);
|
|
do
|
|
{
|
|
++cnt;
|
|
char new_ext[50];
|
|
snprintf(new_ext, sizeof(new_ext), ".%d%s", cnt, ext.c_str());
|
|
e.path = base + new_ext;
|
|
} while (!files.insert(e.path).second);
|
|
}
|
|
target.add_file(e, file_hash ? file_hash->string_ptr() + info_ptr_diff : 0);
|
|
|
|
// This is a memory optimization! Instead of having
|
|
// each entry keep a string for its filename, make it
|
|
// simply point into the info-section buffer
|
|
int last_index = target.num_files() - 1;
|
|
<div style="background: #ffff00" width="100%"> if (fee && target.file_name(last_index) == fee->string_value())
|
|
</div> {
|
|
// this string pointer does not necessarily point into
|
|
// the m_info_section buffer.
|
|
char const* str_ptr = fee->string_ptr() + info_ptr_diff;
|
|
target.rename_file_borrow(last_index, str_ptr, fee->string_length());
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
int merkle_get_parent(int tree_node)
|
|
{
|
|
// node 0 doesn't have a parent
|
|
TORRENT_ASSERT(tree_node > 0);
|
|
return (tree_node - 1) / 2;
|
|
}
|
|
|
|
int merkle_get_sibling(int tree_node)
|
|
{
|
|
// node 0 doesn't have a sibling
|
|
TORRENT_ASSERT(tree_node > 0);
|
|
// even numbers have their sibling to the left
|
|
// odd numbers have their sibling to the right
|
|
return tree_node + (tree_node&1?1:-1);
|
|
}
|
|
|
|
int merkle_num_nodes(int leafs)
|
|
{
|
|
TORRENT_ASSERT(leafs > 0);
|
|
return (leafs << 1) - 1;
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(20)">../src/kademlia/node.cpp:812</a></td><td>find_node should write directly to the response entry</td></tr><tr id="20" style="display: none;" colspan="3"><td colspan="3"><h2>find_node should write directly to the response entry</h2><h4>../src/kademlia/node.cpp:812</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
TORRENT_LOG(node) << " values: " << reply["values"].list().size();
|
|
}
|
|
#endif
|
|
}
|
|
else if (strcmp(query, "find_node") == 0)
|
|
{
|
|
key_desc_t msg_desc[] = {
|
|
{"target", lazy_entry::string_t, 20, 0},
|
|
};
|
|
|
|
lazy_entry const* msg_keys[1];
|
|
if (!verify_message(arg_ent, msg_desc, msg_keys, 1, error_string, sizeof(error_string)))
|
|
{
|
|
incoming_error(e, error_string);
|
|
return;
|
|
}
|
|
|
|
sha1_hash target(msg_keys[0]->string_ptr());
|
|
|
|
<div style="background: #ffff00" width="100%"> nodes_t n;
|
|
</div> m_table.find_node(target, n, 0);
|
|
write_nodes_entry(reply, n);
|
|
}
|
|
else if (strcmp(query, "announce_peer") == 0)
|
|
{
|
|
key_desc_t msg_desc[] = {
|
|
{"info_hash", lazy_entry::string_t, 20, 0},
|
|
{"port", lazy_entry::int_t, 0, 0},
|
|
{"token", lazy_entry::string_t, 0, 0},
|
|
{"n", lazy_entry::string_t, 0, key_desc_t::optional},
|
|
{"seed", lazy_entry::int_t, 0, key_desc_t::optional},
|
|
{"implied_port", lazy_entry::int_t, 0, key_desc_t::optional},
|
|
};
|
|
|
|
lazy_entry const* msg_keys[6];
|
|
if (!verify_message(arg_ent, msg_desc, msg_keys, 6, error_string, sizeof(error_string)))
|
|
{
|
|
#ifdef TORRENT_DHT_VERBOSE_LOGGING
|
|
++g_failed_announces;
|
|
#endif
|
|
incoming_error(e, error_string);
|
|
return;
|
|
}
|
|
|
|
int port = int(msg_keys[1]->int_value());
|
|
|
|
// is the announcer asking to ignore the explicit
|
|
// listen port and instead use the source port of the packet?
|
|
if (msg_keys[5] && msg_keys[5]->int_value() != 0)
|
|
port = m.addr.port();
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(21)">../include/libtorrent/ip_voter.hpp:122</a></td><td>instead, have one instance per possible subnet, global IPv4, global IPv6, loopback, 192.168.x.x, 10.x.x.x, etc.</td></tr><tr id="21" style="display: none;" colspan="3"><td colspan="3"><h2>instead, have one instance per possible subnet, global IPv4, global IPv6, loopback, 192.168.x.x, 10.x.x.x, etc.</h2><h4>../include/libtorrent/ip_voter.hpp:122</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // away all the votes and started from scratch, in case
|
|
// our IP has changed
|
|
ptime m_last_rotate;
|
|
};
|
|
|
|
// this keeps track of multiple external IPs (for now, just IPv6 and IPv4, but
|
|
// it could be extended to deal with loopback and local network addresses as well)
|
|
struct TORRENT_EXTRA_EXPORT external_ip
|
|
{
|
|
// returns true if a different IP is the top vote now
|
|
// i.e. we changed our idea of what our external IP is
|
|
bool cast_vote(address const& ip, int source_type, address const& source);
|
|
|
|
// the external IP as it would be observed from `ip`
|
|
address external_address(address const& ip) const;
|
|
|
|
private:
|
|
|
|
// for now, assume one external IPv4 and one external IPv6 address
|
|
// 0 = IPv4 1 = IPv6
|
|
<div style="background: #ffff00" width="100%"> ip_voter m_vote_group[2];
|
|
</div> };
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(22)">../include/libtorrent/web_peer_connection.hpp:126</a></td><td>if we make this be a disk_buffer_holder instead we would save a copy sometimes use allocate_disk_receive_buffer and release_disk_receive_buffer</td></tr><tr id="22" style="display: none;" colspan="3"><td colspan="3"><h2>if we make this be a disk_buffer_holder instead
|
|
we would save a copy sometimes
|
|
use allocate_disk_receive_buffer and release_disk_receive_buffer</h2><h4>../include/libtorrent/web_peer_connection.hpp:126</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
bool maybe_harvest_block();
|
|
|
|
// returns the block currently being
|
|
// downloaded. And the progress of that
|
|
// block. If the peer isn't downloading
|
|
// a piece for the moment, the boost::optional
|
|
// will be invalid.
|
|
boost::optional<piece_block_progress> downloading_piece_progress() const;
|
|
|
|
// this has one entry per http-request
|
|
// (might be more than the bt requests)
|
|
std::deque<int> m_file_requests;
|
|
|
|
std::string m_url;
|
|
|
|
web_seed_entry& m_web;
|
|
|
|
// this is used for intermediate storage of pieces
|
|
// that are received in more than one HTTP response
|
|
<div style="background: #ffff00" width="100%"> std::vector<char> m_piece;
|
|
</div>
|
|
// the number of bytes received in the current HTTP
|
|
// response. used to know where in the buffer the
|
|
// next response starts
|
|
size_type m_received_body;
|
|
|
|
// position in the current range response
|
|
size_type m_range_pos;
|
|
|
|
// the position in the current block
|
|
int m_block_pos;
|
|
|
|
// this is the offset inside the current receive
|
|
// buffer where the next chunk header will be.
|
|
// this is updated for each chunk header that's
|
|
// parsed. It does not necessarily point to a valid
|
|
// offset in the receive buffer, if we haven't received
|
|
// it yet. This offset never includes the HTTP header
|
|
size_type m_chunk_pos;
|
|
|
|
// this is the number of bytes we've already received
|
|
// from the next chunk header we're waiting for
|
|
int m_partial_chunk_header;
|
|
|
|
// the number of responses we've received so far on
|
|
// this connection
|
|
int m_num_responses;
|
|
};
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(23)">../src/bt_peer_connection.cpp:643</a></td><td>this could be optimized using knuth morris pratt</td></tr><tr id="23" style="display: none;" colspan="3"><td colspan="3"><h2>this could be optimized using knuth morris pratt</h2><h4>../src/bt_peer_connection.cpp:643</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
disconnect(errors::no_memory);
|
|
return;
|
|
}
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
peer_log(" computed RC4 keys");
|
|
#endif
|
|
}
|
|
|
|
int bt_peer_connection::get_syncoffset(char const* src, int src_size,
|
|
char const* target, int target_size) const
|
|
{
|
|
TORRENT_ASSERT(target_size >= src_size);
|
|
TORRENT_ASSERT(src_size > 0);
|
|
TORRENT_ASSERT(src);
|
|
TORRENT_ASSERT(target);
|
|
|
|
int traverse_limit = target_size - src_size;
|
|
|
|
<div style="background: #ffff00" width="100%"> for (int i = 0; i < traverse_limit; ++i)
|
|
</div> {
|
|
char const* target_ptr = target + i;
|
|
if (std::equal(src, src+src_size, target_ptr))
|
|
return i;
|
|
}
|
|
|
|
// // Partial sync
|
|
// for (int i = 0; i < target_size; ++i)
|
|
// {
|
|
// // first is iterator in src[] at which mismatch occurs
|
|
// // second is iterator in target[] at which mismatch occurs
|
|
// std::pair<const char*, const char*> ret;
|
|
// int src_sync_size;
|
|
// if (i > traverse_limit) // partial sync test
|
|
// {
|
|
// ret = std::mismatch(src, src + src_size - (i - traverse_limit), &target[i]);
|
|
// src_sync_size = ret.first - src;
|
|
// if (src_sync_size == (src_size - (i - traverse_limit)))
|
|
// return i;
|
|
// }
|
|
// else // complete sync test
|
|
// {
|
|
// ret = std::mismatch(src, src + src_size, &target[i]);
|
|
// src_sync_size = ret.first - src;
|
|
// if (src_sync_size == src_size)
|
|
// return i;
|
|
// }
|
|
// }
|
|
|
|
// no complete sync
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(24)">../src/bt_peer_connection.cpp:2112</a></td><td>if we're finished, send upload_only message</td></tr><tr id="24" style="display: none;" colspan="3"><td colspan="3"><h2>if we're finished, send upload_only message</h2><h4>../src/bt_peer_connection.cpp:2112</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (msg[5 + k / 8] & (0x80 >> (k % 8))) bitfield_string[k] = '1';
|
|
else bitfield_string[k] = '0';
|
|
}
|
|
peer_log("==> BITFIELD [ %s ]", bitfield_string.c_str());
|
|
#endif
|
|
#if TORRENT_USE_ASSERTS
|
|
m_sent_bitfield = true;
|
|
#endif
|
|
|
|
send_buffer(msg, packet_size);
|
|
|
|
if (num_lazy_pieces > 0)
|
|
{
|
|
for (int i = 0; i < num_lazy_pieces; ++i)
|
|
{
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
peer_log("==> HAVE [ piece: %d ]", lazy_pieces[i]);
|
|
#endif
|
|
write_have(lazy_pieces[i]);
|
|
}
|
|
<div style="background: #ffff00" width="100%"> }
|
|
</div>
|
|
if (m_supports_fast)
|
|
send_allowed_set();
|
|
}
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
void bt_peer_connection::write_extensions()
|
|
{
|
|
INVARIANT_CHECK;
|
|
|
|
TORRENT_ASSERT(m_supports_extensions);
|
|
TORRENT_ASSERT(m_sent_handshake);
|
|
|
|
entry handshake;
|
|
entry::dictionary_type& m = handshake["m"].dict();
|
|
|
|
// if we're using a proxy, our listen port won't be useful
|
|
// anyway.
|
|
if (!m_ses.settings().force_proxy && is_outgoing())
|
|
handshake["p"] = m_ses.listen_port();
|
|
|
|
// only send the port in case we bade the connection
|
|
// on incoming connections the other end already knows
|
|
// our listen port
|
|
if (!m_ses.m_settings.anonymous_mode)
|
|
{
|
|
handshake["v"] = m_ses.settings().handshake_client_version.empty()
|
|
? m_ses.settings().user_agent : m_ses.settings().handshake_client_version;
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(25)">../src/bt_peer_connection.cpp:3364</a></td><td>move the erasing into the loop above remove all payload ranges that has been sent</td></tr><tr id="25" style="display: none;" colspan="3"><td colspan="3"><h2>move the erasing into the loop above
|
|
remove all payload ranges that has been sent</h2><h4>../src/bt_peer_connection.cpp:3364</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> for (std::vector<range>::iterator i = m_payloads.begin();
|
|
i != m_payloads.end(); ++i)
|
|
{
|
|
i->start -= bytes_transferred;
|
|
if (i->start < 0)
|
|
{
|
|
if (i->start + i->length <= 0)
|
|
{
|
|
amount_payload += i->length;
|
|
}
|
|
else
|
|
{
|
|
amount_payload += -i->start;
|
|
i->length -= -i->start;
|
|
i->start = 0;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> m_payloads.erase(
|
|
</div> std::remove_if(m_payloads.begin(), m_payloads.end(), range_below_zero)
|
|
, m_payloads.end());
|
|
|
|
TORRENT_ASSERT(amount_payload <= (int)bytes_transferred);
|
|
m_statistics.sent_bytes(amount_payload, bytes_transferred - amount_payload);
|
|
|
|
if (amount_payload > 0)
|
|
{
|
|
boost::shared_ptr<torrent> t = associated_torrent().lock();
|
|
TORRENT_ASSERT(t);
|
|
if (t) t->update_last_upload();
|
|
}
|
|
}
|
|
|
|
#if TORRENT_USE_INVARIANT_CHECKS
|
|
void bt_peer_connection::check_invariant() const
|
|
{
|
|
boost::shared_ptr<torrent> t = associated_torrent().lock();
|
|
|
|
#ifndef TORRENT_DISABLE_ENCRYPTION
|
|
TORRENT_ASSERT( (bool(m_state != read_pe_dhkey) || m_dh_key_exchange.get())
|
|
|| !is_outgoing());
|
|
|
|
TORRENT_ASSERT(!m_rc4_encrypted || m_enc_handler.get());
|
|
#endif
|
|
if (!in_handshake())
|
|
{
|
|
TORRENT_ASSERT(m_sent_handshake);
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(26)">../src/file.cpp:1404</a></td><td>is there any way to pre-fetch data from a file on windows?</td></tr><tr id="26" style="display: none;" colspan="3"><td colspan="3"><h2>is there any way to pre-fetch data from a file on windows?</h2><h4>../src/file.cpp:1404</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
void file::init_file()
|
|
{
|
|
if (m_page_size != 0) return;
|
|
|
|
m_page_size = page_size();
|
|
}
|
|
|
|
#endif
|
|
|
|
void file::hint_read(size_type file_offset, int len)
|
|
{
|
|
#if defined POSIX_FADV_WILLNEED
|
|
posix_fadvise(m_fd, file_offset, len, POSIX_FADV_WILLNEED);
|
|
#elif defined F_RDADVISE
|
|
radvisory r;
|
|
r.ra_offset = file_offset;
|
|
r.ra_count = len;
|
|
fcntl(m_fd, F_RDADVISE, &r);
|
|
#else
|
|
<div style="background: #ffff00" width="100%">#endif
|
|
</div> }
|
|
|
|
size_type file::readv(size_type file_offset, iovec_t const* bufs, int num_bufs, error_code& ec)
|
|
{
|
|
#ifdef TORRENT_WINDOWS
|
|
if (m_file_handle == INVALID_HANDLE_VALUE)
|
|
{
|
|
ec = error_code(ERROR_INVALID_HANDLE, get_system_category());
|
|
return -1;
|
|
}
|
|
#else
|
|
if (m_fd == -1)
|
|
{
|
|
ec = error_code(EBADF, get_system_category());
|
|
return -1;
|
|
}
|
|
#endif
|
|
TORRENT_ASSERT((m_open_mode & rw_mask) == read_only || (m_open_mode & rw_mask) == read_write);
|
|
TORRENT_ASSERT(bufs);
|
|
TORRENT_ASSERT(num_bufs > 0);
|
|
TORRENT_ASSERT(is_open());
|
|
|
|
#if defined TORRENT_WINDOWS || defined TORRENT_LINUX || defined TORRENT_DEBUG
|
|
// make sure m_page_size is initialized
|
|
init_file();
|
|
#endif
|
|
|
|
#ifdef TORRENT_DEBUG
|
|
if (m_open_mode & no_buffer)
|
|
{
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(27)">../src/http_tracker_connection.cpp:99</a></td><td>support authentication (i.e. user name and password) in the URL</td></tr><tr id="27" style="display: none;" colspan="3"><td colspan="3"><h2>support authentication (i.e. user name and password) in the URL</h2><h4>../src/http_tracker_connection.cpp:99</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> , aux::session_impl const& ses
|
|
, proxy_settings const& ps
|
|
, std::string const& auth
|
|
#if TORRENT_USE_I2P
|
|
, i2p_connection* i2p_conn
|
|
#endif
|
|
)
|
|
: tracker_connection(man, req, ios, c)
|
|
, m_man(man)
|
|
, m_ses(ses)
|
|
, m_ps(ps)
|
|
, m_cc(cc)
|
|
, m_ios(ios)
|
|
#if TORRENT_USE_I2P
|
|
, m_i2p_conn(i2p_conn)
|
|
#endif
|
|
{}
|
|
|
|
void http_tracker_connection::start()
|
|
{
|
|
<div style="background: #ffff00" width="100%"> std::string url = tracker_req().url;
|
|
</div>
|
|
if (tracker_req().kind == tracker_request::scrape_request)
|
|
{
|
|
// find and replace "announce" with "scrape"
|
|
// in request
|
|
|
|
std::size_t pos = url.find("announce");
|
|
if (pos == std::string::npos)
|
|
{
|
|
tracker_connection::fail(error_code(errors::scrape_not_available));
|
|
return;
|
|
}
|
|
url.replace(pos, 8, "scrape");
|
|
}
|
|
|
|
#if TORRENT_USE_I2P
|
|
bool i2p = is_i2p_url(url);
|
|
#else
|
|
static const bool i2p = false;
|
|
#endif
|
|
|
|
session_settings const& settings = m_ses.settings();
|
|
|
|
// if request-string already contains
|
|
// some parameters, append an ampersand instead
|
|
// of a question mark
|
|
size_t arguments_start = url.find('?');
|
|
if (arguments_start != std::string::npos)
|
|
url += "&";
|
|
else
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(28)">../src/i2p_stream.cpp:210</a></td><td>move this to proxy_base and use it in all proxies</td></tr><tr id="28" style="display: none;" colspan="3"><td colspan="3"><h2>move this to proxy_base and use it in all proxies</h2><h4>../src/i2p_stream.cpp:210</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
i2p_stream::i2p_stream(io_service& io_service)
|
|
: proxy_base(io_service)
|
|
, m_id(0)
|
|
, m_command(cmd_create_session)
|
|
, m_state(0)
|
|
{
|
|
#if TORRENT_USE_ASSERTS
|
|
m_magic = 0x1337;
|
|
#endif
|
|
}
|
|
|
|
i2p_stream::~i2p_stream()
|
|
{
|
|
#if TORRENT_USE_ASSERTS
|
|
TORRENT_ASSERT(m_magic == 0x1337);
|
|
m_magic = 0;
|
|
#endif
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> bool i2p_stream::handle_error(error_code const& e, boost::shared_ptr<handler_type> const& h)
|
|
</div> {
|
|
TORRENT_ASSERT(m_magic == 0x1337);
|
|
if (!e) return false;
|
|
// fprintf(stderr, "i2p error \"%s\"\n", e.message().c_str());
|
|
(*h)(e);
|
|
return true;
|
|
}
|
|
|
|
void i2p_stream::do_connect(error_code const& e, tcp::resolver::iterator i
|
|
, boost::shared_ptr<handler_type> h)
|
|
{
|
|
TORRENT_ASSERT(m_magic == 0x1337);
|
|
if (e || i == tcp::resolver::iterator())
|
|
{
|
|
(*h)(e);
|
|
error_code ec;
|
|
close(ec);
|
|
return;
|
|
}
|
|
|
|
#if defined TORRENT_ASIO_DEBUGGING
|
|
add_outstanding_async("i2p_stream::connected");
|
|
#endif
|
|
m_sock.async_connect(i->endpoint(), boost::bind(
|
|
&i2p_stream::connected, this, _1, h));
|
|
}
|
|
|
|
void i2p_stream::connected(error_code const& e, boost::shared_ptr<handler_type> h)
|
|
{
|
|
TORRENT_ASSERT(m_magic == 0x1337);
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(29)">../src/packet_buffer.cpp:176</a></td><td>use compare_less_wrap for this comparison as well</td></tr><tr id="29" style="display: none;" colspan="3"><td colspan="3"><h2>use compare_less_wrap for this comparison as well</h2><h4>../src/packet_buffer.cpp:176</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> while (new_size < size)
|
|
new_size <<= 1;
|
|
|
|
void** new_storage = (void**)malloc(sizeof(void*) * new_size);
|
|
|
|
for (index_type i = 0; i < new_size; ++i)
|
|
new_storage[i] = 0;
|
|
|
|
for (index_type i = m_first; i < (m_first + m_capacity); ++i)
|
|
new_storage[i & (new_size - 1)] = m_storage[i & (m_capacity - 1)];
|
|
|
|
free(m_storage);
|
|
|
|
m_storage = new_storage;
|
|
m_capacity = new_size;
|
|
}
|
|
|
|
void* packet_buffer::remove(index_type idx)
|
|
{
|
|
INVARIANT_CHECK;
|
|
<div style="background: #ffff00" width="100%"> if (idx >= m_first + m_capacity)
|
|
</div> return 0;
|
|
|
|
if (compare_less_wrap(idx, m_first, 0xffff))
|
|
return 0;
|
|
|
|
const int mask = (m_capacity - 1);
|
|
void* old_value = m_storage[idx & mask];
|
|
m_storage[idx & mask] = 0;
|
|
|
|
if (old_value)
|
|
{
|
|
--m_size;
|
|
if (m_size == 0) m_last = m_first;
|
|
}
|
|
|
|
if (idx == m_first && m_size != 0)
|
|
{
|
|
++m_first;
|
|
for (boost::uint32_t i = 0; i < m_capacity; ++i, ++m_first)
|
|
if (m_storage[m_first & mask]) break;
|
|
m_first &= 0xffff;
|
|
}
|
|
|
|
if (((idx + 1) & 0xffff) == m_last && m_size != 0)
|
|
{
|
|
--m_last;
|
|
for (boost::uint32_t i = 0; i < m_capacity; ++i, --m_last)
|
|
if (m_storage[m_last & mask]) break;
|
|
++m_last;
|
|
m_last &= 0xffff;
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(30)">../src/peer_connection.cpp:988</a></td><td>this should only be peers we're trying to download from</td></tr><tr id="30" style="display: none;" colspan="3"><td colspan="3"><h2>this should only be peers we're trying to download from</h2><h4>../src/peer_connection.cpp:988</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> time_duration peer_connection::download_queue_time(int extra_bytes) const
|
|
{
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
TORRENT_ASSERT(t);
|
|
|
|
int rate = 0;
|
|
|
|
// if we haven't received any data recently, the current download rate
|
|
// is not representative
|
|
if (time_now() - m_last_piece > seconds(30) && m_download_rate_peak > 0)
|
|
{
|
|
rate = m_download_rate_peak;
|
|
}
|
|
else if (time_now() - m_last_unchoked < seconds(5)
|
|
&& m_statistics.total_payload_upload() < 2 * 0x4000)
|
|
{
|
|
// if we're have only been unchoked for a short period of time,
|
|
// we don't know what rate we can get from this peer. Instead of assuming
|
|
// the lowest possible rate, assume the average.
|
|
|
|
<div style="background: #ffff00" width="100%"> int peers_with_requests = m_ses.num_connections();
|
|
</div> // avoid division by 0
|
|
if (peers_with_requests == 0) peers_with_requests = 1;
|
|
|
|
rate = m_ses.m_stat.transfer_rate(stat::download_payload) / peers_with_requests;
|
|
}
|
|
else
|
|
{
|
|
// current download rate in bytes per seconds
|
|
rate = m_statistics.transfer_rate(stat::download_payload)
|
|
+ m_statistics.transfer_rate(stat::download_protocol);
|
|
}
|
|
|
|
// avoid division by zero
|
|
if (rate < 50) rate = 50;
|
|
|
|
// average of current rate and peak
|
|
// rate = (rate + m_download_rate_peak) / 2;
|
|
|
|
return seconds((m_outstanding_bytes + m_queued_time_critical * t->block_size()) / rate);
|
|
}
|
|
|
|
void peer_connection::add_stat(size_type downloaded, size_type uploaded)
|
|
{
|
|
m_statistics.add_stat(downloaded, uploaded);
|
|
}
|
|
|
|
bitfield const& peer_connection::get_bitfield() const
|
|
{
|
|
return m_have_piece;
|
|
}
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(31)">../src/peer_connection.cpp:2744</a></td><td>this might need something more so that once we have the metadata we can construct a full bitfield</td></tr><tr id="31" style="display: none;" colspan="3"><td colspan="3"><h2>this might need something more
|
|
so that once we have the metadata
|
|
we can construct a full bitfield</h2><h4>../src/peer_connection.cpp:2744</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
peer_log("*** THIS IS A SEED [ p: %p ]", m_peer_info);
|
|
#endif
|
|
|
|
t->get_policy().set_seed(m_peer_info, true);
|
|
m_upload_only = true;
|
|
m_bitfield_received = true;
|
|
|
|
// if we don't have metadata yet
|
|
// just remember the bitmask
|
|
// don't update the piecepicker
|
|
// (since it doesn't exist yet)
|
|
if (!t->ready_for_connections())
|
|
{
|
|
// assume seeds are interesting when we
|
|
// don't even have the metadata
|
|
t->get_policy().peer_is_interesting(*this);
|
|
|
|
disconnect_if_redundant();
|
|
<div style="background: #ffff00" width="100%"> return;
|
|
</div> }
|
|
|
|
TORRENT_ASSERT(!m_have_piece.empty());
|
|
m_have_piece.set_all();
|
|
m_num_pieces = m_have_piece.size();
|
|
|
|
t->peer_has_all(this);
|
|
|
|
// if we're finished, we're not interested
|
|
if (t->is_upload_only()) send_not_interested();
|
|
else t->get_policy().peer_is_interesting(*this);
|
|
|
|
disconnect_if_redundant();
|
|
}
|
|
|
|
// -----------------------------
|
|
// --------- HAVE NONE ---------
|
|
// -----------------------------
|
|
|
|
void peer_connection::incoming_have_none()
|
|
{
|
|
INVARIANT_CHECK;
|
|
|
|
#ifdef TORRENT_VERBOSE_LOGGING
|
|
peer_log("<== HAVE_NONE");
|
|
#endif
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
TORRENT_ASSERT(t);
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(32)">../src/peer_connection.cpp:2875</a></td><td>sort the allowed fast set in priority order</td></tr><tr id="32" style="display: none;" colspan="3"><td colspan="3"><h2>sort the allowed fast set in priority order</h2><h4>../src/peer_connection.cpp:2875</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // this piece index later
|
|
m_allowed_fast.push_back(index);
|
|
|
|
// if the peer has the piece and we want
|
|
// to download it, request it
|
|
if (int(m_have_piece.size()) > index
|
|
&& m_have_piece[index]
|
|
&& t->valid_metadata()
|
|
&& t->has_picker()
|
|
&& t->picker().piece_priority(index) > 0)
|
|
{
|
|
t->get_policy().peer_is_interesting(*this);
|
|
}
|
|
}
|
|
|
|
std::vector<int> const& peer_connection::allowed_fast()
|
|
{
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
TORRENT_ASSERT(t);
|
|
|
|
<div style="background: #ffff00" width="100%"> return m_allowed_fast;
|
|
</div> }
|
|
|
|
bool peer_connection::can_request_time_critical() const
|
|
{
|
|
if (has_peer_choked() || !is_interesting()) return false;
|
|
if ((int)m_download_queue.size() + (int)m_request_queue.size()
|
|
> m_desired_queue_size * 2) return false;
|
|
if (on_parole()) return false;
|
|
if (m_disconnecting) return false;
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
TORRENT_ASSERT(t);
|
|
if (t->upload_mode()) return false;
|
|
|
|
// ignore snubbed peers, since they're not likely to return pieces in a
|
|
// timely manner anyway
|
|
if (m_snubbed) return false;
|
|
return true;
|
|
}
|
|
|
|
bool peer_connection::make_time_critical(piece_block const& block)
|
|
{
|
|
std::vector<pending_block>::iterator rit = std::find_if(m_request_queue.begin()
|
|
, m_request_queue.end(), has_block(block));
|
|
if (rit == m_request_queue.end()) return false;
|
|
#if TORRENT_USE_ASSERTS
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
TORRENT_ASSERT(t);
|
|
TORRENT_ASSERT(t->has_picker());
|
|
TORRENT_ASSERT(t->picker().is_requested(block));
|
|
#endif
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(33)">../src/peer_connection.cpp:4539</a></td><td>peers should really be corked/uncorked outside of all completed disk operations</td></tr><tr id="33" style="display: none;" colspan="3"><td colspan="3"><h2>peers should really be corked/uncorked outside of
|
|
all completed disk operations</h2><h4>../src/peer_connection.cpp:4539</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // this means we're in seed mode and we haven't yet
|
|
// verified this piece (r.piece)
|
|
t->filesystem().async_read_and_hash(r, boost::bind(&peer_connection::on_disk_read_complete
|
|
, self(), _1, _2, r), cache.second);
|
|
t->verified(r.piece);
|
|
}
|
|
|
|
m_reading_bytes += r.length;
|
|
|
|
m_requests.erase(m_requests.begin());
|
|
sent_a_piece = true;
|
|
}
|
|
|
|
if (t->share_mode() && sent_a_piece)
|
|
t->recalc_share_mode();
|
|
}
|
|
|
|
void peer_connection::on_disk_read_complete(int ret, disk_io_job const& j, peer_request r)
|
|
{
|
|
// flush send buffer at the end of this scope
|
|
<div style="background: #ffff00" width="100%"> cork _c(*this);
|
|
</div>
|
|
#ifdef TORRENT_STATS
|
|
++m_ses.m_num_messages[aux::session_impl::on_disk_read_counter];
|
|
#endif
|
|
TORRENT_ASSERT(m_ses.is_network_thread());
|
|
|
|
m_reading_bytes -= r.length;
|
|
|
|
disk_buffer_holder buffer(m_ses, j.buffer);
|
|
#if TORRENT_DISK_STATS
|
|
if (j.buffer) m_ses.m_disk_thread.rename_buffer(j.buffer, "received send buffer");
|
|
#endif
|
|
|
|
boost::shared_ptr<torrent> t = m_torrent.lock();
|
|
if (!t)
|
|
{
|
|
disconnect(j.error);
|
|
return;
|
|
}
|
|
|
|
if (ret != r.length)
|
|
{
|
|
if (ret == -3)
|
|
{
|
|
#if defined TORRENT_VERBOSE_LOGGING
|
|
peer_log("==> REJECT_PIECE [ piece: %d s: %d l: %d ]"
|
|
, r.piece , r.start , r.length);
|
|
#endif
|
|
write_reject_request(r);
|
|
if (t->seed_mode()) t->leave_seed_mode(false);
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(34)">../src/policy.cpp:888</a></td><td>only allow _one_ connection to use this override at a time</td></tr><tr id="34" style="display: none;" colspan="3"><td colspan="3"><h2>only allow _one_ connection to use this
|
|
override at a time</h2><h4>../src/policy.cpp:888</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> " external: " << external.external_address(m_peers[candidate]->address()) <<
|
|
" t: " << (session_time - m_peers[candidate]->last_connected) <<
|
|
" ]\n";
|
|
}
|
|
#endif
|
|
|
|
if (candidate == -1) return m_peers.end();
|
|
return m_peers.begin() + candidate;
|
|
}
|
|
|
|
bool policy::new_connection(peer_connection& c, int session_time)
|
|
{
|
|
TORRENT_ASSERT(!c.is_outgoing());
|
|
|
|
INVARIANT_CHECK;
|
|
|
|
// if the connection comes from the tracker,
|
|
// it's probably just a NAT-check. Ignore the
|
|
// num connections constraint then.
|
|
|
|
<div style="background: #ffff00" width="100%"> error_code ec;
|
|
</div> TORRENT_ASSERT(c.remote() == c.get_socket()->remote_endpoint(ec) || ec);
|
|
TORRENT_ASSERT(!m_torrent->is_paused());
|
|
|
|
#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING
|
|
if (c.remote().address() == m_torrent->current_tracker().address())
|
|
{
|
|
m_torrent->debug_log("overriding connection limit for tracker NAT-check");
|
|
}
|
|
#endif
|
|
|
|
iterator iter;
|
|
peer* i = 0;
|
|
|
|
bool found = false;
|
|
if (m_torrent->settings().allow_multiple_connections_per_ip)
|
|
{
|
|
tcp::endpoint remote = c.remote();
|
|
std::pair<iterator, iterator> range = find_peers(remote.address());
|
|
iter = std::find_if(range.first, range.second, match_peer_endpoint(remote));
|
|
|
|
if (iter != range.second)
|
|
{
|
|
TORRENT_ASSERT((*iter)->in_use);
|
|
found = true;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
iter = std::lower_bound(
|
|
m_peers.begin(), m_peers.end()
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(35)">../src/session_impl.cpp:1767</a></td><td>recalculate all connect candidates for all torrents</td></tr><tr id="35" style="display: none;" colspan="3"><td colspan="3"><h2>recalculate all connect candidates for all torrents</h2><h4>../src/session_impl.cpp:1767</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // #error closing the udp socket here means that
|
|
// the uTP connections cannot be closed gracefully
|
|
m_udp_socket.close();
|
|
m_external_udp_port = 0;
|
|
|
|
m_undead_peers.clear();
|
|
|
|
#ifndef TORRENT_DISABLE_GEO_IP
|
|
if (m_asnum_db) GeoIP_delete(m_asnum_db);
|
|
if (m_country_db) GeoIP_delete(m_country_db);
|
|
m_asnum_db = 0;
|
|
m_country_db = 0;
|
|
#endif
|
|
|
|
m_disk_thread.abort();
|
|
}
|
|
|
|
void session_impl::set_port_filter(port_filter const& f)
|
|
{
|
|
m_port_filter = f;
|
|
<div style="background: #ffff00" width="100%"> }
|
|
</div>
|
|
void session_impl::set_ip_filter(ip_filter const& f)
|
|
{
|
|
INVARIANT_CHECK;
|
|
|
|
m_ip_filter = f;
|
|
|
|
// Close connections whose endpoint is filtered
|
|
// by the new ip-filter
|
|
for (torrent_map::iterator i = m_torrents.begin()
|
|
, end(m_torrents.end()); i != end; ++i)
|
|
i->second->ip_filter_updated();
|
|
}
|
|
|
|
ip_filter const& session_impl::get_ip_filter() const
|
|
{
|
|
return m_ip_filter;
|
|
}
|
|
|
|
void session_impl::update_disk_thread_settings()
|
|
{
|
|
disk_io_job j;
|
|
j.buffer = (char*)new session_settings(m_settings);
|
|
j.action = disk_io_job::update_settings;
|
|
m_disk_thread.add_job(j);
|
|
}
|
|
|
|
template <class Socket>
|
|
void static set_socket_buffer_size(Socket& s, session_settings const& sett, error_code& ec)
|
|
{
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(36)">../src/session_impl.cpp:3236</a></td><td>have a separate list for these connections, instead of having to loop through all of them</td></tr><tr id="36" style="display: none;" colspan="3"><td colspan="3"><h2>have a separate list for these connections, instead of having to loop through all of them</h2><h4>../src/session_impl.cpp:3236</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // --------------------------------------------------------------
|
|
if (!m_paused) m_auto_manage_time_scaler--;
|
|
if (m_auto_manage_time_scaler < 0)
|
|
{
|
|
m_auto_manage_time_scaler = settings().auto_manage_interval;
|
|
recalculate_auto_managed_torrents();
|
|
}
|
|
|
|
// --------------------------------------------------------------
|
|
// check for incoming connections that might have timed out
|
|
// --------------------------------------------------------------
|
|
|
|
for (connection_map::iterator i = m_connections.begin();
|
|
i != m_connections.end();)
|
|
{
|
|
peer_connection* p = (*i).get();
|
|
++i;
|
|
// ignore connections that already have a torrent, since they
|
|
// are ticked through the torrents' second_tick
|
|
if (!p->associated_torrent().expired()) continue;
|
|
<div style="background: #ffff00" width="100%"> if (m_last_tick - p->connected_time() > seconds(m_settings.handshake_timeout))
|
|
</div> p->disconnect(errors::timed_out);
|
|
}
|
|
|
|
// --------------------------------------------------------------
|
|
// second_tick every torrent
|
|
// --------------------------------------------------------------
|
|
|
|
int congested_torrents = 0;
|
|
int uncongested_torrents = 0;
|
|
|
|
// count the number of seeding torrents vs. downloading
|
|
// torrents we are running
|
|
int num_seeds = 0;
|
|
int num_downloads = 0;
|
|
|
|
// count the number of peers of downloading torrents
|
|
int num_downloads_peers = 0;
|
|
|
|
torrent_map::iterator least_recently_scraped = m_torrents.end();
|
|
int num_paused_auto_managed = 0;
|
|
|
|
int num_checking = 0;
|
|
int num_queued = 0;
|
|
for (torrent_map::iterator i = m_torrents.begin();
|
|
i != m_torrents.end();)
|
|
{
|
|
torrent& t = *i->second;
|
|
TORRENT_ASSERT(!t.is_aborted());
|
|
if (t.statistics().upload_rate() * 11 / 10 > t.upload_limit())
|
|
++congested_torrents;
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(37)">../src/session_impl.cpp:4299</a></td><td>allow extensions to sort torrents for queuing</td></tr><tr id="37" style="display: none;" colspan="3"><td colspan="3"><h2>allow extensions to sort torrents for queuing</h2><h4>../src/session_impl.cpp:4299</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (t->is_auto_managed() && !t->has_error())
|
|
{
|
|
TORRENT_ASSERT(t->m_resume_data_loaded || !t->valid_metadata());
|
|
// this torrent is auto managed, add it to
|
|
// the list (depending on if it's a seed or not)
|
|
if (t->is_finished())
|
|
seeds.push_back(t);
|
|
else
|
|
downloaders.push_back(t);
|
|
}
|
|
else if (!t->is_paused())
|
|
{
|
|
TORRENT_ASSERT(t->m_resume_data_loaded || !t->valid_metadata());
|
|
--hard_limit;
|
|
}
|
|
}
|
|
|
|
bool handled_by_extension = false;
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
<div style="background: #ffff00" width="100%">#endif
|
|
</div>
|
|
if (!handled_by_extension)
|
|
{
|
|
std::sort(downloaders.begin(), downloaders.end()
|
|
, boost::bind(&torrent::sequence_number, _1) < boost::bind(&torrent::sequence_number, _2));
|
|
|
|
std::sort(seeds.begin(), seeds.end()
|
|
, boost::bind(&torrent::seed_rank, _1, boost::ref(m_settings))
|
|
> boost::bind(&torrent::seed_rank, _2, boost::ref(m_settings)));
|
|
}
|
|
|
|
if (settings().auto_manage_prefer_seeds)
|
|
{
|
|
auto_manage_torrents(seeds, dht_limit, tracker_limit, lsd_limit
|
|
, hard_limit, num_seeds);
|
|
auto_manage_torrents(downloaders, dht_limit, tracker_limit, lsd_limit
|
|
, hard_limit, num_downloaders);
|
|
}
|
|
else
|
|
{
|
|
auto_manage_torrents(downloaders, dht_limit, tracker_limit, lsd_limit
|
|
, hard_limit, num_downloaders);
|
|
auto_manage_torrents(seeds, dht_limit, tracker_limit, lsd_limit
|
|
, hard_limit, num_seeds);
|
|
}
|
|
}
|
|
|
|
void session_impl::recalculate_optimistic_unchoke_slots()
|
|
{
|
|
TORRENT_ASSERT(is_network_thread());
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(38)">../src/session_impl.cpp:4464</a></td><td>use a lower limit than m_settings.connections_limit to allocate the to 10% or so of connection slots for incoming connections</td></tr><tr id="38" style="display: none;" colspan="3"><td colspan="3"><h2>use a lower limit than m_settings.connections_limit
|
|
to allocate the to 10% or so of connection slots for incoming
|
|
connections</h2><h4>../src/session_impl.cpp:4464</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
if (m_boost_connections > max_connections)
|
|
{
|
|
m_boost_connections -= max_connections;
|
|
max_connections = 0;
|
|
}
|
|
else
|
|
{
|
|
max_connections -= m_boost_connections;
|
|
m_boost_connections = 0;
|
|
}
|
|
}
|
|
|
|
// this logic is here to smooth out the number of new connection
|
|
// attempts over time, to prevent connecting a large number of
|
|
// sockets, wait 10 seconds, and then try again
|
|
int limit = (std::min)(m_settings.connections_limit - num_connections(), free_slots);
|
|
if (m_settings.smooth_connects && max_connections > (limit+1) / 2)
|
|
max_connections = (limit+1) / 2;
|
|
|
|
<div style="background: #ffff00" width="100%"> if (!m_torrents.empty()
|
|
</div> && free_slots > -m_half_open.limit()
|
|
&& num_connections() < m_settings.connections_limit
|
|
&& !m_abort
|
|
&& m_settings.connection_speed > 0
|
|
&& max_connections > 0)
|
|
{
|
|
// this is the maximum number of connections we will
|
|
// attempt this tick
|
|
int average_peers = 0;
|
|
if (num_downloads > 0)
|
|
average_peers = num_downloads_peers / num_downloads;
|
|
|
|
if (m_next_connect_torrent == m_torrents.end())
|
|
m_next_connect_torrent = m_torrents.begin();
|
|
|
|
int steps_since_last_connect = 0;
|
|
int num_torrents = int(m_torrents.size());
|
|
for (;;)
|
|
{
|
|
torrent& t = *m_next_connect_torrent->second;
|
|
if (t.want_more_peers())
|
|
{
|
|
TORRENT_ASSERT(t.allows_peers());
|
|
// have a bias to give more connection attempts
|
|
// to downloading torrents than seed, and even
|
|
// more to downloading torrents with less than
|
|
// average number of connections
|
|
int num_attempts = 1;
|
|
if (!t.is_finished())
|
|
{
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(39)">../src/session_impl.cpp:4498</a></td><td>make this bias configurable</td></tr><tr id="39" style="display: none;" colspan="3"><td colspan="3"><h2>make this bias configurable</h2><h4>../src/session_impl.cpp:4498</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"></pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(40)">../src/session_impl.cpp:4499</a></td><td>also take average_peers into account, to create a bias for downloading torrents with < average peers</td></tr><tr id="40" style="display: none;" colspan="3"><td colspan="3"><h2>also take average_peers into account, to create a bias for downloading torrents with < average peers</h2><h4>../src/session_impl.cpp:4499</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> average_peers = num_downloads_peers / num_downloads;
|
|
|
|
if (m_next_connect_torrent == m_torrents.end())
|
|
m_next_connect_torrent = m_torrents.begin();
|
|
|
|
int steps_since_last_connect = 0;
|
|
int num_torrents = int(m_torrents.size());
|
|
for (;;)
|
|
{
|
|
torrent& t = *m_next_connect_torrent->second;
|
|
if (t.want_more_peers())
|
|
{
|
|
TORRENT_ASSERT(t.allows_peers());
|
|
// have a bias to give more connection attempts
|
|
// to downloading torrents than seed, and even
|
|
// more to downloading torrents with less than
|
|
// average number of connections
|
|
int num_attempts = 1;
|
|
if (!t.is_finished())
|
|
{
|
|
<div style="background: #ffff00" width="100%"> TORRENT_ASSERT(m_num_active_downloading > 0);
|
|
</div> num_attempts += m_num_active_finished / m_num_active_downloading;
|
|
}
|
|
while (m_current_connect_attempts < num_attempts)
|
|
{
|
|
TORRENT_TRY
|
|
{
|
|
++m_current_connect_attempts;
|
|
if (t.try_connect_peer())
|
|
{
|
|
--max_connections;
|
|
--free_slots;
|
|
steps_since_last_connect = 0;
|
|
#ifdef TORRENT_STATS
|
|
++m_connection_attempts;
|
|
#endif
|
|
}
|
|
}
|
|
TORRENT_CATCH(std::bad_alloc&)
|
|
{
|
|
// we ran out of memory trying to connect to a peer
|
|
// lower the global limit to the number of peers
|
|
// we already have
|
|
m_settings.connections_limit = num_connections();
|
|
if (m_settings.connections_limit < 2) m_settings.connections_limit = 2;
|
|
}
|
|
if (!t.want_more_peers()) break;
|
|
if (free_slots <= -m_half_open.limit()) return;
|
|
if (max_connections == 0) return;
|
|
if (num_connections() >= m_settings.connections_limit) return;
|
|
}
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(41)">../src/session_impl.cpp:4609</a></td><td>post a message to have this happen immediately instead of waiting for the next tick</td></tr><tr id="41" style="display: none;" colspan="3"><td colspan="3"><h2>post a message to have this happen
|
|
immediately instead of waiting for the next tick</h2><h4>../src/session_impl.cpp:4609</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
// we've unchoked this peer, and it hasn't reciprocated
|
|
// we may want to increase our estimated reciprocation rate
|
|
p->increase_est_reciprocation_rate();
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!p->is_peer_interested()
|
|
|| p->is_disconnecting()
|
|
|| p->is_connecting())
|
|
{
|
|
// this peer is not unchokable. So, if it's unchoked
|
|
// already, make sure to choke it.
|
|
if (p->is_choked()) continue;
|
|
if (pi && pi->optimistically_unchoked)
|
|
{
|
|
pi->optimistically_unchoked = false;
|
|
// force a new optimistic unchoke
|
|
m_optimistic_unchoke_time_scaler = 0;
|
|
<div style="background: #ffff00" width="100%"> }
|
|
</div> t->choke_peer(*p);
|
|
continue;
|
|
}
|
|
peers.push_back(p.get());
|
|
}
|
|
|
|
if (m_settings.choking_algorithm == session_settings::rate_based_choker)
|
|
{
|
|
m_allowed_upload_slots = 0;
|
|
std::sort(peers.begin(), peers.end()
|
|
, boost::bind(&peer_connection::upload_rate_compare, _1, _2));
|
|
|
|
#ifdef TORRENT_DEBUG
|
|
for (std::vector<peer_connection*>::const_iterator i = peers.begin()
|
|
, end(peers.end()), prev(peers.end()); i != end; ++i)
|
|
{
|
|
if (prev != end)
|
|
{
|
|
boost::shared_ptr<torrent> t1 = (*prev)->associated_torrent().lock();
|
|
TORRENT_ASSERT(t1);
|
|
boost::shared_ptr<torrent> t2 = (*i)->associated_torrent().lock();
|
|
TORRENT_ASSERT(t2);
|
|
TORRENT_ASSERT((*prev)->uploaded_in_last_round() * 1000
|
|
* (1 + t1->priority()) / total_milliseconds(unchoke_interval)
|
|
>= (*i)->uploaded_in_last_round() * 1000
|
|
* (1 + t2->priority()) / total_milliseconds(unchoke_interval));
|
|
}
|
|
prev = i;
|
|
}
|
|
#endif
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(42)">../src/session_impl.cpp:4643</a></td><td>make configurable</td></tr><tr id="42" style="display: none;" colspan="3"><td colspan="3"><h2>make configurable</h2><h4>../src/session_impl.cpp:4643</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
#ifdef TORRENT_DEBUG
|
|
for (std::vector<peer_connection*>::const_iterator i = peers.begin()
|
|
, end(peers.end()), prev(peers.end()); i != end; ++i)
|
|
{
|
|
if (prev != end)
|
|
{
|
|
boost::shared_ptr<torrent> t1 = (*prev)->associated_torrent().lock();
|
|
TORRENT_ASSERT(t1);
|
|
boost::shared_ptr<torrent> t2 = (*i)->associated_torrent().lock();
|
|
TORRENT_ASSERT(t2);
|
|
TORRENT_ASSERT((*prev)->uploaded_in_last_round() * 1000
|
|
* (1 + t1->priority()) / total_milliseconds(unchoke_interval)
|
|
>= (*i)->uploaded_in_last_round() * 1000
|
|
* (1 + t2->priority()) / total_milliseconds(unchoke_interval));
|
|
}
|
|
prev = i;
|
|
}
|
|
#endif
|
|
|
|
<div style="background: #ffff00" width="100%"> int rate_threshold = 1024;
|
|
</div>
|
|
for (std::vector<peer_connection*>::const_iterator i = peers.begin()
|
|
, end(peers.end()); i != end; ++i)
|
|
{
|
|
peer_connection const& p = **i;
|
|
int rate = int(p.uploaded_in_last_round()
|
|
* 1000 / total_milliseconds(unchoke_interval));
|
|
|
|
if (rate < rate_threshold) break;
|
|
|
|
++m_allowed_upload_slots;
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(43)">../src/session_impl.cpp:4657</a></td><td>make configurable</td></tr><tr id="43" style="display: none;" colspan="3"><td colspan="3"><h2>make configurable</h2><h4>../src/session_impl.cpp:4657</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> >= (*i)->uploaded_in_last_round() * 1000
|
|
* (1 + t2->priority()) / total_milliseconds(unchoke_interval));
|
|
}
|
|
prev = i;
|
|
}
|
|
#endif
|
|
|
|
int rate_threshold = 1024;
|
|
|
|
for (std::vector<peer_connection*>::const_iterator i = peers.begin()
|
|
, end(peers.end()); i != end; ++i)
|
|
{
|
|
peer_connection const& p = **i;
|
|
int rate = int(p.uploaded_in_last_round()
|
|
* 1000 / total_milliseconds(unchoke_interval));
|
|
|
|
if (rate < rate_threshold) break;
|
|
|
|
++m_allowed_upload_slots;
|
|
|
|
<div style="background: #ffff00" width="100%"> rate_threshold += 1024;
|
|
</div> }
|
|
// allow one optimistic unchoke
|
|
++m_allowed_upload_slots;
|
|
}
|
|
|
|
if (m_settings.choking_algorithm == session_settings::bittyrant_choker)
|
|
{
|
|
// if we're using the bittyrant choker, sort peers by their return
|
|
// on investment. i.e. download rate / upload rate
|
|
std::sort(peers.begin(), peers.end()
|
|
, boost::bind(&peer_connection::bittyrant_unchoke_compare, _1, _2));
|
|
}
|
|
else
|
|
{
|
|
// sorts the peers that are eligible for unchoke by download rate and secondary
|
|
// by total upload. The reason for this is, if all torrents are being seeded,
|
|
// the download rate will be 0, and the peers we have sent the least to should
|
|
// be unchoked
|
|
std::sort(peers.begin(), peers.end()
|
|
, boost::bind(&peer_connection::unchoke_compare, _1, _2));
|
|
}
|
|
|
|
// auto unchoke
|
|
int upload_limit = m_bandwidth_channel[peer_connection::upload_channel]->throttle();
|
|
if (m_settings.choking_algorithm == session_settings::auto_expand_choker
|
|
&& upload_limit > 0)
|
|
{
|
|
// if our current upload rate is less than 90% of our
|
|
// limit AND most torrents are not "congested", i.e.
|
|
// they are not holding back because of a per-torrent
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(44)">../src/storage.cpp:324</a></td><td>if the read fails, set error and exit immediately</td></tr><tr id="44" style="display: none;" colspan="3"><td colspan="3"><h2>if the read fails, set error and exit immediately</h2><h4>../src/storage.cpp:324</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (m_storage->disk_pool()) block_size = m_storage->disk_pool()->block_size();
|
|
int size = slot_size;
|
|
int num_blocks = (size + block_size - 1) / block_size;
|
|
|
|
// when we optimize for speed we allocate all the buffers we
|
|
// need for the rest of the piece, and read it all in one call
|
|
// and then hash it. When optimizing for memory usage, we read
|
|
// one block at a time and hash it. This ends up only using a
|
|
// single buffer
|
|
if (m_storage->settings().optimize_hashing_for_speed)
|
|
{
|
|
file::iovec_t* bufs = TORRENT_ALLOCA(file::iovec_t, num_blocks);
|
|
for (int i = 0; i < num_blocks; ++i)
|
|
{
|
|
bufs[i].iov_base = m_storage->disk_pool()->allocate_buffer("hash temp");
|
|
bufs[i].iov_len = (std::min)(block_size, size);
|
|
size -= bufs[i].iov_len;
|
|
}
|
|
// deliberately pass in 0 as flags, to disable random_access
|
|
num_read = m_storage->readv(bufs, slot, ph.offset, num_blocks, 0);
|
|
<div style="background: #ffff00" width="100%">
|
|
</div> for (int i = 0; i < num_blocks; ++i)
|
|
{
|
|
if (small_hash && small_piece_size <= block_size)
|
|
{
|
|
ph.h.update((char const*)bufs[i].iov_base, small_piece_size);
|
|
*small_hash = hasher(ph.h).final();
|
|
small_hash = 0; // avoid this case again
|
|
if (int(bufs[i].iov_len) > small_piece_size)
|
|
ph.h.update((char const*)bufs[i].iov_base + small_piece_size
|
|
, bufs[i].iov_len - small_piece_size);
|
|
}
|
|
else
|
|
{
|
|
ph.h.update((char const*)bufs[i].iov_base, bufs[i].iov_len);
|
|
small_piece_size -= bufs[i].iov_len;
|
|
}
|
|
ph.offset += bufs[i].iov_len;
|
|
m_storage->disk_pool()->free_buffer((char*)bufs[i].iov_base);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
file::iovec_t buf;
|
|
disk_buffer_holder holder(*m_storage->disk_pool()
|
|
, m_storage->disk_pool()->allocate_buffer("hash temp"));
|
|
buf.iov_base = holder.get();
|
|
for (int i = 0; i < num_blocks; ++i)
|
|
{
|
|
buf.iov_len = (std::min)(block_size, size);
|
|
// deliberately pass in 0 as flags, to disable random_access
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(45)">../src/storage.cpp:358</a></td><td>if the read fails, set error and exit immediately</td></tr><tr id="45" style="display: none;" colspan="3"><td colspan="3"><h2>if the read fails, set error and exit immediately</h2><h4>../src/storage.cpp:358</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
ph.h.update((char const*)bufs[i].iov_base, bufs[i].iov_len);
|
|
small_piece_size -= bufs[i].iov_len;
|
|
}
|
|
ph.offset += bufs[i].iov_len;
|
|
m_storage->disk_pool()->free_buffer((char*)bufs[i].iov_base);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
file::iovec_t buf;
|
|
disk_buffer_holder holder(*m_storage->disk_pool()
|
|
, m_storage->disk_pool()->allocate_buffer("hash temp"));
|
|
buf.iov_base = holder.get();
|
|
for (int i = 0; i < num_blocks; ++i)
|
|
{
|
|
buf.iov_len = (std::min)(block_size, size);
|
|
// deliberately pass in 0 as flags, to disable random_access
|
|
int ret = m_storage->readv(&buf, slot, ph.offset, 1, 0);
|
|
if (ret > 0) num_read += ret;
|
|
<div style="background: #ffff00" width="100%">
|
|
</div> if (small_hash && small_piece_size <= block_size)
|
|
{
|
|
if (small_piece_size > 0) ph.h.update((char const*)buf.iov_base, small_piece_size);
|
|
*small_hash = hasher(ph.h).final();
|
|
small_hash = 0; // avoid this case again
|
|
if (int(buf.iov_len) > small_piece_size)
|
|
ph.h.update((char const*)buf.iov_base + small_piece_size
|
|
, buf.iov_len - small_piece_size);
|
|
}
|
|
else
|
|
{
|
|
ph.h.update((char const*)buf.iov_base, buf.iov_len);
|
|
small_piece_size -= buf.iov_len;
|
|
}
|
|
|
|
ph.offset += buf.iov_len;
|
|
size -= buf.iov_len;
|
|
}
|
|
}
|
|
if (error()) return 0;
|
|
}
|
|
return num_read;
|
|
}
|
|
|
|
default_storage::default_storage(file_storage const& fs, file_storage const* mapped, std::string const& path
|
|
, file_pool& fp, std::vector<boost::uint8_t> const& file_prio)
|
|
: m_files(fs)
|
|
, m_file_priority(file_prio)
|
|
, m_pool(fp)
|
|
, m_page_size(page_size())
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(46)">../src/storage.cpp:633</a></td><td>make this more generic to not just work if files have been renamed, but also if they have been merged into a single file for instance maybe use the same format as .torrent files and reuse some code from torrent_info</td></tr><tr id="46" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
|
renamed, but also if they have been merged into a single file for instance
|
|
maybe use the same format as .torrent files and reuse some code from torrent_info</h2><h4>../src/storage.cpp:633</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> for (;;)
|
|
{
|
|
if (file_offset < files().file_size(file_index))
|
|
break;
|
|
|
|
file_offset -= files().file_size(file_index);
|
|
++file_index;
|
|
TORRENT_ASSERT(file_index != files().num_files());
|
|
}
|
|
|
|
error_code ec;
|
|
boost::intrusive_ptr<file> file_handle = open_file(file_index, file::read_only, ec);
|
|
if (!file_handle || ec) return slot;
|
|
|
|
size_type data_start = file_handle->sparse_end(file_offset);
|
|
return int((data_start + files().piece_length() - 1) / files().piece_length());
|
|
}
|
|
|
|
bool default_storage::verify_resume_data(lazy_entry const& rd, error_code& error)
|
|
{
|
|
<div style="background: #ffff00" width="100%"> lazy_entry const* mapped_files = rd.dict_find_list("mapped_files");
|
|
</div> if (mapped_files && mapped_files->list_size() == m_files.num_files())
|
|
{
|
|
m_mapped_files.reset(new file_storage(m_files));
|
|
for (int i = 0; i < m_files.num_files(); ++i)
|
|
{
|
|
std::string new_filename = mapped_files->list_string_value_at(i);
|
|
if (new_filename.empty()) continue;
|
|
m_mapped_files->rename_file(i, new_filename);
|
|
}
|
|
}
|
|
|
|
lazy_entry const* file_priority = rd.dict_find_list("file_priority");
|
|
if (file_priority && file_priority->list_size()
|
|
== files().num_files())
|
|
{
|
|
m_file_priority.resize(file_priority->list_size());
|
|
for (int i = 0; i < file_priority->list_size(); ++i)
|
|
m_file_priority[i] = boost::uint8_t(file_priority->list_int_value_at(i, 1));
|
|
}
|
|
|
|
std::vector<std::pair<size_type, std::time_t> > file_sizes;
|
|
lazy_entry const* file_sizes_ent = rd.dict_find_list("file sizes");
|
|
if (file_sizes_ent == 0)
|
|
{
|
|
error = errors::missing_file_sizes;
|
|
return false;
|
|
}
|
|
|
|
for (int i = 0; i < file_sizes_ent->list_size(); ++i)
|
|
{
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(47)">../src/storage.cpp:1269</a></td><td>what if file_base is used to merge several virtual files into a single physical file? We should probably disable this if file_base is used. This is not a widely used feature though</td></tr><tr id="47" style="display: none;" colspan="3"><td colspan="3"><h2>what if file_base is used to merge several virtual files
|
|
into a single physical file? We should probably disable this
|
|
if file_base is used. This is not a widely used feature though</h2><h4>../src/storage.cpp:1269</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> int bytes_transferred = 0;
|
|
// if the file is opened in no_buffer mode, and the
|
|
// read is unaligned, we need to fall back on a slow
|
|
// special read that reads aligned buffers and copies
|
|
// it into the one supplied
|
|
size_type adjusted_offset = files().file_base(file_index) + file_offset;
|
|
if ((file_handle->open_mode() & file::no_buffer)
|
|
&& ((adjusted_offset & (file_handle->pos_alignment()-1)) != 0
|
|
|| (uintptr_t(tmp_bufs->iov_base) & (file_handle->buf_alignment()-1)) != 0))
|
|
{
|
|
bytes_transferred = (int)(this->*op.unaligned_op)(file_handle, adjusted_offset
|
|
, tmp_bufs, num_tmp_bufs, ec);
|
|
if ((op.mode & file::rw_mask) != file::read_only
|
|
&& adjusted_offset + bytes_transferred >= files().file_size(file_index)
|
|
&& (file_handle->pos_alignment() > 0 || file_handle->size_alignment() > 0))
|
|
{
|
|
// we were writing, and we just wrote the last block of the file
|
|
// we likely wrote a bit too much, since we're restricted to
|
|
// a specific alignment for writes. Make sure to truncate the size
|
|
|
|
<div style="background: #ffff00" width="100%"> file_handle->set_size(files().file_size(file_index), ec);
|
|
</div> }
|
|
}
|
|
else
|
|
{
|
|
bytes_transferred = (int)((*file_handle).*op.regular_op)(adjusted_offset
|
|
, tmp_bufs, num_tmp_bufs, ec);
|
|
TORRENT_ASSERT(bytes_transferred <= bufs_size(tmp_bufs, num_tmp_bufs));
|
|
}
|
|
file_offset = 0;
|
|
|
|
if (ec)
|
|
{
|
|
set_error(files().file_path(file_index, m_save_path), ec);
|
|
return -1;
|
|
}
|
|
|
|
if (file_bytes_left != bytes_transferred)
|
|
return bytes_transferred;
|
|
|
|
advance_bufs(current_buf, bytes_transferred);
|
|
TORRENT_ASSERT(count_bufs(current_buf, bytes_left - file_bytes_left) <= num_bufs);
|
|
}
|
|
return size;
|
|
}
|
|
|
|
// these functions are inefficient, but should be fairly uncommon. The read
|
|
// case happens if unaligned files are opened in no_buffer mode or if clients
|
|
// makes unaligned requests (and the disk cache is disabled or fully utilized
|
|
// for write cache).
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(48)">../src/torrent.cpp:1234</a></td><td>is verify_peer_cert called once per certificate in the chain, and this function just tells us which depth we're at right now? If so, the comment makes sense. any certificate that isn't the leaf (i.e. the one presented by the peer) should be accepted automatically, given preverified is true. The leaf certificate need to be verified to make sure its DN matches the info-hash</td></tr><tr id="48" style="display: none;" colspan="3"><td colspan="3"><h2>is verify_peer_cert called once per certificate in the chain, and
|
|
this function just tells us which depth we're at right now? If so, the comment
|
|
makes sense.
|
|
any certificate that isn't the leaf (i.e. the one presented by the peer)
|
|
should be accepted automatically, given preverified is true. The leaf certificate
|
|
need to be verified to make sure its DN matches the info-hash</h2><h4>../src/torrent.cpp:1234</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (pp) p->add_extension(pp);
|
|
}
|
|
|
|
// if files are checked for this torrent, call the extension
|
|
// to let it initialize itself
|
|
if (m_connections_initialized)
|
|
tp->on_files_checked();
|
|
}
|
|
|
|
#endif
|
|
|
|
#ifdef TORRENT_USE_OPENSSL
|
|
|
|
#if BOOST_VERSION >= 104700
|
|
bool torrent::verify_peer_cert(bool preverified, boost::asio::ssl::verify_context& ctx)
|
|
{
|
|
// if the cert wasn't signed by the correct CA, fail the verification
|
|
if (!preverified) return false;
|
|
|
|
// we're only interested in checking the certificate at the end of the chain.
|
|
<div style="background: #ffff00" width="100%"> int depth = X509_STORE_CTX_get_error_depth(ctx.native_handle());
|
|
</div> if (depth > 0) return true;
|
|
|
|
X509* cert = X509_STORE_CTX_get_current_cert(ctx.native_handle());
|
|
|
|
// Go through the alternate names in the certificate looking for matching DNS entries
|
|
GENERAL_NAMES* gens = static_cast<GENERAL_NAMES*>(
|
|
X509_get_ext_d2i(cert, NID_subject_alt_name, 0, 0));
|
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
|
std::string names;
|
|
bool match = false;
|
|
#endif
|
|
for (int i = 0; i < sk_GENERAL_NAME_num(gens); ++i)
|
|
{
|
|
GENERAL_NAME* gen = sk_GENERAL_NAME_value(gens, i);
|
|
if (gen->type != GEN_DNS) continue;
|
|
ASN1_IA5STRING* domain = gen->d.dNSName;
|
|
if (domain->type != V_ASN1_IA5STRING || !domain->data || !domain->length) continue;
|
|
const char* torrent_name = reinterpret_cast<const char*>(domain->data);
|
|
std::size_t name_length = domain->length;
|
|
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
|
if (i > 1) names += " | n: ";
|
|
names.append(torrent_name, name_length);
|
|
#endif
|
|
if (strncmp(torrent_name, "*", name_length) == 0
|
|
|| strncmp(torrent_name, m_torrent_file->name().c_str(), name_length) == 0)
|
|
{
|
|
#if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
|
|
match = true;
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(49)">../src/torrent.cpp:5164</a></td><td>make this more generic to not just work if files have been renamed, but also if they have been merged into a single file for instance maybe use the same format as .torrent files and reuse some code from torrent_info The mapped_files needs to be read both in the network thread and in the disk thread, since they both have their own mapped files structures which are kept in sync</td></tr><tr id="49" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
|
renamed, but also if they have been merged into a single file for instance
|
|
maybe use the same format as .torrent files and reuse some code from torrent_info
|
|
The mapped_files needs to be read both in the network thread
|
|
and in the disk thread, since they both have their own mapped files structures
|
|
which are kept in sync</h2><h4>../src/torrent.cpp:5164</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (m_seed_mode) m_verified.resize(m_torrent_file->num_pieces(), false);
|
|
super_seeding(rd.dict_find_int_value("super_seeding", 0));
|
|
|
|
m_last_scrape = rd.dict_find_int_value("last_scrape", 0);
|
|
m_last_download = rd.dict_find_int_value("last_download", 0);
|
|
m_last_upload = rd.dict_find_int_value("last_upload", 0);
|
|
|
|
m_url = rd.dict_find_string_value("url");
|
|
m_uuid = rd.dict_find_string_value("uuid");
|
|
m_source_feed_url = rd.dict_find_string_value("feed");
|
|
|
|
if (!m_uuid.empty() || !m_url.empty())
|
|
{
|
|
boost::shared_ptr<torrent> me(shared_from_this());
|
|
|
|
// insert this torrent in the uuid index
|
|
m_ses.m_uuids.insert(std::make_pair(m_uuid.empty()
|
|
? m_url : m_uuid, me));
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> lazy_entry const* mapped_files = rd.dict_find_list("mapped_files");
|
|
</div> if (mapped_files && mapped_files->list_size() == m_torrent_file->num_files())
|
|
{
|
|
for (int i = 0; i < m_torrent_file->num_files(); ++i)
|
|
{
|
|
std::string new_filename = mapped_files->list_string_value_at(i);
|
|
if (new_filename.empty()) continue;
|
|
m_torrent_file->rename_file(i, new_filename);
|
|
}
|
|
}
|
|
|
|
m_added_time = rd.dict_find_int_value("added_time", m_added_time);
|
|
m_completed_time = rd.dict_find_int_value("completed_time", m_completed_time);
|
|
if (m_completed_time != 0 && m_completed_time < m_added_time)
|
|
m_completed_time = m_added_time;
|
|
|
|
lazy_entry const* file_priority = rd.dict_find_list("file_priority");
|
|
if (file_priority && file_priority->list_size()
|
|
== m_torrent_file->num_files())
|
|
{
|
|
for (int i = 0; i < file_priority->list_size(); ++i)
|
|
m_file_priority[i] = file_priority->list_int_value_at(i, 1);
|
|
update_piece_priorities();
|
|
}
|
|
|
|
lazy_entry const* piece_priority = rd.dict_find_string("piece_priority");
|
|
if (piece_priority && piece_priority->string_length()
|
|
== m_torrent_file->num_pieces())
|
|
{
|
|
char const* p = piece_priority->string_ptr();
|
|
for (int i = 0; i < piece_priority->string_length(); ++i)
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(50)">../src/torrent.cpp:5300</a></td><td>if this is a merkle torrent and we can't restore the tree, we need to wipe all the bits in the have array, but not necessarily we might want to do a full check to see if we have all the pieces. This is low priority since almost no one uses merkle torrents</td></tr><tr id="50" style="display: none;" colspan="3"><td colspan="3"><h2>if this is a merkle torrent and we can't
|
|
restore the tree, we need to wipe all the
|
|
bits in the have array, but not necessarily
|
|
we might want to do a full check to see if we have
|
|
all the pieces. This is low priority since almost
|
|
no one uses merkle torrents</h2><h4>../src/torrent.cpp:5300</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> add_web_seed(url, web_seed_entry::http_seed);
|
|
}
|
|
}
|
|
|
|
if (m_torrent_file->is_merkle_torrent())
|
|
{
|
|
lazy_entry const* mt = rd.dict_find_string("merkle tree");
|
|
if (mt)
|
|
{
|
|
std::vector<sha1_hash> tree;
|
|
tree.resize(m_torrent_file->merkle_tree().size());
|
|
std::memcpy(&tree[0], mt->string_ptr()
|
|
, (std::min)(mt->string_length(), int(tree.size()) * 20));
|
|
if (mt->string_length() < int(tree.size()) * 20)
|
|
std::memset(&tree[0] + mt->string_length() / 20, 0
|
|
, tree.size() - mt->string_length() / 20);
|
|
m_torrent_file->set_merkle_tree(tree);
|
|
}
|
|
else
|
|
{
|
|
<div style="background: #ffff00" width="100%"> TORRENT_ASSERT(false);
|
|
</div> }
|
|
}
|
|
}
|
|
|
|
boost::intrusive_ptr<torrent_info const> torrent::get_torrent_copy()
|
|
{
|
|
if (!m_torrent_file->is_valid()) return boost::intrusive_ptr<torrent_info>();
|
|
|
|
// copy the torrent_info object
|
|
return boost::intrusive_ptr<torrent_info>(new torrent_info(*m_torrent_file));
|
|
}
|
|
|
|
void torrent::write_resume_data(entry& ret) const
|
|
{
|
|
using namespace libtorrent::detail; // for write_*_endpoint()
|
|
ret["file-format"] = "libtorrent resume file";
|
|
ret["file-version"] = 1;
|
|
ret["libtorrent-version"] = LIBTORRENT_VERSION;
|
|
|
|
ret["total_uploaded"] = m_total_uploaded;
|
|
ret["total_downloaded"] = m_total_downloaded;
|
|
|
|
ret["active_time"] = m_active_time;
|
|
ret["finished_time"] = m_finished_time;
|
|
ret["seeding_time"] = m_seeding_time;
|
|
ret["last_seen_complete"] = m_last_seen_complete;
|
|
|
|
ret["num_complete"] = m_complete;
|
|
ret["num_incomplete"] = m_incomplete;
|
|
ret["num_downloaded"] = m_downloaded;
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(51)">../src/torrent.cpp:5488</a></td><td>make this more generic to not just work if files have been renamed, but also if they have been merged into a single file for instance. using file_base</td></tr><tr id="51" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
|
renamed, but also if they have been merged into a single file for instance.
|
|
using file_base</h2><h4>../src/torrent.cpp:5488</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> entry::string_type& pieces = ret["pieces"].string();
|
|
pieces.resize(m_torrent_file->num_pieces());
|
|
if (is_seed())
|
|
{
|
|
std::memset(&pieces[0], 1, pieces.size());
|
|
}
|
|
else
|
|
{
|
|
for (int i = 0, end(pieces.size()); i < end; ++i)
|
|
pieces[i] = m_picker->have_piece(i) ? 1 : 0;
|
|
}
|
|
|
|
if (m_seed_mode)
|
|
{
|
|
TORRENT_ASSERT(m_verified.size() == pieces.size());
|
|
for (int i = 0, end(pieces.size()); i < end; ++i)
|
|
pieces[i] |= m_verified[i] ? 2 : 0;
|
|
}
|
|
|
|
// write renamed files
|
|
<div style="background: #ffff00" width="100%"> if (&m_torrent_file->files() != &m_torrent_file->orig_files()
|
|
</div> && m_torrent_file->files().num_files() == m_torrent_file->orig_files().num_files())
|
|
{
|
|
entry::list_type& fl = ret["mapped_files"].list();
|
|
file_storage const& fs = m_torrent_file->files();
|
|
for (int i = 0; i < fs.num_files(); ++i)
|
|
{
|
|
fl.push_back(fs.file_path(i));
|
|
}
|
|
}
|
|
|
|
// write local peers
|
|
|
|
std::back_insert_iterator<entry::string_type> peers(ret["peers"].string());
|
|
std::back_insert_iterator<entry::string_type> banned_peers(ret["banned_peers"].string());
|
|
#if TORRENT_USE_IPV6
|
|
std::back_insert_iterator<entry::string_type> peers6(ret["peers6"].string());
|
|
std::back_insert_iterator<entry::string_type> banned_peers6(ret["banned_peers6"].string());
|
|
#endif
|
|
|
|
// failcount is a 5 bit value
|
|
int max_failcount = (std::min)(settings().max_failcount, 31);
|
|
|
|
int num_saved_peers = 0;
|
|
|
|
for (policy::const_iterator i = m_policy.begin_peer()
|
|
, end(m_policy.end_peer()); i != end; ++i)
|
|
{
|
|
error_code ec;
|
|
policy::peer const* p = *i;
|
|
address addr = p->address();
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(52)">../src/torrent.cpp:8073</a></td><td>go through the pieces we have and count the total number of downloaders we have. Only count peers that are interested in us since some peers might not send have messages for pieces we have it num_interested == 0, we need to pick a new piece</td></tr><tr id="52" style="display: none;" colspan="3"><td colspan="3"><h2>go through the pieces we have and count the total number
|
|
of downloaders we have. Only count peers that are interested in us
|
|
since some peers might not send have messages for pieces we have
|
|
it num_interested == 0, we need to pick a new piece</h2><h4>../src/torrent.cpp:8073</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
|
|
|
rarest_pieces.clear();
|
|
rarest_rarity = pp.peer_count;
|
|
rarest_pieces.push_back(i);
|
|
}
|
|
|
|
if (prio_updated)
|
|
m_policy.recalculate_connect_candidates();
|
|
|
|
// now, rarest_pieces is a list of all pieces that are the rarest ones.
|
|
// and rarest_rarity is the number of peers that have the rarest pieces
|
|
|
|
// if there's only a single peer that doesn't have the rarest piece
|
|
// it's impossible for us to download one piece and upload it
|
|
// twice. i.e. we cannot get a positive share ratio
|
|
if (num_peers - rarest_rarity < settings().share_mode_target) return;
|
|
|
|
// we might be able to do better than a share ratio of 2 if there are
|
|
// enough downloaders of the pieces we already have.
|
|
<div style="background: #ffff00" width="100%">
|
|
</div> // now, pick one of the rarest pieces to download
|
|
int pick = random() % rarest_pieces.size();
|
|
bool was_finished = is_finished();
|
|
m_picker->set_piece_priority(rarest_pieces[pick], 1);
|
|
update_peer_interest(was_finished);
|
|
|
|
m_policy.recalculate_connect_candidates();
|
|
}
|
|
|
|
void torrent::refresh_explicit_cache(int cache_size)
|
|
{
|
|
TORRENT_ASSERT(m_ses.is_network_thread());
|
|
if (!ready_for_connections()) return;
|
|
|
|
if (m_abort) return;
|
|
TORRENT_ASSERT(m_storage);
|
|
|
|
// rotate the cached pieces
|
|
|
|
// add blocks_per_piece / 2 in order to round to closest whole piece
|
|
int blocks_per_piece = m_torrent_file->piece_length() / block_size();
|
|
int num_cache_pieces = (cache_size + blocks_per_piece / 2) / blocks_per_piece;
|
|
if (num_cache_pieces > m_torrent_file->num_pieces())
|
|
num_cache_pieces = m_torrent_file->num_pieces();
|
|
|
|
std::vector<int> avail_vec;
|
|
if (has_picker())
|
|
{
|
|
m_picker->get_availability(avail_vec);
|
|
}
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(53)">../src/udp_socket.cpp:292</a></td><td>it would be nice to detect this on posix systems also</td></tr><tr id="53" style="display: none;" colspan="3"><td colspan="3"><h2>it would be nice to detect this on posix systems also</h2><h4>../src/udp_socket.cpp:292</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> --m_v6_outstanding;
|
|
}
|
|
else
|
|
#endif
|
|
{
|
|
TORRENT_ASSERT(m_v4_outstanding > 0);
|
|
--m_v4_outstanding;
|
|
}
|
|
|
|
if (ec == asio::error::operation_aborted) return;
|
|
if (m_abort) return;
|
|
|
|
CHECK_MAGIC;
|
|
|
|
for (;;)
|
|
{
|
|
error_code ec;
|
|
udp::endpoint ep;
|
|
size_t bytes_transferred = s->receive_from(asio::buffer(m_buf, m_buf_size), ep, 0, ec);
|
|
|
|
<div style="background: #ffff00" width="100%">#ifdef TORRENT_WINDOWS
|
|
</div> if ((ec == error_code(ERROR_MORE_DATA, get_system_category())
|
|
|| ec == error_code(WSAEMSGSIZE, get_system_category()))
|
|
&& m_buf_size < 65536)
|
|
{
|
|
// if this function fails to allocate memory, m_buf_size
|
|
// is set to 0. In that case, don't issue the async_read().
|
|
set_buf_size(m_buf_size * 2);
|
|
if (m_buf_size == 0) return;
|
|
continue;
|
|
}
|
|
#endif
|
|
|
|
if (ec == asio::error::would_block || ec == asio::error::try_again) break;
|
|
on_read_impl(s, ep, ec, bytes_transferred);
|
|
}
|
|
call_drained_handler();
|
|
setup_read(s);
|
|
}
|
|
|
|
void udp_socket::call_handler(error_code const& ec, udp::endpoint const& ep, char const* buf, int size)
|
|
{
|
|
m_observers_locked = true;
|
|
for (std::vector<udp_socket_observer*>::iterator i = m_observers.begin();
|
|
i != m_observers.end();)
|
|
{
|
|
bool ret = false;
|
|
TORRENT_TRY {
|
|
ret = (*i)->incoming_packet(ec, ep, buf, size);
|
|
} TORRENT_CATCH (std::exception&) {}
|
|
if (*i == NULL) i = m_observers.erase(i);
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(54)">../src/udp_tracker_connection.cpp:550</a></td><td>it would be more efficient to not use a string here. however, the problem is that some trackers will respond with actual strings. For example i2p trackers</td></tr><tr id="54" style="display: none;" colspan="3"><td colspan="3"><h2>it would be more efficient to not use a string here.
|
|
however, the problem is that some trackers will respond
|
|
with actual strings. For example i2p trackers</h2><h4>../src/udp_tracker_connection.cpp:550</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
|
|
|
boost::shared_ptr<request_callback> cb = requester();
|
|
#if defined TORRENT_VERBOSE_LOGGING || defined TORRENT_LOGGING
|
|
if (cb)
|
|
{
|
|
boost::shared_ptr<request_callback> cb = requester();
|
|
cb->debug_log("<== UDP_TRACKER_RESPONSE [ url: %s ]", tracker_req().url.c_str());
|
|
}
|
|
#endif
|
|
|
|
if (!cb)
|
|
{
|
|
close();
|
|
return true;
|
|
}
|
|
|
|
std::vector<peer_entry> peer_list;
|
|
for (int i = 0; i < num_peers; ++i)
|
|
{
|
|
<div style="background: #ffff00" width="100%"> peer_entry e;
|
|
</div> char ip_string[100];
|
|
unsigned int a = detail::read_uint8(buf);
|
|
unsigned int b = detail::read_uint8(buf);
|
|
unsigned int c = detail::read_uint8(buf);
|
|
unsigned int d = detail::read_uint8(buf);
|
|
snprintf(ip_string, 100, "%u.%u.%u.%u", a, b, c, d);
|
|
e.ip = ip_string;
|
|
e.port = detail::read_uint16(buf);
|
|
e.pid.clear();
|
|
peer_list.push_back(e);
|
|
}
|
|
|
|
std::list<address> ip_list;
|
|
for (std::list<tcp::endpoint>::const_iterator i = m_endpoints.begin()
|
|
, end(m_endpoints.end()); i != end; ++i)
|
|
{
|
|
ip_list.push_back(i->address());
|
|
}
|
|
|
|
cb->tracker_response(tracker_req(), m_target.address(), ip_list
|
|
, peer_list, interval, min_interval, complete, incomplete, 0, address(), "" /*trackerid*/);
|
|
|
|
close();
|
|
return true;
|
|
}
|
|
|
|
bool udp_tracker_connection::on_scrape_response(char const* buf, int size)
|
|
{
|
|
restart_read_timeout();
|
|
int action = detail::read_int32(buf);
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(55)">../src/upnp.cpp:65</a></td><td>listen_interface is not used. It's meant to bind the broadcast socket</td></tr><tr id="55" style="display: none;" colspan="3"><td colspan="3"><h2>listen_interface is not used. It's meant to bind the broadcast socket</h2><h4>../src/upnp.cpp:65</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
#if defined TORRENT_ASIO_DEBUGGING
|
|
#include "libtorrent/debug.hpp"
|
|
#endif
|
|
|
|
#include <boost/bind.hpp>
|
|
#include <boost/ref.hpp>
|
|
#if BOOST_VERSION < 103500
|
|
#include <asio/ip/host_name.hpp>
|
|
#include <asio/ip/multicast.hpp>
|
|
#else
|
|
#include <boost/asio/ip/host_name.hpp>
|
|
#include <boost/asio/ip/multicast.hpp>
|
|
#endif
|
|
#include <cstdlib>
|
|
|
|
namespace libtorrent {
|
|
|
|
static error_code ec;
|
|
|
|
<div style="background: #ffff00" width="100%">upnp::upnp(io_service& ios, connection_queue& cc
|
|
</div> , address const& listen_interface, std::string const& user_agent
|
|
, portmap_callback_t const& cb, log_callback_t const& lcb
|
|
, bool ignore_nonrouters, void* state)
|
|
: m_user_agent(user_agent)
|
|
, m_callback(cb)
|
|
, m_log_callback(lcb)
|
|
, m_retry_count(0)
|
|
, m_io_service(ios)
|
|
, m_socket(udp::endpoint(address_v4::from_string("239.255.255.250", ec), 1900)
|
|
, boost::bind(&upnp::on_reply, self(), _1, _2, _3))
|
|
, m_broadcast_timer(ios)
|
|
, m_refresh_timer(ios)
|
|
, m_map_timer(ios)
|
|
, m_disabled(false)
|
|
, m_closing(false)
|
|
, m_ignore_non_routers(ignore_nonrouters)
|
|
, m_cc(cc)
|
|
{
|
|
TORRENT_ASSERT(cb);
|
|
|
|
error_code ec;
|
|
m_socket.open(ios, ec);
|
|
|
|
if (state)
|
|
{
|
|
upnp_state_t* s = (upnp_state_t*)state;
|
|
m_devices.swap(s->devices);
|
|
m_mappings.swap(s->mappings);
|
|
delete s;
|
|
}
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(56)">../src/utp_stream.cpp:1606</a></td><td>this loop may not be very efficient</td></tr><tr id="56" style="display: none;" colspan="3"><td colspan="3"><h2>this loop may not be very efficient</h2><h4>../src/utp_stream.cpp:1606</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
char* m_buf;
|
|
};
|
|
|
|
// sends a packet, pulls data from the write buffer (if there's any)
|
|
// if ack is true, we need to send a packet regardless of if there's
|
|
// any data. Returns true if we could send more data (i.e. call
|
|
// send_pkt() again)
|
|
// returns true if there is more space for payload in our
|
|
// congestion window, false if there is no more space.
|
|
bool utp_socket_impl::send_pkt(int flags)
|
|
{
|
|
INVARIANT_CHECK;
|
|
|
|
bool force = (flags & pkt_ack) || (flags & pkt_fin);
|
|
|
|
// TORRENT_ASSERT(m_state != UTP_STATE_FIN_SENT || (flags & pkt_ack));
|
|
|
|
// first see if we need to resend any packets
|
|
|
|
<div style="background: #ffff00" width="100%"> for (int i = (m_acked_seq_nr + 1) & ACK_MASK; i != m_seq_nr; i = (i + 1) & ACK_MASK)
|
|
</div> {
|
|
packet* p = (packet*)m_outbuf.at(i);
|
|
if (!p) continue;
|
|
if (!p->need_resend) continue;
|
|
if (!resend_packet(p))
|
|
{
|
|
// we couldn't resend the packet. It probably doesn't
|
|
// fit in our cwnd. If force is set, we need to continue
|
|
// to send our packet anyway, if we don't have force set,
|
|
// we might as well return
|
|
if (!force) return false;
|
|
// resend_packet might have failed
|
|
if (m_state == UTP_STATE_ERROR_WAIT || m_state == UTP_STATE_DELETE) return false;
|
|
break;
|
|
}
|
|
|
|
// don't fast-resend this packet
|
|
if (m_fast_resend_seq_nr == i)
|
|
m_fast_resend_seq_nr = (m_fast_resend_seq_nr + 1) & ACK_MASK;
|
|
}
|
|
|
|
int sack = 0;
|
|
if (m_inbuf.size())
|
|
{
|
|
// the SACK bitfield should ideally fit all
|
|
// the pieces we have successfully received
|
|
sack = (m_inbuf.span() + 7) / 8;
|
|
if (sack > 32) sack = 32;
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(57)">../src/kademlia/dht_tracker.cpp:428</a></td><td>ideally this function would be called when the put completes</td></tr><tr id="57" style="display: none;" colspan="3"><td colspan="3"><h2>ideally this function would be called when the
|
|
put completes</h2><h4>../src/kademlia/dht_tracker.cpp:428</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // since it controls whether we re-put the content
|
|
TORRENT_ASSERT(!it.is_mutable());
|
|
f(it);
|
|
return false;
|
|
}
|
|
|
|
bool get_mutable_item_callback(item& it, boost::function<void(item const&)> f)
|
|
{
|
|
// the reason to wrap here is to control the return value
|
|
// since it controls whether we re-put the content
|
|
TORRENT_ASSERT(it.is_mutable());
|
|
f(it);
|
|
return false;
|
|
}
|
|
|
|
bool put_immutable_item_callback(item& it, boost::function<void()> f
|
|
, entry data)
|
|
{
|
|
TORRENT_ASSERT(!it.is_mutable());
|
|
it.assign(data);
|
|
<div style="background: #ffff00" width="100%"> f();
|
|
</div> return true;
|
|
}
|
|
|
|
bool put_mutable_item_callback(item& it, boost::function<void(item&)> cb)
|
|
{
|
|
cb(it);
|
|
return true;
|
|
}
|
|
|
|
void dht_tracker::get_item(sha1_hash const& target
|
|
, boost::function<void(item const&)> cb)
|
|
{
|
|
m_dht.get_item(target, boost::bind(&get_immutable_item_callback, _1, cb));
|
|
}
|
|
|
|
// key is a 32-byte binary string, the public key to look up.
|
|
// the salt is optional
|
|
void dht_tracker::get_item(char const* key
|
|
, boost::function<void(item const&)> cb
|
|
, std::string salt)
|
|
{
|
|
m_dht.get_item(key, salt, boost::bind(&get_mutable_item_callback, _1, cb));
|
|
}
|
|
|
|
void dht_tracker::put_item(entry data
|
|
, boost::function<void()> cb)
|
|
{
|
|
std::string flat_data;
|
|
bencode(std::back_inserter(flat_data), data);
|
|
sha1_hash target = item_target_id(
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(58)">../src/kademlia/routing_table.cpp:293</a></td><td>instad of refreshing a bucket by using find_nodes, ping each node periodically</td></tr><tr id="58" style="display: none;" colspan="3"><td colspan="3"><h2>instad of refreshing a bucket by using find_nodes,
|
|
ping each node periodically</h2><h4>../src/kademlia/routing_table.cpp:293</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> os << "]\n";
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
void routing_table::touch_bucket(node_id const& target)
|
|
{
|
|
table_t::iterator i = find_bucket(target);
|
|
i->last_active = time_now();
|
|
}
|
|
|
|
// returns true if lhs is in more need of a refresh than rhs
|
|
bool compare_bucket_refresh(routing_table_node const& lhs, routing_table_node const& rhs)
|
|
{
|
|
// add the number of nodes to prioritize buckets with few nodes in them
|
|
return lhs.last_active + seconds(lhs.live_nodes.size() * 5)
|
|
< rhs.last_active + seconds(rhs.live_nodes.size() * 5);
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%">bool routing_table::need_refresh(node_id& target) const
|
|
</div>{
|
|
INVARIANT_CHECK;
|
|
|
|
ptime now = time_now();
|
|
|
|
// refresh our own bucket once every 15 minutes
|
|
if (now - m_last_self_refresh > minutes(15))
|
|
{
|
|
m_last_self_refresh = now;
|
|
target = m_id;
|
|
#ifdef TORRENT_DHT_VERBOSE_LOGGING
|
|
TORRENT_LOG(table) << "need_refresh [ bucket: self target: " << target << " ]";
|
|
#endif
|
|
return true;
|
|
}
|
|
|
|
if (m_buckets.empty()) return false;
|
|
|
|
table_t::const_iterator i = std::min_element(m_buckets.begin(), m_buckets.end()
|
|
, &compare_bucket_refresh);
|
|
|
|
if (now - i->last_active < minutes(15)) return false;
|
|
if (now - m_last_refresh < seconds(45)) return false;
|
|
|
|
// generate a random node_id within the given bucket
|
|
target = generate_random_id();
|
|
int num_bits = std::distance(m_buckets.begin(), i) + 1;
|
|
node_id mask = generate_prefix_mask(num_bits);
|
|
|
|
// target = (target & ~mask) | (root & mask)
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(59)">../include/libtorrent/config.hpp:333</a></td><td>Make this count Unicode characters instead of bytes on windows</td></tr><tr id="59" style="display: none;" colspan="3"><td colspan="3"><h2>Make this count Unicode characters instead of bytes on windows</h2><h4>../include/libtorrent/config.hpp:333</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
// ==== eCS(OS/2) ===
|
|
#elif defined __OS2__
|
|
#define TORRENT_OS2
|
|
#define TORRENT_HAS_FALLOCATE 0
|
|
#define TORRENT_USE_IFCONF 1
|
|
#define TORRENT_USE_SYSCTL 1
|
|
#define TORRENT_USE_MLOCK 0
|
|
#define TORRENT_USE_IPV6 0
|
|
#define TORRENT_ICONV_ARG (const char**)
|
|
#define TORRENT_USE_WRITEV 0
|
|
#define TORRENT_USE_READV 0
|
|
|
|
#else
|
|
#warning unknown OS, assuming BSD
|
|
#define TORRENT_BSD
|
|
#endif
|
|
|
|
// on windows, NAME_MAX refers to Unicode characters
|
|
// on linux it refers to bytes (utf-8 encoded)
|
|
<div style="background: #ffff00" width="100%">
|
|
</div>// windows
|
|
#if defined FILENAME_MAX
|
|
#define TORRENT_MAX_PATH FILENAME_MAX
|
|
|
|
// beos
|
|
#elif defined B_PATH_NAME_LENGTH
|
|
#define TORRENT_MAX_PATH B_PATH_NAME_LENGTH
|
|
|
|
// solaris
|
|
#elif defined MAXPATH
|
|
#define TORRENT_MAX_PATH MAXPATH
|
|
|
|
// posix
|
|
#elif defined NAME_MAX
|
|
#define TORRENT_MAX_PATH NAME_MAX
|
|
|
|
// none of the above
|
|
#else
|
|
// this is the maximum number of characters in a
|
|
// path element / filename on windows
|
|
#define TORRENT_MAX_PATH 255
|
|
#warning unknown platform, assuming the longest path is 255
|
|
|
|
#endif
|
|
|
|
#if defined TORRENT_WINDOWS && !defined TORRENT_MINGW
|
|
|
|
#include <stdarg.h>
|
|
|
|
// internal
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(60)">../include/libtorrent/peer_connection.hpp:725</a></td><td>make this private</td></tr><tr id="60" style="display: none;" colspan="3"><td colspan="3"><h2>make this private</h2><h4>../include/libtorrent/peer_connection.hpp:725</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> void set_soft_packet_size(int size) { m_soft_packet_size = size; }
|
|
|
|
// if allow_encrypted is false, and the torrent 'ih' turns out
|
|
// to be an encrypted torrent (AES-256 encrypted) the peer will
|
|
// be disconnected. This is to prevent non-encrypted peers to
|
|
// attach to an encrypted torrent
|
|
void attach_to_torrent(sha1_hash const& ih, bool allow_encrypted);
|
|
|
|
bool verify_piece(peer_request const& p) const;
|
|
|
|
void update_desired_queue_size();
|
|
|
|
void set_timeout(int s) { m_timeout = s; }
|
|
|
|
boost::intrusive_ptr<peer_connection> self()
|
|
{
|
|
TORRENT_ASSERT(!m_in_constructor);
|
|
return boost::intrusive_ptr<peer_connection>(this);
|
|
}
|
|
|
|
<div style="background: #ffff00" width="100%"> public:
|
|
</div>
|
|
// upload and download channel state
|
|
// enum from peer_info::bw_state
|
|
boost::uint8_t m_channel_state[2];
|
|
|
|
private:
|
|
|
|
// is true if we learn the incoming connections listening
|
|
// during the extended handshake
|
|
bool m_received_listen_port:1;
|
|
|
|
// this is set to true when a have_all
|
|
// message is received. This information
|
|
// is used to fill the bitmask in init()
|
|
bool m_have_all:1;
|
|
|
|
// other side says that it's interested in downloading
|
|
// from us.
|
|
bool m_peer_interested:1;
|
|
|
|
// the other side has told us that it won't send anymore
|
|
// data to us for a while
|
|
bool m_peer_choked:1;
|
|
|
|
// the peer has pieces we are interested in
|
|
bool m_interesting:1;
|
|
|
|
// we have choked the upload to the peer
|
|
bool m_choked:1;
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(61)">../include/libtorrent/peer_connection.hpp:806</a></td><td>make these private as well</td></tr><tr id="61" style="display: none;" colspan="3"><td colspan="3"><h2>make these private as well</h2><h4>../include/libtorrent/peer_connection.hpp:806</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
// when this is set, the peer_connection socket is
|
|
// corked, similar to the linux TCP feature TCP_CORK.
|
|
// we won't send anything to the actual socket, just
|
|
// buffer messages up in the application layer send
|
|
// buffer, and send it once we're uncorked.
|
|
bool m_corked:1;
|
|
|
|
// set to true if this peer has metadata, and false
|
|
// otherwise.
|
|
bool m_has_metadata:1;
|
|
|
|
// this is set to true if this peer was accepted exceeding
|
|
// the connection limit. It means it has to disconnect
|
|
// itself, or some other peer, as soon as it's completed
|
|
// the handshake. We need to wait for the handshake in
|
|
// order to know which torrent it belongs to, to know which
|
|
// other peers to compare it to.
|
|
bool m_exceeded_limit:1;
|
|
|
|
<div style="background: #ffff00" width="100%"> protected:
|
|
</div>
|
|
// number of bytes this peer can send and receive
|
|
int m_quota[2];
|
|
|
|
// statistics about upload and download speeds
|
|
// and total amount of uploads and downloads for
|
|
// this peer
|
|
stat m_statistics;
|
|
|
|
// a back reference to the session
|
|
// the peer belongs to.
|
|
aux::session_impl& m_ses;
|
|
|
|
#ifndef TORRENT_DISABLE_EXTENSIONS
|
|
typedef std::list<boost::shared_ptr<peer_plugin> > extension_list_t;
|
|
extension_list_t m_extensions;
|
|
#endif
|
|
|
|
// called from the main loop when this connection has any
|
|
// work to do.
|
|
void on_send_data(error_code const& error
|
|
, std::size_t bytes_transferred);
|
|
void on_receive_data(error_code const& error
|
|
, std::size_t bytes_transferred);
|
|
|
|
// the average rate of receiving complete piece messages
|
|
sliding_average<20> m_piece_rate;
|
|
sliding_average<20> m_send_rate;
|
|
|
|
private:
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(62)">../include/libtorrent/proxy_base.hpp:166</a></td><td>it would be nice to remember the bind port and bind once we know where the proxy is m_sock.bind(endpoint, ec);</td></tr><tr id="62" style="display: none;" colspan="3"><td colspan="3"><h2>it would be nice to remember the bind port and bind once we know where the proxy is
|
|
m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
|
|
return m_sock.get_option(opt, ec);
|
|
}
|
|
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
|
void bind(endpoint_type const& endpoint)
|
|
{
|
|
// m_sock.bind(endpoint);
|
|
}
|
|
#endif
|
|
|
|
void bind(endpoint_type const& endpoint, error_code& ec)
|
|
{
|
|
// the reason why we ignore binds here is because we don't
|
|
// (necessarily) yet know what address family the proxy
|
|
// will resolve to, and binding to the wrong one would
|
|
// break our connection attempt later. The caller here
|
|
// doesn't necessarily know that we're proxying, so this
|
|
// bind address is based on the final endpoint, not the
|
|
// proxy.
|
|
<div style="background: #ffff00" width="100%"> }
|
|
</div>
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
|
void open(protocol_type const& p)
|
|
{
|
|
// m_sock.open(p);
|
|
}
|
|
#endif
|
|
|
|
void open(protocol_type const& p, error_code& ec)
|
|
{
|
|
// we need to ignore this for the same reason as stated
|
|
// for ignoring bind()
|
|
// m_sock.open(p, ec);
|
|
}
|
|
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
|
void close()
|
|
{
|
|
m_remote_endpoint = endpoint_type();
|
|
m_sock.close();
|
|
m_resolver.cancel();
|
|
}
|
|
#endif
|
|
|
|
void close(error_code& ec)
|
|
{
|
|
m_remote_endpoint = endpoint_type();
|
|
m_sock.close(ec);
|
|
m_resolver.cancel();
|
|
}
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(63)">../include/libtorrent/stat.hpp:113</a></td><td>this is 4 bytes of padding!</td></tr><tr id="63" style="display: none;" colspan="3"><td colspan="3"><h2>this is 4 bytes of padding!</h2><h4>../include/libtorrent/stat.hpp:113</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
int counter() const { return m_counter; }
|
|
|
|
void clear()
|
|
{
|
|
m_counter = 0;
|
|
m_5_sec_average = 0;
|
|
m_30_sec_average = 0;
|
|
m_total_counter = 0;
|
|
}
|
|
|
|
private:
|
|
|
|
// the accumulator for this second.
|
|
int m_counter;
|
|
|
|
// sliding average
|
|
int m_5_sec_average;
|
|
int m_30_sec_average;
|
|
|
|
<div style="background: #ffff00" width="100%">
|
|
</div> // total counters
|
|
size_type m_total_counter;
|
|
};
|
|
|
|
class TORRENT_EXTRA_EXPORT stat
|
|
{
|
|
friend class invariant_access;
|
|
public:
|
|
void operator+=(const stat& s)
|
|
{
|
|
for (int i = 0; i < num_channels; ++i)
|
|
m_stat[i] += s.m_stat[i];
|
|
}
|
|
|
|
void sent_syn(bool ipv6)
|
|
{
|
|
#ifndef TORRENT_DISABLE_FULL_STATS
|
|
m_stat[upload_ip_protocol].add(ipv6 ? 60 : 40);
|
|
#endif
|
|
}
|
|
|
|
void received_synack(bool ipv6)
|
|
{
|
|
#ifndef TORRENT_DISABLE_FULL_STATS
|
|
// we received SYN-ACK and also sent ACK back
|
|
m_stat[download_ip_protocol].add(ipv6 ? 60 : 40);
|
|
m_stat[upload_ip_protocol].add(ipv6 ? 60 : 40);
|
|
#endif
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(64)">../include/libtorrent/torrent_info.hpp:123</a></td><td>include the number of peers received from this tracker, at last announce</td></tr><tr id="64" style="display: none;" colspan="3"><td colspan="3"><h2>include the number of peers received from this tracker, at last announce</h2><h4>../include/libtorrent/torrent_info.hpp:123</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
|
// if this tracker failed the last time it was contacted
|
|
// this error code specifies what error occurred
|
|
error_code last_error;
|
|
|
|
// returns the number of seconds to the next announce on
|
|
// this tracker. ``min_announce_in()`` returns the number of seconds until we are
|
|
// allowed to force another tracker update with this tracker.
|
|
//
|
|
// If the last time this tracker was contacted failed, ``last_error`` is the error
|
|
// code describing what error occurred.
|
|
int next_announce_in() const;
|
|
int min_announce_in() const;
|
|
|
|
// the time of next tracker announce
|
|
ptime next_announce;
|
|
|
|
// no announces before this time
|
|
ptime min_announce;
|
|
|
|
<div style="background: #ffff00" width="100%">
|
|
</div> // these are either -1 or the scrape information this tracker last responded with. *incomplete* is
|
|
// the current number of downloaders in the swarm, *complete* is the current number
|
|
// of seeds in the swarm and *downloaded* is the cumulative number of completed
|
|
// downloads of this torrent, since the beginning of time (from this tracker's point
|
|
// of view).
|
|
|
|
// if this tracker has returned scrape data, these fields are filled
|
|
// in with valid numbers. Otherwise they are set to -1.
|
|
// the number of current downloaders
|
|
int scrape_incomplete;
|
|
int scrape_complete;
|
|
int scrape_downloaded;
|
|
|
|
// the tier this tracker belongs to
|
|
boost::uint8_t tier;
|
|
|
|
// the max number of failures to announce to this tracker in
|
|
// a row, before this tracker is not used anymore. 0 means unlimited
|
|
boost::uint8_t fail_limit;
|
|
|
|
// the number of times in a row we have failed to announce to this
|
|
// tracker.
|
|
boost::uint8_t fails:7;
|
|
|
|
// true while we're waiting for a response from the tracker.
|
|
bool updating:1;
|
|
|
|
// flags for the source bitmask, each indicating where
|
|
// we heard about this tracker
|
|
enum tracker_source
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(65)">../include/libtorrent/upnp.hpp:108</a></td><td>support using the windows API for UPnP operations as well</td></tr><tr id="65" style="display: none;" colspan="3"><td colspan="3"><h2>support using the windows API for UPnP operations as well</h2><h4>../include/libtorrent/upnp.hpp:108</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // specific IP addres or DNS name
|
|
remote_host_must_be_wildcard = 726,
|
|
// ExternalPort must be a wildcard and cannot be a
|
|
// specific port
|
|
external_port_must_be_wildcard = 727
|
|
};
|
|
}
|
|
|
|
TORRENT_EXPORT boost::system::error_category& get_upnp_category();
|
|
|
|
// int: port-mapping index
|
|
// address: external address as queried from router
|
|
// int: external port
|
|
// std::string: error message
|
|
// an empty string as error means success
|
|
// a port-mapping index of -1 means it's
|
|
// an informational log message
|
|
typedef boost::function<void(int, address, int, error_code const&)> portmap_callback_t;
|
|
typedef boost::function<void(char const*)> log_callback_t;
|
|
|
|
<div style="background: #ffff00" width="100%">class TORRENT_EXTRA_EXPORT upnp : public intrusive_ptr_base<upnp>
|
|
</div>{
|
|
public:
|
|
upnp(io_service& ios, connection_queue& cc
|
|
, address const& listen_interface, std::string const& user_agent
|
|
, portmap_callback_t const& cb, log_callback_t const& lcb
|
|
, bool ignore_nonrouters, void* state = 0);
|
|
~upnp();
|
|
|
|
void* drain_state();
|
|
|
|
enum protocol_type { none = 0, udp = 1, tcp = 2 };
|
|
|
|
// Attempts to add a port mapping for the specified protocol. Valid protocols are
|
|
// ``upnp::tcp`` and ``upnp::udp`` for the UPnP class and ``natpmp::tcp`` and
|
|
// ``natpmp::udp`` for the NAT-PMP class.
|
|
//
|
|
// ``external_port`` is the port on the external address that will be mapped. This
|
|
// is a hint, you are not guaranteed that this port will be available, and it may
|
|
// end up being something else. In the portmap_alert_ notification, the actual
|
|
// external port is reported.
|
|
//
|
|
// ``local_port`` is the port in the local machine that the mapping should forward
|
|
// to.
|
|
//
|
|
// The return value is an index that identifies this port mapping. This is used
|
|
// to refer to mappings that fails or succeeds in the portmap_error_alert_ and
|
|
// portmap_alert_ respectively. If The mapping fails immediately, the return value
|
|
// is -1, which means failure. There will not be any error alert notification for
|
|
// mappings that fail with a -1 return value.
|
|
int add_mapping(protocol_type p, int external_port, int local_port);
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(66)">../include/libtorrent/utp_stream.hpp:378</a></td><td>implement blocking write. Low priority since it's not used (yet)</td></tr><tr id="66" style="display: none;" colspan="3"><td colspan="3"><h2>implement blocking write. Low priority since it's not used (yet)</h2><h4>../include/libtorrent/utp_stream.hpp:378</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> for (typename Mutable_Buffers::const_iterator i = buffers.begin()
|
|
, end(buffers.end()); i != end; ++i)
|
|
{
|
|
using asio::buffer_cast;
|
|
using asio::buffer_size;
|
|
add_read_buffer(buffer_cast<void*>(*i), buffer_size(*i));
|
|
#if TORRENT_USE_ASSERTS
|
|
buf_size += buffer_size(*i);
|
|
#endif
|
|
}
|
|
std::size_t ret = read_some(true);
|
|
TORRENT_ASSERT(ret <= buf_size);
|
|
TORRENT_ASSERT(ret > 0);
|
|
return ret;
|
|
}
|
|
|
|
template <class Const_Buffers>
|
|
std::size_t write_some(Const_Buffers const& buffers, error_code& ec)
|
|
{
|
|
TORRENT_ASSERT(false && "not implemented!");
|
|
<div style="background: #ffff00" width="100%"> return 0;
|
|
</div> }
|
|
|
|
#ifndef BOOST_NO_EXCEPTIONS
|
|
template <class Mutable_Buffers>
|
|
std::size_t read_some(Mutable_Buffers const& buffers)
|
|
{
|
|
error_code ec;
|
|
std::size_t ret = read_some(buffers, ec);
|
|
if (ec)
|
|
boost::throw_exception(boost::system::system_error(ec));
|
|
return ret;
|
|
}
|
|
|
|
template <class Const_Buffers>
|
|
std::size_t write_some(Const_Buffers const& buffers)
|
|
{
|
|
error_code ec;
|
|
std::size_t ret = write_some(buffers, ec);
|
|
if (ec)
|
|
boost::throw_exception(boost::system::system_error(ec));
|
|
return ret;
|
|
}
|
|
#endif
|
|
|
|
template <class Handler>
|
|
void async_write_some(boost::asio::null_buffers const& buffers, Handler const& handler)
|
|
{
|
|
TORRENT_ASSERT(false);
|
|
}
|
|
|
|
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(67)">../include/libtorrent/kademlia/item.hpp:61</a></td><td>since this is a public function, it should probably be moved out of this header and into one with other public functions.</td></tr><tr id="67" style="display: none;" colspan="3"><td colspan="3"><h2>since this is a public function, it should probably be moved
|
|
out of this header and into one with other public functions.</h2><h4>../include/libtorrent/kademlia/item.hpp:61</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">#include <boost/array.hpp>
|
|
|
|
namespace libtorrent { namespace dht
|
|
{
|
|
|
|
// calculate the target hash for an immutable item.
|
|
sha1_hash TORRENT_EXTRA_EXPORT item_target_id(
|
|
std::pair<char const*, int> v);
|
|
|
|
// calculate the target hash for a mutable item.
|
|
sha1_hash TORRENT_EXTRA_EXPORT item_target_id(std::pair<char const*, int> salt
|
|
, char const* pk);
|
|
|
|
bool TORRENT_EXTRA_EXPORT verify_mutable_item(
|
|
std::pair<char const*, int> v
|
|
, std::pair<char const*, int> salt
|
|
, boost::uint64_t seq
|
|
, char const* pk
|
|
, char const* sig);
|
|
|
|
<div style="background: #ffff00" width="100%">
|
|
</div>// given a byte range ``v`` and an optional byte range ``salt``, a
|
|
// sequence number, public key ``pk`` (must be 32 bytes) and a secret key
|
|
// ``sk`` (must be 64 bytes), this function produces a signature which
|
|
// is written into a 64 byte buffer pointed to by ``sig``. The caller
|
|
// is responsible for allocating the destination buffer that's passed in
|
|
// as the ``sig`` argument. Typically it would be allocated on the stack.
|
|
void TORRENT_EXPORT sign_mutable_item(
|
|
std::pair<char const*, int> v
|
|
, std::pair<char const*, int> salt
|
|
, boost::uint64_t seq
|
|
, char const* pk
|
|
, char const* sk
|
|
, char* sig);
|
|
|
|
sha1_hash TORRENT_EXTRA_EXPORT mutable_item_cas(
|
|
std::pair<char const*, int> v
|
|
, std::pair<char const*, int> salt
|
|
, boost::uint64_t seq);
|
|
|
|
struct TORRENT_EXTRA_EXPORT invalid_item : std::exception
|
|
{
|
|
virtual const char* what() const throw() { return "invalid DHT item"; }
|
|
};
|
|
|
|
enum
|
|
{
|
|
item_pk_len = 32,
|
|
item_sk_len = 64,
|
|
item_sig_len = 64
|
|
};
|
|
</pre></td></tr></table></body></html> |