forked from soneyworld/dtndht
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathChangeLog
183 lines (132 loc) · 6.1 KB
/
ChangeLog
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
20 October 2012: dtndht-0.2.3
* Memory Leaks fixed
* If empty neighbor information were parsed, the allocated space is now freed
* On shutdown, the announcement list will be freed correctly
* Improved README
13 March 2012: dtndht-0.2.2
* New callback function to inform, if a search is done
* Removed the requirement of openssl
* Changed openssl to optional
* Added sha1 implementation of PolarSSL
12 March 2012: dtndht-0.2.1
* New possibility to enable evaluation output
* New function to free a convergence_layer struct
* New function is available from dtndht.h
* Bugfix free of unused memory
7 February 2012: dtndht-0.2.0
* New api design
* New GetEID Message added to dht
06 February 2012: dtndht-0.1.7
* New rating functions added
* All DHT result have got a rating information
* Minimum rating is 0, which means 1 node answered this information
* Maximum rating is 10: 11 or more nodes has answered this information
27 January 2012: dtndht-0.1.6
* New function introduced
* Lookup for hosts, group members and neighbours of hosts done by same function
* The new lookup function has a type parameter
* Also the result of a lookup has now a type parameter
* The group result function has been deleted
* Bugfixes on list operations to prevent segmentation faults
25 January 2012: dtndht-0.1.5
* Added a option to switch the blacklist off and on
* Better memory management
* frees all blacklisted id s
* frees the blacklist on uninit
19 January 2012: dtndht-0.1.4
* Added blacklist support for possible weird acting dht nodes
* Added test program for verifying blacklist
16 January 2012: dtndht-0.1.3
* Added a new function to speed up bootstrapping with a search for a random hash
* Changed the dtn_dht_ready_for_work function to return different status values
12 January 2012: dtndht-0.1.2
* A lot of bugfixes
* All library functions should work now
* Changed version number to 0.1.2
* Bootstrapping functions implemented
* prevent calling functions until dht is ready to be used
27 November 2011: dtndht-0.1.1
* Library Support added.
25 July 2011: dht-0.21
* Blacklisting support.
7 July 2011: dht-0.20
* Fix compilation on systems that have memmem but don't define HAVE_MEMMEM.
30 April 2011: dht-0.19
* Fix incorrect parsing of announces. Thanks to cjdelisle.
* Relax rate limiting slightly.
20 January 2011: dht-0.18
* Fix a bug that could cause parse_message to enter an infinite loop
on overflow. Thanks to Jordan Lee.
9 January 2011: dht-0.17:
* Fix a bug that prevented calling dht_init after dht_uninit.
* Remove the "dofree" parameter to dht_uninit.
23 December 2010: dht-0.16:
* Change the interface to allow sharing of the UDP socket e.g. with uTP.
1 July 2010: dht-0.15
* Port to Windows, for the needs of Transmission.
25 March 2010: dht-0.14
* Fixed ordering of entries in parameter dictionaries.
15 December 2009: dht-0.13
* Implemented protection against incorrect addresses in the DHT.
* Tweaked neighborhood maintenance to wake up less often.
11 December 2009: dht-0.12
* Fixed slightly incorrect formatting of DHT messages.
* Fixed incorrect debugging message.
22 November 2009: dht-0.11
* Implemented IPv6 support (BEP-32).
* Fixed a bug which could cause us to never mark a search as finished.
* Fixed a bug that could cause us to send incomplete lists in response to
find_nodes.
* Limit the number of hashes that we're willing to track.
* Made bucket maintenance slightly more aggressive.
* Produce on-the-wire error messages to give a hint to the other side.
* Added a bunch of options to dht-example to make it useful as
a bootstrap node.
* Send version "JC\0\0" when using dht-example.
18 October 2009: dht-0.10
* Send nodes even when sending values. This is a violation of the
protocol, but I have been assured that it doesn't break any deployed
implementation. This is also what both libtorrent and uTorrent do.
* Give up immediately on a search peer when no token was provided. This
is a very reasonable extension to the protocol, and certainly doesn't
break anything.
* Parse heterogeneous values lists correctly. This is mandated by BEP 32.
20 September 2009: dht-0.9
* Fixed incorrect computation of number of nodes.
* Made the initial bucket split eagerly (speeds up bootstrapping).
* Fixed initial filling of search buckets (speeds up searches).
28 July 2009: dht-0.8
* Fixed a crash when expiring the first search on the list.
* Fixed freeing of the search list when uniniting with dofree = 1.
24 June 2009: dht-0.7
* Removed the fixed limit on the number of concurrent searches, we now
use a linked list.
* Fixed build on FreeBSD (thanks to Humihara and Charles Kerr).
22 May 2009: dht-0.6
* Fixed a buffer overflow (when reading) in parse_message.
* Fixed slightly inacurrate metric computation when searching.
* Removed a slightly inaccurate shortcut when responding to find_nodes.
* Relaxed the rate-limiting parameters to 4 requests per second.
19 May 2009: dht-0.5
* Made reading of /dev/urandom a function provided by the user.
* Implemented the ``v'' extension that identifies node implementations.
18 May 2009: dht-0.4
* Fixed the handling of tokens in announce_peer messages.
* Implemented backtracking during search when nodes turn out to be dead.
17 May 2009: dht-0.3
* Fixed a number of incorrectly formatted messages.
* Changed reply to find_peers to spread the load more uniformly.
* Fixed a bug that could cause premature splitting.
* Implemented rate limiting.
* Changed some time constants to be less chatty.
* When determining if a bucket is fresh enough, we now only take replies
into account.
* dht_get_nodes now returns nodes starting with our own bucket.
* Tweaked the memory allocation strategy for stored peers.
17 May 2009: dht-0.2
* Fixed a crash in dht_uninit.
* Added support for saving the list of known-good nodes.
* Changed the interface of dht_nodes to provide the number of nodes that
recently sent incoming requests.
13 May 2009: dht-0.1
* Initial public release.