forked from premiere/premiere-libtorrent
a bunch of documentation and tarball fixes
This commit is contained in:
Arvid Norberg
parent
9636b9d3c7
commit
b579ba4342
13
Makefile.am
13
Makefile.am
|
|
@ -61,7 +61,14 @@ DOCS_IMAGES = \
|
|||
docs/write_disk_buffers.graffle \
|
||||
docs/write_disk_buffers.png \
|
||||
docs/ziptorrent_thumb.gif \
|
||||
docs/zyxel.png
|
||||
docs/zyxel.png \
|
||||
docs/folx.png \
|
||||
docs/tonidoplug.png \
|
||||
docs/disk_access_elevator.png \
|
||||
docs/disk_access_no_elevator.png\
|
||||
docs/ip_id_v4.png \
|
||||
docs/ip_id_v6.png \
|
||||
docs/hash_distribution.png
|
||||
|
||||
DOCS_PAGES = \
|
||||
docs/building.html \
|
||||
|
|
@ -76,6 +83,8 @@ DOCS_PAGES = \
|
|||
docs/dht_rss.rst \
|
||||
docs/dht_sec.html \
|
||||
docs/dht_sec.rst \
|
||||
docs/dht_store.html \
|
||||
docs/dht_store.rst \
|
||||
docs/examples.html \
|
||||
docs/examples.rst \
|
||||
docs/extension_protocol.html \
|
||||
|
|
@ -92,6 +101,8 @@ DOCS_PAGES = \
|
|||
docs/python_binding.rst \
|
||||
docs/tuning.html \
|
||||
docs/tuning.rst \
|
||||
docs/troubleshooting.html \
|
||||
docs/troubleshooting.png \
|
||||
docs/udp_tracker_protocol.html \
|
||||
docs/udp_tracker_protocol.rst \
|
||||
docs/utp.html \
|
||||
|
|
|
|||
|
|
@ -3,7 +3,7 @@
|
|||
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
||||
<meta name="generator" content="Docutils 0.10: http://docutils.sourceforge.net/" />
|
||||
<meta name="generator" content="Docutils 0.11: http://docutils.sourceforge.net/" />
|
||||
<title>BitTorrent extension for DHT RSS feeds</title>
|
||||
<meta name="author" content="Arvid Norberg, arvid@rasterbar.com" />
|
||||
<link rel="stylesheet" type="text/css" href="../../css/base.css" />
|
||||
|
|
@ -75,6 +75,8 @@
|
|||
<li><a class="reference internal" href="#rationale" id="id14">rationale</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<p>This proposal has been superseded by the <a class="reference external" href="dht_store.html">dht_put</a> feature. This may
|
||||
still be implemented on top of that.</p>
|
||||
<p>This is a proposal for an extension to the BitTorrent DHT to allow
|
||||
for decentralized RSS feed like functionality.</p>
|
||||
<p>The intention is to allow the creation of repositories of torrents
|
||||
|
|
@ -92,8 +94,6 @@ key against the target ID it is stored under, as well as the validity of
|
|||
the signatures of each individual item.</p>
|
||||
<p>As with normal DHT announces, the write-token mechanism is used to
|
||||
prevent IP spoof attacks.</p>
|
||||
<p>There are two new proposed messages, <tt class="docutils literal">announce_item</tt> and <tt class="docutils literal">get_item</tt>.
|
||||
Every valid item that is announced, should be stored.</p>
|
||||
<div class="section" id="terminology">
|
||||
<h1>terminology</h1>
|
||||
<p>In this document, a <em>storage node</em> refers to the node in the DHT to which
|
||||
|
|
|
|||
|
|
@ -9,6 +9,11 @@ BitTorrent extension for DHT RSS feeds
|
|||
:depth: 2
|
||||
:backlinks: none
|
||||
|
||||
This proposal has been superseded by the dht_put_ feature. This may
|
||||
still be implemented on top of that.
|
||||
|
||||
.. _dht_put: dht_store.html
|
||||
|
||||
This is a proposal for an extension to the BitTorrent DHT to allow
|
||||
for decentralized RSS feed like functionality.
|
||||
|
||||
|
|
@ -30,9 +35,6 @@ the signatures of each individual item.
|
|||
As with normal DHT announces, the write-token mechanism is used to
|
||||
prevent IP spoof attacks.
|
||||
|
||||
There are two new proposed messages, ``announce_item`` and ``get_item``.
|
||||
Every valid item that is announced, should be stored.
|
||||
|
||||
terminology
|
||||
-----------
|
||||
|
||||
|
|
|
|||
|
|
@ -3,7 +3,7 @@
|
|||
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
||||
<meta name="generator" content="Docutils 0.10: http://docutils.sourceforge.net/" />
|
||||
<meta name="generator" content="Docutils 0.11: http://docutils.sourceforge.net/" />
|
||||
<title></title>
|
||||
<link rel="stylesheet" type="text/css" href="../../css/base.css" />
|
||||
<link rel="stylesheet" type="text/css" href="../../css/rst.css" />
|
||||
|
|
@ -69,7 +69,7 @@
|
|||
<li><a class="reference external" href="reference-Plugins.html">plugin interface</a></li>
|
||||
<li><a class="reference external" href="dht_extensions.html">DHT extensions</a></li>
|
||||
<li><a class="reference external" href="dht_sec.html">DHT security extension</a></li>
|
||||
<li><a class="reference external" href="dht_rss.html">DHT feed extension</a></li>
|
||||
<li><a class="reference external" href="dht_store.html">DHT store extension</a></li>
|
||||
<li><a class="reference external" href="udp_tracker_protocol.html">UDP tracker protocol</a></li>
|
||||
<li><a class="reference external" href="http://www.getright.com/seedtorrent.html">HTTP seed</a></li>
|
||||
<li><a class="reference external" href="http://bittorrent.org/beps/bep_0012.html">multitracker</a></li>
|
||||
|
|
|
|||
|
|
@ -29,7 +29,7 @@ Extensions
|
|||
* `plugin interface`_
|
||||
* `DHT extensions`_
|
||||
* `DHT security extension`_
|
||||
* `DHT feed extension`_
|
||||
* `DHT store extension`_
|
||||
* `UDP tracker protocol`_
|
||||
* `HTTP seed`_
|
||||
* multitracker_
|
||||
|
|
@ -70,7 +70,7 @@ libtorrent
|
|||
.. _`plugin interface`: reference-Plugins.html
|
||||
.. _`DHT extensions`: dht_extensions.html
|
||||
.. _`DHT security extension`: dht_sec.html
|
||||
.. _`DHT feed extension`: dht_rss.html
|
||||
.. _`DHT store extension`: dht_store.html
|
||||
.. _`UDP tracker protocol`: udp_tracker_protocol.html
|
||||
.. _`HTTP seed`: http://www.getright.com/seedtorrent.html
|
||||
.. _multitracker: http://bittorrent.org/beps/bep_0012.html
|
||||
|
|
|
|||
|
|
@ -221,7 +221,6 @@ struct peer_info
|
|||
char country[2];
|
||||
std::string inet_as_name;
|
||||
int inet_as;
|
||||
size_type load_balancing;
|
||||
int download_queue_length;
|
||||
int timed_out_requests;
|
||||
int busy_requests;
|
||||
|
|
@ -612,14 +611,6 @@ an empty string if there is no name in the geo ip database.</dd>
|
|||
<dt>inet_as</dt>
|
||||
<dd>the AS number the peer is located in.</dd>
|
||||
</dl>
|
||||
<a name="load_balancing"></a><dl class="docutils">
|
||||
<dt>load_balancing</dt>
|
||||
<dd>a measurement of the balancing of free download (that we get) and free
|
||||
upload that we give. Every peer gets a certain amount of free upload,
|
||||
but this member says how much <em>extra</em> free upload this peer has got.
|
||||
If it is a negative number it means that this was a peer from which we
|
||||
have got this amount of free download.</dd>
|
||||
</dl>
|
||||
<a name="download_queue_length"></a><dl class="docutils">
|
||||
<dt>download_queue_length</dt>
|
||||
<dd>this is the number of requests
|
||||
|
|
|
|||
|
|
@ -1559,7 +1559,7 @@ starved out for bandwidth by the TCP connections. This mode is
|
|||
current throughput and rate limits all TCP connections to their
|
||||
proportional share based on how many of the connections are TCP. This
|
||||
works best if uTP connections are not rate limited by the global rate
|
||||
limiter (which they aren't by default).</p>
|
||||
limiter, see rate_limit_utp.</p>
|
||||
<p class="last">see <a class="reference external" href="reference-Settings.html#bandwidth_mixed_algo_t">bandwidth_mixed_algo_t</a> for options.</p>
|
||||
</dd>
|
||||
</dl>
|
||||
|
|
|
|||
160
docs/todo.html
160
docs/todo.html
|
|
@ -24,7 +24,7 @@
|
|||
<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">44 notes</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
|
||||
|
|
@ -131,7 +131,7 @@ namespace libtorrent
|
|||
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:6187</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:6187</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> return false;
|
||||
</pre></td></tr><tr style="background: #fcc"><td>relevance 3</td><td><a href="javascript:expand(2)">../src/torrent.cpp:6111</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:6111</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> return false;
|
||||
}
|
||||
TORRENT_ASSERT(m_connections.find(p) == m_connections.end());
|
||||
m_connections.insert(p);
|
||||
|
|
@ -255,7 +255,7 @@ when it doesn't have any of the file do the following</h2><h4>../src/web_peer_co
|
|||
return total_size - size;
|
||||
}
|
||||
|
||||
<div style="background: #ffff00" width="100%"> bool inflate_gzip(
|
||||
<div style="background: #ffff00" width="100%"> TORRENT_EXTRA_EXPORT bool inflate_gzip(
|
||||
</div> char const* in
|
||||
, int size
|
||||
, std::vector<char>& buffer
|
||||
|
|
@ -275,6 +275,9 @@ when it doesn't have any of the file do the following</h2><h4>../src/web_peer_co
|
|||
// if needed
|
||||
boost::uint32_t destlen = 4096;
|
||||
int ret = 0;
|
||||
boost::uint32_t srclen = size - header_len;
|
||||
in += header_len;
|
||||
|
||||
do
|
||||
{
|
||||
TORRENT_TRY {
|
||||
|
|
@ -283,9 +286,6 @@ when it doesn't have any of the file do the following</h2><h4>../src/web_peer_co
|
|||
error = "out of memory";
|
||||
return true;
|
||||
}
|
||||
|
||||
boost::uint32_t srclen = size - header_len;
|
||||
in += header_len;
|
||||
</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
|
||||
|
|
@ -339,7 +339,7 @@ that we have a fixed length</h2><h4>../src/policy.cpp:155</h4><pre style="backgr
|
|||
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:702</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:702</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> state_updated();
|
||||
</pre></td></tr><tr style="background: #cfc"><td>relevance 2</td><td><a href="javascript:expand(6)">../src/torrent.cpp:633</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:633</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> state_updated();
|
||||
|
||||
set_state(torrent_status::downloading);
|
||||
|
||||
|
|
@ -597,8 +597,8 @@ the chunk headers should be subtracted from the receive_buffer_size</h2><h4>../s
|
|||
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:2622</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:2622</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
||||
</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;
|
||||
|
||||
|
|
@ -754,11 +754,11 @@ is kind of expensive, it would be nice to not do it unnecessarily</h2><h4>../src
|
|||
|
||||
#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:1099</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
|
||||
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(14)">../src/torrent.cpp:1030</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:1099</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (c) c->disconnect(errors::no_memory);
|
||||
up to the highest written piece in each file</h2><h4>../src/torrent.cpp:1030</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (c) c->disconnect(errors::no_memory);
|
||||
return;
|
||||
}
|
||||
|
||||
|
|
@ -809,8 +809,8 @@ up to the highest written piece in each file</h2><h4>../src/torrent.cpp:1099</h4
|
|||
{
|
||||
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:5448</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:5448</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> ? (1 << k) : 0;
|
||||
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(15)">../src/torrent.cpp:5372</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:5372</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);
|
||||
}
|
||||
|
|
@ -861,9 +861,9 @@ it may pose an issue when downgrading though</h2><h4>../src/torrent.cpp:5448</h4
|
|||
|
||||
// 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:6355</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
|
||||
</pre></td></tr><tr style="background: #ccf"><td>relevance 1</td><td><a href="javascript:expand(16)">../src/torrent.cpp:6279</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:6355</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> TORRENT_ASSERT(m_state != torrent_status::finished && m_state != torrent_status::seeding);
|
||||
for all peers though</h2><h4>../src/torrent.cpp:6279</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);
|
||||
|
|
@ -1457,7 +1457,7 @@ remove all payload ranges that has been sent</h2><h4>../src/bt_peer_connection.c
|
|||
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:209</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:209</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(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)
|
||||
|
|
@ -1559,7 +1559,7 @@ remove all payload ranges that has been sent</h2><h4>../src/bt_peer_connection.c
|
|||
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:989</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:989</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> time_duration peer_connection::download_queue_time(int extra_bytes) const
|
||||
</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);
|
||||
|
|
@ -1610,9 +1610,9 @@ remove all payload ranges that has been sent</h2><h4>../src/bt_peer_connection.c
|
|||
{
|
||||
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:2785</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
|
||||
</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:2785</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
||||
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
|
||||
|
|
@ -1663,7 +1663,7 @@ we can construct a full bitfield</h2><h4>../src/peer_connection.cpp:2785</h4><pr
|
|||
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:2916</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:2916</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // this piece index later
|
||||
</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
|
||||
|
|
@ -1714,8 +1714,8 @@ we can construct a full bitfield</h2><h4>../src/peer_connection.cpp:2785</h4><pr
|
|||
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:4643</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:4643</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // this means we're in seed mode and we haven't yet
|
||||
</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);
|
||||
|
|
@ -2075,7 +2075,59 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
|
|||
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:4651</a></td><td>make configurable</td></tr><tr id="41" style="display: none;" colspan="3"><td colspan="3"><h2>make configurable</h2><h4>../src/session_impl.cpp:4651</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(41)">../src/session_impl.cpp:4617</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:4617</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:4651</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:4651</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)
|
||||
|
|
@ -2108,7 +2160,7 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
|
|||
|
||||
++m_allowed_upload_slots;
|
||||
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(42)">../src/session_impl.cpp:4665</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:4665</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> >= (*i)->uploaded_in_last_round() * 1000
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(43)">../src/session_impl.cpp:4665</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:4665</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> >= (*i)->uploaded_in_last_round() * 1000
|
||||
* (1 + t2->priority()) / total_milliseconds(unchoke_interval));
|
||||
}
|
||||
prev = i;
|
||||
|
|
@ -2159,7 +2211,7 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
|
|||
// 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(43)">../src/storage.cpp:324</a></td><td>if the read fails, set error and exit immediately</td></tr><tr id="43" 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();
|
||||
</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;
|
||||
|
||||
|
|
@ -2210,7 +2262,7 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
|
|||
{
|
||||
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(44)">../src/storage.cpp:358</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:358</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(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;
|
||||
}
|
||||
|
|
@ -2261,7 +2313,7 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
|
|||
, 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(45)">../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="45" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
||||
</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 (;;)
|
||||
{
|
||||
|
|
@ -2314,7 +2366,7 @@ maybe use the same format as .torrent files and reuse some code from torrent_inf
|
|||
|
||||
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(46)">../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="46" style="display: none;" colspan="3"><td colspan="3"><h2>what if file_base is used to merge several virtual files
|
||||
</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
|
||||
|
|
@ -2367,12 +2419,12 @@ if file_base is used. This is not a widely used feature though</h2><h4>../src/st
|
|||
// 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(47)">../src/torrent.cpp:1301</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="47" style="display: none;" colspan="3"><td colspan="3"><h2>is verify_peer_cert called once per certificate in the chain, and
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(48)">../src/torrent.cpp:1232</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:1301</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (pp) p->add_extension(pp);
|
||||
need to be verified to make sure its DN matches the info-hash</h2><h4>../src/torrent.cpp:1232</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
|
||||
|
|
@ -2423,12 +2475,12 @@ need to be verified to make sure its DN matches the info-hash</h2><h4>../src/tor
|
|||
{
|
||||
#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(48)">../src/torrent.cpp:5181</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="48" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(49)">../src/torrent.cpp:5105</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:5181</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (m_seed_mode) m_verified.resize(m_torrent_file->num_pieces(), false);
|
||||
which are kept in sync</h2><h4>../src/torrent.cpp:5105</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);
|
||||
|
|
@ -2479,12 +2531,12 @@ which are kept in sync</h2><h4>../src/torrent.cpp:5181</h4><pre style="backgroun
|
|||
{
|
||||
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(49)">../src/torrent.cpp:5317</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="49" style="display: none;" colspan="3"><td colspan="3"><h2>if this is a merkle torrent and we can't
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(50)">../src/torrent.cpp:5241</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:5317</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> add_web_seed(url, web_seed_entry::http_seed);
|
||||
no one uses merkle torrents</h2><h4>../src/torrent.cpp:5241</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> add_web_seed(url, web_seed_entry::http_seed);
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -2535,9 +2587,9 @@ no one uses merkle torrents</h2><h4>../src/torrent.cpp:5317</h4><pre style="back
|
|||
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(50)">../src/torrent.cpp:5505</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="50" style="display: none;" colspan="3"><td colspan="3"><h2>make this more generic to not just work if files have been
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(51)">../src/torrent.cpp:5429</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:5505</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> entry::string_type& pieces = ret["pieces"].string();
|
||||
using file_base</h2><h4>../src/torrent.cpp:5429</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())
|
||||
{
|
||||
|
|
@ -2588,10 +2640,10 @@ using file_base</h2><h4>../src/torrent.cpp:5505</h4><pre style="background: #f6f
|
|||
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(51)">../src/torrent.cpp:8068</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="51" style="display: none;" colspan="3"><td colspan="3"><h2>go through the pieces we have and count the total number
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(52)">../src/torrent.cpp:7965</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:8068</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
||||
it num_interested == 0, we need to pick a new piece</h2><h4>../src/torrent.cpp:7965</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
|
||||
|
||||
rarest_pieces.clear();
|
||||
rarest_rarity = pp.peer_count;
|
||||
|
|
@ -2642,7 +2694,7 @@ it num_interested == 0, we need to pick a new piece</h2><h4>../src/torrent.cpp:8
|
|||
{
|
||||
m_picker->get_availability(avail_vec);
|
||||
}
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(52)">../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="52" style="display: none;" colspan="3"><td colspan="3"><h2>it would be more efficient to not use a string here.
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(53)">../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="53" 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;"> }
|
||||
|
||||
|
|
@ -2695,7 +2747,7 @@ with actual strings. For example i2p trackers</h2><h4>../src/udp_tracker_connect
|
|||
{
|
||||
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(53)">../src/upnp.cpp:65</a></td><td>listen_interface is not used. It's meant to bind the broadcast socket</td></tr><tr id="53" 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;">
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(54)">../src/upnp.cpp:65</a></td><td>listen_interface is not used. It's meant to bind the broadcast socket</td></tr><tr id="54" 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
|
||||
|
|
@ -2746,7 +2798,7 @@ static error_code ec;
|
|||
m_mappings.swap(s->mappings);
|
||||
delete s;
|
||||
}
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(54)">../src/utp_stream.cpp:1606</a></td><td>this loop may not be very efficient</td></tr><tr id="54" 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;">
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(55)">../src/utp_stream.cpp:1606</a></td><td>this loop may not be very efficient</td></tr><tr id="55" 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;
|
||||
};
|
||||
|
||||
|
|
@ -2797,8 +2849,8 @@ bool utp_socket_impl::send_pkt(int flags)
|
|||
if (sack > 32) sack = 32;
|
||||
}
|
||||
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(55)">../src/kademlia/dht_tracker.cpp:451</a></td><td>ideally this function would be called when the put completes</td></tr><tr id="55" 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:451</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> // since it controls whether we re-put the content
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(56)">../src/kademlia/dht_tracker.cpp:428</a></td><td>ideally this function would be called when the put completes</td></tr><tr id="56" 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;
|
||||
|
|
@ -2849,7 +2901,7 @@ put completes</h2><h4>../src/kademlia/dht_tracker.cpp:451</h4><pre style="backgr
|
|||
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(56)">../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="56" style="display: none;" colspan="3"><td colspan="3"><h2>instad of refreshing a bucket by using find_nodes,
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(57)">../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="57" 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";
|
||||
}
|
||||
}
|
||||
|
|
@ -2901,7 +2953,7 @@ bool compare_bucket_refresh(routing_table_node const& lhs, routing_table_nod
|
|||
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(57)">../include/libtorrent/config.hpp:326</a></td><td>Make this count Unicode characters instead of bytes on windows</td></tr><tr id="57" 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:326</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(58)">../include/libtorrent/config.hpp:327</a></td><td>Make this count Unicode characters instead of bytes on windows</td></tr><tr id="58" 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:327</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
||||
// ==== eCS(OS/2) ===
|
||||
#elif defined __OS2__
|
||||
#define TORRENT_OS2
|
||||
|
|
@ -2952,7 +3004,7 @@ bool compare_bucket_refresh(routing_table_node const& lhs, routing_table_nod
|
|||
#include <stdarg.h>
|
||||
|
||||
// internal
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(58)">../include/libtorrent/peer_connection.hpp:731</a></td><td>make this private</td></tr><tr id="58" style="display: none;" colspan="3"><td colspan="3"><h2>make this private</h2><h4>../include/libtorrent/peer_connection.hpp:731</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> void set_soft_packet_size(int size) { m_soft_packet_size = size; }
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(59)">../include/libtorrent/peer_connection.hpp:725</a></td><td>make this private</td></tr><tr id="59" 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
|
||||
|
|
@ -3003,7 +3055,7 @@ bool compare_bucket_refresh(routing_table_node const& lhs, routing_table_nod
|
|||
// 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(59)">../include/libtorrent/peer_connection.hpp:812</a></td><td>make these private as well</td></tr><tr id="59" style="display: none;" colspan="3"><td colspan="3"><h2>make these private as well</h2><h4>../include/libtorrent/peer_connection.hpp:812</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(60)">../include/libtorrent/peer_connection.hpp:806</a></td><td>make these private as well</td></tr><tr id="60" 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
|
||||
|
|
@ -3054,7 +3106,7 @@ bool compare_bucket_refresh(routing_table_node const& lhs, routing_table_nod
|
|||
sliding_average<20> m_send_rate;
|
||||
|
||||
private:
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(60)">../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="60" 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
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(61)">../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="61" 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);
|
||||
}
|
||||
|
|
@ -3106,7 +3158,7 @@ m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4>
|
|||
m_sock.close(ec);
|
||||
m_resolver.cancel();
|
||||
}
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(61)">../include/libtorrent/stat.hpp:113</a></td><td>this is 4 bytes of padding!</td></tr><tr id="61" 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;">
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(62)">../include/libtorrent/stat.hpp:113</a></td><td>this is 4 bytes of padding!</td></tr><tr id="62" 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()
|
||||
|
|
@ -3157,7 +3209,7 @@ m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4>
|
|||
#endif
|
||||
}
|
||||
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(62)">../include/libtorrent/torrent.hpp:1357</a></td><td>there's space for another bit here</td></tr><tr id="62" style="display: none;" colspan="3"><td colspan="3"><h2>there's space for another bit here</h2><h4>../include/libtorrent/torrent.hpp:1357</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(63)">../include/libtorrent/torrent.hpp:1333</a></td><td>there's space for another bit here</td></tr><tr id="63" style="display: none;" colspan="3"><td colspan="3"><h2>there's space for another bit here</h2><h4>../include/libtorrent/torrent.hpp:1333</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">
|
||||
// these represent whether or not this torrent is counted
|
||||
// in the total counters of active seeds and downloads
|
||||
// in the session.
|
||||
|
|
@ -3208,7 +3260,7 @@ m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4>
|
|||
|
||||
// if this is true, libtorrent may pause and resume
|
||||
// this torrent depending on queuing rules. Torrents
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(63)">../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="63" 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;">
|
||||
</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;
|
||||
|
|
@ -3259,7 +3311,7 @@ m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4>
|
|||
// 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(64)">../include/libtorrent/upnp.hpp:108</a></td><td>support using the windows API for UPnP operations as well</td></tr><tr id="64" 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
|
||||
</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
|
||||
|
|
@ -3310,7 +3362,7 @@ public:
|
|||
// 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(65)">../include/libtorrent/utp_stream.hpp:378</a></td><td>implement blocking write. Low priority since it's not used (yet)</td></tr><tr id="65" 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()
|
||||
</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;
|
||||
|
|
@ -3361,7 +3413,7 @@ public:
|
|||
TORRENT_ASSERT(false);
|
||||
}
|
||||
|
||||
</pre></td></tr><tr style="background: #ccc"><td>relevance 0</td><td><a href="javascript:expand(66)">../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="66" style="display: none;" colspan="3"><td colspan="3"><h2>since this is a public function, it should probably be moved
|
||||
</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
|
||||
|
|
|
|||
Loading…
Reference in New Issue