premiere
/
premiere-libtorrent
2
2
Fork 1
Code Issues Pull Requests Releases Wiki Activity

fixed Jamfile. updated docs with some recent changes.

This commit is contained in:
Arvid Norberg 2006-09-02 07:33:01 +00:00
parent 5ae55c5738
commit 35c6fc413c
3 changed files with 21 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
Jamfile
View File

@ -135,14 +135,13 @@ LIBS = ;
LIBS += wsock32 ;
}
lib torrent
:
src/$(SOURCES)
src/$(KADEMLIA_SOURCES)
zlib/$(ZLIB_SOURCES)
$(LIBS)
;
#lib torrent
# :
# src/$(SOURCES)
# src/$(KADEMLIA_SOURCES)
# zlib/$(ZLIB_SOURCES)
# $(LIBS)
# ;
# if DHT support is disabled, don't include the kademlia sources
lib torrent
@ -151,7 +150,7 @@ lib torrent
zlib/$(ZLIB_SOURCES)
$(LIBS)
:
<dht-support>off
<dht-support>on:<source>src/$(KADEMLIA_SOURCES)
<dht-support>logging:<source>src/$(KADEMLIA_SOURCES)
;

10
docs/manual.html
View File

@ -544,8 +544,11 @@ and the node id from the previous session. The dht node state is a bencoded
dictionary with the following entries:</p>
<dl class="docutils">
<dt><tt class="docutils literal"><span class="pre">nodes</span></tt></dt>
<dd>is a string with the nodes written as 6 bytes each. 4 bytes ip
address and 2 bytes port number. Both are written in big endian byte order.</dd>
<dd>A list of strings, where each string is a node endpoint encoded in binary. If
the string is 6 bytes long, it is an IPv4 address of 4 bytes, encoded in
network byte order (big endian), followed by a 2 byte port number (also
network byte order). If the string is 18 bytes long, it is 16 bytes of IPv6
address followed by a 2 bytes port number (also network byte order).</dd>
<dt><tt class="docutils literal"><span class="pre">node-id</span></tt></dt>
<dd>The node id written as a readable string as a hexadecimal number.</dd>
</dl>
@ -572,8 +575,7 @@ response to a <tt class="docutils literal"><span class="pre">get_peers</span></t
<p><tt class="docutils literal"><span class="pre">search_branching</span></tt> is the number of concurrent search request the node will
send when announcing and refreshing the routing table. This parameter is
called alpha in the kademlia paper.</p>
<p><tt class="docutils literal"><span class="pre">service_port</span></tt> is the udp port the node will listen to. (currently this
cannot be changed while the node is running).</p>
<p><tt class="docutils literal"><span class="pre">service_port</span></tt> is the udp port the node will listen to.</p>
<p><tt class="docutils literal"><span class="pre">max_fail_count</span></tt> is the maximum number of failed tries to contact a node
before it is removed from the routing table. If there are known working nodes
that are ready to replace a failing node, it will be replaced immediately,

10
docs/manual.rst
View File

@ -415,8 +415,11 @@ and the node id from the previous session. The dht node state is a bencoded
dictionary with the following entries:
``nodes``
is a string with the nodes written as 6 bytes each. 4 bytes ip
address and 2 bytes port number. Both are written in big endian byte order.
A list of strings, where each string is a node endpoint encoded in binary. If
the string is 6 bytes long, it is an IPv4 address of 4 bytes, encoded in
network byte order (big endian), followed by a 2 byte port number (also
network byte order). If the string is 18 bytes long, it is 16 bytes of IPv6
address followed by a 2 bytes port number (also network byte order).
``node-id``
The node id written as a readable string as a hexadecimal number.
@ -449,8 +452,7 @@ response to a ``get_peers`` message from another node.
send when announcing and refreshing the routing table. This parameter is
called alpha in the kademlia paper.
``service_port`` is the udp port the node will listen to. (currently this
cannot be changed while the node is running).
``service_port`` is the udp port the node will listen to.
``max_fail_count`` is the maximum number of failed tries to contact a node
before it is removed from the routing table. If there are known working nodes