fixed Jamfile. updated docs with some recent changes.

Jamfile

@@ -135,14 +135,13 @@ LIBS = ;
 		LIBS += wsock32 ;
 	}
 
-lib torrent
+#lib torrent
-	:
+#	:
-	src/$(SOURCES)
+#	src/$(SOURCES)
-	src/$(KADEMLIA_SOURCES)
+#	src/$(KADEMLIA_SOURCES)
-	zlib/$(ZLIB_SOURCES)
+#	zlib/$(ZLIB_SOURCES)
-	$(LIBS)
+#	$(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)
 	;
 
-

docs/manual.html

@@ -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
+<dd>A list of strings, where each string is a node endpoint encoded in binary. If
-address and 2 bytes port number. Both are written in big endian byte order.</dd>
+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
+<p><tt class="docutils literal"><span class="pre">service_port</span></tt> is the udp port the node will listen to.</p>
-cannot be changed while the node is running).</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,

docs/manual.rst

@@ -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
+	A list of strings, where each string is a node endpoint encoded in binary. If
-	address and 2 bytes port number. Both are written in big endian byte order.
+	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
+``service_port`` is the udp port the node will listen to.
-cannot be changed while the node is running).
 
 ``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