From 35c6fc413c2ae7168a5092283668c8ec21c5be2f Mon Sep 17 00:00:00 2001
From: Arvid Norberg
Date: Sat, 2 Sep 2006 07:33:01 +0000
Subject: [PATCH] fixed Jamfile. updated docs with some recent changes.
---
Jamfile | 19 +++++++++----------
docs/manual.html | 10 ++++++----
docs/manual.rst | 10 ++++++----
3 files changed, 21 insertions(+), 18 deletions(-)
diff --git a/Jamfile b/Jamfile
index 759904b46..3d98f4bd3 100755
--- a/Jamfile
+++ b/Jamfile
@@ -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)
:
- off
+ on:src/$(KADEMLIA_SOURCES)
+ logging:src/$(KADEMLIA_SOURCES)
;
-
diff --git a/docs/manual.html b/docs/manual.html
index 4348a3405..9e5c965d8 100755
--- a/docs/manual.html
+++ b/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:
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.
@@ -572,8 +575,7 @@ response to a get_peerssearch_branching 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.
-
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
that are ready to replace a failing node, it will be replaced immediately,
diff --git a/docs/manual.rst b/docs/manual.rst
index d608edb96..1c531cf4c 100755
--- a/docs/manual.rst
+++ b/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
- 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