documentation fixes, and remove debug dependency on file_pool structure layout

This commit is contained in:
Arvid Norberg 2014-05-26 01:02:26 +00:00
parent 3893a55a57
commit e8ef5cb84e
9 changed files with 119 additions and 138 deletions

View File

@ -70,8 +70,8 @@ $(REFERENCE_TARGETS:=.rst):gen_reference_doc.py ../include/libtorrent/*.hpp ../i
rst2pdf $? -o $@ --stylesheets stylesheet rst2pdf $? -o $@ --stylesheets stylesheet
%.html:%.rst %.html:%.rst
rst2html-2.6.py --template=template.txt --stylesheet-path=style.css --link-stylesheet --no-toc-backlinks $? > $@ rst2html.py --template=template.txt --stylesheet-path=style.css --link-stylesheet --no-toc-backlinks $? > $@
rst2html-2.6.py --template=template2.txt --stylesheet-path=style.css --link-stylesheet --no-toc-backlinks $? > $(WEB_PATH)/$@ rst2html.py --template=template2.txt --stylesheet-path=style.css --link-stylesheet --no-toc-backlinks $? > $(WEB_PATH)/$@
%.png:%.dot %.png:%.dot
dot -Tpng $? >$@ dot -Tpng $? >$@

View File

@ -826,7 +826,9 @@ able to do download blocks from the same piece, concentrating slow peers on as
few pieces as possible. The reverse order means that the most common pieces are few pieces as possible. The reverse order means that the most common pieces are
picked, instead of the rarest pieces (or in the case of sequential download, picked, instead of the rarest pieces (or in the case of sequential download,
the last pieces, intead of the first).</p> the last pieces, intead of the first).</p>
<p>parole mode -----------</p> </div>
<div class="section" id="parole-mode">
<h2>parole mode</h2>
<p>Peers that have participated in a piece that failed the hash check, may be put <p>Peers that have participated in a piece that failed the hash check, may be put
in <em>parole mode</em>. This means we prefer downloading a full piece from this in <em>parole mode</em>. This means we prefer downloading a full piece from this
peer, in order to distinguish which peer is sending corrupt data. Whether to do peer, in order to distinguish which peer is sending corrupt data. Whether to do
@ -834,7 +836,9 @@ this is or not is controlled by <a class="reference external" href="reference-Se
<p>In parole mode, the piece picker prefers picking one whole piece at a time for <p>In parole mode, the piece picker prefers picking one whole piece at a time for
a given peer, avoiding picking any blocks from a piece any other peer has a given peer, avoiding picking any blocks from a piece any other peer has
contributed to (since that would defeat the purpose of parole mode).</p> contributed to (since that would defeat the purpose of parole mode).</p>
<p>prioritize partial pieces -------------------------</p> </div>
<div class="section" id="prioritize-partial-pieces">
<h2>prioritize partial pieces</h2>
<p>This setting determines if partially downloaded or requested pieces should <p>This setting determines if partially downloaded or requested pieces should
always be preferred over other pieces. The benefit of doing this is that the always be preferred over other pieces. The benefit of doing this is that the
number of partial pieces is minimized (and hence the turn-around time for number of partial pieces is minimized (and hence the turn-around time for
@ -850,7 +854,9 @@ of the swarm.</p>
in the piece picker exceeds the number of peers we're connected to times 1.5. in the piece picker exceeds the number of peers we're connected to times 1.5.
This is in order to keep the waste of partial pieces to a minimum, but still This is in order to keep the waste of partial pieces to a minimum, but still
prefer rarest pieces.</p> prefer rarest pieces.</p>
<p>prefer whole pieces -------------------</p> </div>
<div class="section" id="prefer-whole-pieces">
<h2>prefer whole pieces</h2>
<p>The <em>prefer whole pieces</em> setting makes the piece picker prefer picking entire <p>The <em>prefer whole pieces</em> setting makes the piece picker prefer picking entire
pieces at a time. This is used by web connections (both http seeding pieces at a time. This is used by web connections (both http seeding
standards), in order to be able to coalesce the small bittorrent requests to standards), in order to be able to coalesce the small bittorrent requests to

View File

@ -717,7 +717,8 @@ few pieces as possible. The reverse order means that the most common pieces are
picked, instead of the rarest pieces (or in the case of sequential download, picked, instead of the rarest pieces (or in the case of sequential download,
the last pieces, intead of the first). the last pieces, intead of the first).
parole mode ----------- parole mode
-----------
Peers that have participated in a piece that failed the hash check, may be put Peers that have participated in a piece that failed the hash check, may be put
in *parole mode*. This means we prefer downloading a full piece from this in *parole mode*. This means we prefer downloading a full piece from this
@ -728,7 +729,8 @@ In parole mode, the piece picker prefers picking one whole piece at a time for
a given peer, avoiding picking any blocks from a piece any other peer has a given peer, avoiding picking any blocks from a piece any other peer has
contributed to (since that would defeat the purpose of parole mode). contributed to (since that would defeat the purpose of parole mode).
prioritize partial pieces ------------------------- prioritize partial pieces
-------------------------
This setting determines if partially downloaded or requested pieces should This setting determines if partially downloaded or requested pieces should
always be preferred over other pieces. The benefit of doing this is that the always be preferred over other pieces. The benefit of doing this is that the
@ -748,7 +750,8 @@ in the piece picker exceeds the number of peers we're connected to times 1.5.
This is in order to keep the waste of partial pieces to a minimum, but still This is in order to keep the waste of partial pieces to a minimum, but still
prefer rarest pieces. prefer rarest pieces.
prefer whole pieces ------------------- prefer whole pieces
-------------------
The *prefer whole pieces* setting makes the piece picker prefer picking entire The *prefer whole pieces* setting makes the piece picker prefer picking entire
pieces at a time. This is used by web connections (both http seeding pieces at a time. This is used by web connections (both http seeding

View File

@ -55,16 +55,16 @@
<div class="contents topic" id="table-of-contents"> <div class="contents topic" id="table-of-contents">
<p class="topic-title first">Table of contents</p> <p class="topic-title first">Table of contents</p>
<ul class="simple"> <ul class="simple">
<li><a class="reference internal" href="#disk-buffer-holder" id="id186">disk_buffer_holder</a></li> <li><a class="reference internal" href="#disk-buffer-holder" id="id187">disk_buffer_holder</a></li>
<li><a class="reference internal" href="#hasher" id="id187">hasher</a></li> <li><a class="reference internal" href="#hasher" id="id188">hasher</a></li>
<li><a class="reference internal" href="#peer-info" id="id188">peer_info</a></li> <li><a class="reference internal" href="#peer-info" id="id189">peer_info</a></li>
<li><a class="reference internal" href="#peer-request" id="id189">peer_request</a></li> <li><a class="reference internal" href="#peer-request" id="id190">peer_request</a></li>
<li><a class="reference internal" href="#block-info" id="id190">block_info</a></li> <li><a class="reference internal" href="#block-info" id="id191">block_info</a></li>
<li><a class="reference internal" href="#partial-piece-info" id="id191">partial_piece_info</a></li> <li><a class="reference internal" href="#partial-piece-info" id="id192">partial_piece_info</a></li>
<li><a class="reference internal" href="#torrent-handle" id="id192">torrent_handle</a></li> <li><a class="reference internal" href="#torrent-handle" id="id193">torrent_handle</a></li>
<li><a class="reference internal" href="#torrent-status" id="id193">torrent_status</a></li> <li><a class="reference internal" href="#torrent-status" id="id194">torrent_status</a></li>
<li><a class="reference internal" href="#announce-entry" id="id194">announce_entry</a></li> <li><a class="reference internal" href="#announce-entry" id="id195">announce_entry</a></li>
<li><a class="reference internal" href="#torrent-info" id="id195">torrent_info</a></li> <li><a class="reference internal" href="#torrent-info" id="id196">torrent_info</a></li>
</ul> </ul>
</div> </div>
<a name="disk_buffer_holder"></a><div class="section" id="disk-buffer-holder"> <a name="disk_buffer_holder"></a><div class="section" id="disk-buffer-holder">
@ -1073,6 +1073,7 @@ struct torrent_handle
torrent_status <strong>status</strong> (boost::uint32_t flags = 0xffffffff) const; torrent_status <strong>status</strong> (boost::uint32_t flags = 0xffffffff) const;
void <strong>get_download_queue</strong> (std::vector&lt;partial_piece_info&gt;&amp; queue) const; void <strong>get_download_queue</strong> (std::vector&lt;partial_piece_info&gt;&amp; queue) const;
void <strong>reset_piece_deadline</strong> (int index) const; void <strong>reset_piece_deadline</strong> (int index) const;
void <strong>clear_piece_deadlines</strong> () const;
void <strong>set_piece_deadline</strong> (int index, int deadline, int flags = 0) const; void <strong>set_piece_deadline</strong> (int index, int deadline, int flags = 0) const;
void <strong>set_priority</strong> (int prio) const; void <strong>set_priority</strong> (int prio) const;
void <strong>file_progress</strong> (std::vector&lt;size_type&gt;&amp; progress, int flags = 0) const; void <strong>file_progress</strong> (std::vector&lt;size_type&gt;&amp; progress, int flags = 0) const;
@ -1274,12 +1275,14 @@ void <strong>get_download_queue</strong> (std::vector&lt;partial_piece_info&gt;&
it will fill with information about pieces that are partially it will fill with information about pieces that are partially
downloaded or not downloaded at all but partially requested. See downloaded or not downloaded at all but partially requested. See
<a class="reference external" href="reference-Core.html#partial_piece_info">partial_piece_info</a> for the fields in the returned vector.</p> <a class="reference external" href="reference-Core.html#partial_piece_info">partial_piece_info</a> for the fields in the returned vector.</p>
<a name="clear_piece_deadlines()"></a>
<a name="reset_piece_deadline()"></a> <a name="reset_piece_deadline()"></a>
<a name="set_piece_deadline()"></a></div> <a name="set_piece_deadline()"></a></div>
<div class="section" id="reset-piece-deadline-set-piece-deadline"> <div class="section" id="clear-piece-deadlines-reset-piece-deadline-set-piece-deadline">
<h2>reset_piece_deadline() set_piece_deadline()</h2> <h2>clear_piece_deadlines() reset_piece_deadline() set_piece_deadline()</h2>
<pre class="literal-block"> <pre class="literal-block">
void <strong>reset_piece_deadline</strong> (int index) const; void <strong>reset_piece_deadline</strong> (int index) const;
void <strong>clear_piece_deadlines</strong> () const;
void <strong>set_piece_deadline</strong> (int index, int deadline, int flags = 0) const; void <strong>set_piece_deadline</strong> (int index, int deadline, int flags = 0) const;
</pre> </pre>
<p>This function sets or resets the deadline associated with a specific <p>This function sets or resets the deadline associated with a specific
@ -1301,6 +1304,8 @@ completed.</p>
<p><tt class="docutils literal">reset_piece_deadline</tt> removes the deadline from the piece. If it <p><tt class="docutils literal">reset_piece_deadline</tt> removes the deadline from the piece. If it
hasn't already been downloaded, it will no longer be considered a hasn't already been downloaded, it will no longer be considered a
priority.</p> priority.</p>
<p><tt class="docutils literal">clear_piece_deadlines()</tt> removes deadlines on all pieces in
the torrent. As if <a class="reference external" href="reference-Core.html#reset_piece_deadline()">reset_piece_deadline()</a> was called on all pieces.</p>
<a name="set_priority()"></a></div> <a name="set_priority()"></a></div>
<div class="section" id="set-priority"> <div class="section" id="set-priority">
<h2>set_priority()</h2> <h2>set_priority()</h2>
@ -2391,7 +2396,7 @@ struct torrent_status
sha1_hash info_hash; sha1_hash info_hash;
}; };
</pre> </pre>
<a name="operator==()"></a><div class="section" id="id121"> <a name="operator==()"></a><div class="section" id="id122">
<h2>operator==()</h2> <h2>operator==()</h2>
<pre class="literal-block"> <pre class="literal-block">
bool <strong>operator==</strong> (torrent_status const&amp; st) const; bool <strong>operator==</strong> (torrent_status const&amp; st) const;
@ -2399,7 +2404,7 @@ bool <strong>operator==</strong> (torrent_status const&amp; st) const;
<p>compres if the torrent status objects come from the same torrent. i.e. <p>compres if the torrent status objects come from the same torrent. i.e.
only the <a class="reference external" href="reference-Core.html#torrent_handle">torrent_handle</a> field is compared.</p> only the <a class="reference external" href="reference-Core.html#torrent_handle">torrent_handle</a> field is compared.</p>
<a name="state_t"></a></div> <a name="state_t"></a></div>
<div class="section" id="id123"> <div class="section" id="id124">
<h2>enum state_t</h2> <h2>enum state_t</h2>
<p>Declared in &quot;<a class="reference external" href="../include/libtorrent/torrent_handle.hpp">libtorrent/torrent_handle.hpp</a>&quot;</p> <p>Declared in &quot;<a class="reference external" href="../include/libtorrent/torrent_handle.hpp">libtorrent/torrent_handle.hpp</a>&quot;</p>
<table border="1" class="docutils"> <table border="1" class="docutils">
@ -2949,7 +2954,7 @@ allowed to force another tracker update with this tracker.</p>
<p>If the last time this tracker was contacted failed, <tt class="docutils literal">last_error</tt> is the error <p>If the last time this tracker was contacted failed, <tt class="docutils literal">last_error</tt> is the error
code describing what error occurred.</p> code describing what error occurred.</p>
<a name="reset()"></a></div> <a name="reset()"></a></div>
<div class="section" id="id144"> <div class="section" id="id145">
<h2>reset()</h2> <h2>reset()</h2>
<pre class="literal-block"> <pre class="literal-block">
void <strong>reset</strong> (); void <strong>reset</strong> ();
@ -3165,7 +3170,7 @@ class torrent_info : public intrusive_ptr_base&lt;torrent_info&gt;
bool <strong>is_merkle_torrent</strong> () const; bool <strong>is_merkle_torrent</strong> () const;
}; };
</pre> </pre>
<a name="torrent_info()"></a><div class="section" id="id148"> <a name="torrent_info()"></a><div class="section" id="id149">
<h2>torrent_info()</h2> <h2>torrent_info()</h2>
<pre class="literal-block"> <pre class="literal-block">
<strong>torrent_info</strong> (std::string const&amp; filename, int flags = 0); <strong>torrent_info</strong> (std::string const&amp; filename, int flags = 0);
@ -3197,7 +3202,7 @@ always throw if an error occurs. These overloads are not available when building
exception support.</p> exception support.</p>
<p>The <tt class="docutils literal">flags</tt> argument is currently unused.</p> <p>The <tt class="docutils literal">flags</tt> argument is currently unused.</p>
<a name="~torrent_info()"></a></div> <a name="~torrent_info()"></a></div>
<div class="section" id="id156"> <div class="section" id="id157">
<h2>~torrent_info()</h2> <h2>~torrent_info()</h2>
<pre class="literal-block"> <pre class="literal-block">
<strong>~torrent_info</strong> (); <strong>~torrent_info</strong> ();
@ -3222,7 +3227,7 @@ names. Filename may be chaged using <tt class="docutils literal"><span class="pr
<p>For more information on the <a class="reference external" href="reference-Storage.html#file_storage">file_storage</a> object, see the separate document on how <p>For more information on the <a class="reference external" href="reference-Storage.html#file_storage">file_storage</a> object, see the separate document on how
to create torrents.</p> to create torrents.</p>
<a name="rename_file()"></a></div> <a name="rename_file()"></a></div>
<div class="section" id="id162"> <div class="section" id="id163">
<h2>rename_file()</h2> <h2>rename_file()</h2>
<pre class="literal-block"> <pre class="literal-block">
void <strong>rename_file</strong> (int index, std::string const&amp; new_filename); void <strong>rename_file</strong> (int index, std::string const&amp; new_filename);
@ -3307,7 +3312,7 @@ the piece index as argument and gives you the exact size of that piece. It will
be the same as <tt class="docutils literal">piece_length()</tt> except in the case of the last piece, which may be the same as <tt class="docutils literal">piece_length()</tt> except in the case of the last piece, which may
be smaller.</p> be smaller.</p>
<a name="info_hash()"></a></div> <a name="info_hash()"></a></div>
<div class="section" id="id169"> <div class="section" id="id170">
<h2>info_hash()</h2> <h2>info_hash()</h2>
<pre class="literal-block"> <pre class="literal-block">
const sha1_hash&amp; <strong>info_hash</strong> () const; const sha1_hash&amp; <strong>info_hash</strong> () const;
@ -3354,7 +3359,7 @@ std::string <strong>ssl_cert</strong> () const;
torrent. Otherwise returns an empty string. The certificate is torrent. Otherwise returns an empty string. The certificate is
the the public certificate in x509 format.</p> the the public certificate in x509 format.</p>
<a name="is_valid()"></a></div> <a name="is_valid()"></a></div>
<div class="section" id="id172"> <div class="section" id="id173">
<h2>is_valid()</h2> <h2>is_valid()</h2>
<pre class="literal-block"> <pre class="literal-block">
bool <strong>is_valid</strong> () const; bool <strong>is_valid</strong> () const;
@ -3467,7 +3472,7 @@ lazy_entry const* <strong>info</strong> (char const* key) const;
It can be used to access extension values put in the .torrent file. If the specified It can be used to access extension values put in the .torrent file. If the specified
key cannot be found, it returns NULL.</p> key cannot be found, it returns NULL.</p>
<a name="swap()"></a></div> <a name="swap()"></a></div>
<div class="section" id="id177"> <div class="section" id="id178">
<h2>swap()</h2> <h2>swap()</h2>
<pre class="literal-block"> <pre class="literal-block">
void <strong>swap</strong> (torrent_info&amp; ti); void <strong>swap</strong> (torrent_info&amp; ti);

View File

@ -57,9 +57,9 @@
<div class="contents topic" id="table-of-contents"> <div class="contents topic" id="table-of-contents">
<p class="topic-title first">Table of contents</p> <p class="topic-title first">Table of contents</p>
<ul class="simple"> <ul class="simple">
<li><a class="reference internal" href="#plugins" id="id66">Plugins</a></li> <li><a class="reference internal" href="#plugins" id="id68">Plugins</a></li>
<li><a class="reference internal" href="#plugin-interface" id="id67">plugin-interface</a></li> <li><a class="reference internal" href="#plugin-interface" id="id69">plugin-interface</a></li>
<li><a class="reference internal" href="#custom-alerts" id="id68">custom alerts</a></li> <li><a class="reference internal" href="#custom-alerts" id="id70">custom alerts</a></li>
</ul> </ul>
</div> </div>
<p>libtorrent has a <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> interface for implementing extensions to the protocol. <p>libtorrent has a <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> interface for implementing extensions to the protocol.
@ -175,6 +175,7 @@ struct plugin
virtual void <strong>added</strong> (aux::session_impl*); virtual void <strong>added</strong> (aux::session_impl*);
virtual void <strong>on_alert</strong> (alert const*); virtual void <strong>on_alert</strong> (alert const*);
virtual void <strong>on_tick</strong> (); virtual void <strong>on_tick</strong> ();
virtual bool <strong>on_optimistic_unchoke</strong> (std::vector&lt;policy::peer*&gt;&amp; <em>/* peers */</em>);
virtual void <strong>save_state</strong> (entry&amp;) const; virtual void <strong>save_state</strong> (entry&amp;) const;
virtual void <strong>load_state</strong> (lazy_entry const&amp;); virtual void <strong>load_state</strong> (lazy_entry const&amp;);
}; };
@ -214,6 +215,18 @@ posted</p>
virtual void <strong>on_tick</strong> (); virtual void <strong>on_tick</strong> ();
</pre> </pre>
<p>called once per second</p> <p>called once per second</p>
<a name="on_optimistic_unchoke()"></a></div>
<div class="section" id="on-optimistic-unchoke">
<h3>on_optimistic_unchoke()</h3>
<pre class="literal-block">
virtual bool <strong>on_optimistic_unchoke</strong> (std::vector&lt;policy::peer*&gt;&amp; <em>/* peers */</em>);
</pre>
<p>called when choosing peers to optimisticly unchoke
peer's will be unchoked in the order they appear in the given
vector which is initiallity sorted by when they were last
optimistically unchoked.
if the <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> returns true then the ordering provided will be
used and no other <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> will be allowed to change it.</p>
<a name="save_state()"></a></div> <a name="save_state()"></a></div>
<div class="section" id="save-state"> <div class="section" id="save-state">
<h3>save_state()</h3> <h3>save_state()</h3>
@ -374,6 +387,7 @@ struct peer_plugin
virtual bool <strong>on_suggest</strong> (int <em>/*index*/</em>); virtual bool <strong>on_suggest</strong> (int <em>/*index*/</em>);
virtual bool <strong>on_cancel</strong> (peer_request const&amp;); virtual bool <strong>on_cancel</strong> (peer_request const&amp;);
virtual bool <strong>on_dont_have</strong> (int <em>/*index*/</em>); virtual bool <strong>on_dont_have</strong> (int <em>/*index*/</em>);
virtual void <strong>sent_unchoke</strong> ();
virtual bool <strong>can_disconnect</strong> (error_code const&amp; <em>/*ec*/</em>); virtual bool <strong>can_disconnect</strong> (error_code const&amp; <em>/*ec*/</em>);
virtual bool <strong>on_extended</strong> (int <em>/*length*/</em>, int <em>/*msg*/</em>, virtual bool <strong>on_extended</strong> (int <em>/*length*/</em>, int <em>/*msg*/</em>,
buffer::const_interval <em>/*body*/</em>); buffer::const_interval <em>/*body*/</em>);
@ -478,6 +492,13 @@ indicates that the <a class="reference external" href="reference-Plugins.html#pl
it will break the <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> chain traversing and not let it will break the <a class="reference external" href="reference-Plugins.html#plugin">plugin</a> chain traversing and not let
anyone else handle the message, including the default anyone else handle the message, including the default
handler.</p> handler.</p>
<a name="sent_unchoke()"></a></div>
<div class="section" id="sent-unchoke">
<h3>sent_unchoke()</h3>
<pre class="literal-block">
virtual void <strong>sent_unchoke</strong> ();
</pre>
<p>called after a choke message has been sent to the peer</p>
<a name="can_disconnect()"></a></div> <a name="can_disconnect()"></a></div>
<div class="section" id="can-disconnect"> <div class="section" id="can-disconnect">
<h3>can_disconnect()</h3> <h3>can_disconnect()</h3>
@ -508,7 +529,7 @@ virtual bool <strong>on_unknown_message</strong> (int <em>/*length*/</em>, int <
<p>this is not called for web seeds</p> <p>this is not called for web seeds</p>
<a name="on_piece_failed()"></a> <a name="on_piece_failed()"></a>
<a name="on_piece_pass()"></a></div> <a name="on_piece_pass()"></a></div>
<div class="section" id="id53"> <div class="section" id="id55">
<h3>on_piece_failed() on_piece_pass()</h3> <h3>on_piece_failed() on_piece_pass()</h3>
<pre class="literal-block"> <pre class="literal-block">
virtual void <strong>on_piece_pass</strong> (int <em>/*index*/</em>); virtual void <strong>on_piece_pass</strong> (int <em>/*index*/</em>);
@ -517,7 +538,7 @@ virtual void <strong>on_piece_failed</strong> (int <em>/*index*/</em>);
<p>called when a piece that this peer participated in either <p>called when a piece that this peer participated in either
fails or passes the hash_check</p> fails or passes the hash_check</p>
<a name="tick()"></a></div> <a name="tick()"></a></div>
<div class="section" id="id54"> <div class="section" id="id56">
<h3>tick()</h3> <h3>tick()</h3>
<pre class="literal-block"> <pre class="literal-block">
virtual void <strong>tick</strong> (); virtual void <strong>tick</strong> ();

View File

@ -330,6 +330,8 @@ struct session_settings
bool report_redundant_bytes; bool report_redundant_bytes;
std::string handshake_client_version; std::string handshake_client_version;
bool use_disk_cache_pool; bool use_disk_cache_pool;
int inactive_down_rate;
int inactive_up_rate;
}; };
</pre> </pre>
<a name="~session_settings()"></a> <a name="~session_settings()"></a>
@ -1731,6 +1733,16 @@ blocks. Enabling this improves performance of the disk cache with the
side effect that the disk cache is less likely and slower at returning side effect that the disk cache is less likely and slower at returning
memory to the kernel when cache pressure is low.</dd> memory to the kernel when cache pressure is low.</dd>
</dl> </dl>
<a name="inactive_down_rate"></a>
<a name="inactive_up_rate"></a><dl class="docutils">
<dt>inactive_down_rate inactive_up_rate</dt>
<dd>the download and upload rate limits for a torrent to be considered
active by the queuing mechanism. A torrent whose download rate is less
than <tt class="docutils literal">inactive_down_rate</tt> and whose upload rate is less than
<tt class="docutils literal">inactive_up_rate</tt> for <tt class="docutils literal">auto_manage_startup</tt> seconds, is
considered inactive, and another queued torrent may be startert.
This logic is disabled if <tt class="docutils literal">dont_count_slow_torrents</tt> is false.</dd>
</dl>
<a name="dht_settings"></a></div> <a name="dht_settings"></a></div>
</div> </div>
<div class="section" id="dht-settings"> <div class="section" id="dht-settings">

View File

@ -24,7 +24,7 @@
<span style="color: #f77">2 important</span> <span style="color: #f77">2 important</span>
<span style="color: #3c3">6 relevant</span> <span style="color: #3c3">6 relevant</span>
<span style="color: #77f">13 feasible</span> <span style="color: #77f">13 feasible</span>
<span style="color: #999">46 notes</span> <span style="color: #999">45 notes</span>
<table width="100%" border="1" style="border-collapse: collapse;"><tr style="background: #fdd"><td>relevance&nbsp;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 <table width="100%" border="1" style="border-collapse: collapse;"><tr style="background: #fdd"><td>relevance&nbsp;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 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 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 integer16: *((boost::uint16_t*)dest) = boost::uint16_t(val); break;
case integer: *((int*)dest) = int(val); break; case integer: *((int*)dest) = int(val); break;
case size_integer: *((size_type*)dest) = size_type(val); break; case size_integer: *((size_type*)dest) = size_type(val); break;
</pre></td></tr><tr style="background: #fcc"><td>relevance&nbsp;3</td><td><a href="javascript:expand(2)">../src/torrent.cpp:6151</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:6151</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> return false; </pre></td></tr><tr style="background: #fcc"><td>relevance&nbsp;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()); TORRENT_ASSERT(m_connections.find(p) == m_connections.end());
m_connections.insert(p); m_connections.insert(p);
@ -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*)&amp;b1[0], 16); crc.process_bytes((char const*)&amp;b1[0], 16);
crc.process_bytes((char const*)&amp;b2[0], 16); crc.process_bytes((char const*)&amp;b2[0], 16);
} }
</pre></td></tr><tr style="background: #cfc"><td>relevance&nbsp;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(); </pre></td></tr><tr style="background: #cfc"><td>relevance&nbsp;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); set_state(torrent_status::downloading);
@ -649,8 +649,8 @@ all completed disk operations</h2><h4>../src/peer_connection.cpp:2581</h4><pre s
return; return;
} }
</pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;1</td><td><a href="javascript:expand(12)">../src/session_impl.cpp:5552</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 </pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;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:5552</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> void session_impl::on_port_mapping(int mapping, address const&amp; ip, int port 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&amp; ip, int port
, error_code const&amp; ec, int map_transport) , error_code const&amp; ec, int map_transport)
{ {
TORRENT_ASSERT(is_network_thread()); TORRENT_ASSERT(is_network_thread());
@ -701,9 +701,9 @@ this understanding of our external address, instead of the empty address</h2><h4
{ {
// INVARIANT_CHECK; // INVARIANT_CHECK;
TORRENT_ASSERT(is_network_thread()); TORRENT_ASSERT(is_network_thread());
</pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;1</td><td><a href="javascript:expand(13)">../src/session_impl.cpp:6341</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 </pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;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 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:6341</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;">#endif 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 (!m_external_ip.cast_vote(ip, source_type, source)) 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 #ifdef TORRENT_DISK_STATS
TORRENT_ASSERT(m_buffer_allocations &gt;= 0); TORRENT_ASSERT(m_buffer_allocations &gt;= 0);
</pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;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 </pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;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 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 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 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:1030</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (c) c-&gt;disconnect(errors::no_memory); 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-&gt;disconnect(errors::no_memory);
return; return;
} }
@ -809,8 +809,8 @@ up to the highest written piece in each file</h2><h4>../src/torrent.cpp:1030</h4
{ {
int size = m_torrent_file-&gt;piece_size(r.piece); int size = m_torrent_file-&gt;piece_size(r.piece);
if (rp-&gt;fail) if (rp-&gt;fail)
</pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;1</td><td><a href="javascript:expand(15)">../src/torrent.cpp:5412</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 </pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;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:5412</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> ? (1 &lt;&lt; k) : 0; it may pose an issue when downgrading though</h2><h4>../src/torrent.cpp:5431</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> ? (1 &lt;&lt; k) : 0;
bitmask.append(1, v); bitmask.append(1, v);
TORRENT_ASSERT(bits == 8 || j == num_bitmask_bytes - 1); 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:5412</h4
// write have bitmask // write have bitmask
// the pieces string has one byte per piece. Each // the pieces string has one byte per piece. Each
</pre></td></tr><tr style="background: #ccf"><td>relevance&nbsp;1</td><td><a href="javascript:expand(16)">../src/torrent.cpp:6319</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&nbsp;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 not just seeds. It would be pretty expensive to check all pieces
for all peers though</h2><h4>../src/torrent.cpp:6319</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> TORRENT_ASSERT(m_state != torrent_status::finished &amp;&amp; m_state != torrent_status::seeding); 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 &amp;&amp; m_state != torrent_status::seeding);
set_state(torrent_status::finished); set_state(torrent_status::finished);
set_queue_position(-1); set_queue_position(-1);
@ -1303,8 +1303,8 @@ use allocate_disk_receive_buffer and release_disk_receive_buffer</h2><h4>../incl
? m_ses.settings().user_agent : m_ses.settings().handshake_client_version; ? m_ses.settings().user_agent : m_ses.settings().handshake_client_version;
} }
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(25)">../src/bt_peer_connection.cpp:3356</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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:3356</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> for (std::vector&lt;range&gt;::iterator i = m_payloads.begin(); 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&lt;range&gt;::iterator i = m_payloads.begin();
i != m_payloads.end(); ++i) i != m_payloads.end(); ++i)
{ {
i-&gt;start -= bytes_transferred; i-&gt;start -= bytes_transferred;
@ -1920,7 +1920,7 @@ override at a time</h2><h4>../src/policy.cpp:888</h4><pre style="background: #f6
TORRENT_ASSERT(!t.is_aborted()); TORRENT_ASSERT(!t.is_aborted());
if (t.statistics().upload_rate() * 11 / 10 &gt; t.upload_limit()) if (t.statistics().upload_rate() * 11 / 10 &gt; t.upload_limit())
++congested_torrents; ++congested_torrents;
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(37)">../src/session_impl.cpp:4316</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:4316</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (t-&gt;is_auto_managed() &amp;&amp; !t-&gt;has_error()) </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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-&gt;is_auto_managed() &amp;&amp; !t-&gt;has_error())
{ {
TORRENT_ASSERT(t-&gt;m_resume_data_loaded || !t-&gt;valid_metadata()); TORRENT_ASSERT(t-&gt;m_resume_data_loaded || !t-&gt;valid_metadata());
// this torrent is auto managed, add it to // this torrent is auto managed, add it to
@ -1971,9 +1971,9 @@ override at a time</h2><h4>../src/policy.cpp:888</h4><pre style="background: #f6
void session_impl::recalculate_optimistic_unchoke_slots() void session_impl::recalculate_optimistic_unchoke_slots()
{ {
TORRENT_ASSERT(is_network_thread()); TORRENT_ASSERT(is_network_thread());
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(38)">../src/session_impl.cpp:4472</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 to allocate the to 10% or so of connection slots for incoming
connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> { connections</h2><h4>../src/session_impl.cpp:4464</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> {
if (m_boost_connections &gt; max_connections) if (m_boost_connections &gt; max_connections)
{ {
m_boost_connections -= max_connections; m_boost_connections -= max_connections;
@ -2024,7 +2024,7 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
int num_attempts = 1; int num_attempts = 1;
if (!t.is_finished()) if (!t.is_finished())
{ {
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(39)">../src/session_impl.cpp:4506</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:4506</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"></pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(40)">../src/session_impl.cpp:4507</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:4507</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> average_peers = num_downloads_peers / num_downloads; </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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&nbsp;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()) if (m_next_connect_torrent == m_torrents.end())
m_next_connect_torrent = m_torrents.begin(); m_next_connect_torrent = m_torrents.begin();
@ -2075,8 +2075,8 @@ connections</h2><h4>../src/session_impl.cpp:4472</h4><pre style="background: #f6
if (max_connections == 0) return; if (max_connections == 0) return;
if (num_connections() &gt;= m_settings.connections_limit) return; if (num_connections() &gt;= m_settings.connections_limit) return;
} }
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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:4617</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> { 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've unchoked this peer, and it hasn't reciprocated
// we may want to increase our estimated reciprocation rate // we may want to increase our estimated reciprocation rate
p-&gt;increase_est_reciprocation_rate(); p-&gt;increase_est_reciprocation_rate();
@ -2127,7 +2127,7 @@ immediately instead of waiting for the next tick</h2><h4>../src/session_impl.cpp
prev = i; prev = i;
} }
#endif #endif
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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;"> </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 #ifdef TORRENT_DEBUG
for (std::vector&lt;peer_connection*&gt;::const_iterator i = peers.begin() for (std::vector&lt;peer_connection*&gt;::const_iterator i = peers.begin()
, end(peers.end()), prev(peers.end()); i != end; ++i) , end(peers.end()), prev(peers.end()); i != end; ++i)
@ -2160,7 +2160,7 @@ immediately instead of waiting for the next tick</h2><h4>../src/session_impl.cpp
++m_allowed_upload_slots; ++m_allowed_upload_slots;
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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;"> &gt;= (*i)-&gt;uploaded_in_last_round() * 1000 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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;"> &gt;= (*i)-&gt;uploaded_in_last_round() * 1000
* (1 + t2-&gt;priority()) / total_milliseconds(unchoke_interval)); * (1 + t2-&gt;priority()) / total_milliseconds(unchoke_interval));
} }
prev = i; prev = i;
@ -2419,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 // makes unaligned requests (and the disk cache is disabled or fully utilized
// for write cache). // for write cache).
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 this function just tells us which depth we're at right now? If so, the comment
makes sense. makes sense.
any certificate that isn't the leaf (i.e. the one presented by the peer) 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 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:1232</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (pp) p-&gt;add_extension(pp); 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-&gt;add_extension(pp);
} }
// if files are checked for this torrent, call the extension // if files are checked for this torrent, call the extension
@ -2475,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) #if defined(TORRENT_VERBOSE_LOGGING) || defined(TORRENT_LOGGING)
match = true; match = true;
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(49)">../src/torrent.cpp:5145</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 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 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 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 and in the disk thread, since they both have their own mapped files structures
which are kept in sync</h2><h4>../src/torrent.cpp:5145</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> if (m_seed_mode) m_verified.resize(m_torrent_file-&gt;num_pieces(), false); 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-&gt;num_pieces(), false);
super_seeding(rd.dict_find_int_value("super_seeding", 0)); super_seeding(rd.dict_find_int_value("super_seeding", 0));
m_last_scrape = rd.dict_find_int_value("last_scrape", 0); m_last_scrape = rd.dict_find_int_value("last_scrape", 0);
@ -2531,12 +2531,12 @@ which are kept in sync</h2><h4>../src/torrent.cpp:5145</h4><pre style="backgroun
{ {
char const* p = piece_priority-&gt;string_ptr(); char const* p = piece_priority-&gt;string_ptr();
for (int i = 0; i &lt; piece_priority-&gt;string_length(); ++i) for (int i = 0; i &lt; piece_priority-&gt;string_length(); ++i)
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(50)">../src/torrent.cpp:5281</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 restore the tree, we need to wipe all the
bits in the have array, but not necessarily bits in the have array, but not necessarily
we might want to do a full check to see if we have we might want to do a full check to see if we have
all the pieces. This is low priority since almost all the pieces. This is low priority since almost
no one uses merkle torrents</h2><h4>../src/torrent.cpp:5281</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:5300</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> add_web_seed(url, web_seed_entry::http_seed);
} }
} }
@ -2587,9 +2587,9 @@ no one uses merkle torrents</h2><h4>../src/torrent.cpp:5281</h4><pre style="back
ret["num_complete"] = m_complete; ret["num_complete"] = m_complete;
ret["num_incomplete"] = m_incomplete; ret["num_incomplete"] = m_incomplete;
ret["num_downloaded"] = m_downloaded; ret["num_downloaded"] = m_downloaded;
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(51)">../src/torrent.cpp:5469</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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. renamed, but also if they have been merged into a single file for instance.
using file_base</h2><h4>../src/torrent.cpp:5469</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> entry::string_type&amp; pieces = ret["pieces"].string(); using file_base</h2><h4>../src/torrent.cpp:5488</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> entry::string_type&amp; pieces = ret["pieces"].string();
pieces.resize(m_torrent_file-&gt;num_pieces()); pieces.resize(m_torrent_file-&gt;num_pieces());
if (is_seed()) if (is_seed())
{ {
@ -2640,10 +2640,10 @@ using file_base</h2><h4>../src/torrent.cpp:5469</h4><pre style="background: #f6f
error_code ec; error_code ec;
policy::peer const* p = *i; policy::peer const* p = *i;
address addr = p-&gt;address(); address addr = p-&gt;address();
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(52)">../src/torrent.cpp:8005</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 </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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 of downloaders we have. Only count peers that are interested in us
since some peers might not send have messages for pieces we have 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:8005</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:8073</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> }
rarest_pieces.clear(); rarest_pieces.clear();
rarest_rarity = pp.peer_count; rarest_rarity = pp.peer_count;
@ -3004,7 +3004,7 @@ bool compare_bucket_refresh(routing_table_node const&amp; lhs, routing_table_nod
node_id mask = generate_prefix_mask(num_bits); node_id mask = generate_prefix_mask(num_bits);
// target = (target &amp; ~mask) | (root &amp; mask) // target = (target &amp; ~mask) | (root &amp; mask)
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(59)">../include/libtorrent/config.hpp:327</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:327</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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) === // ==== eCS(OS/2) ===
#elif defined __OS2__ #elif defined __OS2__
#define TORRENT_OS2 #define TORRENT_OS2
@ -3260,58 +3260,7 @@ m_sock.bind(endpoint, ec);</h2><h4>../include/libtorrent/proxy_base.hpp:166</h4>
#endif #endif
} }
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(64)">../include/libtorrent/torrent.hpp:1336</a></td><td>there's space for another bit here</td></tr><tr id="64" style="display: none;" colspan="3"><td colspan="3"><h2>there's space for another bit here</h2><h4>../include/libtorrent/torrent.hpp:1336</h4><pre style="background: #f6f6f6; border: solid 1px #ddd;"> </pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;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;">
// these represent whether or not this torrent is counted
// in the total counters of active seeds and downloads
// in the session.
bool m_is_active_download:1;
bool m_is_active_finished:1;
// even if we're not built to support SSL torrents,
// remember that this is an SSL torrent, so that we don't
// accidentally start seeding it without any authentication.
bool m_ssl_torrent:1;
// this is set to true if we're trying to delete the
// files belonging to it. When set, don't write any
// more blocks to disk!
bool m_deleted:1;
// set to true while moving the storage
bool m_moving_storage:1;
<div style="background: #ffff00" width="100%">
</div>// ----
// the scrape data from the tracker response, this
// is optional and may be 0xffffff
boost::uint32_t m_incomplete:24;
// is set to true when the torrent has
// been aborted.
bool m_abort:1;
// true when the torrent should announce to
// the DHT
bool m_announce_to_dht:1;
// true when this torrent should anncounce to
// trackers
bool m_announce_to_trackers:1;
// true when this torrent should anncounce to
// the local network
bool m_announce_to_lsd:1;
// is true if this torrent has allows having peers
bool m_allow_peers:1;
// set to true when this torrent may not download anything
bool m_upload_mode:1;
// 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&nbsp;0</td><td><a href="javascript:expand(65)">../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="65" 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 // if this tracker failed the last time it was contacted
// this error code specifies what error occurred // this error code specifies what error occurred
error_code last_error; error_code last_error;
@ -3362,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 // flags for the source bitmask, each indicating where
// we heard about this tracker // we heard about this tracker
enum tracker_source enum tracker_source
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(66)">../include/libtorrent/upnp.hpp:108</a></td><td>support using the windows API for UPnP operations as well</td></tr><tr id="66" 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&nbsp;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, remote_host_must_be_wildcard = 726,
// ExternalPort must be a wildcard and cannot be a // ExternalPort must be a wildcard and cannot be a
// specific port // specific port
@ -3413,7 +3362,7 @@ public:
// is -1, which means failure. There will not be any error alert notification for // is -1, which means failure. There will not be any error alert notification for
// mappings that fail with a -1 return value. // mappings that fail with a -1 return value.
int add_mapping(protocol_type p, int external_port, int local_port); int add_mapping(protocol_type p, int external_port, int local_port);
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(67)">../include/libtorrent/utp_stream.hpp:378</a></td><td>implement blocking write. Low priority since it's not used (yet)</td></tr><tr id="67" 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&nbsp;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) , end(buffers.end()); i != end; ++i)
{ {
using asio::buffer_cast; using asio::buffer_cast;
@ -3464,7 +3413,7 @@ public:
TORRENT_ASSERT(false); TORRENT_ASSERT(false);
} }
</pre></td></tr><tr style="background: #ccc"><td>relevance&nbsp;0</td><td><a href="javascript:expand(68)">../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="68" 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&nbsp;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 &lt;boost/array.hpp&gt; 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 &lt;boost/array.hpp&gt;
namespace libtorrent { namespace dht namespace libtorrent { namespace dht

View File

@ -107,9 +107,6 @@ namespace libtorrent
file_set m_files; file_set m_files;
mutex m_mutex; mutex m_mutex;
#if TORRENT_USE_ASSERTS
int m_in_use;
#endif
#if TORRENT_CLOSE_MAY_BLOCK #if TORRENT_CLOSE_MAY_BLOCK
void closer_thread_fun(); void closer_thread_fun();

View File

@ -49,16 +49,10 @@ namespace libtorrent
, m_closer_thread(boost::bind(&file_pool::closer_thread_fun, this)) , m_closer_thread(boost::bind(&file_pool::closer_thread_fun, this))
#endif #endif
{ {
#if TORRENT_USE_ASSERTS
m_in_use = 1337;
#endif
} }
file_pool::~file_pool() file_pool::~file_pool()
{ {
#if TORRENT_USE_ASSERTS
m_in_use = 0;
#endif
#if TORRENT_CLOSE_MAY_BLOCK #if TORRENT_CLOSE_MAY_BLOCK
mutex::scoped_lock l(m_closer_mutex); mutex::scoped_lock l(m_closer_mutex);
m_stop_thread = true; m_stop_thread = true;
@ -183,7 +177,6 @@ namespace libtorrent
TORRENT_ASSERT((m & file::rw_mask) == file::read_only TORRENT_ASSERT((m & file::rw_mask) == file::read_only
|| (m & file::rw_mask) == file::read_write); || (m & file::rw_mask) == file::read_write);
mutex::scoped_lock l(m_mutex); mutex::scoped_lock l(m_mutex);
TORRENT_ASSERT(m_in_use == 1337);
file_set::iterator i = m_files.find(std::make_pair(st, file_index)); file_set::iterator i = m_files.find(std::make_pair(st, file_index));
if (i != m_files.end()) if (i != m_files.end())
{ {
@ -268,8 +261,6 @@ namespace libtorrent
void file_pool::remove_oldest() void file_pool::remove_oldest()
{ {
TORRENT_ASSERT(m_in_use == 1337);
file_set::iterator i = std::min_element(m_files.begin(), m_files.end() file_set::iterator i = std::min_element(m_files.begin(), m_files.end()
, boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _1)) , boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _1))
< boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _2))); < boost::bind(&lru_file_entry::last_use, boost::bind(&file_set::value_type::second, _2)));
@ -286,7 +277,6 @@ namespace libtorrent
void file_pool::release(void* st, int file_index) void file_pool::release(void* st, int file_index)
{ {
mutex::scoped_lock l(m_mutex); mutex::scoped_lock l(m_mutex);
TORRENT_ASSERT(m_in_use == 1337);
file_set::iterator i = m_files.find(std::make_pair(st, file_index)); file_set::iterator i = m_files.find(std::make_pair(st, file_index));
if (i == m_files.end()) return; if (i == m_files.end()) return;
@ -303,7 +293,6 @@ namespace libtorrent
void file_pool::release(void* st) void file_pool::release(void* st)
{ {
mutex::scoped_lock l(m_mutex); mutex::scoped_lock l(m_mutex);
TORRENT_ASSERT(m_in_use == 1337);
if (st == 0) if (st == 0)
{ {
m_files.clear(); m_files.clear();
@ -324,7 +313,6 @@ namespace libtorrent
{ {
TORRENT_ASSERT(size > 0); TORRENT_ASSERT(size > 0);
TORRENT_ASSERT(m_in_use == 1337);
if (size == m_size) return; if (size == m_size) return;
mutex::scoped_lock l(m_mutex); mutex::scoped_lock l(m_mutex);
m_size = size; m_size = size;