2 This file is part of GNUnet.
3 (C) 2009, 2010 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file dht/gnunet-service-dht.c
23 * @brief GNUnet DHT service
24 * @author Christian Grothoff
25 * @author Nathan Evans
29 #include "gnunet_block_lib.h"
30 #include "gnunet_client_lib.h"
31 #include "gnunet_getopt_lib.h"
32 #include "gnunet_os_lib.h"
33 #include "gnunet_protocols.h"
34 #include "gnunet_service_lib.h"
35 #include "gnunet_core_service.h"
36 #include "gnunet_signal_lib.h"
37 #include "gnunet_util_lib.h"
38 #include "gnunet_datacache_lib.h"
39 #include "gnunet_transport_service.h"
40 #include "gnunet_hello_lib.h"
41 #include "gnunet_dht_service.h"
42 #include "gnunet_statistics_service.h"
47 #define PRINT_TABLES GNUNET_NO
49 #define REAL_DISTANCE GNUNET_NO
51 #define EXTRA_CHECKS GNUNET_NO
54 * How many buckets will we allow total.
56 #define MAX_BUCKETS sizeof (GNUNET_HashCode) * 8
59 * Should the DHT issue FIND_PEER requests to get better routing tables?
61 #define DEFAULT_DO_FIND_PEER GNUNET_YES
64 * Defines whether find peer requests send their HELLO's outgoing,
65 * or expect replies to contain hellos.
67 #define FIND_PEER_WITH_HELLO GNUNET_YES
70 * What is the maximum number of peers in a given bucket.
72 #define DEFAULT_BUCKET_SIZE 4
75 * Minimum number of peers we need for "good" routing,
76 * any less than this and we will allow messages to
77 * travel much further through the network!
79 #define MINIMUM_PEER_THRESHOLD 20
81 #define DHT_MAX_RECENT 1000
83 #define FIND_PEER_CALC_INTERVAL GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 60)
86 * Default time to wait to send messages on behalf of other peers.
88 #define DHT_DEFAULT_P2P_TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 10)
91 * Default importance for handling messages on behalf of other peers.
93 #define DHT_DEFAULT_P2P_IMPORTANCE 0
96 * How long to keep recent requests around by default.
98 #define DEFAULT_RECENT_REMOVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30)
101 * Default time to wait to send find peer messages sent by the dht service.
103 #define DHT_DEFAULT_FIND_PEER_TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 30)
106 * Default importance for find peer messages sent by the dht service.
108 #define DHT_DEFAULT_FIND_PEER_IMPORTANCE 8
111 * Default replication parameter for find peer messages sent by the dht service.
113 #define DHT_DEFAULT_FIND_PEER_REPLICATION 4
116 * Default options for find peer requests sent by the dht service.
118 #define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE
119 /*#define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_NONE*/
122 * How long at least to wait before sending another find peer request.
124 #define DHT_MINIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
127 * How long at most to wait before sending another find peer request.
129 #define DHT_MAXIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 8)
132 * How often to update our preference levels for peers in our routing tables.
134 #define DHT_DEFAULT_PREFERENCE_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
137 * How long at most on average will we allow a reply forward to take
138 * (before we quit sending out new requests)
140 #define MAX_REQUEST_TIME GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
143 * How many initial requests to send out (in true Kademlia fashion)
145 #define DHT_KADEMLIA_REPLICATION 3
148 * Default frequency for sending malicious get messages
150 #define DEFAULT_MALICIOUS_GET_FREQUENCY 1000 /* Number of milliseconds */
153 * Default frequency for sending malicious put messages
155 #define DEFAULT_MALICIOUS_PUT_FREQUENCY 1000 /* Default is in milliseconds */
158 #define DHT_DEFAULT_PING_DELAY GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 1)
161 * Real maximum number of hops, at which point we refuse
162 * to forward the message.
164 #define DEFAULT_MAX_HOPS 10
167 * How many time differences between requesting a core send and
168 * the actual callback to remember.
170 #define MAX_REPLY_TIMES 8
172 enum ConvergenceOptions
175 * Use the linear method for convergence.
180 * Converge using a fast converging square
186 * Converge using a slower exponential
189 DHT_CONVERGE_EXPONENTIAL,
192 * Don't do any special convergence, allow
193 * the algorithm to hopefully route to closer
199 * Binary convergence, start routing to closest
200 * only after set number of hops.
206 * Linked list of messages to send to clients.
208 struct P2PPendingMessage
211 * Pointer to next item in the list
213 struct P2PPendingMessage *next;
216 * Pointer to previous item in the list
218 struct P2PPendingMessage *prev;
221 * Message importance level.
223 unsigned int importance;
226 * Time when this request was scheduled to be sent.
228 struct GNUNET_TIME_Absolute scheduled;
231 * How long to wait before sending message.
233 struct GNUNET_TIME_Relative timeout;
236 * Actual message to be sent; // avoid allocation
238 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
243 * Per-peer information.
248 * Next peer entry (DLL)
250 struct PeerInfo *next;
253 * Prev peer entry (DLL)
255 struct PeerInfo *prev;
258 * Head of pending messages to be sent to this peer.
260 struct P2PPendingMessage *head;
263 * Tail of pending messages to be sent to this peer.
265 struct P2PPendingMessage *tail;
268 * Core handle for sending messages to this peer.
270 struct GNUNET_CORE_TransmitHandle *th;
273 * Task for scheduling message sends.
275 GNUNET_SCHEDULER_TaskIdentifier send_task;
278 * Task for scheduling preference updates
280 GNUNET_SCHEDULER_TaskIdentifier preference_task;
283 * Preference update context
285 struct GNUNET_CORE_InformationRequestContext *info_ctx;
288 * What is the average latency for replies received?
290 struct GNUNET_TIME_Relative latency;
293 * What is the identity of the peer?
295 struct GNUNET_PeerIdentity id;
298 * Transport level distance to peer.
300 unsigned int distance;
303 * Holds matching bits from peer to current target,
304 * used for distance comparisons between peers. May
305 * be considered a really bad idea.
306 * FIXME: remove this value (create struct which holds
307 * a single peerinfo and the matching bits, use
308 * that to pass to comparitor)
310 unsigned int matching_bits;
313 * Task for scheduling periodic ping messages for this peer.
315 GNUNET_SCHEDULER_TaskIdentifier ping_task;
319 * Peers are grouped into buckets.
326 struct PeerInfo *head;
331 struct PeerInfo *tail;
334 * Number of peers in the bucket.
336 unsigned int peers_size;
340 * Linked list of messages to send to clients.
342 struct PendingMessage
345 * Pointer to next item in the list
347 struct PendingMessage *next;
350 * Pointer to previous item in the list
352 struct PendingMessage *prev;
355 * Actual message to be sent; // avoid allocation
357 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
362 * Struct containing information about a client,
363 * handle to connect to it, and any pending messages
364 * that need to be sent to it.
369 * Linked list of active clients
371 struct ClientList *next;
374 * The handle to this client
376 struct GNUNET_SERVER_Client *client_handle;
379 * Handle to the current transmission request, NULL
382 struct GNUNET_CONNECTION_TransmitHandle *transmit_handle;
385 * Linked list of pending messages for this client
387 struct PendingMessage *pending_head;
390 * Tail of linked list of pending messages for this client
392 struct PendingMessage *pending_tail;
397 * Context containing information about a DHT message received.
399 struct DHT_MessageContext
402 * The client this request was received from.
403 * (NULL if received from another peer)
405 struct ClientList *client;
408 * The peer this request was received from.
409 * (NULL if received from local client)
411 const struct GNUNET_PeerIdentity *peer;
414 * Bloomfilter for this routing request.
416 struct GNUNET_CONTAINER_BloomFilter *bloom;
419 * extended query (see gnunet_block_lib.h).
424 * Bloomfilter to filter out duplicate replies.
426 struct GNUNET_CONTAINER_BloomFilter *reply_bf;
429 * The key this request was about
434 * How long should we wait to transmit this request?
436 struct GNUNET_TIME_Relative timeout;
439 * The unique identifier of this request
444 * Number of bytes in xquery.
449 * Mutator value for the reply_bf, see gnunet_block_lib.h
451 uint32_t reply_bf_mutator;
454 * Desired replication level
456 uint32_t replication;
459 * Network size estimate, either ours or the sum of
460 * those routed to thus far. =~ Log of number of peers
461 * chosen from for this request.
463 uint32_t network_size;
466 * Any message options for this request
468 uint32_t msg_options;
471 * How many hops has the message already traversed?
476 * How important is this message?
478 unsigned int importance;
481 * Should we (still) forward the request on to other peers?
486 * Did we forward this message? (may need to remember it!)
491 * Are we the closest known peer to this key (out of our neighbors?)
497 * Record used for remembering what peers are waiting for what
498 * responses (based on search key).
500 struct DHTRouteSource
505 struct DHTRouteSource *next;
510 struct DHTRouteSource *prev;
513 * Source of the request. Replies should be forwarded to
516 struct GNUNET_PeerIdentity source;
519 * If this was a local request, remember the client; otherwise NULL.
521 struct ClientList *client;
524 * Pointer to this nodes heap location (for removal)
526 struct GNUNET_CONTAINER_HeapNode *hnode;
529 * Back pointer to the record storing this information.
531 struct DHTQueryRecord *record;
534 * Task to remove this entry on timeout.
536 GNUNET_SCHEDULER_TaskIdentifier delete_task;
539 * Bloomfilter of peers we have already sent back as
540 * replies to the initial request. Allows us to not
541 * forward the same peer multiple times for a find peer
544 struct GNUNET_CONTAINER_BloomFilter *find_peers_responded;
549 * Entry in the DHT routing table.
551 struct DHTQueryRecord
554 * Head of DLL for result forwarding.
556 struct DHTRouteSource *head;
559 * Tail of DLL for result forwarding.
561 struct DHTRouteSource *tail;
564 * Key that the record concerns.
569 * GET message of this record (what we already forwarded?).
571 //DV_DHT_MESSAGE get; Try to get away with not saving this.
574 * Bloomfilter of the peers we've replied to so far
576 //struct GNUNET_BloomFilter *bloom_results; Don't think we need this, just remove from DLL on response.
581 * Context used to calculate the number of find peer messages
582 * per X time units since our last scheduled find peer message
583 * was sent. If we have seen too many messages, delay or don't
586 struct FindPeerMessageContext
590 struct GNUNET_TIME_Absolute start;
592 struct GNUNET_TIME_Absolute end;
596 * DHT Routing results structure
601 * Min heap for removal upon reaching limit
603 struct GNUNET_CONTAINER_Heap *minHeap;
606 * Hashmap for fast key based lookup
608 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
613 * DHT structure for recent requests.
615 struct RecentRequests
618 * Min heap for removal upon reaching limit
620 struct GNUNET_CONTAINER_Heap *minHeap;
623 * Hashmap for key based lookup
625 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
631 * Position of this node in the min heap.
633 struct GNUNET_CONTAINER_HeapNode *heap_node;
636 * Bloomfilter containing entries for peers
637 * we forwarded this request to.
639 struct GNUNET_CONTAINER_BloomFilter *bloom;
642 * Timestamp of this request, for ordering
645 struct GNUNET_TIME_Absolute timestamp;
648 * Key of this request.
653 * Unique identifier for this request.
658 * Task to remove this entry on timeout.
660 GNUNET_SCHEDULER_TaskIdentifier remove_task;
663 struct RepublishContext
678 * Which kind of convergence will we be using?
680 static enum ConvergenceOptions converge_option;
683 * Modifier for the convergence function
685 static float converge_modifier;
688 * Recent requests by hash/uid and by time inserted.
690 static struct RecentRequests recent;
693 * Context to use to calculate find peer rates.
695 static struct FindPeerMessageContext find_peer_context;
698 * Don't use our routing algorithm, always route
699 * to closest peer; initially send requests to 3
702 static unsigned int strict_kademlia;
705 * Routing option to end routing when closest peer found.
707 static unsigned int stop_on_closest;
710 * Routing option to end routing when data is found.
712 static unsigned int stop_on_found;
715 * Whether DHT needs to manage find peer requests, or
716 * an external force will do it on behalf of the DHT.
718 static unsigned int do_find_peer;
721 * Once we have stored an item in the DHT, refresh it
722 * according to our republish interval.
724 static unsigned int do_republish;
727 * Use the "real" distance metric when selecting the
728 * next routing hop. Can be less accurate.
730 static unsigned int use_real_distance;
733 * How many peers have we added since we sent out our last
736 static unsigned int newly_found_peers;
739 * Container of active queries we should remember
741 static struct DHTResults forward_list;
744 * Handle to the datacache service (for inserting/retrieving data)
746 static struct GNUNET_DATACACHE_Handle *datacache;
749 * Handle for the statistics service.
751 struct GNUNET_STATISTICS_Handle *stats;
755 * The configuration the DHT service is running with
757 static const struct GNUNET_CONFIGURATION_Handle *cfg;
760 * Handle to the core service
762 static struct GNUNET_CORE_Handle *coreAPI;
765 * Handle to the transport service, for getting our hello
767 static struct GNUNET_TRANSPORT_Handle *transport_handle;
770 * The identity of our peer.
772 static struct GNUNET_PeerIdentity my_identity;
775 * Short id of the peer, for printing
777 static char *my_short_id;
782 static struct GNUNET_MessageHeader *my_hello;
785 * Task to run when we shut down, cleaning up all our trash
787 static GNUNET_SCHEDULER_TaskIdentifier cleanup_task;
790 * The lowest currently used bucket.
792 static unsigned int lowest_bucket; /* Initially equal to MAX_BUCKETS - 1 */
795 * The maximum number of hops before we stop routing messages.
797 static unsigned long long max_hops;
800 * How often to republish content we have previously stored.
802 static struct GNUNET_TIME_Relative dht_republish_frequency;
805 * GNUNET_YES to stop at max_hops, GNUNET_NO to heuristically decide when to stop forwarding.
807 static int use_max_hops;
810 * The buckets (Kademlia routing table, complete with growth).
811 * Array of size MAX_BUCKET_SIZE.
813 static struct PeerBucket k_buckets[MAX_BUCKETS]; /* From 0 to MAX_BUCKETS - 1 */
816 * Hash map of all known peers, for easy removal from k_buckets on disconnect.
818 static struct GNUNET_CONTAINER_MultiHashMap *all_known_peers;
821 * Recently seen find peer requests.
823 static struct GNUNET_CONTAINER_MultiHashMap *recent_find_peer_requests;
826 * Maximum size for each bucket.
828 static unsigned int bucket_size = DEFAULT_BUCKET_SIZE; /* Initially equal to DEFAULT_BUCKET_SIZE */
831 * List of active clients.
833 static struct ClientList *client_list;
836 * Handle to the DHT logger.
838 static struct GNUNET_DHTLOG_Handle *dhtlog_handle;
841 * Whether or not to send routing debugging information
842 * to the dht logging server
844 static unsigned int debug_routes;
847 * Whether or not to send FULL route information to
850 static unsigned int debug_routes_extended;
853 * GNUNET_YES or GNUNET_NO, whether or not to act as
854 * a malicious node which drops all messages
856 static unsigned int malicious_dropper;
859 * GNUNET_YES or GNUNET_NO, whether or not to act as
860 * a malicious node which sends out lots of GETS
862 static unsigned int malicious_getter;
865 * GNUNET_YES or GNUNET_NO, whether or not to act as
866 * a malicious node which sends out lots of PUTS
868 static unsigned int malicious_putter;
871 * Frequency for malicious get requests.
873 static unsigned long long malicious_get_frequency;
876 * Frequency for malicious put requests.
878 static unsigned long long malicious_put_frequency;
881 * Reply times for requests, if we are busy, don't send any
884 static struct GNUNET_TIME_Relative reply_times[MAX_REPLY_TIMES];
887 * Current counter for replies.
889 static unsigned int reply_counter;
892 * Our handle to the BLOCK library.
894 static struct GNUNET_BLOCK_Context *block_context;
898 * Forward declaration.
901 send_generic_reply (void *cls, size_t size, void *buf);
904 /** Declare here so retry_core_send is aware of it */
906 core_transmit_notify (void *cls,
907 size_t size, void *buf);
910 * Convert unique ID to hash code.
912 * @param uid unique ID to convert
913 * @param hash set to uid (extended with zeros)
916 hash_from_uid (uint64_t uid,
917 GNUNET_HashCode *hash)
919 memset (hash, 0, sizeof(GNUNET_HashCode));
920 *((uint64_t*)hash) = uid;
925 * Calculate the average send time between messages so that we can
926 * ignore certain requests if we get too busy.
928 * @return the average time between asking core to send a message
929 * and when the buffer for copying it is passed
931 static struct GNUNET_TIME_Relative get_average_send_delay()
934 unsigned int divisor;
935 struct GNUNET_TIME_Relative average_time;
936 average_time = GNUNET_TIME_relative_get_zero();
938 for (i = 0; i < MAX_REPLY_TIMES; i++)
940 average_time = GNUNET_TIME_relative_add(average_time, reply_times[i]);
941 if (reply_times[i].abs_value == (uint64_t)0)
951 average_time = GNUNET_TIME_relative_divide(average_time, divisor);
953 "Avg send delay: %u sends is %llu\n",
955 (unsigned long long) average_time.abs_value);
961 * Given the largest send delay, artificially decrease it
962 * so the next time around we may have a chance at sending
965 static void decrease_max_send_delay(struct GNUNET_TIME_Relative max_time)
968 for (i = 0; i < MAX_REPLY_TIMES; i++)
970 if (reply_times[i].rel_value == max_time.rel_value)
972 reply_times[i].rel_value = reply_times[i].rel_value / 2;
979 * Find the maximum send time of the recently sent values.
981 * @return the average time between asking core to send a message
982 * and when the buffer for copying it is passed
984 static struct GNUNET_TIME_Relative get_max_send_delay()
987 struct GNUNET_TIME_Relative max_time;
988 max_time = GNUNET_TIME_relative_get_zero();
990 for (i = 0; i < MAX_REPLY_TIMES; i++)
992 if (reply_times[i].rel_value > max_time.rel_value)
993 max_time.rel_value = reply_times[i].rel_value;
996 if (max_time.rel_value > MAX_REQUEST_TIME.rel_value)
997 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Max send delay was %llu\n",
998 (unsigned long long) max_time.rel_value);
1003 increment_stats(const char *value)
1007 GNUNET_STATISTICS_update (stats, value, 1, GNUNET_NO);
1012 * Try to send another message from our core send list
1015 try_core_send (void *cls,
1016 const struct GNUNET_SCHEDULER_TaskContext *tc)
1018 struct PeerInfo *peer = cls;
1019 struct P2PPendingMessage *pending;
1022 peer->send_task = GNUNET_SCHEDULER_NO_TASK;
1024 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1027 if (peer->th != NULL)
1028 return; /* Message send already in progress */
1030 pending = peer->head;
1031 if (pending != NULL)
1033 ssize = ntohs(pending->msg->size);
1035 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1036 "`%s:%s': Calling notify_transmit_ready with size %d for peer %s\n", my_short_id,
1037 "DHT", ssize, GNUNET_i2s(&peer->id));
1039 pending->scheduled = GNUNET_TIME_absolute_get();
1041 if (reply_counter >= MAX_REPLY_TIMES)
1043 peer->th = GNUNET_CORE_notify_transmit_ready(coreAPI, pending->importance,
1044 pending->timeout, &peer->id,
1045 ssize, &core_transmit_notify, peer);
1050 * Function called to send a request out to another peer.
1051 * Called both for locally initiated requests and those
1052 * received from other peers.
1054 * @param msg the encapsulated message
1055 * @param peer the peer to forward the message to
1056 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1059 forward_result_message (const struct GNUNET_MessageHeader *msg,
1060 struct PeerInfo *peer,
1061 struct DHT_MessageContext *msg_ctx)
1063 struct GNUNET_DHT_P2PRouteResultMessage *result_message;
1064 struct P2PPendingMessage *pending;
1068 increment_stats(STAT_RESULT_FORWARDS);
1069 msize = sizeof (struct GNUNET_DHT_P2PRouteResultMessage) + ntohs(msg->size);
1070 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1071 psize = sizeof(struct P2PPendingMessage) + msize;
1072 pending = GNUNET_malloc(psize);
1073 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1074 pending->importance = DHT_SEND_PRIORITY;
1075 pending->timeout = GNUNET_TIME_relative_get_forever();
1076 result_message = (struct GNUNET_DHT_P2PRouteResultMessage *)pending->msg;
1077 result_message->header.size = htons(msize);
1078 result_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT);
1079 result_message->put_path_length = htons(0); /* FIXME: implement */
1080 result_message->get_path_length = htons(0); /* FIXME: implement */
1081 result_message->options = htonl(msg_ctx->msg_options);
1082 result_message->hop_count = htonl(msg_ctx->hop_count + 1);
1083 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, result_message->bloomfilter, DHT_BLOOM_SIZE));
1084 result_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1085 memcpy(&result_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1086 memcpy(&result_message[1], msg, ntohs(msg->size));
1088 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Adding pending message size %d for peer %s\n", my_short_id, "DHT", msize, GNUNET_i2s(&peer->id));
1090 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1091 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1092 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1097 * Called when core is ready to send a message we asked for
1098 * out to the destination.
1100 * @param cls closure (NULL)
1101 * @param size number of bytes available in buf
1102 * @param buf where the callee should write the message
1103 * @return number of bytes written to buf
1106 core_transmit_notify (void *cls,
1107 size_t size, void *buf)
1109 struct PeerInfo *peer = cls;
1111 struct P2PPendingMessage *pending;
1118 /* client disconnected */
1120 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "`%s:%s': buffer was NULL\n", my_short_id, "DHT");
1125 if (peer->head == NULL)
1130 pending = peer->head;
1131 reply_times[reply_counter] = GNUNET_TIME_absolute_get_difference(pending->scheduled, GNUNET_TIME_absolute_get());
1132 msize = ntohs(pending->msg->size);
1136 memcpy (cbuf, pending->msg, msize);
1137 GNUNET_CONTAINER_DLL_remove (peer->head,
1141 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Removing pending message size %d for peer %s\n", my_short_id, "DHT", msize, GNUNET_i2s(&peer->id));
1143 GNUNET_free (pending);
1146 while (NULL != pending &&
1147 (size - off >= (msize = ntohs (pending->msg->size))))
1149 #if DEBUG_DHT_ROUTING
1150 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "`%s:%s' : transmit_notify (core) called with size %d, available %d\n", my_short_id, "dht service", msize, size);
1152 memcpy (&cbuf[off], pending->msg, msize);
1154 GNUNET_CONTAINER_DLL_remove (peer->head,
1157 GNUNET_free (pending);
1158 pending = peer->head;
1161 if ((peer->head != NULL) && (peer->send_task == GNUNET_SCHEDULER_NO_TASK))
1162 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1164 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "`%s:%s' : transmit_notify (core) called with size %d, available %d, returning %d\n", my_short_id, "dht service", msize, size, off);
1171 * Compute the distance between have and target as a 32-bit value.
1172 * Differences in the lower bits must count stronger than differences
1173 * in the higher bits.
1175 * @return 0 if have==target, otherwise a number
1176 * that is larger as the distance between
1177 * the two hash codes increases
1180 distance (const GNUNET_HashCode * target, const GNUNET_HashCode * have)
1182 unsigned int bucket;
1187 /* We have to represent the distance between two 2^9 (=512)-bit
1188 numbers as a 2^5 (=32)-bit number with "0" being used for the
1189 two numbers being identical; furthermore, we need to
1190 guarantee that a difference in the number of matching
1191 bits is always represented in the result.
1193 We use 2^32/2^9 numerical values to distinguish between
1194 hash codes that have the same LSB bit distance and
1195 use the highest 2^9 bits of the result to signify the
1196 number of (mis)matching LSB bits; if we have 0 matching
1197 and hence 512 mismatching LSB bits we return -1 (since
1198 512 itself cannot be represented with 9 bits) */
1200 /* first, calculate the most significant 9 bits of our
1201 result, aka the number of LSBs */
1202 bucket = GNUNET_CRYPTO_hash_matching_bits (target, have);
1203 /* bucket is now a value between 0 and 512 */
1205 return 0; /* perfect match */
1207 return (unsigned int) -1; /* LSB differs; use max (if we did the bit-shifting
1208 below, we'd end up with max+1 (overflow)) */
1210 /* calculate the most significant bits of the final result */
1211 msb = (512 - bucket) << (32 - 9);
1212 /* calculate the 32-9 least significant bits of the final result by
1213 looking at the differences in the 32-9 bits following the
1214 mismatching bit at 'bucket' */
1216 for (i = bucket + 1;
1217 (i < sizeof (GNUNET_HashCode) * 8) && (i < bucket + 1 + 32 - 9); i++)
1219 if (GNUNET_CRYPTO_hash_get_bit (target, i) != GNUNET_CRYPTO_hash_get_bit (have, i))
1220 lsb |= (1 << (bucket + 32 - 9 - i)); /* first bit set will be 10,
1221 last bit set will be 31 -- if
1222 i does not reach 512 first... */
1228 * Return a number that is larger the closer the
1229 * "have" GNUNET_hash code is to the "target".
1231 * @return inverse distance metric, non-zero.
1232 * Must fudge the value if NO bits match.
1235 inverse_distance (const GNUNET_HashCode * target,
1236 const GNUNET_HashCode * have)
1238 if (GNUNET_CRYPTO_hash_matching_bits(target, have) == 0)
1239 return 1; /* Never return 0! */
1240 return ((unsigned int) -1) - distance (target, have);
1244 * Find the optimal bucket for this key, regardless
1245 * of the current number of buckets in use.
1247 * @param hc the hashcode to compare our identity to
1249 * @return the proper bucket index, or GNUNET_SYSERR
1250 * on error (same hashcode)
1252 static int find_bucket(const GNUNET_HashCode *hc)
1256 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, hc);
1257 if (bits == MAX_BUCKETS)
1258 return GNUNET_SYSERR;
1259 return MAX_BUCKETS - bits - 1;
1263 * Find which k-bucket this peer should go into,
1264 * taking into account the size of the k-bucket
1265 * array. This means that if more bits match than
1266 * there are currently buckets, lowest_bucket will
1269 * @param hc GNUNET_HashCode we are finding the bucket for.
1271 * @return the proper bucket index for this key,
1272 * or GNUNET_SYSERR on error (same hashcode)
1274 static int find_current_bucket(const GNUNET_HashCode *hc)
1277 actual_bucket = find_bucket(hc);
1279 if (actual_bucket == GNUNET_SYSERR) /* hc and our peer identity match! */
1280 return lowest_bucket;
1281 else if (actual_bucket < lowest_bucket) /* actual_bucket not yet used */
1282 return lowest_bucket;
1284 return actual_bucket;
1289 * Find a routing table entry from a peer identity
1291 * @param peer the peer to look up
1293 * @return the bucket number holding the peer, GNUNET_SYSERR if not found
1296 find_bucket_by_peer(const struct PeerInfo *peer)
1299 struct PeerInfo *pos;
1301 for (bucket = lowest_bucket; bucket < MAX_BUCKETS - 1; bucket++)
1303 pos = k_buckets[bucket].head;
1312 return GNUNET_SYSERR; /* No such peer. */
1318 * Print the complete routing table for this peer.
1321 print_routing_table ()
1324 struct PeerInfo *pos;
1325 char char_buf[30000];
1327 memset(char_buf, 0, sizeof(char_buf));
1329 char_pos += sprintf(&char_buf[char_pos], "Printing routing table for peer %s\n", my_short_id);
1330 //fprintf(stderr, "Printing routing table for peer %s\n", my_short_id);
1331 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1333 pos = k_buckets[bucket].head;
1334 char_pos += sprintf(&char_buf[char_pos], "Bucket %d:\n", bucket);
1335 //fprintf(stderr, "Bucket %d:\n", bucket);
1338 //fprintf(stderr, "\tPeer %s, best bucket %d, %d bits match\n", GNUNET_i2s(&pos->id), find_bucket(&pos->id.hashPubKey), GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, &my_identity.hashPubKey));
1339 char_pos += sprintf(&char_buf[char_pos], "\tPeer %s, best bucket %d, %d bits match\n", GNUNET_i2s(&pos->id), find_bucket(&pos->id.hashPubKey), GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, &my_identity.hashPubKey));
1343 fprintf(stderr, "%s", char_buf);
1349 * Find a routing table entry from a peer identity
1351 * @param peer the peer identity to look up
1353 * @return the routing table entry, or NULL if not found
1355 static struct PeerInfo *
1356 find_peer_by_id(const struct GNUNET_PeerIdentity *peer)
1359 struct PeerInfo *pos;
1360 bucket = find_current_bucket(&peer->hashPubKey);
1362 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1365 pos = k_buckets[bucket].head;
1368 if (0 == memcmp(&pos->id, peer, sizeof(struct GNUNET_PeerIdentity)))
1372 return NULL; /* No such peer. */
1375 /* Forward declaration */
1377 update_core_preference (void *cls,
1378 const struct GNUNET_SCHEDULER_TaskContext *tc);
1380 * Function called with statistics about the given peer.
1382 * @param cls closure
1383 * @param peer identifies the peer
1384 * @param bpm_in set to the current bandwidth limit (receiving) for this peer
1385 * @param bpm_out set to the current bandwidth limit (sending) for this peer
1386 * @param amount set to the amount that was actually reserved or unreserved;
1387 * either the full requested amount or zero (no partial reservations)
1388 * @param preference current traffic preference for the given peer
1391 update_core_preference_finish (void *cls,
1392 const struct GNUNET_PeerIdentity * peer,
1393 struct GNUNET_BANDWIDTH_Value32NBO bpm_in,
1394 struct GNUNET_BANDWIDTH_Value32NBO bpm_out,
1395 int amount, uint64_t preference)
1397 struct PeerInfo *peer_info = cls;
1398 peer_info->info_ctx = NULL;
1399 GNUNET_SCHEDULER_add_delayed(DHT_DEFAULT_PREFERENCE_INTERVAL, &update_core_preference, peer_info);
1403 update_core_preference (void *cls,
1404 const struct GNUNET_SCHEDULER_TaskContext *tc)
1406 struct PeerInfo *peer = cls;
1407 uint64_t preference;
1408 unsigned int matching;
1409 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1413 matching = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->id.hashPubKey);
1416 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Peer identifier matches by %u bits, only shifting as much as we can!\n", matching);
1419 preference = 1LL << matching;
1420 peer->info_ctx = GNUNET_CORE_peer_change_preference (cfg,
1422 GNUNET_TIME_relative_get_forever(),
1423 GNUNET_BANDWIDTH_value_init (UINT32_MAX),
1426 &update_core_preference_finish,
1431 * Really add a peer to a bucket (only do assertions
1434 * @param peer GNUNET_PeerIdentity of the peer to add
1435 * @param bucket the already figured out bucket to add
1437 * @param latency the core reported latency of this peer
1438 * @param distance the transport level distance to this peer
1440 * @return the newly added PeerInfo
1442 static struct PeerInfo *
1443 add_peer(const struct GNUNET_PeerIdentity *peer,
1444 unsigned int bucket,
1445 struct GNUNET_TIME_Relative latency,
1446 unsigned int distance)
1448 struct PeerInfo *new_peer;
1449 GNUNET_assert(bucket < MAX_BUCKETS);
1450 GNUNET_assert(peer != NULL);
1451 new_peer = GNUNET_malloc(sizeof(struct PeerInfo));
1452 new_peer->latency = latency;
1453 new_peer->distance = distance;
1455 memcpy(&new_peer->id, peer, sizeof(struct GNUNET_PeerIdentity));
1457 GNUNET_CONTAINER_DLL_insert_after(k_buckets[bucket].head,
1458 k_buckets[bucket].tail,
1459 k_buckets[bucket].tail,
1461 k_buckets[bucket].peers_size++;
1463 if ((GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->hashPubKey) > 0) && (k_buckets[bucket].peers_size <= bucket_size))
1465 #if DO_UPDATE_PREFERENCE
1466 new_peer->preference_task = GNUNET_SCHEDULER_add_now(&update_core_preference, new_peer);
1474 * Given a peer and its corresponding bucket,
1475 * remove it from that bucket. Does not free
1476 * the PeerInfo struct, nor cancel messages
1477 * or free messages waiting to be sent to this
1480 * @param peer the peer to remove
1481 * @param bucket the bucket the peer belongs to
1483 static void remove_peer (struct PeerInfo *peer,
1484 unsigned int bucket)
1486 GNUNET_assert(k_buckets[bucket].peers_size > 0);
1487 GNUNET_CONTAINER_DLL_remove(k_buckets[bucket].head,
1488 k_buckets[bucket].tail,
1490 k_buckets[bucket].peers_size--;
1492 if ((bucket == lowest_bucket) && (k_buckets[lowest_bucket].peers_size == 0) && (lowest_bucket < MAX_BUCKETS - 1))
1498 * Removes peer from a bucket, then frees associated
1499 * resources and frees peer.
1501 * @param peer peer to be removed and freed
1502 * @param bucket which bucket this peer belongs to
1504 static void delete_peer (struct PeerInfo *peer,
1505 unsigned int bucket)
1507 struct P2PPendingMessage *pos;
1508 struct P2PPendingMessage *next;
1510 struct PeerInfo *peer_pos;
1512 peer_pos = k_buckets[bucket].head;
1513 while ((peer_pos != NULL) && (peer_pos != peer))
1514 peer_pos = peer_pos->next;
1515 if (peer_pos == NULL)
1517 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s: Expected peer `%s' in bucket %d\n", my_short_id, "DHT", GNUNET_i2s(&peer->id), bucket);
1518 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s: Lowest bucket: %d, find_current_bucket: %d, peer resides in bucket: %d\n", my_short_id, "DHT", lowest_bucket, find_current_bucket(&peer->id.hashPubKey), find_bucket_by_peer(peer));
1520 GNUNET_assert(peer_pos != NULL);
1522 remove_peer(peer, bucket); /* First remove the peer from its bucket */
1524 if (peer->send_task != GNUNET_SCHEDULER_NO_TASK)
1525 GNUNET_SCHEDULER_cancel(peer->send_task);
1526 if (peer->th != NULL)
1527 GNUNET_CORE_notify_transmit_ready_cancel(peer->th);
1530 while (pos != NULL) /* Remove any pending messages for this peer */
1537 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->id.hashPubKey));
1538 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove (all_known_peers, &peer->id.hashPubKey, peer));
1544 * Iterator over hash map entries.
1546 * @param cls closure
1547 * @param key current key code
1548 * @param value PeerInfo of the peer to move to new lowest bucket
1549 * @return GNUNET_YES if we should continue to
1553 static int move_lowest_bucket (void *cls,
1554 const GNUNET_HashCode * key,
1557 struct PeerInfo *peer = value;
1560 GNUNET_assert(lowest_bucket > 0);
1561 new_bucket = lowest_bucket - 1;
1562 remove_peer(peer, lowest_bucket);
1563 GNUNET_CONTAINER_DLL_insert_after(k_buckets[new_bucket].head,
1564 k_buckets[new_bucket].tail,
1565 k_buckets[new_bucket].tail,
1567 k_buckets[new_bucket].peers_size++;
1573 * The current lowest bucket is full, so change the lowest
1574 * bucket to the next lower down, and move any appropriate
1575 * entries in the current lowest bucket to the new bucket.
1577 static void enable_next_bucket()
1579 struct GNUNET_CONTAINER_MultiHashMap *to_remove;
1580 struct PeerInfo *pos;
1581 GNUNET_assert(lowest_bucket > 0);
1582 to_remove = GNUNET_CONTAINER_multihashmap_create(bucket_size);
1583 pos = k_buckets[lowest_bucket].head;
1586 fprintf(stderr, "Printing RT before new bucket\n");
1587 print_routing_table();
1589 /* Populate the array of peers which should be in the next lowest bucket */
1592 if (find_bucket(&pos->id.hashPubKey) < lowest_bucket)
1593 GNUNET_CONTAINER_multihashmap_put(to_remove, &pos->id.hashPubKey, pos, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
1597 /* Remove peers from lowest bucket, insert into next lowest bucket */
1598 GNUNET_CONTAINER_multihashmap_iterate(to_remove, &move_lowest_bucket, NULL);
1599 GNUNET_CONTAINER_multihashmap_destroy(to_remove);
1600 lowest_bucket = lowest_bucket - 1;
1602 fprintf(stderr, "Printing RT after new bucket\n");
1603 print_routing_table();
1608 * Find the closest peer in our routing table to the
1611 * @return The closest peer in our routing table to the
1612 * key, or NULL on error.
1614 static struct PeerInfo *
1615 find_closest_peer (const GNUNET_HashCode *hc)
1617 struct PeerInfo *pos;
1618 struct PeerInfo *current_closest;
1619 unsigned int lowest_distance;
1620 unsigned int temp_distance;
1624 lowest_distance = -1;
1626 if (k_buckets[lowest_bucket].peers_size == 0)
1629 current_closest = NULL;
1630 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1632 pos = k_buckets[bucket].head;
1634 while ((pos != NULL) && (count < bucket_size))
1636 temp_distance = distance(&pos->id.hashPubKey, hc);
1637 if (temp_distance <= lowest_distance)
1639 lowest_distance = temp_distance;
1640 current_closest = pos;
1646 GNUNET_assert(current_closest != NULL);
1647 return current_closest;
1652 * Function called to send a request out to another peer.
1653 * Called both for locally initiated requests and those
1654 * received from other peers.
1656 * @param msg the encapsulated message
1657 * @param peer the peer to forward the message to
1658 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1660 static void forward_message (const struct GNUNET_MessageHeader *msg,
1661 struct PeerInfo *peer,
1662 struct DHT_MessageContext *msg_ctx)
1664 struct GNUNET_DHT_P2PRouteMessage *route_message;
1665 struct P2PPendingMessage *pending;
1669 increment_stats(STAT_ROUTE_FORWARDS);
1670 GNUNET_assert(peer != NULL);
1671 if ((msg_ctx->closest != GNUNET_YES) && (peer == find_closest_peer(&msg_ctx->key)))
1672 increment_stats(STAT_ROUTE_FORWARDS_CLOSEST);
1674 msize = sizeof (struct GNUNET_DHT_P2PRouteMessage) + ntohs(msg->size);
1675 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1676 psize = sizeof(struct P2PPendingMessage) + msize;
1677 pending = GNUNET_malloc(psize);
1678 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1679 pending->importance = msg_ctx->importance;
1680 pending->timeout = msg_ctx->timeout;
1681 route_message = (struct GNUNET_DHT_P2PRouteMessage *)pending->msg;
1682 route_message->header.size = htons(msize);
1683 route_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE);
1684 route_message->options = htonl(msg_ctx->msg_options);
1685 route_message->hop_count = htonl(msg_ctx->hop_count + 1);
1686 route_message->network_size = htonl(msg_ctx->network_size);
1687 route_message->desired_replication_level = htonl(msg_ctx->replication);
1688 route_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1689 if (msg_ctx->bloom != NULL)
1690 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, route_message->bloomfilter, DHT_BLOOM_SIZE));
1691 memcpy(&route_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1692 memcpy(&route_message[1], msg, ntohs(msg->size));
1694 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Adding pending message size %d for peer %s\n", my_short_id, "DHT", msize, GNUNET_i2s(&peer->id));
1696 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1697 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1698 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1703 * Task used to send ping messages to peers so that
1704 * they don't get disconnected.
1706 * @param cls the peer to send a ping message to
1707 * @param tc context, reason, etc.
1710 periodic_ping_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1712 struct PeerInfo *peer = cls;
1713 struct GNUNET_MessageHeader ping_message;
1714 struct DHT_MessageContext msg_ctx;
1716 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1719 ping_message.size = htons(sizeof(struct GNUNET_MessageHeader));
1720 ping_message.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_PING);
1722 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
1724 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Sending periodic ping to %s\n", my_short_id, "DHT", GNUNET_i2s(&peer->id));
1726 forward_message(&ping_message, peer, &msg_ctx);
1727 peer->ping_task = GNUNET_SCHEDULER_add_delayed(DHT_DEFAULT_PING_DELAY, &periodic_ping_task, peer);
1731 * Schedule PING messages for the top X peers in each
1732 * bucket of the routing table (so core won't disconnect them!)
1734 void schedule_ping_messages()
1736 unsigned int bucket;
1738 struct PeerInfo *pos;
1739 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1741 pos = k_buckets[bucket].head;
1745 if ((count < bucket_size) && (pos->ping_task == GNUNET_SCHEDULER_NO_TASK))
1746 GNUNET_SCHEDULER_add_now(&periodic_ping_task, pos);
1747 else if ((count >= bucket_size) && (pos->ping_task != GNUNET_SCHEDULER_NO_TASK))
1749 GNUNET_SCHEDULER_cancel(pos->ping_task);
1750 pos->ping_task = GNUNET_SCHEDULER_NO_TASK;
1760 * Attempt to add a peer to our k-buckets.
1762 * @param peer the peer identity of the peer being added
1763 * @param bucket the bucket that we want this peer to go in
1764 * @param latency transport latency of this peer
1765 * @param distance transport distance to this peer
1767 * @return NULL if the peer was not added,
1768 * pointer to PeerInfo for new peer otherwise
1770 static struct PeerInfo *
1771 try_add_peer(const struct GNUNET_PeerIdentity *peer,
1772 unsigned int bucket,
1773 struct GNUNET_TIME_Relative latency,
1774 unsigned int distance)
1777 struct PeerInfo *new_peer;
1779 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1782 peer_bucket = find_current_bucket(&peer->hashPubKey);
1784 GNUNET_assert(peer_bucket >= lowest_bucket);
1785 new_peer = add_peer(peer, peer_bucket, latency, distance);
1787 if ((k_buckets[lowest_bucket].peers_size) >= bucket_size)
1788 enable_next_bucket();
1790 schedule_ping_messages();
1797 * Task run to check for messages that need to be sent to a client.
1799 * @param client a ClientList, containing the client and any messages to be sent to it
1802 process_pending_messages (struct ClientList *client)
1804 if (client->pending_head == NULL)
1806 if (client->transmit_handle != NULL)
1809 client->transmit_handle =
1810 GNUNET_SERVER_notify_transmit_ready (client->client_handle,
1811 ntohs (client->pending_head->msg->
1813 GNUNET_TIME_UNIT_FOREVER_REL,
1814 &send_generic_reply, client);
1818 * Callback called as a result of issuing a GNUNET_SERVER_notify_transmit_ready
1819 * request. A ClientList is passed as closure, take the head of the list
1820 * and copy it into buf, which has the result of sending the message to the
1823 * @param cls closure to this call
1824 * @param size maximum number of bytes available to send
1825 * @param buf where to copy the actual message to
1827 * @return the number of bytes actually copied, 0 indicates failure
1830 send_generic_reply (void *cls, size_t size, void *buf)
1832 struct ClientList *client = cls;
1834 struct PendingMessage *reply;
1838 client->transmit_handle = NULL;
1841 /* client disconnected */
1845 while ( (NULL != (reply = client->pending_head)) &&
1846 (size >= off + (msize = ntohs (reply->msg->size))))
1848 GNUNET_CONTAINER_DLL_remove (client->pending_head,
1849 client->pending_tail,
1851 memcpy (&cbuf[off], reply->msg, msize);
1852 GNUNET_free (reply);
1855 process_pending_messages (client);
1857 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1858 "Transmitted %u bytes of replies to client\n",
1859 (unsigned int) off);
1866 * Add a PendingMessage to the clients list of messages to be sent
1868 * @param client the active client to send the message to
1869 * @param pending_message the actual message to send
1872 add_pending_message (struct ClientList *client,
1873 struct PendingMessage *pending_message)
1875 GNUNET_CONTAINER_DLL_insert_after (client->pending_head,
1876 client->pending_tail,
1877 client->pending_tail,
1879 process_pending_messages (client);
1884 * Called when a reply needs to be sent to a client, as
1885 * a result it found to a GET or FIND PEER request.
1887 * @param client the client to send the reply to
1888 * @param message the encapsulated message to send
1889 * @param uid the unique identifier of this request
1892 send_reply_to_client (struct ClientList *client,
1893 const struct GNUNET_MessageHeader *message,
1894 unsigned long long uid,
1895 const GNUNET_HashCode *key)
1897 struct GNUNET_DHT_RouteResultMessage *reply;
1898 struct PendingMessage *pending_message;
1902 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1903 "`%s:%s': Sending reply to client.\n", my_short_id, "DHT");
1905 msize = ntohs (message->size);
1906 tsize = sizeof (struct GNUNET_DHT_RouteResultMessage) + msize;
1907 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
1909 GNUNET_break_op (0);
1912 pending_message = GNUNET_malloc (sizeof (struct PendingMessage) + tsize);
1913 pending_message->msg = (struct GNUNET_MessageHeader *)&pending_message[1];
1914 reply = (struct GNUNET_DHT_RouteResultMessage *)&pending_message[1];
1915 reply->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_RESULT);
1916 reply->header.size = htons (tsize);
1917 reply->put_path_length = htons(0); /* FIXME: implement */
1918 reply->get_path_length = htons(0); /* FIXME: implement */
1919 reply->unique_id = GNUNET_htonll (uid);
1921 memcpy (&reply[1], message, msize);
1922 add_pending_message (client, pending_message);
1926 * Consider whether or not we would like to have this peer added to
1927 * our routing table. Check whether bucket for this peer is full,
1928 * if so return negative; if not return positive. Since peers are
1929 * only added on CORE level connect, this doesn't actually add the
1930 * peer to the routing table.
1932 * @param peer the peer we are considering adding
1934 * @return GNUNET_YES if we want this peer, GNUNET_NO if not (bucket
1937 static int consider_peer (struct GNUNET_PeerIdentity *peer)
1941 if ((GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey)) || (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity))))
1942 return GNUNET_NO; /* We already know this peer (are connected even!) */
1943 bucket = find_current_bucket(&peer->hashPubKey);
1945 if ((k_buckets[bucket].peers_size < bucket_size) || ((bucket == lowest_bucket) && (lowest_bucket > 0)))
1952 * Main function that handles whether or not to route a result
1953 * message to other peers, or to send to our local client.
1955 * @param msg the result message to be routed
1956 * @param msg_ctx context of the message we are routing
1958 * @return the number of peers the message was routed to,
1959 * GNUNET_SYSERR on failure
1961 static int route_result_message(struct GNUNET_MessageHeader *msg,
1962 struct DHT_MessageContext *msg_ctx)
1964 struct GNUNET_PeerIdentity new_peer;
1965 struct DHTQueryRecord *record;
1966 struct DHTRouteSource *pos;
1967 struct PeerInfo *peer_info;
1968 const struct GNUNET_MessageHeader *hello_msg;
1970 increment_stats(STAT_RESULTS);
1972 * If a find peer result message is received and contains a valid
1973 * HELLO for another peer, offer it to the transport service.
1975 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT)
1977 if (ntohs(msg->size) <= sizeof(struct GNUNET_MessageHeader))
1980 hello_msg = &msg[1];
1981 if ((ntohs(hello_msg->type) != GNUNET_MESSAGE_TYPE_HELLO) || (GNUNET_SYSERR == GNUNET_HELLO_get_id((const struct GNUNET_HELLO_Message *)hello_msg, &new_peer)))
1983 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Received non-HELLO message type in find peer result message!\n", my_short_id, "DHT");
1987 else /* We have a valid hello, and peer id stored in new_peer */
1989 find_peer_context.count++;
1990 increment_stats(STAT_FIND_PEER_REPLY);
1991 if (GNUNET_YES == consider_peer(&new_peer))
1993 increment_stats(STAT_HELLOS_PROVIDED);
1994 GNUNET_TRANSPORT_offer_hello(transport_handle, hello_msg);
1995 GNUNET_CORE_peer_request_connect(cfg, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &new_peer, NULL, NULL);
2000 if (malicious_dropper == GNUNET_YES)
2003 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &msg_ctx->key);
2005 if (record == NULL) /* No record of this message! */
2008 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2009 "`%s:%s': Have no record of response key %s uid %llu\n", my_short_id,
2010 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2012 #if DEBUG_DHT_ROUTING
2013 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2015 dhtlog_handle->insert_route (NULL,
2022 msg_ctx->peer, NULL);
2025 if (msg_ctx->bloom != NULL)
2027 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
2028 msg_ctx->bloom = NULL;
2036 #if STRICT_FORWARDING
2037 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT) /* If we have already forwarded this peer id, don't do it again! */
2039 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (pos->find_peers_responded, &new_peer.hashPubKey))
2041 increment_stats("# find peer responses NOT forwarded (bloom match)");
2046 GNUNET_CONTAINER_bloomfilter_add(pos->find_peers_responded, &new_peer.hashPubKey);
2050 if (0 == memcmp(&pos->source, &my_identity, sizeof(struct GNUNET_PeerIdentity))) /* Local client (or DHT) initiated request! */
2053 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2054 "`%s:%s': Sending response key %s uid %llu to client\n", my_short_id,
2055 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2057 #if DEBUG_DHT_ROUTING
2058 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2060 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_RESULT,
2062 GNUNET_YES, &my_identity, &msg_ctx->key,
2063 msg_ctx->peer, NULL);
2066 increment_stats(STAT_RESULTS_TO_CLIENT);
2067 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET_RESULT)
2068 increment_stats(STAT_GET_REPLY);
2070 send_reply_to_client(pos->client, msg,
2074 else /* Send to peer */
2076 peer_info = find_peer_by_id(&pos->source);
2077 if (peer_info == NULL) /* Didn't find the peer in our routing table, perhaps peer disconnected! */
2083 if (msg_ctx->bloom == NULL)
2084 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2085 GNUNET_CONTAINER_bloomfilter_add (msg_ctx->bloom, &my_identity.hashPubKey);
2086 if ((GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (msg_ctx->bloom, &peer_info->id.hashPubKey)))
2089 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2090 "`%s:%s': Forwarding response key %s uid %llu to peer %s\n", my_short_id,
2091 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&peer_info->id));
2093 #if DEBUG_DHT_ROUTING
2094 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2096 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id,
2099 GNUNET_NO, &my_identity, &msg_ctx->key,
2100 msg_ctx->peer, &pos->source);
2103 forward_result_message(msg, peer_info, msg_ctx);
2108 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2109 "`%s:%s': NOT Forwarding response (bloom match) key %s uid %llu to peer %s\n", my_short_id,
2110 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&peer_info->id));
2116 if (msg_ctx->bloom != NULL)
2117 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
2122 * Iterator for local get request results,
2124 * @param cls closure for iterator, a DatacacheGetContext
2125 * @param exp when does this value expire?
2126 * @param key the key this data is stored under
2127 * @param size the size of the data identified by key
2128 * @param data the actual data
2129 * @param type the type of the data
2131 * @return GNUNET_OK to continue iteration, anything else
2132 * to stop iteration.
2135 datacache_get_iterator (void *cls,
2136 struct GNUNET_TIME_Absolute exp,
2137 const GNUNET_HashCode * key,
2138 size_t size, const char *data,
2139 enum GNUNET_BLOCK_Type type)
2141 struct DHT_MessageContext *msg_ctx = cls;
2142 struct DHT_MessageContext *new_msg_ctx;
2143 struct GNUNET_DHT_GetResultMessage *get_result;
2144 enum GNUNET_BLOCK_EvaluationResult eval;
2147 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2148 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
2150 eval = GNUNET_BLOCK_evaluate (block_context,
2154 msg_ctx->reply_bf_mutator,
2156 msg_ctx->xquery_size,
2161 case GNUNET_BLOCK_EVALUATION_OK_LAST:
2162 msg_ctx->do_forward = GNUNET_NO;
2163 case GNUNET_BLOCK_EVALUATION_OK_MORE:
2164 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2165 memcpy(new_msg_ctx, msg_ctx, sizeof(struct DHT_MessageContext));
2167 GNUNET_malloc (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2168 get_result->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_GET_RESULT);
2169 get_result->header.size =
2170 htons (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2171 get_result->expiration = GNUNET_TIME_absolute_hton(exp);
2172 get_result->type = htons (type);
2173 memcpy (&get_result[1], data, size);
2174 new_msg_ctx->peer = &my_identity;
2175 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2176 new_msg_ctx->hop_count = 0;
2177 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make result routing a higher priority */
2178 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2179 increment_stats(STAT_GET_RESPONSE_START);
2180 route_result_message(&get_result->header, new_msg_ctx);
2181 GNUNET_free(new_msg_ctx);
2182 GNUNET_free (get_result);
2184 case GNUNET_BLOCK_EVALUATION_OK_DUPLICATE:
2186 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2187 "`%s:%s': Duplicate block error\n", my_short_id, "DHT");
2190 case GNUNET_BLOCK_EVALUATION_RESULT_INVALID:
2192 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2193 "`%s:%s': Invalid request error\n", my_short_id, "DHT");
2196 case GNUNET_BLOCK_EVALUATION_REQUEST_VALID:
2198 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2199 "`%s:%s': Valid request, no results.\n", my_short_id, "DHT");
2203 case GNUNET_BLOCK_EVALUATION_REQUEST_INVALID:
2204 GNUNET_break_op (0);
2205 msg_ctx->do_forward = GNUNET_NO;
2207 case GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED:
2209 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2210 "`%s:%s': Unsupported block type (%u) in response!\n", my_short_id, "DHT", type);
2212 /* msg_ctx->do_forward = GNUNET_NO; // not sure... */
2220 * Main function that handles whether or not to route a message to other
2223 * @param msg the message to be routed
2224 * @param msg_ctx the context containing all pertinent information about the message
2227 route_message(const struct GNUNET_MessageHeader *msg,
2228 struct DHT_MessageContext *msg_ctx);
2232 * Server handler for all dht get requests, look for data,
2233 * if found, send response either to clients or other peers.
2235 * @param msg the actual get message
2236 * @param msg_ctx struct containing pertinent information about the get request
2238 * @return number of items found for GET request
2241 handle_dht_get (const struct GNUNET_MessageHeader *msg,
2242 struct DHT_MessageContext *msg_ctx)
2244 const struct GNUNET_DHT_GetMessage *get_msg;
2247 unsigned int results;
2249 enum GNUNET_BLOCK_Type type;
2251 msize = ntohs (msg->size);
2252 if (msize < sizeof (struct GNUNET_DHT_GetMessage))
2257 get_msg = (const struct GNUNET_DHT_GetMessage *) msg;
2258 bf_size = ntohs (get_msg->bf_size);
2259 msg_ctx->xquery_size = ntohs (get_msg->xquery_size);
2260 msg_ctx->reply_bf_mutator = get_msg->bf_mutator; /* FIXME: ntohl? */
2261 if (msize != sizeof (struct GNUNET_DHT_GetMessage) + bf_size + msg_ctx->xquery_size)
2266 end = (const char*) &get_msg[1];
2267 if (msg_ctx->xquery_size == 0)
2269 msg_ctx->xquery = NULL;
2273 msg_ctx->xquery = (const void*) end;
2274 end += msg_ctx->xquery_size;
2278 msg_ctx->reply_bf = NULL;
2282 msg_ctx->reply_bf = GNUNET_CONTAINER_bloomfilter_init (end,
2284 GNUNET_DHT_GET_BLOOMFILTER_K);
2286 type = (enum GNUNET_BLOCK_Type) ntohl (get_msg->type);
2288 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2289 "`%s:%s': Received `%s' request, message type %u, key %s, uid %llu\n",
2293 GNUNET_h2s (&msg_ctx->key),
2294 msg_ctx->unique_id);
2296 increment_stats(STAT_GETS);
2299 if (type == GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE)
2301 GNUNET_CONTAINER_bloomfilter_free (msg_ctx->reply_bf);
2305 msg_ctx->do_forward = GNUNET_YES;
2306 if (datacache != NULL)
2308 = GNUNET_DATACACHE_get (datacache,
2309 &msg_ctx->key, type,
2310 &datacache_get_iterator,
2313 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2314 "`%s:%s': Found %d results for `%s' request uid %llu\n", my_short_id, "DHT",
2315 results, "GET", msg_ctx->unique_id);
2319 #if DEBUG_DHT_ROUTING
2320 if ((debug_routes) && (dhtlog_handle != NULL))
2322 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_GET,
2323 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2327 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2329 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
2330 msg_ctx->hop_count, GNUNET_YES,
2331 &my_identity, &msg_ctx->key, msg_ctx->peer,
2338 /* check query valid */
2339 if (GNUNET_BLOCK_EVALUATION_REQUEST_INVALID
2340 == GNUNET_BLOCK_evaluate (block_context,
2344 msg_ctx->reply_bf_mutator,
2346 msg_ctx->xquery_size,
2349 GNUNET_break_op (0);
2350 msg_ctx->do_forward = GNUNET_NO;
2354 if (msg_ctx->hop_count == 0) /* Locally initiated request */
2356 #if DEBUG_DHT_ROUTING
2357 if ((debug_routes) && (dhtlog_handle != NULL))
2359 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_GET,
2360 msg_ctx->hop_count, GNUNET_NO, &my_identity,
2365 if (msg_ctx->do_forward == GNUNET_YES)
2366 route_message (msg, msg_ctx);
2367 GNUNET_CONTAINER_bloomfilter_free (msg_ctx->reply_bf);
2372 remove_recent_find_peer(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
2374 GNUNET_HashCode *key = cls;
2376 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent_find_peer_requests, key, NULL));
2381 * Server handler for initiating local dht find peer requests
2383 * @param find_msg the actual find peer message
2384 * @param msg_ctx struct containing pertinent information about the request
2388 handle_dht_find_peer (const struct GNUNET_MessageHeader *find_msg,
2389 struct DHT_MessageContext *msg_ctx)
2391 struct GNUNET_MessageHeader *find_peer_result;
2392 struct GNUNET_DHT_FindPeerMessage *find_peer_message;
2393 struct DHT_MessageContext *new_msg_ctx;
2394 struct GNUNET_CONTAINER_BloomFilter *incoming_bloom;
2397 GNUNET_HashCode *recent_hash;
2398 struct GNUNET_MessageHeader *other_hello;
2399 size_t other_hello_size;
2400 struct GNUNET_PeerIdentity peer_id;
2402 find_peer_message = (struct GNUNET_DHT_FindPeerMessage *)find_msg;
2403 GNUNET_break_op(ntohs(find_msg->size) >= (sizeof(struct GNUNET_DHT_FindPeerMessage)));
2404 if (ntohs(find_msg->size) < sizeof(struct GNUNET_DHT_FindPeerMessage))
2407 other_hello_size = 0;
2408 if (ntohs(find_msg->size) > sizeof(struct GNUNET_DHT_FindPeerMessage))
2410 other_hello_size = ntohs(find_msg->size) - sizeof(struct GNUNET_DHT_FindPeerMessage);
2411 other_hello = GNUNET_malloc(other_hello_size);
2412 memcpy(other_hello, &find_peer_message[1], other_hello_size);
2413 if ((GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)other_hello) == 0) || (GNUNET_OK != GNUNET_HELLO_get_id((struct GNUNET_HELLO_Message *)other_hello, &peer_id)))
2415 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Received invalid HELLO message in find peer request!\n");
2416 GNUNET_free(other_hello);
2419 #if FIND_PEER_WITH_HELLO
2420 if (GNUNET_YES == consider_peer(&peer_id))
2422 increment_stats(STAT_HELLOS_PROVIDED);
2423 GNUNET_TRANSPORT_offer_hello(transport_handle, other_hello);
2424 GNUNET_CORE_peer_request_connect(cfg, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &peer_id, NULL, NULL);
2425 route_message (find_msg, msg_ctx);
2426 GNUNET_free (other_hello);
2429 else /* We don't want this peer! */
2431 route_message (find_msg, msg_ctx);
2432 GNUNET_free (other_hello);
2439 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2440 "`%s:%s': Received `%s' request from client, key %s (msg size %d, we expected %d)\n",
2441 my_short_id, "DHT", "FIND PEER", GNUNET_h2s (&msg_ctx->key),
2442 ntohs (find_msg->size),
2443 sizeof (struct GNUNET_MessageHeader));
2445 if (my_hello == NULL)
2448 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2449 "`%s': Our HELLO is null, can't return.\n",
2452 GNUNET_free_non_null (other_hello);
2453 route_message (find_msg, msg_ctx);
2457 incoming_bloom = GNUNET_CONTAINER_bloomfilter_init(find_peer_message->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2458 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(incoming_bloom, &my_identity.hashPubKey))
2460 increment_stats(STAT_BLOOM_FIND_PEER);
2461 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2462 GNUNET_free_non_null(other_hello);
2463 route_message (find_msg, msg_ctx);
2464 return; /* We match the bloomfilter, do not send a response to this peer (they likely already know us!)*/
2466 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2468 #if RESTRICT_FIND_PEER
2471 * Ignore any find peer requests from a peer we have seen very recently.
2473 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(recent_find_peer_requests, &msg_ctx->key)) /* We have recently responded to a find peer request for this peer! */
2475 increment_stats("# dht find peer requests ignored (recently seen!)");
2476 GNUNET_free_non_null(other_hello);
2481 * Use this check to only allow the peer to respond to find peer requests if
2482 * it would be beneficial to have the requesting peer in this peers routing
2483 * table. Can be used to thwart peers flooding the network with find peer
2484 * requests that we don't care about. However, if a new peer is joining
2485 * the network and has no other peers this is a problem (assume all buckets
2486 * full, no one will respond!).
2488 memcpy(&peer_id.hashPubKey, &msg_ctx->key, sizeof(GNUNET_HashCode));
2489 if (GNUNET_NO == consider_peer(&peer_id))
2491 increment_stats("# dht find peer requests ignored (do not need!)");
2492 GNUNET_free_non_null(other_hello);
2493 route_message (find_msg, msg_ctx);
2498 recent_hash = GNUNET_malloc(sizeof(GNUNET_HashCode));
2499 memcpy(recent_hash, &msg_ctx->key, sizeof(GNUNET_HashCode));
2500 if (GNUNET_SYSERR != GNUNET_CONTAINER_multihashmap_put (recent_find_peer_requests,
2501 &msg_ctx->key, NULL,
2502 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
2504 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Adding recent remove task for key `%s`!\n", GNUNET_h2s(&msg_ctx->key));
2505 /* Only add a task if there wasn't one for this key already! */
2506 GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30),
2507 &remove_recent_find_peer, recent_hash);
2511 GNUNET_free(recent_hash);
2512 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Received duplicate find peer request too soon!\n");
2515 /* Simplistic find_peer functionality, always return our hello */
2516 hello_size = ntohs(my_hello->size);
2517 tsize = hello_size + sizeof (struct GNUNET_MessageHeader);
2519 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
2521 GNUNET_break_op (0);
2522 GNUNET_free_non_null(other_hello);
2526 find_peer_result = GNUNET_malloc (tsize);
2527 find_peer_result->type = htons (GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT);
2528 find_peer_result->size = htons (tsize);
2529 memcpy (&find_peer_result[1], my_hello, hello_size);
2531 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2532 "`%s': Sending hello size %d to requesting peer.\n",
2535 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2536 memcpy(new_msg_ctx, msg_ctx, sizeof(struct DHT_MessageContext));
2537 new_msg_ctx->peer = &my_identity;
2538 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2539 new_msg_ctx->hop_count = 0;
2540 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make find peer requests a higher priority */
2541 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2542 increment_stats(STAT_FIND_PEER_ANSWER);
2543 route_result_message(find_peer_result, new_msg_ctx);
2544 GNUNET_free(new_msg_ctx);
2545 #if DEBUG_DHT_ROUTING
2546 if ((debug_routes) && (dhtlog_handle != NULL))
2548 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_FIND_PEER,
2549 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2553 GNUNET_free_non_null(other_hello);
2554 GNUNET_free(find_peer_result);
2555 route_message (find_msg, msg_ctx);
2559 * Task used to republish data.
2560 * Forward declaration; function call loop.
2562 * @param cls closure (a struct RepublishContext)
2563 * @param tc runtime context for this task
2566 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc);
2569 * Server handler for initiating local dht put requests
2571 * @param msg the actual put message
2572 * @param msg_ctx struct containing pertinent information about the request
2575 handle_dht_put (const struct GNUNET_MessageHeader *msg,
2576 struct DHT_MessageContext *msg_ctx)
2578 const struct GNUNET_DHT_PutMessage *put_msg;
2579 enum GNUNET_BLOCK_Type put_type;
2582 struct RepublishContext *put_context;
2583 GNUNET_HashCode key;
2585 GNUNET_assert (ntohs (msg->size) >=
2586 sizeof (struct GNUNET_DHT_PutMessage));
2589 put_msg = (const struct GNUNET_DHT_PutMessage *)msg;
2590 put_type = (enum GNUNET_BLOCK_Type) ntohl (put_msg->type);
2592 if (put_type == GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE)
2595 data_size = ntohs (put_msg->header.size) - sizeof (struct GNUNET_DHT_PutMessage);
2596 ret = GNUNET_BLOCK_get_key (block_context,
2601 if (GNUNET_NO == ret)
2604 GNUNET_break_op (0);
2607 if ( (GNUNET_YES == ret) &&
2610 sizeof (GNUNET_HashCode))) )
2612 /* invalid wrapper: key mismatch! */
2613 GNUNET_break_op (0);
2616 /* ret == GNUNET_SYSERR means that there is no known relationship between
2617 data and the key, so we cannot check it */
2619 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2620 "`%s:%s': Received `%s' request (inserting data!), message type %d, key %s, uid %llu\n",
2621 my_short_id, "DHT", "PUT", put_type, GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2623 #if DEBUG_DHT_ROUTING
2624 if (msg_ctx->hop_count == 0) /* Locally initiated request */
2626 if ((debug_routes) && (dhtlog_handle != NULL))
2628 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_PUT,
2629 msg_ctx->hop_count, GNUNET_NO, &my_identity,
2635 if (msg_ctx->closest != GNUNET_YES)
2637 route_message (msg, msg_ctx);
2642 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2643 "`%s:%s': Received `%s' request (inserting data!), message type %d, key %s, uid %llu\n",
2644 my_short_id, "DHT", "PUT", put_type, GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2647 #if DEBUG_DHT_ROUTING
2648 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2650 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
2651 msg_ctx->hop_count, GNUNET_YES,
2652 &my_identity, &msg_ctx->key, msg_ctx->peer,
2656 if ((debug_routes) && (dhtlog_handle != NULL))
2658 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_PUT,
2659 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2664 increment_stats(STAT_PUTS_INSERTED);
2665 if (datacache != NULL)
2667 ret = GNUNET_DATACACHE_put (datacache, &msg_ctx->key, data_size,
2668 (char *) &put_msg[1], put_type,
2669 GNUNET_TIME_absolute_ntoh(put_msg->expiration));
2671 if ((ret == GNUNET_YES) && (do_republish == GNUNET_YES))
2673 put_context = GNUNET_malloc(sizeof(struct RepublishContext));
2674 memcpy(&put_context->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
2675 put_context->type = put_type;
2676 GNUNET_SCHEDULER_add_delayed (dht_republish_frequency, &republish_content, put_context);
2680 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2681 "`%s:%s': %s request received, but have no datacache!\n",
2682 my_short_id, "DHT", "PUT");
2684 if (stop_on_closest == GNUNET_NO)
2685 route_message (msg, msg_ctx);
2689 * Estimate the diameter of the network based
2690 * on how many buckets are currently in use.
2691 * Concept here is that the diameter of the network
2692 * is roughly the distance a message must travel in
2693 * order to reach its intended destination. Since
2694 * at each hop we expect to get one bit closer, and
2695 * we have one bit per bucket, the number of buckets
2696 * in use should be the largest number of hops for
2697 * a successful message. (of course, this assumes we
2698 * know all peers in the network!)
2700 * @return ballpark diameter figure
2702 static unsigned int estimate_diameter()
2704 return MAX_BUCKETS - lowest_bucket;
2708 * To how many peers should we (on average)
2709 * forward the request to obtain the desired
2710 * target_replication count (on average).
2712 * Always 0, 1 or 2 (don't send, send once, split)
2715 get_forward_count (unsigned int hop_count, size_t target_replication)
2718 double target_count;
2719 double random_probability;
2721 uint32_t random_value;
2723 unsigned int target_value;
2724 unsigned int diameter;
2727 * If we are behaving in strict kademlia mode, send multiple initial requests,
2728 * but then only send to 1 or 0 peers based strictly on the number of hops.
2730 if (strict_kademlia == GNUNET_YES)
2733 return DHT_KADEMLIA_REPLICATION;
2734 else if (hop_count < max_hops)
2740 /* FIXME: the smaller we think the network is the more lenient we should be for
2741 * routing right? The estimation below only works if we think we have reasonably
2742 * full routing tables, which for our RR topologies may not be the case!
2744 diameter = estimate_diameter ();
2745 if ((hop_count > (diameter + 1) * 2) && (MINIMUM_PEER_THRESHOLD < estimate_diameter() * bucket_size) && (use_max_hops == GNUNET_NO))
2748 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2749 "`%s:%s': Hop count too high (est %d, lowest %d), NOT Forwarding request\n", my_short_id,
2750 "DHT", estimate_diameter(), lowest_bucket);
2754 else if (hop_count > max_hops)
2757 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2758 "`%s:%s': Hop count too high (greater than max)\n", my_short_id,
2765 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Replication %d, hop_count %u, diameter %u\n", target_replication, hop_count, diameter);
2766 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Numerator %f, denominator %f\n", (double)target_replication, ((double)target_replication * (hop_count + 1) + diameter));
2767 target_count = /* target_count is ALWAYS < 1 unless replication is < 1 */
2768 (double)target_replication / ((double)target_replication * (hop_count + 1) + diameter);
2769 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Target count is %f\n", target_count);
2770 random_probability = ((double)GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
2771 RAND_MAX)) / RAND_MAX;
2772 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Random is %f\n", random_probability);
2775 //while (target_value < target_count)
2776 if (target_value < target_count)
2777 target_value++; /* target_value is ALWAYS 1 after this "loop", right? Because target_count is always > 0, right? Or does it become 0.00000... at some point because the hop count is so high? */
2780 //if ((target_count + 1 - (double)target_value) > random_probability)
2781 if ((target_count) > random_probability)
2785 random_value = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_STRONG, target_replication * (hop_count + 1) + diameter) + 1;
2786 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "replication %u, at hop %d, will split with probability %f\n", target_replication, hop_count, target_replication / (double)((target_replication * (hop_count + 1) + diameter) + 1));
2788 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "random %u, target %u, max %u\n", random_value, target_replication, target_replication * (hop_count + 1) + diameter);
2789 if (random_value < target_replication)
2791 increment_stats("# DHT Messages split");
2795 return target_value;
2799 * Check whether my identity is closer than any known peers.
2800 * If a non-null bloomfilter is given, check if this is the closest
2801 * peer that hasn't already been routed to.
2803 * @param target hash code to check closeness to
2804 * @param bloom bloomfilter, exclude these entries from the decision
2806 * Return GNUNET_YES if node location is closest, GNUNET_NO
2810 am_closest_peer (const GNUNET_HashCode * target, struct GNUNET_CONTAINER_BloomFilter *bloom)
2816 struct PeerInfo *pos;
2817 unsigned int my_distance;
2819 if (0 == memcmp(&my_identity.hashPubKey, target, sizeof(GNUNET_HashCode)))
2822 bucket_num = find_current_bucket(target);
2824 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, target);
2825 my_distance = distance(&my_identity.hashPubKey, target);
2826 pos = k_buckets[bucket_num].head;
2828 while ((pos != NULL) && (count < bucket_size))
2830 if ((bloom != NULL) && (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(bloom, &pos->id.hashPubKey)))
2833 continue; /* Skip already checked entries */
2836 other_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
2837 if (other_bits > bits)
2839 else if (other_bits == bits) /* We match the same number of bits, do distance comparison */
2841 if (strict_kademlia != GNUNET_YES) /* Return that we at as close as any other peer */
2843 else if (distance(&pos->id.hashPubKey, target) < my_distance) /* Check all known peers, only return if we are the true closest */
2849 /* No peers closer, we are the closest! */
2855 * Return this peers adjusted value based on the convergence
2856 * function chosen. This is the key function for randomized
2857 * routing decisions.
2859 * @param target the key of the request
2860 * @param peer the peer we would like the value of
2861 * @param hops number of hops this message has already traveled
2863 * @return bit distance from target to peer raised to an exponent
2864 * adjusted based on the current routing convergence algorithm
2867 static unsigned long long
2868 converge_distance (const GNUNET_HashCode *target,
2869 struct PeerInfo *peer,
2872 unsigned long long ret;
2873 unsigned int other_matching_bits;
2874 double base_converge_modifier = .1; /* Value that "looks" good (when plotted), have to start somewhere */
2875 double temp_modifier;
2881 curr_max_hops = max_hops;
2883 curr_max_hops = (estimate_diameter() + 1) * 2;
2885 if (converge_modifier > 0)
2886 temp_modifier = converge_modifier * base_converge_modifier;
2889 temp_modifier = base_converge_modifier;
2890 base_converge_modifier = 0.0;
2893 GNUNET_assert(temp_modifier > 0);
2895 other_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &peer->id.hashPubKey);
2897 switch (converge_option)
2899 case DHT_CONVERGE_RANDOM:
2900 return 1; /* Always return 1, choose equally among all peers */
2901 case DHT_CONVERGE_LINEAR:
2902 calc_value = hops * curr_max_hops * temp_modifier;
2904 case DHT_CONVERGE_SQUARE:
2906 * Simple square based curve.
2908 calc_value = (sqrt(hops) / sqrt(curr_max_hops)) * (curr_max_hops / (curr_max_hops * temp_modifier));
2910 case DHT_CONVERGE_EXPONENTIAL:
2912 * Simple exponential curve.
2914 if (base_converge_modifier > 0)
2915 calc_value = (temp_modifier * hops * hops) / curr_max_hops;
2917 calc_value = (hops * hops) / curr_max_hops;
2919 case DHT_CONVERGE_BINARY:
2921 * If below the cutoff, route randomly (return 1),
2922 * If above the cutoff, return the maximum possible
2923 * value first (always route to closest, because
2927 if (hops > converge_modifier) /* Past cutoff */
2936 /* Take the log (base e) of the number of bits matching the other peer */
2937 exponent = log(other_matching_bits);
2939 /* Check if we would overflow; our largest possible value is 2^64 approx. e^44.361419555836498 */
2940 if (exponent * calc_value >= 44.361419555836498)
2943 /* Clear errno and all math exceptions */
2945 feclearexcept(FE_ALL_EXCEPT);
2946 ret = (unsigned long long)pow(other_matching_bits, calc_value);
2947 if ((errno != 0) || fetestexcept(FE_INVALID | FE_DIVBYZERO | FE_OVERFLOW |
2950 if (0 != fetestexcept(FE_OVERFLOW))
2951 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_OVERFLOW\n");
2952 if (0 != fetestexcept(FE_INVALID))
2953 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_INVALID\n");
2954 if (0 != fetestexcept(FE_UNDERFLOW))
2955 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_UNDERFLOW\n");
2963 * Comparison function for two struct PeerInfo's
2964 * which have already had their matching bits to
2965 * some target calculated.
2967 * @param p1 a pointer pointer to a struct PeerInfo
2968 * @param p2 a pointer pointer to a struct PeerInfo
2970 * @return 0 if equidistant to target,
2971 * -1 if p1 is closer,
2975 compare_peers (const void *p1, const void *p2)
2977 struct PeerInfo **first = (struct PeerInfo **)p1;
2978 struct PeerInfo **second = (struct PeerInfo **)p2;
2980 if ((*first)->matching_bits > (*second)->matching_bits)
2982 if ((*first)->matching_bits < (*second)->matching_bits)
2990 * Select a peer from the routing table that would be a good routing
2991 * destination for sending a message for "target". The resulting peer
2992 * must not be in the set of blocked peers.<p>
2994 * Note that we should not ALWAYS select the closest peer to the
2995 * target, peers further away from the target should be chosen with
2996 * exponentially declining probability.
2998 * @param target the key we are selecting a peer to route to
2999 * @param bloom a bloomfilter containing entries this request has seen already
3001 * @return Peer to route to, or NULL on error
3003 static struct PeerInfo *
3004 select_peer (const GNUNET_HashCode * target,
3005 struct GNUNET_CONTAINER_BloomFilter *bloom, unsigned int hops)
3010 unsigned int offset;
3011 unsigned int my_matching_bits;
3013 struct PeerInfo *pos;
3014 struct PeerInfo *sorted_closest[bucket_size];
3015 unsigned long long temp_converge_distance;
3016 unsigned long long total_distance;
3017 unsigned long long selected;
3019 unsigned long long stats_total_distance;
3023 unsigned int distance;
3024 unsigned int largest_distance;
3025 struct PeerInfo *chosen;
3027 my_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &my_identity.hashPubKey);
3030 if (strict_kademlia == GNUNET_YES)
3032 largest_distance = 0;
3034 for (bc = lowest_bucket; bc < MAX_BUCKETS; bc++)
3036 pos = k_buckets[bc].head;
3038 while ((pos != NULL) && (count < bucket_size))
3040 /* If we are doing strict Kademlia routing, then checking the bloomfilter is basically cheating! */
3041 if (GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3043 distance = inverse_distance (target, &pos->id.hashPubKey);
3044 if (distance > largest_distance)
3047 largest_distance = distance;
3055 if ((largest_distance > 0) && (chosen != NULL))
3057 GNUNET_CONTAINER_bloomfilter_add(bloom, &chosen->id.hashPubKey);
3068 /* Three steps: order peers in closest bucket (most matching bits).
3069 * Then go over all LOWER buckets (matching same bits we do)
3070 * Then go over all HIGHER buckets (matching less then we do)
3073 closest_bucket = find_current_bucket(target);
3074 GNUNET_assert(closest_bucket >= lowest_bucket);
3075 pos = k_buckets[closest_bucket].head;
3077 offset = 0; /* Need offset as well as count in case peers are bloomfiltered */
3078 memset(sorted_closest, 0, sizeof(sorted_closest));
3079 /* Put any peers in the closest bucket in the sorting array */
3080 while ((pos != NULL) && (count < bucket_size))
3082 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3086 continue; /* Ignore bloomfiltered peers */
3088 pos->matching_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
3089 sorted_closest[offset] = pos;
3095 /* Sort the peers in descending order */
3096 qsort(&sorted_closest[0], offset, sizeof(struct PeerInfo *), &compare_peers);
3098 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3099 for (i = 0; i < offset; i++)
3101 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3102 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3103 break; /* Ignore bloomfiltered peers */
3104 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3105 total_distance += temp_converge_distance;
3107 break; /* overflow case */
3110 /* Now handle peers in lower buckets (matches same # of bits as target) */
3111 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3113 pos = k_buckets[bc].head;
3115 while ((pos != NULL) && (count < bucket_size))
3117 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3121 continue; /* Ignore bloomfiltered peers */
3123 temp_converge_distance = converge_distance(target, pos, hops);
3124 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3125 total_distance += temp_converge_distance;
3127 break; /* overflow case */
3133 /* Now handle all the further away peers */
3134 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3136 pos = k_buckets[bc].head;
3138 while ((pos != NULL) && (count < bucket_size))
3140 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3144 continue; /* Ignore bloomfiltered peers */
3146 temp_converge_distance = converge_distance(target, pos, hops);
3147 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3148 total_distance += temp_converge_distance;
3150 break; /* overflow case */
3156 if (total_distance == 0) /* No peers to select from! */
3158 increment_stats("# select_peer, total_distance == 0");
3162 #if DEBUG_DHT_ROUTING > 1
3165 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3166 stats_total_distance = 0;
3167 for (i = 0; i < offset; i++)
3169 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3170 break; /* Ignore bloomfiltered peers */
3171 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3172 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3173 stats_total_distance += temp_converge_distance;
3175 break; /* overflow case */
3176 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Choose %d matching bits (%d bits match me) (%.2f percent) converge ret %llu\n", GNUNET_CRYPTO_hash_matching_bits(&sorted_closest[i]->id.hashPubKey, target), GNUNET_CRYPTO_hash_matching_bits(&sorted_closest[i]->id.hashPubKey, &my_identity.hashPubKey), (temp_converge_distance / (double)total_distance) * 100, temp_converge_distance);
3179 /* Now handle peers in lower buckets (matches same # of bits as target) */
3180 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3182 pos = k_buckets[bc].head;
3184 while ((pos != NULL) && (count < bucket_size))
3186 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3190 continue; /* Ignore bloomfiltered peers */
3192 temp_converge_distance = converge_distance(target, pos, hops);
3193 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3194 stats_total_distance += temp_converge_distance;
3196 break; /* overflow case */
3197 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Choose %d matching bits (%d bits match me) (%.2f percent) converge ret %llu\n", GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target), GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, &my_identity.hashPubKey), (temp_converge_distance / (double)total_distance) * 100, temp_converge_distance);
3203 /* Now handle all the further away peers */
3204 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3206 pos = k_buckets[bc].head;
3208 while ((pos != NULL) && (count < bucket_size))
3210 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3214 continue; /* Ignore bloomfiltered peers */
3216 temp_converge_distance = converge_distance(target, pos, hops);
3217 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3218 stats_total_distance += temp_converge_distance;
3220 break; /* overflow case */
3221 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Choose %d matching bits (%d bits match me) (%.2f percent) converge ret %llu\n", GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target), GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, &my_identity.hashPubKey), (temp_converge_distance / (double)total_distance) * 100, temp_converge_distance);
3226 /* END PRINT STATS */
3229 /* Now actually choose a peer */
3230 selected = GNUNET_CRYPTO_random_u64 (GNUNET_CRYPTO_QUALITY_WEAK, total_distance);
3232 /* Go over closest sorted peers. */
3233 for (i = 0; i < offset; i++)
3235 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3236 break; /* Ignore bloomfiltered peers */
3237 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3238 if (temp_converge_distance >= selected)
3239 return sorted_closest[i];
3241 selected -= temp_converge_distance;
3244 /* Now handle peers in lower buckets (matches same # of bits as target) */
3245 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3247 pos = k_buckets[bc].head;
3249 while ((pos != NULL) && (count < bucket_size))
3251 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3255 continue; /* Ignore bloomfiltered peers */
3257 temp_converge_distance = converge_distance(target, pos, hops);
3258 if (temp_converge_distance >= selected)
3261 selected -= temp_converge_distance;
3267 /* Now handle all the further away peers */
3268 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3270 pos = k_buckets[bc].head;
3272 while ((pos != NULL) && (count < bucket_size))
3274 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3278 continue; /* Ignore bloomfiltered peers */
3280 temp_converge_distance = converge_distance(target, pos, hops);
3281 if (temp_converge_distance >= selected)
3284 selected -= temp_converge_distance;
3290 increment_stats("# failed to select peer");
3296 * Task used to remove recent entries, either
3297 * after timeout, when full, or on shutdown.
3299 * @param cls the entry to remove
3300 * @param tc context, reason, etc.
3303 remove_recent (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3305 struct RecentRequest *req = cls;
3306 static GNUNET_HashCode hash;
3308 GNUNET_assert(req != NULL);
3309 hash_from_uid(req->uid, &hash);
3310 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent.hashmap, &hash, req));
3311 GNUNET_CONTAINER_heap_remove_node(recent.minHeap, req->heap_node);
3312 GNUNET_CONTAINER_bloomfilter_free(req->bloom);
3316 if ((tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN) && (0 == GNUNET_CONTAINER_multihashmap_size(recent.hashmap)) && (0 == GNUNET_CONTAINER_heap_get_size(recent.minHeap)))
3318 GNUNET_CONTAINER_multihashmap_destroy(recent.hashmap);
3319 GNUNET_CONTAINER_heap_destroy(recent.minHeap);
3326 * Task used to remove forwarding entries, either
3327 * after timeout, when full, or on shutdown.
3329 * @param cls the entry to remove
3330 * @param tc context, reason, etc.
3333 remove_forward_entry (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3335 struct DHTRouteSource *source_info = cls;
3336 struct DHTQueryRecord *record;
3337 source_info = GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, source_info->hnode);
3338 record = source_info->record;
3339 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, source_info);
3341 if (record->head == NULL) /* No more entries in DLL */
3343 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3344 GNUNET_free(record);
3346 if (source_info->find_peers_responded != NULL)
3347 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3348 GNUNET_free(source_info);
3352 * Remember this routing request so that if a reply is
3353 * received we can either forward it to the correct peer
3354 * or return the result locally.
3356 * @param msg_ctx Context of the route request
3358 * @return GNUNET_YES if this response was cached, GNUNET_NO if not
3360 static int cache_response(struct DHT_MessageContext *msg_ctx)
3362 struct DHTQueryRecord *record;
3363 struct DHTRouteSource *source_info;
3364 struct DHTRouteSource *pos;
3365 struct GNUNET_TIME_Absolute now;
3366 unsigned int current_size;
3368 current_size = GNUNET_CONTAINER_multihashmap_size(forward_list.hashmap);
3369 while (current_size >= MAX_OUTSTANDING_FORWARDS)
3371 source_info = GNUNET_CONTAINER_heap_remove_root(forward_list.minHeap);
3372 GNUNET_assert(source_info != NULL);
3373 record = source_info->record;
3374 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, source_info);
3375 if (record->head == NULL) /* No more entries in DLL */
3377 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3378 GNUNET_free(record);
3380 if (source_info->delete_task != GNUNET_SCHEDULER_NO_TASK)
3381 GNUNET_SCHEDULER_cancel(source_info->delete_task);
3382 if (source_info->find_peers_responded != NULL)
3383 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3384 GNUNET_free(source_info);
3385 current_size = GNUNET_CONTAINER_multihashmap_size(forward_list.hashmap);
3387 now = GNUNET_TIME_absolute_get();
3388 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &msg_ctx->key);
3389 if (record != NULL) /* Already know this request! */
3394 if (0 == memcmp(msg_ctx->peer, &pos->source, sizeof(struct GNUNET_PeerIdentity)))
3395 break; /* Already have this peer in reply list! */
3398 if ((pos != NULL) && (pos->client == msg_ctx->client)) /* Seen this already */
3400 GNUNET_CONTAINER_heap_update_cost(forward_list.minHeap, pos->hnode, now.abs_value);
3406 record = GNUNET_malloc(sizeof (struct DHTQueryRecord));
3407 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_multihashmap_put(forward_list.hashmap, &msg_ctx->key, record, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
3408 memcpy(&record->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
3411 source_info = GNUNET_malloc(sizeof(struct DHTRouteSource));
3412 source_info->record = record;
3413 source_info->delete_task = GNUNET_SCHEDULER_add_delayed(DHT_FORWARD_TIMEOUT, &remove_forward_entry, source_info);
3414 source_info->find_peers_responded = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3415 memcpy(&source_info->source, msg_ctx->peer, sizeof(struct GNUNET_PeerIdentity));
3416 GNUNET_CONTAINER_DLL_insert_after(record->head, record->tail, record->tail, source_info);
3417 if (msg_ctx->client != NULL) /* For local request, set timeout so high it effectively never gets pushed out */
3419 source_info->client = msg_ctx->client;
3420 now = GNUNET_TIME_absolute_get_forever();
3422 source_info->hnode = GNUNET_CONTAINER_heap_insert(forward_list.minHeap, source_info, now.abs_value);
3424 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3425 "`%s:%s': Created new forward source info for %s uid %llu\n", my_short_id,
3426 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
3433 * Main function that handles whether or not to route a message to other
3436 * @param msg the message to be routed
3437 * @param msg_ctx the context containing all pertinent information about the message
3440 route_message(const struct GNUNET_MessageHeader *msg,
3441 struct DHT_MessageContext *msg_ctx)
3444 struct PeerInfo *selected;
3445 #if DEBUG_DHT_ROUTING > 1
3446 struct PeerInfo *nearest;
3448 unsigned int forward_count;
3449 struct RecentRequest *recent_req;
3450 GNUNET_HashCode unique_hash;
3451 char *stat_forward_count;
3452 char *temp_stat_str;
3453 #if DEBUG_DHT_ROUTING
3457 if (malicious_dropper == GNUNET_YES)
3459 #if DEBUG_DHT_ROUTING
3460 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3462 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3463 msg_ctx->hop_count, GNUNET_SYSERR,
3464 &my_identity, &msg_ctx->key, msg_ctx->peer,
3468 if (msg_ctx->bloom != NULL)
3469 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
3473 increment_stats(STAT_ROUTES);
3474 forward_count = get_forward_count(msg_ctx->hop_count, msg_ctx->replication);
3475 GNUNET_asprintf(&stat_forward_count, "# forward counts of %d", forward_count);
3476 increment_stats(stat_forward_count);
3477 GNUNET_free(stat_forward_count);
3478 if (msg_ctx->bloom == NULL)
3479 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3481 if ((stop_on_closest == GNUNET_YES) && (msg_ctx->closest == GNUNET_YES) && (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT))
3485 * NOTICE: In Kademlia, a find peer request goes no further if the peer doesn't return
3486 * any closer peers (which is being checked for below). Since we are doing recursive
3487 * routing we have no choice but to stop forwarding in this case. This means that at
3488 * any given step the request may NOT be forwarded to alpha peers (because routes will
3489 * stop and the parallel route will not be aware of it). Of course, assuming that we
3490 * have fulfilled the Kademlia requirements for routing table fullness this will never
3491 * ever ever be a problem.
3493 * However, is this fair?
3495 * Since we use these requests to build our routing tables (and we build them in the
3496 * testing driver) we will ignore this restriction for FIND_PEER messages so that
3497 * routing tables still get constructed.
3499 if ((GNUNET_YES == strict_kademlia) && (msg_ctx->closest == GNUNET_YES) && (msg_ctx->hop_count > 0) && (ntohs(msg->type) != GNUNET_MESSAGE_TYPE_DHT_FIND_PEER))
3502 #if DEBUG_DHT_ROUTING
3503 if (forward_count == 0)
3504 ret = GNUNET_SYSERR;
3508 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3510 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3511 msg_ctx->hop_count, ret,
3512 &my_identity, &msg_ctx->key, msg_ctx->peer,
3518 GNUNET_CONTAINER_bloomfilter_add (msg_ctx->bloom, &my_identity.hashPubKey);
3519 hash_from_uid (msg_ctx->unique_id, &unique_hash);
3520 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains (recent.hashmap, &unique_hash))
3522 recent_req = GNUNET_CONTAINER_multihashmap_get(recent.hashmap, &unique_hash);
3523 GNUNET_assert(recent_req != NULL);
3524 if (0 != memcmp(&recent_req->key, &msg_ctx->key, sizeof(GNUNET_HashCode)))
3525 increment_stats(STAT_DUPLICATE_UID);
3528 increment_stats(STAT_RECENT_SEEN);
3529 GNUNET_CONTAINER_bloomfilter_or2(msg_ctx->bloom, recent_req->bloom, DHT_BLOOM_SIZE);
3534 recent_req = GNUNET_malloc(sizeof(struct RecentRequest));
3535 recent_req->uid = msg_ctx->unique_id;
3536 memcpy(&recent_req->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
3537 recent_req->remove_task = GNUNET_SCHEDULER_add_delayed(DEFAULT_RECENT_REMOVAL, &remove_recent, recent_req);
3538 recent_req->heap_node = GNUNET_CONTAINER_heap_insert(recent.minHeap, recent_req, GNUNET_TIME_absolute_get().abs_value);
3539 recent_req->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3540 GNUNET_CONTAINER_multihashmap_put(recent.hashmap, &unique_hash, recent_req, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
3543 if (GNUNET_CONTAINER_multihashmap_size(recent.hashmap) > DHT_MAX_RECENT)
3545 recent_req = GNUNET_CONTAINER_heap_peek(recent.minHeap);
3546 GNUNET_assert(recent_req != NULL);
3547 GNUNET_SCHEDULER_cancel(recent_req->remove_task);
3548 GNUNET_SCHEDULER_add_now(&remove_recent, recent_req);
3551 for (i = 0; i < forward_count; i++)
3553 selected = select_peer(&msg_ctx->key, msg_ctx->bloom, msg_ctx->hop_count);
3555 if (selected != NULL)
3557 if (GNUNET_CRYPTO_hash_matching_bits(&selected->id.hashPubKey, &msg_ctx->key) >= GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &msg_ctx->key))
3558 GNUNET_asprintf(&temp_stat_str, "# requests routed to close(r) peer hop %u", msg_ctx->hop_count);
3560 GNUNET_asprintf(&temp_stat_str, "# requests routed to less close peer hop %u", msg_ctx->hop_count);
3561 if (temp_stat_str != NULL)
3563 increment_stats(temp_stat_str);
3564 GNUNET_free(temp_stat_str);
3566 GNUNET_CONTAINER_bloomfilter_add(msg_ctx->bloom, &selected->id.hashPubKey);
3567 #if DEBUG_DHT_ROUTING > 1
3568 nearest = find_closest_peer(&msg_ctx->key);
3569 nearest_buf = GNUNET_strdup(GNUNET_i2s(&nearest->id));
3570 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3571 "`%s:%s': Forwarding request key %s uid %llu to peer %s (closest %s, bits %d, distance %u)\n", my_short_id,
3572 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&selected->id), nearest_buf, GNUNET_CRYPTO_hash_matching_bits(&nearest->id.hashPubKey, msg_ctx->key), distance(&nearest->id.hashPubKey, msg_ctx->key));
3573 GNUNET_free(nearest_buf);
3575 #if DEBUG_DHT_ROUTING
3576 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3578 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3579 msg_ctx->hop_count, GNUNET_NO,
3580 &my_identity, &msg_ctx->key, msg_ctx->peer,
3584 forward_message(msg, selected, msg_ctx);
3588 if (msg_ctx->bloom != NULL)
3590 GNUNET_CONTAINER_bloomfilter_or2(recent_req->bloom, msg_ctx->bloom, DHT_BLOOM_SIZE);
3591 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
3598 * Main function that handles whether or not to route a message to other
3601 * @param msg the message to be routed
3602 * @param msg_ctx the context containing all pertinent information about the message
3605 demultiplex_message(const struct GNUNET_MessageHeader *msg,
3606 struct DHT_MessageContext *msg_ctx)
3608 msg_ctx->closest = am_closest_peer(&msg_ctx->key, NULL);
3609 switch (ntohs(msg->type))
3611 case GNUNET_MESSAGE_TYPE_DHT_GET: /* Add to hashmap of requests seen, search for data (always) */
3612 cache_response (msg_ctx);
3613 handle_dht_get (msg, msg_ctx);
3615 case GNUNET_MESSAGE_TYPE_DHT_PUT: /* Check if closest, if so insert data. */
3616 increment_stats(STAT_PUTS);
3617 handle_dht_put (msg, msg_ctx);
3619 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER: /* Check if closest and not started by us, check options, add to requests seen */
3620 increment_stats(STAT_FIND_PEER);
3621 if (((msg_ctx->hop_count > 0) && (0 != memcmp(msg_ctx->peer, &my_identity, sizeof(struct GNUNET_PeerIdentity)))) || (msg_ctx->client != NULL))
3623 cache_response (msg_ctx);
3624 if ((msg_ctx->closest == GNUNET_YES) || (msg_ctx->msg_options == GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE))
3625 handle_dht_find_peer (msg, msg_ctx);
3628 route_message (msg, msg_ctx);
3629 #if DEBUG_DHT_ROUTING
3630 if (msg_ctx->hop_count == 0) /* Locally initiated request */
3632 if ((debug_routes) && (dhtlog_handle != NULL))
3634 dhtlog_handle->insert_dhtkey(NULL, &msg_ctx->key);
3635 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_FIND_PEER,
3636 msg_ctx->hop_count, GNUNET_NO, &my_identity,
3643 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
3644 "`%s': Message type (%d) not handled, forwarding anyway!\n", "DHT", ntohs(msg->type));
3645 route_message (msg, msg_ctx);
3653 * Iterator for local get request results,
3655 * @param cls closure for iterator, NULL
3656 * @param exp when does this value expire?
3657 * @param key the key this data is stored under
3658 * @param size the size of the data identified by key
3659 * @param data the actual data
3660 * @param type the type of the data
3662 * @return GNUNET_OK to continue iteration, anything else
3663 * to stop iteration.
3666 republish_content_iterator (void *cls,
3667 struct GNUNET_TIME_Absolute exp,
3668 const GNUNET_HashCode * key,
3669 size_t size, const char *data, uint32_t type)
3672 struct DHT_MessageContext *new_msg_ctx;
3673 struct GNUNET_DHT_PutMessage *put_msg;
3675 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3676 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
3678 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
3681 GNUNET_malloc (sizeof (struct GNUNET_DHT_PutMessage) + size);
3682 put_msg->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_PUT);
3683 put_msg->header.size = htons (sizeof (struct GNUNET_DHT_PutMessage) + size);
3684 put_msg->expiration = GNUNET_TIME_absolute_hton(exp);
3685 put_msg->type = htons (type);
3686 memcpy (&put_msg[1], data, size);
3687 new_msg_ctx->unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3688 new_msg_ctx->replication = ntohl (DEFAULT_PUT_REPLICATION);
3689 new_msg_ctx->msg_options = ntohl (0);
3690 new_msg_ctx->network_size = estimate_diameter();
3691 new_msg_ctx->peer = &my_identity;
3692 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3693 new_msg_ctx->hop_count = 0;
3694 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE;
3695 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
3696 increment_stats(STAT_PUT_START);
3697 demultiplex_message(&put_msg->header, new_msg_ctx);
3699 GNUNET_free(new_msg_ctx);
3700 GNUNET_free (put_msg);
3705 * Task used to republish data.
3707 * @param cls closure (a struct RepublishContext)
3708 * @param tc runtime context for this task
3711 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3713 struct RepublishContext *put_context = cls;
3715 unsigned int results;
3717 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3719 GNUNET_free(put_context);
3723 GNUNET_assert (datacache != NULL); /* If we have no datacache we never should have scheduled this! */
3724 results = GNUNET_DATACACHE_get(datacache, &put_context->key, put_context->type, &republish_content_iterator, NULL);
3725 if (results == 0) /* Data must have expired */
3726 GNUNET_free(put_context);
3727 else /* Reschedule task for next time period */
3728 GNUNET_SCHEDULER_add_delayed(dht_republish_frequency, &republish_content, put_context);
3734 * Iterator over hash map entries.
3736 * @param cls client to search for in source routes
3737 * @param key current key code (ignored)
3738 * @param value value in the hash map, a DHTQueryRecord
3739 * @return GNUNET_YES if we should continue to
3743 static int find_client_records (void *cls,
3744 const GNUNET_HashCode * key, void *value)
3746 struct ClientList *client = cls;
3747 struct DHTQueryRecord *record = value;
3748 struct DHTRouteSource *pos;
3752 if (pos->client == client)
3758 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, pos);
3759 GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, pos->hnode);
3760 if (pos->delete_task != GNUNET_SCHEDULER_NO_TASK)
3761 GNUNET_SCHEDULER_cancel(pos->delete_task);
3763 if (pos->find_peers_responded != NULL)
3764 GNUNET_CONTAINER_bloomfilter_free(pos->find_peers_responded);
3767 if (record->head == NULL) /* No more entries in DLL */
3769 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3770 GNUNET_free(record);
3776 * Functions with this signature are called whenever a client
3777 * is disconnected on the network level.
3779 * @param cls closure (NULL for dht)
3780 * @param client identification of the client; NULL
3781 * for the last call when the server is destroyed
3783 static void handle_client_disconnect (void *cls,
3784 struct GNUNET_SERVER_Client* client)
3786 struct ClientList *pos = client_list;
3787 struct ClientList *prev;
3788 struct ClientList *found;
3789 struct PendingMessage *reply;
3795 if (pos->client_handle == client)
3798 prev->next = pos->next;
3800 client_list = pos->next;
3810 while(NULL != (reply = found->pending_head))
3812 GNUNET_CONTAINER_DLL_remove(found->pending_head, found->pending_tail, reply);
3815 GNUNET_CONTAINER_multihashmap_iterate(forward_list.hashmap, &find_client_records, found);
3821 * Find a client if it exists, add it otherwise.
3823 * @param client the server handle to the client
3825 * @return the client if found, a new client otherwise
3827 static struct ClientList *
3828 find_active_client (struct GNUNET_SERVER_Client *client)
3830 struct ClientList *pos = client_list;
3831 struct ClientList *ret;
3835 if (pos->client_handle == client)
3840 ret = GNUNET_malloc (sizeof (struct ClientList));
3841 ret->client_handle = client;
3842 ret->next = client_list;
3850 * Task to send a malicious put message across the network.
3852 * @param cls closure for this task
3853 * @param tc the context under which the task is running
3856 malicious_put_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3858 static struct GNUNET_DHT_PutMessage put_message;
3859 static struct DHT_MessageContext msg_ctx;
3860 static GNUNET_HashCode key;
3861 uint32_t random_key;
3863 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3865 put_message.header.size = htons(sizeof(struct GNUNET_DHT_PutMessage));
3866 put_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_PUT);
3867 put_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3868 put_message.expiration = GNUNET_TIME_absolute_hton(GNUNET_TIME_absolute_get_forever());
3869 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
3870 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3871 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3872 memcpy(&msg_ctx.key, &key, sizeof(GNUNET_HashCode));
3873 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3874 msg_ctx.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3875 msg_ctx.msg_options = ntohl (0);
3876 msg_ctx.network_size = estimate_diameter();
3877 msg_ctx.peer = &my_identity;
3878 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE;
3879 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3880 #if DEBUG_DHT_ROUTING
3881 if (dhtlog_handle != NULL)
3882 dhtlog_handle->insert_dhtkey(NULL, &key);
3884 increment_stats(STAT_PUT_START);
3885 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious PUT message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3886 demultiplex_message(&put_message.header, &msg_ctx);
3887 GNUNET_SCHEDULER_add_delayed(GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_put_frequency), &malicious_put_task, NULL);
3892 * Task to send a malicious put message across the network.
3894 * @param cls closure for this task
3895 * @param tc the context under which the task is running
3898 malicious_get_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3900 static struct GNUNET_DHT_GetMessage get_message;
3901 struct DHT_MessageContext msg_ctx;
3902 static GNUNET_HashCode key;
3903 uint32_t random_key;
3905 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3908 get_message.header.size = htons(sizeof(struct GNUNET_DHT_GetMessage));
3909 get_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_GET);
3910 get_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3911 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
3912 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3913 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3914 memcpy(&msg_ctx.key, &key, sizeof(GNUNET_HashCode));
3915 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3916 msg_ctx.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3917 msg_ctx.msg_options = ntohl (0);
3918 msg_ctx.network_size = estimate_diameter();
3919 msg_ctx.peer = &my_identity;
3920 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE;
3921 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3922 #if DEBUG_DHT_ROUTING
3923 if (dhtlog_handle != NULL)
3924 dhtlog_handle->insert_dhtkey(NULL, &key);
3926 increment_stats(STAT_GET_START);
3927 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious GET message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3928 demultiplex_message (&get_message.header, &msg_ctx);
3929 GNUNET_SCHEDULER_add_delayed(GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_get_frequency), &malicious_get_task, NULL);
3935 * Iterator over hash map entries.
3937 * @param cls closure
3938 * @param key current key code
3939 * @param value value in the hash map
3940 * @return GNUNET_YES if we should continue to
3945 add_known_to_bloom (void *cls,
3946 const GNUNET_HashCode * key,
3949 struct GNUNET_CONTAINER_BloomFilter *bloom = cls;
3950 GNUNET_CONTAINER_bloomfilter_add (bloom, key);
3955 * Task to send a find peer message for our own peer identifier
3956 * so that we can find the closest peers in the network to ourselves
3957 * and attempt to connect to them.
3959 * @param cls closure for this task
3960 * @param tc the context under which the task is running
3963 send_find_peer_message (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3965 struct GNUNET_DHT_FindPeerMessage *find_peer_msg;
3966 struct DHT_MessageContext msg_ctx;
3967 struct GNUNET_TIME_Relative next_send_time;
3968 struct GNUNET_CONTAINER_BloomFilter *temp_bloom;
3970 struct GNUNET_TIME_Relative time_diff;
3971 struct GNUNET_TIME_Absolute end;
3973 double count_per_interval;
3975 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3978 if ((newly_found_peers > bucket_size) && (GNUNET_YES == do_find_peer)) /* If we are finding peers already, no need to send out our request right now! */
3980 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Have %d newly found peers since last find peer message sent!\n", newly_found_peers);
3981 GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_UNIT_MINUTES,
3982 &send_find_peer_message, NULL);
3983 newly_found_peers = 0;
3987 increment_stats(STAT_FIND_PEER_START);
3989 end = GNUNET_TIME_absolute_get();
3990 time_diff = GNUNET_TIME_absolute_get_difference(find_peer_context.start, end);
3992 if (time_diff.abs_value > FIND_PEER_CALC_INTERVAL.abs_value)
3994 multiplier = time_diff.abs_value / FIND_PEER_CALC_INTERVAL.abs_value;
3995 count_per_interval = find_peer_context.count / multiplier;
3999 multiplier = FIND_PEER_CALC_INTERVAL.abs_value / time_diff.abs_value;
4000 count_per_interval = find_peer_context.count * multiplier;
4004 #if FIND_PEER_WITH_HELLO
4005 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4006 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4007 memcpy(&find_peer_msg[1], my_hello, GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4009 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage));
4010 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage));
4012 find_peer_msg->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_FIND_PEER);
4013 temp_bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4014 GNUNET_CONTAINER_multihashmap_iterate(all_known_peers, &add_known_to_bloom, temp_bloom);
4015 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(temp_bloom, find_peer_msg->bloomfilter, DHT_BLOOM_SIZE));
4016 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4017 memcpy(&msg_ctx.key, &my_identity.hashPubKey, sizeof(GNUNET_HashCode));
4018 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG, (uint64_t)-1));
4019 msg_ctx.replication = DHT_DEFAULT_FIND_PEER_REPLICATION;
4020 msg_ctx.msg_options = DHT_DEFAULT_FIND_PEER_OPTIONS;
4021 msg_ctx.network_size = estimate_diameter();
4022 msg_ctx.peer = &my_identity;
4023 msg_ctx.importance = DHT_DEFAULT_FIND_PEER_IMPORTANCE;
4024 msg_ctx.timeout = DHT_DEFAULT_FIND_PEER_TIMEOUT;
4026 demultiplex_message(&find_peer_msg->header, &msg_ctx);
4027 GNUNET_free(find_peer_msg);
4028 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4029 "`%s:%s': Sent `%s' request to some (?) peers\n", my_short_id, "DHT",
4031 if (newly_found_peers < bucket_size)
4033 next_send_time.rel_value = (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) +
4034 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4035 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2);
4039 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4040 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4041 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4044 GNUNET_assert (next_send_time.rel_value != 0);
4045 find_peer_context.count = 0;
4046 newly_found_peers = 0;
4047 find_peer_context.start = GNUNET_TIME_absolute_get();
4048 if (GNUNET_YES == do_find_peer)
4050 GNUNET_SCHEDULER_add_delayed (next_send_time,
4051 &send_find_peer_message, NULL);
4056 * Handler for any generic DHT messages, calls the appropriate handler
4057 * depending on message type, sends confirmation if responses aren't otherwise
4060 * @param cls closure for the service
4061 * @param client the client we received this message from
4062 * @param message the actual message received
4065 handle_dht_local_route_request (void *cls, struct GNUNET_SERVER_Client *client,
4066 const struct GNUNET_MessageHeader *message)
4068 const struct GNUNET_DHT_RouteMessage *dht_msg = (const struct GNUNET_DHT_RouteMessage *) message;
4069 const struct GNUNET_MessageHeader *enc_msg;
4070 struct DHT_MessageContext msg_ctx;
4072 enc_msg = (const struct GNUNET_MessageHeader *) &dht_msg[1];
4074 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4075 "`%s:%s': Received `%s' request from client, message type %d, key %s, uid %llu\n",
4079 ntohs (message->type),
4080 GNUNET_h2s (&dht_msg->key),
4081 GNUNET_ntohll (dht_msg->unique_id));
4083 #if DEBUG_DHT_ROUTING
4084 if (dhtlog_handle != NULL)
4085 dhtlog_handle->insert_dhtkey (NULL, &dht_msg->key);
4087 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4088 msg_ctx.client = find_active_client (client);
4089 memcpy(&msg_ctx.key, &dht_msg->key, sizeof(GNUNET_HashCode));
4090 msg_ctx.unique_id = GNUNET_ntohll (dht_msg->unique_id);
4091 msg_ctx.replication = ntohl (dht_msg->desired_replication_level);
4092 msg_ctx.msg_options = ntohl (dht_msg->options);
4093 msg_ctx.network_size = estimate_diameter();
4094 msg_ctx.peer = &my_identity;
4095 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE + 4; /* Make local routing a higher priority */
4096 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4097 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET)
4098 increment_stats(STAT_GET_START);
4099 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT)
4100 increment_stats(STAT_PUT_START);
4101 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER)
4102 increment_stats(STAT_FIND_PEER_START);
4104 demultiplex_message(enc_msg, &msg_ctx);
4106 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4111 * Handler for any locally received DHT control messages,
4112 * sets malicious flags mostly for now.
4114 * @param cls closure for the service
4115 * @param client the client we received this message from
4116 * @param message the actual message received
4120 handle_dht_control_message (void *cls, struct GNUNET_SERVER_Client *client,
4121 const struct GNUNET_MessageHeader *message)
4123 const struct GNUNET_DHT_ControlMessage *dht_control_msg =
4124 (const struct GNUNET_DHT_ControlMessage *) message;
4126 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4127 "`%s:%s': Received `%s' request from client, command %d\n", my_short_id, "DHT",
4128 "CONTROL", ntohs(dht_control_msg->command));
4131 switch (ntohs(dht_control_msg->command))
4133 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER:
4134 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Sending self seeking find peer request!\n");
4135 GNUNET_SCHEDULER_add_now(&send_find_peer_message, NULL);
4138 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_GET:
4139 if (ntohs(dht_control_msg->variable) > 0)
4140 malicious_get_frequency = ntohs(dht_control_msg->variable);
4141 if (malicious_get_frequency == 0)
4142 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4143 if (malicious_getter != GNUNET_YES)
4144 GNUNET_SCHEDULER_add_now(&malicious_get_task, NULL);
4145 malicious_getter = GNUNET_YES;
4146 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4147 "%s:%s Initiating malicious GET behavior, frequency %d\n", my_short_id, "DHT", malicious_get_frequency);
4149 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_PUT:
4150 if (ntohs(dht_control_msg->variable) > 0)
4151 malicious_put_frequency = ntohs(dht_control_msg->variable);
4152 if (malicious_put_frequency == 0)
4153 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4154 if (malicious_putter != GNUNET_YES)
4155 GNUNET_SCHEDULER_add_now(&malicious_put_task, NULL);
4156 malicious_putter = GNUNET_YES;
4157 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4158 "%s:%s Initiating malicious PUT behavior, frequency %d\n", my_short_id, "DHT", malicious_put_frequency);
4160 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_DROP:
4161 #if DEBUG_DHT_ROUTING
4162 if ((malicious_dropper != GNUNET_YES) && (dhtlog_handle != NULL))
4163 dhtlog_handle->set_malicious(&my_identity);
4165 malicious_dropper = GNUNET_YES;
4166 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4167 "%s:%s Initiating malicious DROP behavior\n", my_short_id, "DHT");
4171 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4172 "%s:%s Unknown control command type `%d'!\n",
4174 ntohs(dht_control_msg->command));
4178 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4182 * Handler for any generic DHT stop messages, calls the appropriate handler
4183 * depending on message type (if processed locally)
4185 * @param cls closure for the service
4186 * @param client the client we received this message from
4187 * @param message the actual message received
4191 handle_dht_local_route_stop(void *cls, struct GNUNET_SERVER_Client *client,
4192 const struct GNUNET_MessageHeader *message)
4195 const struct GNUNET_DHT_StopMessage *dht_stop_msg =
4196 (const struct GNUNET_DHT_StopMessage *) message;
4197 struct DHTQueryRecord *record;
4198 struct DHTRouteSource *pos;
4200 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4201 "`%s:%s': Received `%s' request from client, uid %llu\n", my_short_id, "DHT",
4202 "GENERIC STOP", GNUNET_ntohll (dht_stop_msg->unique_id));
4204 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &dht_stop_msg->key);
4211 if ((pos->client != NULL) && (pos->client->client_handle == client))
4213 GNUNET_SCHEDULER_cancel(pos->delete_task);
4214 pos->delete_task = GNUNET_SCHEDULER_NO_TASK;
4215 GNUNET_SCHEDULER_add_now(&remove_forward_entry, pos);
4221 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4226 * Core handler for p2p route requests.
4229 handle_dht_p2p_route_request (void *cls,
4230 const struct GNUNET_PeerIdentity *peer,
4231 const struct GNUNET_MessageHeader *message,
4232 struct GNUNET_TIME_Relative latency, uint32_t distance)
4235 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4236 "`%s:%s': Received P2P request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4238 struct GNUNET_DHT_P2PRouteMessage *incoming = (struct GNUNET_DHT_P2PRouteMessage *)message;
4239 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4240 struct DHT_MessageContext *msg_ctx;
4242 if (get_max_send_delay().rel_value > MAX_REQUEST_TIME.rel_value)
4244 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Sending of previous replies took too long, backing off!\n");
4245 increment_stats("# route requests dropped due to high load");
4246 decrease_max_send_delay(get_max_send_delay());
4250 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_P2P_PING) /* Throw these away. FIXME: Don't throw these away? (reply)*/
4253 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Received P2P Ping message.\n", my_short_id, "DHT");
4258 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4263 msg_ctx = GNUNET_malloc(sizeof (struct DHT_MessageContext));
4264 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4265 GNUNET_assert(msg_ctx->bloom != NULL);
4266 msg_ctx->hop_count = ntohl(incoming->hop_count);
4267 memcpy(&msg_ctx->key, &incoming->key, sizeof(GNUNET_HashCode));
4268 msg_ctx->replication = ntohl(incoming->desired_replication_level);
4269 msg_ctx->unique_id = GNUNET_ntohll(incoming->unique_id);
4270 msg_ctx->msg_options = ntohl(incoming->options);
4271 msg_ctx->network_size = ntohl(incoming->network_size);
4272 msg_ctx->peer = peer;
4273 msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE;
4274 msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
4275 demultiplex_message(enc_msg, msg_ctx);
4276 GNUNET_free(msg_ctx);
4282 * Core handler for p2p route results.
4285 handle_dht_p2p_route_result (void *cls,
4286 const struct GNUNET_PeerIdentity *peer,
4287 const struct GNUNET_MessageHeader *message,
4288 struct GNUNET_TIME_Relative latency, uint32_t distance)
4291 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4292 "`%s:%s': Received request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4294 struct GNUNET_DHT_P2PRouteResultMessage *incoming = (struct GNUNET_DHT_P2PRouteResultMessage *)message;
4295 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4296 struct DHT_MessageContext msg_ctx;
4298 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4304 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4305 // FIXME: call GNUNET_BLOCK_evaluate (...) -- instead of doing your own bloomfilter!
4306 msg_ctx.bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4307 GNUNET_assert(msg_ctx.bloom != NULL);
4308 memcpy(&msg_ctx.key, &incoming->key, sizeof(GNUNET_HashCode));
4309 msg_ctx.unique_id = GNUNET_ntohll(incoming->unique_id);
4310 msg_ctx.msg_options = ntohl(incoming->options);
4311 msg_ctx.hop_count = ntohl(incoming->hop_count);
4312 msg_ctx.peer = peer;
4313 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make result routing a higher priority */
4314 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4315 route_result_message(enc_msg, &msg_ctx);
4321 * Receive the HELLO from transport service,
4322 * free current and replace if necessary.
4325 * @param message HELLO message of peer
4328 process_hello (void *cls, const struct GNUNET_MessageHeader *message)
4331 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4332 "Received our `%s' from transport service\n",
4336 GNUNET_assert (message != NULL);
4337 GNUNET_free_non_null(my_hello);
4338 my_hello = GNUNET_malloc(ntohs(message->size));
4339 memcpy(my_hello, message, ntohs(message->size));
4344 * Task run during shutdown.
4350 shutdown_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
4353 struct PeerInfo *pos;
4355 if (transport_handle != NULL)
4357 GNUNET_free_non_null(my_hello);
4358 GNUNET_TRANSPORT_get_hello_cancel(transport_handle, &process_hello, NULL);
4359 GNUNET_TRANSPORT_disconnect(transport_handle);
4361 for (bucket_count = lowest_bucket; bucket_count < MAX_BUCKETS; bucket_count++)
4363 while (k_buckets[bucket_count].head != NULL)
4365 pos = k_buckets[bucket_count].head;
4367 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4368 "%s:%s Removing peer %s from bucket %d!\n", my_short_id, "DHT", GNUNET_i2s(&pos->id), bucket_count);
4370 delete_peer(pos, bucket_count);
4373 if (coreAPI != NULL)
4376 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4377 "%s:%s Disconnecting core!\n", my_short_id, "DHT");
4379 GNUNET_CORE_disconnect (coreAPI);
4382 if (datacache != NULL)
4385 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4386 "%s:%s Destroying datacache!\n", my_short_id, "DHT");
4388 GNUNET_DATACACHE_destroy (datacache);
4393 GNUNET_STATISTICS_destroy (stats, GNUNET_YES);
4396 if (dhtlog_handle != NULL)
4398 GNUNET_DHTLOG_disconnect(dhtlog_handle);
4399 dhtlog_handle = NULL;
4401 if (block_context != NULL)
4403 GNUNET_BLOCK_context_destroy (block_context);
4404 block_context = NULL;
4406 GNUNET_free_non_null(my_short_id);
4412 * To be called on core init/fail.
4414 * @param cls service closure
4415 * @param server handle to the server for this service
4416 * @param identity the public identity of this peer
4417 * @param publicKey the public key of this peer
4420 core_init (void *cls,
4421 struct GNUNET_CORE_Handle *server,
4422 const struct GNUNET_PeerIdentity *identity,
4423 const struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded *publicKey)
4429 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4430 "%s: Connection to core FAILED!\n", "dht",
4431 GNUNET_i2s (identity));
4433 GNUNET_SCHEDULER_cancel (cleanup_task);
4434 GNUNET_SCHEDULER_add_now (&shutdown_task, NULL);
4438 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4439 "%s: Core connection initialized, I am peer: %s\n", "dht",
4440 GNUNET_i2s (identity));
4443 /* Copy our identity so we can use it */
4444 memcpy (&my_identity, identity, sizeof (struct GNUNET_PeerIdentity));
4445 if (my_short_id != NULL)
4446 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s Receive CORE INIT message but have already been initialized! Did CORE fail?\n", "DHT SERVICE");
4447 my_short_id = GNUNET_strdup(GNUNET_i2s(&my_identity));
4448 /* Set the server to local variable */
4451 if (dhtlog_handle != NULL)
4452 dhtlog_handle->insert_node (NULL, &my_identity);
4456 static struct GNUNET_SERVER_MessageHandler plugin_handlers[] = {
4457 {&handle_dht_local_route_request, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE, 0},
4458 {&handle_dht_local_route_stop, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_STOP, 0},
4459 {&handle_dht_control_message, NULL, GNUNET_MESSAGE_TYPE_DHT_CONTROL, 0},
4464 static struct GNUNET_CORE_MessageHandler core_handlers[] = {
4465 {&handle_dht_p2p_route_request, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE, 0},
4466 {&handle_dht_p2p_route_result, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT, 0},
4472 * Method called whenever a peer connects.
4474 * @param cls closure
4475 * @param peer peer identity this notification is about
4476 * @param latency reported latency of the connection with peer
4477 * @param distance reported distance (DV) to peer
4479 void handle_core_connect (void *cls,
4480 const struct GNUNET_PeerIdentity * peer,
4481 struct GNUNET_TIME_Relative latency,
4484 struct PeerInfo *ret;
4487 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4488 "%s:%s Receives core connect message for peer %s distance %d!\n", my_short_id, "dht", GNUNET_i2s(peer), distance);
4491 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4493 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "%s:%s Received %s message for peer %s, but already have peer in RT!", my_short_id, "DHT", "CORE CONNECT", GNUNET_i2s(peer));
4497 if (datacache != NULL)
4498 GNUNET_DATACACHE_put(datacache, &peer->hashPubKey, sizeof(struct GNUNET_PeerIdentity), (const char *)peer, GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_TIME_absolute_get_forever());
4499 ret = try_add_peer(peer,
4500 find_current_bucket(&peer->hashPubKey),
4505 newly_found_peers++;
4506 GNUNET_CONTAINER_multihashmap_put(all_known_peers, &peer->hashPubKey, ret, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
4509 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4510 "%s:%s Adding peer to routing list: %s\n", my_short_id, "DHT", ret == NULL ? "NOT ADDED" : "PEER ADDED");
4516 * Method called whenever a peer disconnects.
4518 * @param cls closure
4519 * @param peer peer identity this notification is about
4521 void handle_core_disconnect (void *cls,
4523 GNUNET_PeerIdentity * peer)
4525 struct PeerInfo *to_remove;
4528 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s: Received peer disconnect message for peer `%s' from %s\n", my_short_id, "DHT", GNUNET_i2s(peer), "CORE");
4530 if (GNUNET_YES != GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4532 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s: do not have peer `%s' in RT, can't disconnect!\n", my_short_id, "DHT", GNUNET_i2s(peer));
4535 increment_stats(STAT_DISCONNECTS);
4536 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey));
4537 to_remove = GNUNET_CONTAINER_multihashmap_get(all_known_peers, &peer->hashPubKey);
4538 GNUNET_assert (to_remove != NULL);
4539 GNUNET_assert(0 == memcmp(peer, &to_remove->id, sizeof(struct GNUNET_PeerIdentity)));
4540 current_bucket = find_current_bucket(&to_remove->id.hashPubKey);
4541 delete_peer(to_remove, current_bucket);
4546 * Process dht requests.
4548 * @param cls closure
4549 * @param server the initialized server
4550 * @param c configuration to use
4554 struct GNUNET_SERVER_Handle *server,
4555 const struct GNUNET_CONFIGURATION_Handle *c)
4557 struct GNUNET_TIME_Relative next_send_time;
4558 unsigned long long temp_config_num;
4559 char *converge_modifier_buf;
4562 datacache = GNUNET_DATACACHE_create (cfg, "dhtcache");
4563 GNUNET_SERVER_add_handlers (server, plugin_handlers);
4564 GNUNET_SERVER_disconnect_notify (server, &handle_client_disconnect, NULL);
4565 coreAPI = GNUNET_CORE_connect (cfg, /* Main configuration */
4567 GNUNET_TIME_UNIT_FOREVER_REL,
4568 NULL, /* Closure passed to DHT functions */
4569 &core_init, /* Call core_init once connected */
4570 &handle_core_connect, /* Handle connects */
4571 &handle_core_disconnect, /* remove peers on disconnects */
4572 NULL, /* Do we care about "status" updates? */
4573 NULL, /* Don't want notified about all incoming messages */
4574 GNUNET_NO, /* For header only inbound notification */
4575 NULL, /* Don't want notified about all outbound messages */
4576 GNUNET_NO, /* For header only outbound notification */
4577 core_handlers); /* Register these handlers */
4579 if (coreAPI == NULL)
4581 transport_handle = GNUNET_TRANSPORT_connect(cfg,
4582 NULL, NULL, NULL, NULL, NULL);
4583 if (transport_handle != NULL)
4584 GNUNET_TRANSPORT_get_hello (transport_handle, &process_hello, NULL);
4586 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4587 "Failed to connect to transport service!\n");
4588 block_context = GNUNET_BLOCK_context_create (cfg);
4589 lowest_bucket = MAX_BUCKETS - 1;
4590 forward_list.hashmap = GNUNET_CONTAINER_multihashmap_create(MAX_OUTSTANDING_FORWARDS / 10);
4591 forward_list.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4592 all_known_peers = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4593 recent_find_peer_requests = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4594 GNUNET_assert(all_known_peers != NULL);
4595 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing", "mysql_logging"))
4597 debug_routes = GNUNET_YES;
4601 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4604 strict_kademlia = GNUNET_YES;
4608 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4611 stop_on_closest = GNUNET_YES;
4615 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4618 stop_on_found = GNUNET_YES;
4622 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4623 "malicious_getter"))
4625 malicious_getter = GNUNET_YES;
4626 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4627 "MALICIOUS_GET_FREQUENCY",
4628 &malicious_get_frequency))
4629 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4632 if (GNUNET_YES != GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4636 max_hops = DEFAULT_MAX_HOPS;
4639 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno (cfg, "DHT",
4642 use_max_hops = GNUNET_YES;
4646 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4647 "malicious_putter"))
4649 malicious_putter = GNUNET_YES;
4650 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4651 "MALICIOUS_PUT_FREQUENCY",
4652 &malicious_put_frequency))
4653 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4656 dht_republish_frequency = GNUNET_DHT_DEFAULT_REPUBLISH_FREQUENCY;
4657 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_number(cfg, "DHT", "REPLICATION_FREQUENCY", &temp_config_num))
4659 dht_republish_frequency = GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, temp_config_num);
4663 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4664 "malicious_dropper"))
4666 malicious_dropper = GNUNET_YES;
4670 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4672 do_republish = GNUNET_NO;
4675 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4678 do_find_peer = GNUNET_NO;
4681 do_find_peer = GNUNET_YES;
4684 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4685 "use_real_distance"))
4686 use_real_distance = GNUNET_YES;
4689 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing",
4690 "mysql_logging_extended"))
4692 debug_routes = GNUNET_YES;
4693 debug_routes_extended = GNUNET_YES;
4696 #if DEBUG_DHT_ROUTING
4697 if (GNUNET_YES == debug_routes)
4699 dhtlog_handle = GNUNET_DHTLOG_connect(cfg);
4700 if (dhtlog_handle == NULL)
4702 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
4703 "Could not connect to mysql logging server, logging will not happen!");
4708 converge_option = DHT_CONVERGE_SQUARE;
4710 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4713 converge_option = DHT_CONVERGE_LINEAR;
4715 else if (GNUNET_YES ==
4716 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4717 "converge_exponential"))
4719 converge_option = DHT_CONVERGE_EXPONENTIAL;
4721 else if (GNUNET_YES ==
4722 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4725 converge_option = DHT_CONVERGE_RANDOM;
4727 else if (GNUNET_YES ==
4728 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4731 converge_option = DHT_CONVERGE_BINARY;
4734 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string(cfg, "dht_testing", "converge_modifier", &converge_modifier_buf))
4736 if (1 != sscanf(converge_modifier_buf, "%f", &converge_modifier))
4738 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Failed to read decimal value for %s from `%s'\n", "CONVERGE_MODIFIER", converge_modifier_buf);
4739 converge_modifier = 0.0;
4741 GNUNET_free(converge_modifier_buf);
4744 stats = GNUNET_STATISTICS_create("dht", cfg);
4748 GNUNET_STATISTICS_set(stats, STAT_ROUTES, 0, GNUNET_NO);
4749 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS, 0, GNUNET_NO);
4750 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS_CLOSEST, 0, GNUNET_NO);
4751 GNUNET_STATISTICS_set(stats, STAT_RESULTS, 0, GNUNET_NO);
4752 GNUNET_STATISTICS_set(stats, STAT_RESULTS_TO_CLIENT, 0, GNUNET_NO);
4753 GNUNET_STATISTICS_set(stats, STAT_RESULT_FORWARDS, 0, GNUNET_NO);
4754 GNUNET_STATISTICS_set(stats, STAT_GETS, 0, GNUNET_NO);
4755 GNUNET_STATISTICS_set(stats, STAT_PUTS, 0, GNUNET_NO);
4756 GNUNET_STATISTICS_set(stats, STAT_PUTS_INSERTED, 0, GNUNET_NO);
4757 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER, 0, GNUNET_NO);
4758 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_START, 0, GNUNET_NO);
4759 GNUNET_STATISTICS_set(stats, STAT_GET_START, 0, GNUNET_NO);
4760 GNUNET_STATISTICS_set(stats, STAT_PUT_START, 0, GNUNET_NO);
4761 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_REPLY, 0, GNUNET_NO);
4762 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_ANSWER, 0, GNUNET_NO);
4763 GNUNET_STATISTICS_set(stats, STAT_BLOOM_FIND_PEER, 0, GNUNET_NO);
4764 GNUNET_STATISTICS_set(stats, STAT_GET_REPLY, 0, GNUNET_NO);
4765 GNUNET_STATISTICS_set(stats, STAT_GET_RESPONSE_START, 0, GNUNET_NO);
4766 GNUNET_STATISTICS_set(stats, STAT_HELLOS_PROVIDED, 0, GNUNET_NO);
4767 GNUNET_STATISTICS_set(stats, STAT_DISCONNECTS, 0, GNUNET_NO);
4769 /* FIXME: if there are no recent requests then these never get freed, but alternative is _annoying_! */
4770 recent.hashmap = GNUNET_CONTAINER_multihashmap_create(DHT_MAX_RECENT / 2);
4771 recent.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4772 if (GNUNET_YES == do_find_peer)
4774 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4775 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4776 (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4777 find_peer_context.start = GNUNET_TIME_absolute_get();
4778 GNUNET_SCHEDULER_add_delayed (next_send_time,
4779 &send_find_peer_message, &find_peer_context);
4782 /* Scheduled the task to clean up when shutdown is called */
4783 cleanup_task = GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_UNIT_FOREVER_REL,
4784 &shutdown_task, NULL);
4788 * The main function for the dht service.
4790 * @param argc number of arguments from the command line
4791 * @param argv command line arguments
4792 * @return 0 ok, 1 on error
4795 main (int argc, char *const *argv)
4800 GNUNET_SERVICE_run (argc,
4803 GNUNET_SERVICE_OPTION_NONE,
4804 &run, NULL)) ? 0 : 1;
4805 GNUNET_assert (0 == GNUNET_CONTAINER_multihashmap_size(recent.hashmap));
4806 GNUNET_assert (0 == GNUNET_CONTAINER_heap_get_size(recent.minHeap));
4807 GNUNET_CONTAINER_multihashmap_destroy (recent_find_peer_requests);
4808 GNUNET_CONTAINER_multihashmap_destroy (recent.hashmap);
4809 GNUNET_CONTAINER_heap_destroy (recent.minHeap);