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 main DHT service shell, building block for DHT implementations
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_PUT_REPLICATION 4
116 * Default replication parameter for find peer messages sent by the dht service.
118 #define DHT_DEFAULT_FIND_PEER_REPLICATION 4
121 * Default options for find peer requests sent by the dht service.
123 #define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE
124 /*#define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_NONE*/
127 * How long at least to wait before sending another find peer request.
129 #define DHT_MINIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
132 * How long at most to wait before sending another find peer request.
134 #define DHT_MAXIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 8)
137 * How often to update our preference levels for peers in our routing tables.
139 #define DHT_DEFAULT_PREFERENCE_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
142 * How long at most on average will we allow a reply forward to take
143 * (before we quit sending out new requests)
145 #define MAX_REQUEST_TIME GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
148 * How many initial requests to send out (in true Kademlia fashion)
150 #define DHT_KADEMLIA_REPLICATION 3
153 * Default frequency for sending malicious get messages
155 #define DEFAULT_MALICIOUS_GET_FREQUENCY 1000 /* Number of milliseconds */
158 * Default frequency for sending malicious put messages
160 #define DEFAULT_MALICIOUS_PUT_FREQUENCY 1000 /* Default is in milliseconds */
163 #define DHT_DEFAULT_PING_DELAY GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 1)
166 * Real maximum number of hops, at which point we refuse
167 * to forward the message.
169 #define DEFAULT_MAX_HOPS 10
172 * How many time differences between requesting a core send and
173 * the actual callback to remember.
175 #define MAX_REPLY_TIMES 8
177 enum ConvergenceOptions
180 * Use the linear method for convergence.
185 * Converge using a fast converging square
191 * Converge using a slower exponential
194 DHT_CONVERGE_EXPONENTIAL,
197 * Don't do any special convergence, allow
198 * the algorithm to hopefully route to closer
204 * Binary convergence, start routing to closest
205 * only after set number of hops.
211 * Linked list of messages to send to clients.
213 struct P2PPendingMessage
216 * Pointer to next item in the list
218 struct P2PPendingMessage *next;
221 * Pointer to previous item in the list
223 struct P2PPendingMessage *prev;
226 * Message importance level.
228 unsigned int importance;
231 * Time when this request was scheduled to be sent.
233 struct GNUNET_TIME_Absolute scheduled;
236 * How long to wait before sending message.
238 struct GNUNET_TIME_Relative timeout;
241 * Actual message to be sent; // avoid allocation
243 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
248 * Per-peer information.
253 * Next peer entry (DLL)
255 struct PeerInfo *next;
258 * Prev peer entry (DLL)
260 struct PeerInfo *prev;
263 * Head of pending messages to be sent to this peer.
265 struct P2PPendingMessage *head;
268 * Tail of pending messages to be sent to this peer.
270 struct P2PPendingMessage *tail;
273 * Core handle for sending messages to this peer.
275 struct GNUNET_CORE_TransmitHandle *th;
278 * Task for scheduling message sends.
280 GNUNET_SCHEDULER_TaskIdentifier send_task;
283 * Task for scheduling preference updates
285 GNUNET_SCHEDULER_TaskIdentifier preference_task;
288 * Preference update context
290 struct GNUNET_CORE_InformationRequestContext *info_ctx;
293 * What is the average latency for replies received?
295 struct GNUNET_TIME_Relative latency;
298 * What is the identity of the peer?
300 struct GNUNET_PeerIdentity id;
303 * Transport level distance to peer.
305 unsigned int distance;
308 * Holds matching bits from peer to current target,
309 * used for distance comparisons between peers. May
310 * be considered a really bad idea.
311 * FIXME: remove this value (create struct which holds
312 * a single peerinfo and the matching bits, use
313 * that to pass to comparitor)
315 unsigned int matching_bits;
318 * Task for scheduling periodic ping messages for this peer.
320 GNUNET_SCHEDULER_TaskIdentifier ping_task;
324 * Peers are grouped into buckets.
331 struct PeerInfo *head;
336 struct PeerInfo *tail;
339 * Number of peers in the bucket.
341 unsigned int peers_size;
345 * Linked list of messages to send to clients.
347 struct PendingMessage
350 * Pointer to next item in the list
352 struct PendingMessage *next;
355 * Pointer to previous item in the list
357 struct PendingMessage *prev;
360 * Actual message to be sent; // avoid allocation
362 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
367 * Struct containing information about a client,
368 * handle to connect to it, and any pending messages
369 * that need to be sent to it.
374 * Linked list of active clients
376 struct ClientList *next;
379 * The handle to this client
381 struct GNUNET_SERVER_Client *client_handle;
384 * Handle to the current transmission request, NULL
387 struct GNUNET_CONNECTION_TransmitHandle *transmit_handle;
390 * Linked list of pending messages for this client
392 struct PendingMessage *pending_head;
395 * Tail of linked list of pending messages for this client
397 struct PendingMessage *pending_tail;
402 * Context containing information about a DHT message received.
404 struct DHT_MessageContext
407 * The client this request was received from.
408 * (NULL if received from another peer)
410 struct ClientList *client;
413 * The peer this request was received from.
414 * (NULL if received from local client)
416 const struct GNUNET_PeerIdentity *peer;
419 * Bloomfilter for this routing request.
421 struct GNUNET_CONTAINER_BloomFilter *bloom;
424 * extended query (see gnunet_block_lib.h).
429 * Bloomfilter to filter out duplicate replies.
431 struct GNUNET_CONTAINER_BloomFilter *reply_bf;
434 * The key this request was about
439 * How long should we wait to transmit this request?
441 struct GNUNET_TIME_Relative timeout;
444 * The unique identifier of this request
449 * Number of bytes in xquery.
454 * Mutator value for the reply_bf, see gnunet_block_lib.h
456 uint32_t reply_bf_mutator;
459 * Desired replication level
461 uint32_t replication;
464 * Network size estimate, either ours or the sum of
465 * those routed to thus far. =~ Log of number of peers
466 * chosen from for this request.
468 uint32_t network_size;
471 * Any message options for this request
473 uint32_t msg_options;
476 * How many hops has the message already traversed?
481 * How important is this message?
483 unsigned int importance;
486 * Should we (still) forward the request on to other peers?
491 * Did we forward this message? (may need to remember it!)
496 * Are we the closest known peer to this key (out of our neighbors?)
502 * Record used for remembering what peers are waiting for what
503 * responses (based on search key).
505 struct DHTRouteSource
510 struct DHTRouteSource *next;
515 struct DHTRouteSource *prev;
518 * Source of the request. Replies should be forwarded to
521 struct GNUNET_PeerIdentity source;
524 * If this was a local request, remember the client; otherwise NULL.
526 struct ClientList *client;
529 * Pointer to this nodes heap location (for removal)
531 struct GNUNET_CONTAINER_HeapNode *hnode;
534 * Back pointer to the record storing this information.
536 struct DHTQueryRecord *record;
539 * Task to remove this entry on timeout.
541 GNUNET_SCHEDULER_TaskIdentifier delete_task;
544 * Bloomfilter of peers we have already sent back as
545 * replies to the initial request. Allows us to not
546 * forward the same peer multiple times for a find peer
549 struct GNUNET_CONTAINER_BloomFilter *find_peers_responded;
554 * Entry in the DHT routing table.
556 struct DHTQueryRecord
559 * Head of DLL for result forwarding.
561 struct DHTRouteSource *head;
564 * Tail of DLL for result forwarding.
566 struct DHTRouteSource *tail;
569 * Key that the record concerns.
574 * GET message of this record (what we already forwarded?).
576 //DV_DHT_MESSAGE get; Try to get away with not saving this.
579 * Bloomfilter of the peers we've replied to so far
581 //struct GNUNET_BloomFilter *bloom_results; Don't think we need this, just remove from DLL on response.
586 * Context used to calculate the number of find peer messages
587 * per X time units since our last scheduled find peer message
588 * was sent. If we have seen too many messages, delay or don't
591 struct FindPeerMessageContext
595 struct GNUNET_TIME_Absolute start;
597 struct GNUNET_TIME_Absolute end;
601 * DHT Routing results structure
606 * Min heap for removal upon reaching limit
608 struct GNUNET_CONTAINER_Heap *minHeap;
611 * Hashmap for fast key based lookup
613 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
618 * DHT structure for recent requests.
620 struct RecentRequests
623 * Min heap for removal upon reaching limit
625 struct GNUNET_CONTAINER_Heap *minHeap;
628 * Hashmap for key based lookup
630 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
636 * Position of this node in the min heap.
638 struct GNUNET_CONTAINER_HeapNode *heap_node;
641 * Bloomfilter containing entries for peers
642 * we forwarded this request to.
644 struct GNUNET_CONTAINER_BloomFilter *bloom;
647 * Timestamp of this request, for ordering
650 struct GNUNET_TIME_Absolute timestamp;
653 * Key of this request.
658 * Unique identifier for this request.
663 * Task to remove this entry on timeout.
665 GNUNET_SCHEDULER_TaskIdentifier remove_task;
668 struct RepublishContext
683 * Which kind of convergence will we be using?
685 static enum ConvergenceOptions converge_option;
688 * Modifier for the convergence function
690 static float converge_modifier;
693 * Recent requests by hash/uid and by time inserted.
695 static struct RecentRequests recent;
698 * Context to use to calculate find peer rates.
700 static struct FindPeerMessageContext find_peer_context;
703 * Don't use our routing algorithm, always route
704 * to closest peer; initially send requests to 3
707 static unsigned int strict_kademlia;
710 * Routing option to end routing when closest peer found.
712 static unsigned int stop_on_closest;
715 * Routing option to end routing when data is found.
717 static unsigned int stop_on_found;
720 * Whether DHT needs to manage find peer requests, or
721 * an external force will do it on behalf of the DHT.
723 static unsigned int do_find_peer;
726 * Once we have stored an item in the DHT, refresh it
727 * according to our republish interval.
729 static unsigned int do_republish;
732 * Use the "real" distance metric when selecting the
733 * next routing hop. Can be less accurate.
735 static unsigned int use_real_distance;
738 * How many peers have we added since we sent out our last
741 static unsigned int newly_found_peers;
744 * Container of active queries we should remember
746 static struct DHTResults forward_list;
749 * Handle to the datacache service (for inserting/retrieving data)
751 static struct GNUNET_DATACACHE_Handle *datacache;
754 * Handle for the statistics service.
756 struct GNUNET_STATISTICS_Handle *stats;
759 * The main scheduler to use for the DHT service
761 static struct GNUNET_SCHEDULER_Handle *sched;
764 * The configuration the DHT service is running with
766 static const struct GNUNET_CONFIGURATION_Handle *cfg;
769 * Handle to the core service
771 static struct GNUNET_CORE_Handle *coreAPI;
774 * Handle to the transport service, for getting our hello
776 static struct GNUNET_TRANSPORT_Handle *transport_handle;
779 * The identity of our peer.
781 static struct GNUNET_PeerIdentity my_identity;
784 * Short id of the peer, for printing
786 static char *my_short_id;
791 static struct GNUNET_MessageHeader *my_hello;
794 * Task to run when we shut down, cleaning up all our trash
796 static GNUNET_SCHEDULER_TaskIdentifier cleanup_task;
799 * The lowest currently used bucket.
801 static unsigned int lowest_bucket; /* Initially equal to MAX_BUCKETS - 1 */
804 * The maximum number of hops before we stop routing messages.
806 static unsigned long long max_hops;
809 * How often to republish content we have previously stored.
811 static struct GNUNET_TIME_Relative dht_republish_frequency;
814 * GNUNET_YES to stop at max_hops, GNUNET_NO to heuristically decide when to stop forwarding.
816 static int use_max_hops;
819 * The buckets (Kademlia routing table, complete with growth).
820 * Array of size MAX_BUCKET_SIZE.
822 static struct PeerBucket k_buckets[MAX_BUCKETS]; /* From 0 to MAX_BUCKETS - 1 */
825 * Hash map of all known peers, for easy removal from k_buckets on disconnect.
827 static struct GNUNET_CONTAINER_MultiHashMap *all_known_peers;
830 * Recently seen find peer requests.
832 static struct GNUNET_CONTAINER_MultiHashMap *recent_find_peer_requests;
835 * Maximum size for each bucket.
837 static unsigned int bucket_size = DEFAULT_BUCKET_SIZE; /* Initially equal to DEFAULT_BUCKET_SIZE */
840 * List of active clients.
842 static struct ClientList *client_list;
845 * Handle to the DHT logger.
847 static struct GNUNET_DHTLOG_Handle *dhtlog_handle;
850 * Whether or not to send routing debugging information
851 * to the dht logging server
853 static unsigned int debug_routes;
856 * Whether or not to send FULL route information to
859 static unsigned int debug_routes_extended;
862 * GNUNET_YES or GNUNET_NO, whether or not to act as
863 * a malicious node which drops all messages
865 static unsigned int malicious_dropper;
868 * GNUNET_YES or GNUNET_NO, whether or not to act as
869 * a malicious node which sends out lots of GETS
871 static unsigned int malicious_getter;
874 * GNUNET_YES or GNUNET_NO, whether or not to act as
875 * a malicious node which sends out lots of PUTS
877 static unsigned int malicious_putter;
880 * Frequency for malicious get requests.
882 static unsigned long long malicious_get_frequency;
885 * Frequency for malicious put requests.
887 static unsigned long long malicious_put_frequency;
890 * Reply times for requests, if we are busy, don't send any
893 static struct GNUNET_TIME_Relative reply_times[MAX_REPLY_TIMES];
896 * Current counter for replies.
898 static unsigned int reply_counter;
901 * Our handle to the BLOCK library.
903 static struct GNUNET_BLOCK_Context *block_context;
907 * Forward declaration.
910 send_generic_reply (void *cls, size_t size, void *buf);
913 /** Declare here so retry_core_send is aware of it */
915 core_transmit_notify (void *cls,
916 size_t size, void *buf);
919 * Convert unique ID to hash code.
921 * @param uid unique ID to convert
922 * @param hash set to uid (extended with zeros)
925 hash_from_uid (uint64_t uid,
926 GNUNET_HashCode *hash)
928 memset (hash, 0, sizeof(GNUNET_HashCode));
929 *((uint64_t*)hash) = uid;
934 * Calculate the average send time between messages so that we can
935 * ignore certain requests if we get too busy.
937 * @return the average time between asking core to send a message
938 * and when the buffer for copying it is passed
940 static struct GNUNET_TIME_Relative get_average_send_delay()
943 unsigned int divisor;
944 struct GNUNET_TIME_Relative average_time;
945 average_time = GNUNET_TIME_relative_get_zero();
947 for (i = 0; i < MAX_REPLY_TIMES; i++)
949 average_time = GNUNET_TIME_relative_add(average_time, reply_times[i]);
950 if (reply_times[i].abs_value == (uint64_t)0)
960 average_time = GNUNET_TIME_relative_divide(average_time, divisor);
961 fprintf(stderr, "Avg send delay: %u sends is %llu\n", divisor, (long long unsigned int)average_time.abs_value);
967 * Given the largest send delay, artificially decrease it
968 * so the next time around we may have a chance at sending
971 static void decrease_max_send_delay(struct GNUNET_TIME_Relative max_time)
974 for (i = 0; i < MAX_REPLY_TIMES; i++)
976 if (reply_times[i].rel_value == max_time.rel_value)
978 reply_times[i].rel_value = reply_times[i].rel_value / 2;
985 * Find the maximum send time of the recently sent values.
987 * @return the average time between asking core to send a message
988 * and when the buffer for copying it is passed
990 static struct GNUNET_TIME_Relative get_max_send_delay()
993 struct GNUNET_TIME_Relative max_time;
994 max_time = GNUNET_TIME_relative_get_zero();
996 for (i = 0; i < MAX_REPLY_TIMES; i++)
998 if (reply_times[i].rel_value > max_time.rel_value)
999 max_time.rel_value = reply_times[i].rel_value;
1002 if (max_time.rel_value > MAX_REQUEST_TIME.rel_value)
1003 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Max send delay was %llu\n", (long long unsigned int)max_time.rel_value);
1008 increment_stats(const char *value)
1012 GNUNET_STATISTICS_update (stats, value, 1, GNUNET_NO);
1017 * Try to send another message from our core send list
1020 try_core_send (void *cls,
1021 const struct GNUNET_SCHEDULER_TaskContext *tc)
1023 struct PeerInfo *peer = cls;
1024 struct P2PPendingMessage *pending;
1027 peer->send_task = GNUNET_SCHEDULER_NO_TASK;
1029 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1032 if (peer->th != NULL)
1033 return; /* Message send already in progress */
1035 pending = peer->head;
1036 if (pending != NULL)
1038 ssize = ntohs(pending->msg->size);
1040 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1041 "`%s:%s': Calling notify_transmit_ready with size %d for peer %s\n", my_short_id,
1042 "DHT", ssize, GNUNET_i2s(&peer->id));
1044 pending->scheduled = GNUNET_TIME_absolute_get();
1046 if (reply_counter >= MAX_REPLY_TIMES)
1048 peer->th = GNUNET_CORE_notify_transmit_ready(coreAPI, pending->importance,
1049 pending->timeout, &peer->id,
1050 ssize, &core_transmit_notify, peer);
1055 * Function called to send a request out to another peer.
1056 * Called both for locally initiated requests and those
1057 * received from other peers.
1059 * @param msg the encapsulated message
1060 * @param peer the peer to forward the message to
1061 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1064 forward_result_message (const struct GNUNET_MessageHeader *msg,
1065 struct PeerInfo *peer,
1066 struct DHT_MessageContext *msg_ctx)
1068 struct GNUNET_DHT_P2PRouteResultMessage *result_message;
1069 struct P2PPendingMessage *pending;
1073 increment_stats(STAT_RESULT_FORWARDS);
1074 msize = sizeof (struct GNUNET_DHT_P2PRouteResultMessage) + ntohs(msg->size);
1075 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1076 psize = sizeof(struct P2PPendingMessage) + msize;
1077 pending = GNUNET_malloc(psize);
1078 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1079 pending->importance = DHT_SEND_PRIORITY;
1080 pending->timeout = GNUNET_TIME_relative_get_forever();
1081 result_message = (struct GNUNET_DHT_P2PRouteResultMessage *)pending->msg;
1082 result_message->header.size = htons(msize);
1083 result_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT);
1084 result_message->put_path_length = htons(0); /* FIXME: implement */
1085 result_message->get_path_length = htons(0); /* FIXME: implement */
1086 result_message->options = htonl(msg_ctx->msg_options);
1087 result_message->hop_count = htonl(msg_ctx->hop_count + 1);
1088 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, result_message->bloomfilter, DHT_BLOOM_SIZE));
1089 result_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1090 memcpy(&result_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1091 memcpy(&result_message[1], msg, ntohs(msg->size));
1093 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));
1095 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1096 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1097 peer->send_task = GNUNET_SCHEDULER_add_now(sched, &try_core_send, peer);
1102 * Called when core is ready to send a message we asked for
1103 * out to the destination.
1105 * @param cls closure (NULL)
1106 * @param size number of bytes available in buf
1107 * @param buf where the callee should write the message
1108 * @return number of bytes written to buf
1111 core_transmit_notify (void *cls,
1112 size_t size, void *buf)
1114 struct PeerInfo *peer = cls;
1116 struct P2PPendingMessage *pending;
1123 /* client disconnected */
1125 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "`%s:%s': buffer was NULL\n", my_short_id, "DHT");
1130 if (peer->head == NULL)
1135 pending = peer->head;
1136 reply_times[reply_counter] = GNUNET_TIME_absolute_get_difference(pending->scheduled, GNUNET_TIME_absolute_get());
1137 msize = ntohs(pending->msg->size);
1141 memcpy (cbuf, pending->msg, msize);
1142 GNUNET_CONTAINER_DLL_remove (peer->head,
1146 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));
1148 GNUNET_free (pending);
1151 while (NULL != pending &&
1152 (size - off >= (msize = ntohs (pending->msg->size))))
1154 #if DEBUG_DHT_ROUTING
1155 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);
1157 memcpy (&cbuf[off], pending->msg, msize);
1159 GNUNET_CONTAINER_DLL_remove (peer->head,
1162 GNUNET_free (pending);
1163 pending = peer->head;
1166 if ((peer->head != NULL) && (peer->send_task == GNUNET_SCHEDULER_NO_TASK))
1167 peer->send_task = GNUNET_SCHEDULER_add_now(sched, &try_core_send, peer);
1169 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);
1176 * Compute the distance between have and target as a 32-bit value.
1177 * Differences in the lower bits must count stronger than differences
1178 * in the higher bits.
1180 * @return 0 if have==target, otherwise a number
1181 * that is larger as the distance between
1182 * the two hash codes increases
1185 distance (const GNUNET_HashCode * target, const GNUNET_HashCode * have)
1187 unsigned int bucket;
1192 /* We have to represent the distance between two 2^9 (=512)-bit
1193 numbers as a 2^5 (=32)-bit number with "0" being used for the
1194 two numbers being identical; furthermore, we need to
1195 guarantee that a difference in the number of matching
1196 bits is always represented in the result.
1198 We use 2^32/2^9 numerical values to distinguish between
1199 hash codes that have the same LSB bit distance and
1200 use the highest 2^9 bits of the result to signify the
1201 number of (mis)matching LSB bits; if we have 0 matching
1202 and hence 512 mismatching LSB bits we return -1 (since
1203 512 itself cannot be represented with 9 bits) */
1205 /* first, calculate the most significant 9 bits of our
1206 result, aka the number of LSBs */
1207 bucket = GNUNET_CRYPTO_hash_matching_bits (target, have);
1208 /* bucket is now a value between 0 and 512 */
1210 return 0; /* perfect match */
1212 return (unsigned int) -1; /* LSB differs; use max (if we did the bit-shifting
1213 below, we'd end up with max+1 (overflow)) */
1215 /* calculate the most significant bits of the final result */
1216 msb = (512 - bucket) << (32 - 9);
1217 /* calculate the 32-9 least significant bits of the final result by
1218 looking at the differences in the 32-9 bits following the
1219 mismatching bit at 'bucket' */
1221 for (i = bucket + 1;
1222 (i < sizeof (GNUNET_HashCode) * 8) && (i < bucket + 1 + 32 - 9); i++)
1224 if (GNUNET_CRYPTO_hash_get_bit (target, i) != GNUNET_CRYPTO_hash_get_bit (have, i))
1225 lsb |= (1 << (bucket + 32 - 9 - i)); /* first bit set will be 10,
1226 last bit set will be 31 -- if
1227 i does not reach 512 first... */
1233 * Return a number that is larger the closer the
1234 * "have" GNUNET_hash code is to the "target".
1236 * @return inverse distance metric, non-zero.
1237 * Must fudge the value if NO bits match.
1240 inverse_distance (const GNUNET_HashCode * target,
1241 const GNUNET_HashCode * have)
1243 if (GNUNET_CRYPTO_hash_matching_bits(target, have) == 0)
1244 return 1; /* Never return 0! */
1245 return ((unsigned int) -1) - distance (target, have);
1249 * Find the optimal bucket for this key, regardless
1250 * of the current number of buckets in use.
1252 * @param hc the hashcode to compare our identity to
1254 * @return the proper bucket index, or GNUNET_SYSERR
1255 * on error (same hashcode)
1257 static int find_bucket(const GNUNET_HashCode *hc)
1261 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, hc);
1262 if (bits == MAX_BUCKETS)
1263 return GNUNET_SYSERR;
1264 return MAX_BUCKETS - bits - 1;
1268 * Find which k-bucket this peer should go into,
1269 * taking into account the size of the k-bucket
1270 * array. This means that if more bits match than
1271 * there are currently buckets, lowest_bucket will
1274 * @param hc GNUNET_HashCode we are finding the bucket for.
1276 * @return the proper bucket index for this key,
1277 * or GNUNET_SYSERR on error (same hashcode)
1279 static int find_current_bucket(const GNUNET_HashCode *hc)
1282 actual_bucket = find_bucket(hc);
1284 if (actual_bucket == GNUNET_SYSERR) /* hc and our peer identity match! */
1285 return lowest_bucket;
1286 else if (actual_bucket < lowest_bucket) /* actual_bucket not yet used */
1287 return lowest_bucket;
1289 return actual_bucket;
1294 * Find a routing table entry from a peer identity
1296 * @param peer the peer to look up
1298 * @return the bucket number holding the peer, GNUNET_SYSERR if not found
1301 find_bucket_by_peer(const struct PeerInfo *peer)
1304 struct PeerInfo *pos;
1306 for (bucket = lowest_bucket; bucket < MAX_BUCKETS - 1; bucket++)
1308 pos = k_buckets[bucket].head;
1317 return GNUNET_SYSERR; /* No such peer. */
1323 * Print the complete routing table for this peer.
1326 print_routing_table ()
1329 struct PeerInfo *pos;
1330 char char_buf[30000];
1332 memset(char_buf, 0, sizeof(char_buf));
1334 char_pos += sprintf(&char_buf[char_pos], "Printing routing table for peer %s\n", my_short_id);
1335 //fprintf(stderr, "Printing routing table for peer %s\n", my_short_id);
1336 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1338 pos = k_buckets[bucket].head;
1339 char_pos += sprintf(&char_buf[char_pos], "Bucket %d:\n", bucket);
1340 //fprintf(stderr, "Bucket %d:\n", bucket);
1343 //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));
1344 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));
1348 fprintf(stderr, "%s", char_buf);
1354 * Find a routing table entry from a peer identity
1356 * @param peer the peer identity to look up
1358 * @return the routing table entry, or NULL if not found
1360 static struct PeerInfo *
1361 find_peer_by_id(const struct GNUNET_PeerIdentity *peer)
1364 struct PeerInfo *pos;
1365 bucket = find_current_bucket(&peer->hashPubKey);
1367 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1370 pos = k_buckets[bucket].head;
1373 if (0 == memcmp(&pos->id, peer, sizeof(struct GNUNET_PeerIdentity)))
1377 return NULL; /* No such peer. */
1380 /* Forward declaration */
1382 update_core_preference (void *cls,
1383 const struct GNUNET_SCHEDULER_TaskContext *tc);
1385 * Function called with statistics about the given peer.
1387 * @param cls closure
1388 * @param peer identifies the peer
1389 * @param bpm_in set to the current bandwidth limit (receiving) for this peer
1390 * @param bpm_out set to the current bandwidth limit (sending) for this peer
1391 * @param amount set to the amount that was actually reserved or unreserved;
1392 * either the full requested amount or zero (no partial reservations)
1393 * @param preference current traffic preference for the given peer
1396 update_core_preference_finish (void *cls,
1397 const struct GNUNET_PeerIdentity * peer,
1398 struct GNUNET_BANDWIDTH_Value32NBO bpm_in,
1399 struct GNUNET_BANDWIDTH_Value32NBO bpm_out,
1400 int amount, uint64_t preference)
1402 struct PeerInfo *peer_info = cls;
1403 peer_info->info_ctx = NULL;
1404 GNUNET_SCHEDULER_add_delayed(sched, DHT_DEFAULT_PREFERENCE_INTERVAL, &update_core_preference, peer_info);
1408 update_core_preference (void *cls,
1409 const struct GNUNET_SCHEDULER_TaskContext *tc)
1411 struct PeerInfo *peer = cls;
1412 uint64_t preference;
1413 unsigned int matching;
1414 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1418 matching = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->id.hashPubKey);
1421 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Peer identifier matches by %u bits, only shifting as much as we can!\n", matching);
1424 preference = 1LL << matching;
1425 peer->info_ctx = GNUNET_CORE_peer_change_preference (sched, cfg,
1427 GNUNET_TIME_relative_get_forever(),
1428 GNUNET_BANDWIDTH_value_init (UINT32_MAX),
1431 &update_core_preference_finish,
1436 * Really add a peer to a bucket (only do assertions
1439 * @param peer GNUNET_PeerIdentity of the peer to add
1440 * @param bucket the already figured out bucket to add
1442 * @param latency the core reported latency of this peer
1443 * @param distance the transport level distance to this peer
1445 * @return the newly added PeerInfo
1447 static struct PeerInfo *
1448 add_peer(const struct GNUNET_PeerIdentity *peer,
1449 unsigned int bucket,
1450 struct GNUNET_TIME_Relative latency,
1451 unsigned int distance)
1453 struct PeerInfo *new_peer;
1454 GNUNET_assert(bucket < MAX_BUCKETS);
1455 GNUNET_assert(peer != NULL);
1456 new_peer = GNUNET_malloc(sizeof(struct PeerInfo));
1457 new_peer->latency = latency;
1458 new_peer->distance = distance;
1460 memcpy(&new_peer->id, peer, sizeof(struct GNUNET_PeerIdentity));
1462 GNUNET_CONTAINER_DLL_insert_after(k_buckets[bucket].head,
1463 k_buckets[bucket].tail,
1464 k_buckets[bucket].tail,
1466 k_buckets[bucket].peers_size++;
1468 if ((GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->hashPubKey) > 0) && (k_buckets[bucket].peers_size <= bucket_size))
1470 #if DO_UPDATE_PREFERENCE
1471 new_peer->preference_task = GNUNET_SCHEDULER_add_now(sched, &update_core_preference, new_peer);
1479 * Given a peer and its corresponding bucket,
1480 * remove it from that bucket. Does not free
1481 * the PeerInfo struct, nor cancel messages
1482 * or free messages waiting to be sent to this
1485 * @param peer the peer to remove
1486 * @param bucket the bucket the peer belongs to
1488 static void remove_peer (struct PeerInfo *peer,
1489 unsigned int bucket)
1491 GNUNET_assert(k_buckets[bucket].peers_size > 0);
1492 GNUNET_CONTAINER_DLL_remove(k_buckets[bucket].head,
1493 k_buckets[bucket].tail,
1495 k_buckets[bucket].peers_size--;
1497 if ((bucket == lowest_bucket) && (k_buckets[lowest_bucket].peers_size == 0) && (lowest_bucket < MAX_BUCKETS - 1))
1503 * Removes peer from a bucket, then frees associated
1504 * resources and frees peer.
1506 * @param peer peer to be removed and freed
1507 * @param bucket which bucket this peer belongs to
1509 static void delete_peer (struct PeerInfo *peer,
1510 unsigned int bucket)
1512 struct P2PPendingMessage *pos;
1513 struct P2PPendingMessage *next;
1515 struct PeerInfo *peer_pos;
1517 peer_pos = k_buckets[bucket].head;
1518 while ((peer_pos != NULL) && (peer_pos != peer))
1519 peer_pos = peer_pos->next;
1520 if (peer_pos == NULL)
1522 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s: Expected peer `%s' in bucket %d\n", my_short_id, "DHT", GNUNET_i2s(&peer->id), bucket);
1523 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));
1525 GNUNET_assert(peer_pos != NULL);
1527 remove_peer(peer, bucket); /* First remove the peer from its bucket */
1529 if (peer->send_task != GNUNET_SCHEDULER_NO_TASK)
1530 GNUNET_SCHEDULER_cancel(sched, peer->send_task);
1531 if (peer->th != NULL)
1532 GNUNET_CORE_notify_transmit_ready_cancel(peer->th);
1535 while (pos != NULL) /* Remove any pending messages for this peer */
1542 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->id.hashPubKey));
1543 GNUNET_CONTAINER_multihashmap_remove (all_known_peers, &peer->id.hashPubKey, peer);
1549 * Iterator over hash map entries.
1551 * @param cls closure
1552 * @param key current key code
1553 * @param value PeerInfo of the peer to move to new lowest bucket
1554 * @return GNUNET_YES if we should continue to
1558 static int move_lowest_bucket (void *cls,
1559 const GNUNET_HashCode * key,
1562 struct PeerInfo *peer = value;
1565 GNUNET_assert(lowest_bucket > 0);
1566 new_bucket = lowest_bucket - 1;
1567 remove_peer(peer, lowest_bucket);
1568 GNUNET_CONTAINER_DLL_insert_after(k_buckets[new_bucket].head,
1569 k_buckets[new_bucket].tail,
1570 k_buckets[new_bucket].tail,
1572 k_buckets[new_bucket].peers_size++;
1578 * The current lowest bucket is full, so change the lowest
1579 * bucket to the next lower down, and move any appropriate
1580 * entries in the current lowest bucket to the new bucket.
1582 static void enable_next_bucket()
1584 struct GNUNET_CONTAINER_MultiHashMap *to_remove;
1585 struct PeerInfo *pos;
1586 GNUNET_assert(lowest_bucket > 0);
1587 to_remove = GNUNET_CONTAINER_multihashmap_create(bucket_size);
1588 pos = k_buckets[lowest_bucket].head;
1591 fprintf(stderr, "Printing RT before new bucket\n");
1592 print_routing_table();
1594 /* Populate the array of peers which should be in the next lowest bucket */
1597 if (find_bucket(&pos->id.hashPubKey) < lowest_bucket)
1598 GNUNET_CONTAINER_multihashmap_put(to_remove, &pos->id.hashPubKey, pos, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
1602 /* Remove peers from lowest bucket, insert into next lowest bucket */
1603 GNUNET_CONTAINER_multihashmap_iterate(to_remove, &move_lowest_bucket, NULL);
1604 GNUNET_CONTAINER_multihashmap_destroy(to_remove);
1605 lowest_bucket = lowest_bucket - 1;
1607 fprintf(stderr, "Printing RT after new bucket\n");
1608 print_routing_table();
1613 * Find the closest peer in our routing table to the
1616 * @return The closest peer in our routing table to the
1617 * key, or NULL on error.
1619 static struct PeerInfo *
1620 find_closest_peer (const GNUNET_HashCode *hc)
1622 struct PeerInfo *pos;
1623 struct PeerInfo *current_closest;
1624 unsigned int lowest_distance;
1625 unsigned int temp_distance;
1629 lowest_distance = -1;
1631 if (k_buckets[lowest_bucket].peers_size == 0)
1634 current_closest = NULL;
1635 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1637 pos = k_buckets[bucket].head;
1639 while ((pos != NULL) && (count < bucket_size))
1641 temp_distance = distance(&pos->id.hashPubKey, hc);
1642 if (temp_distance <= lowest_distance)
1644 lowest_distance = temp_distance;
1645 current_closest = pos;
1651 GNUNET_assert(current_closest != NULL);
1652 return current_closest;
1657 * Function called to send a request out to another peer.
1658 * Called both for locally initiated requests and those
1659 * received from other peers.
1661 * @param msg the encapsulated message
1662 * @param peer the peer to forward the message to
1663 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1665 static void forward_message (const struct GNUNET_MessageHeader *msg,
1666 struct PeerInfo *peer,
1667 struct DHT_MessageContext *msg_ctx)
1669 struct GNUNET_DHT_P2PRouteMessage *route_message;
1670 struct P2PPendingMessage *pending;
1674 increment_stats(STAT_ROUTE_FORWARDS);
1676 if ((msg_ctx->closest != GNUNET_YES) && (peer == find_closest_peer(&msg_ctx->key)))
1677 increment_stats(STAT_ROUTE_FORWARDS_CLOSEST);
1679 msize = sizeof (struct GNUNET_DHT_P2PRouteMessage) + ntohs(msg->size);
1680 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1681 psize = sizeof(struct P2PPendingMessage) + msize;
1682 pending = GNUNET_malloc(psize);
1683 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1684 pending->importance = msg_ctx->importance;
1685 pending->timeout = msg_ctx->timeout;
1686 route_message = (struct GNUNET_DHT_P2PRouteMessage *)pending->msg;
1687 route_message->header.size = htons(msize);
1688 route_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE);
1689 route_message->options = htonl(msg_ctx->msg_options);
1690 route_message->hop_count = htonl(msg_ctx->hop_count + 1);
1691 route_message->network_size = htonl(msg_ctx->network_size);
1692 route_message->desired_replication_level = htonl(msg_ctx->replication);
1693 route_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1694 if (msg_ctx->bloom != NULL)
1695 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, route_message->bloomfilter, DHT_BLOOM_SIZE));
1696 memcpy(&route_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1697 memcpy(&route_message[1], msg, ntohs(msg->size));
1699 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));
1701 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1702 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1703 peer->send_task = GNUNET_SCHEDULER_add_now(sched, &try_core_send, peer);
1708 * Task used to send ping messages to peers so that
1709 * they don't get disconnected.
1711 * @param cls the peer to send a ping message to
1712 * @param tc context, reason, etc.
1715 periodic_ping_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1717 struct PeerInfo *peer = cls;
1718 struct GNUNET_MessageHeader ping_message;
1719 struct DHT_MessageContext message_context;
1721 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1724 ping_message.size = htons(sizeof(struct GNUNET_MessageHeader));
1725 ping_message.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_PING);
1727 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
1729 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Sending periodic ping to %s\n", my_short_id, "DHT", GNUNET_i2s(&peer->id));
1731 forward_message(&ping_message, peer, &message_context);
1732 peer->ping_task = GNUNET_SCHEDULER_add_delayed(sched, DHT_DEFAULT_PING_DELAY, &periodic_ping_task, peer);
1736 * Schedule PING messages for the top X peers in each
1737 * bucket of the routing table (so core won't disconnect them!)
1739 void schedule_ping_messages()
1741 unsigned int bucket;
1743 struct PeerInfo *pos;
1744 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1746 pos = k_buckets[bucket].head;
1750 if ((count < bucket_size) && (pos->ping_task == GNUNET_SCHEDULER_NO_TASK))
1751 GNUNET_SCHEDULER_add_now(sched, &periodic_ping_task, pos);
1752 else if ((count >= bucket_size) && (pos->ping_task != GNUNET_SCHEDULER_NO_TASK))
1754 GNUNET_SCHEDULER_cancel(sched, pos->ping_task);
1755 pos->ping_task = GNUNET_SCHEDULER_NO_TASK;
1765 * Attempt to add a peer to our k-buckets.
1767 * @param peer the peer identity of the peer being added
1768 * @param bucket the bucket that we want this peer to go in
1769 * @param latency transport latency of this peer
1770 * @param distance transport distance to this peer
1772 * @return NULL if the peer was not added,
1773 * pointer to PeerInfo for new peer otherwise
1775 static struct PeerInfo *
1776 try_add_peer(const struct GNUNET_PeerIdentity *peer,
1777 unsigned int bucket,
1778 struct GNUNET_TIME_Relative latency,
1779 unsigned int distance)
1782 struct PeerInfo *new_peer;
1784 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1787 peer_bucket = find_current_bucket(&peer->hashPubKey);
1789 GNUNET_assert(peer_bucket >= lowest_bucket);
1790 new_peer = add_peer(peer, peer_bucket, latency, distance);
1792 if ((k_buckets[lowest_bucket].peers_size) >= bucket_size)
1793 enable_next_bucket();
1795 schedule_ping_messages();
1802 * Task run to check for messages that need to be sent to a client.
1804 * @param client a ClientList, containing the client and any messages to be sent to it
1807 process_pending_messages (struct ClientList *client)
1809 if (client->pending_head == NULL)
1811 if (client->transmit_handle != NULL)
1814 client->transmit_handle =
1815 GNUNET_SERVER_notify_transmit_ready (client->client_handle,
1816 ntohs (client->pending_head->msg->
1818 GNUNET_TIME_UNIT_FOREVER_REL,
1819 &send_generic_reply, client);
1823 * Callback called as a result of issuing a GNUNET_SERVER_notify_transmit_ready
1824 * request. A ClientList is passed as closure, take the head of the list
1825 * and copy it into buf, which has the result of sending the message to the
1828 * @param cls closure to this call
1829 * @param size maximum number of bytes available to send
1830 * @param buf where to copy the actual message to
1832 * @return the number of bytes actually copied, 0 indicates failure
1835 send_generic_reply (void *cls, size_t size, void *buf)
1837 struct ClientList *client = cls;
1839 struct PendingMessage *reply;
1843 client->transmit_handle = NULL;
1846 /* client disconnected */
1850 while ( (NULL != (reply = client->pending_head)) &&
1851 (size >= off + (msize = ntohs (reply->msg->size))))
1853 GNUNET_CONTAINER_DLL_remove (client->pending_head,
1854 client->pending_tail,
1856 memcpy (&cbuf[off], reply->msg, msize);
1857 GNUNET_free (reply);
1860 process_pending_messages (client);
1862 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1863 "Transmitted %u bytes of replies to client\n",
1864 (unsigned int) off);
1871 * Add a PendingMessage to the clients list of messages to be sent
1873 * @param client the active client to send the message to
1874 * @param pending_message the actual message to send
1877 add_pending_message (struct ClientList *client,
1878 struct PendingMessage *pending_message)
1880 GNUNET_CONTAINER_DLL_insert_after (client->pending_head,
1881 client->pending_tail,
1882 client->pending_tail,
1884 process_pending_messages (client);
1889 * Called when a reply needs to be sent to a client, as
1890 * a result it found to a GET or FIND PEER request.
1892 * @param client the client to send the reply to
1893 * @param message the encapsulated message to send
1894 * @param uid the unique identifier of this request
1897 send_reply_to_client (struct ClientList *client,
1898 const struct GNUNET_MessageHeader *message,
1899 unsigned long long uid,
1900 const GNUNET_HashCode *key)
1902 struct GNUNET_DHT_RouteResultMessage *reply;
1903 struct PendingMessage *pending_message;
1907 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1908 "`%s:%s': Sending reply to client.\n", my_short_id, "DHT");
1910 msize = ntohs (message->size);
1911 tsize = sizeof (struct GNUNET_DHT_RouteResultMessage) + msize;
1912 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
1914 GNUNET_break_op (0);
1917 pending_message = GNUNET_malloc (sizeof (struct PendingMessage) + tsize);
1918 pending_message->msg = (struct GNUNET_MessageHeader *)&pending_message[1];
1919 reply = (struct GNUNET_DHT_RouteResultMessage *)&pending_message[1];
1920 reply->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_RESULT);
1921 reply->header.size = htons (tsize);
1922 reply->put_path_length = htons(0); /* FIXME: implement */
1923 reply->get_path_length = htons(0); /* FIXME: implement */
1924 reply->unique_id = GNUNET_htonll (uid);
1926 memcpy (&reply[1], message, msize);
1927 add_pending_message (client, pending_message);
1931 * Consider whether or not we would like to have this peer added to
1932 * our routing table. Check whether bucket for this peer is full,
1933 * if so return negative; if not return positive. Since peers are
1934 * only added on CORE level connect, this doesn't actually add the
1935 * peer to the routing table.
1937 * @param peer the peer we are considering adding
1939 * @return GNUNET_YES if we want this peer, GNUNET_NO if not (bucket
1942 static int consider_peer (struct GNUNET_PeerIdentity *peer)
1946 if ((GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey)) || (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity))))
1947 return GNUNET_NO; /* We already know this peer (are connected even!) */
1948 bucket = find_current_bucket(&peer->hashPubKey);
1950 if ((k_buckets[bucket].peers_size < bucket_size) || ((bucket == lowest_bucket) && (lowest_bucket > 0)))
1957 * Main function that handles whether or not to route a result
1958 * message to other peers, or to send to our local client.
1960 * @param msg the result message to be routed
1961 * @param message_context context of the message we are routing
1963 * @return the number of peers the message was routed to,
1964 * GNUNET_SYSERR on failure
1966 static int route_result_message(struct GNUNET_MessageHeader *msg,
1967 struct DHT_MessageContext *message_context)
1969 struct GNUNET_PeerIdentity new_peer;
1970 struct DHTQueryRecord *record;
1971 struct DHTRouteSource *pos;
1972 struct PeerInfo *peer_info;
1973 const struct GNUNET_MessageHeader *hello_msg;
1975 increment_stats(STAT_RESULTS);
1977 * If a find peer result message is received and contains a valid
1978 * HELLO for another peer, offer it to the transport service.
1980 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT)
1982 if (ntohs(msg->size) <= sizeof(struct GNUNET_MessageHeader))
1985 hello_msg = &msg[1];
1986 if ((ntohs(hello_msg->type) != GNUNET_MESSAGE_TYPE_HELLO) || (GNUNET_SYSERR == GNUNET_HELLO_get_id((const struct GNUNET_HELLO_Message *)hello_msg, &new_peer)))
1988 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Received non-HELLO message type in find peer result message!\n", my_short_id, "DHT");
1992 else /* We have a valid hello, and peer id stored in new_peer */
1994 find_peer_context.count++;
1995 increment_stats(STAT_FIND_PEER_REPLY);
1996 if (GNUNET_YES == consider_peer(&new_peer))
1998 increment_stats(STAT_HELLOS_PROVIDED);
1999 GNUNET_TRANSPORT_offer_hello(transport_handle, hello_msg);
2000 GNUNET_CORE_peer_request_connect(sched, cfg, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &new_peer, NULL, NULL);
2005 if (malicious_dropper == GNUNET_YES)
2008 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &message_context->key);
2010 if (record == NULL) /* No record of this message! */
2013 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2014 "`%s:%s': Have no record of response key %s uid %llu\n", my_short_id,
2015 "DHT", GNUNET_h2s (&message_context->key), message_context->unique_id);
2017 #if DEBUG_DHT_ROUTING
2018 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2020 dhtlog_handle->insert_route (NULL,
2021 message_context->unique_id,
2023 message_context->hop_count,
2026 &message_context->key,
2027 message_context->peer, NULL);
2030 if (message_context->bloom != NULL)
2032 GNUNET_CONTAINER_bloomfilter_free(message_context->bloom);
2033 message_context->bloom = NULL;
2041 #if STRICT_FORWARDING
2042 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT) /* If we have already forwarded this peer id, don't do it again! */
2044 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (pos->find_peers_responded, &new_peer.hashPubKey))
2046 increment_stats("# find peer responses NOT forwarded (bloom match)");
2051 GNUNET_CONTAINER_bloomfilter_add(pos->find_peers_responded, &new_peer.hashPubKey);
2055 if (0 == memcmp(&pos->source, &my_identity, sizeof(struct GNUNET_PeerIdentity))) /* Local client (or DHT) initiated request! */
2058 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2059 "`%s:%s': Sending response key %s uid %llu to client\n", my_short_id,
2060 "DHT", GNUNET_h2s (&message_context->key), message_context->unique_id);
2062 #if DEBUG_DHT_ROUTING
2063 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2065 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_RESULT,
2066 message_context->hop_count,
2067 GNUNET_YES, &my_identity, &message_context->key,
2068 message_context->peer, NULL);
2071 increment_stats(STAT_RESULTS_TO_CLIENT);
2072 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET_RESULT)
2073 increment_stats(STAT_GET_REPLY);
2075 send_reply_to_client(pos->client, msg,
2076 message_context->unique_id,
2077 &message_context->key);
2079 else /* Send to peer */
2081 peer_info = find_peer_by_id(&pos->source);
2082 if (peer_info == NULL) /* Didn't find the peer in our routing table, perhaps peer disconnected! */
2088 if (message_context->bloom == NULL)
2089 message_context->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2090 GNUNET_CONTAINER_bloomfilter_add (message_context->bloom, &my_identity.hashPubKey);
2091 if ((GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (message_context->bloom, &peer_info->id.hashPubKey)))
2094 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2095 "`%s:%s': Forwarding response key %s uid %llu to peer %s\n", my_short_id,
2096 "DHT", GNUNET_h2s (&message_context->key), message_context->unique_id, GNUNET_i2s(&peer_info->id));
2098 #if DEBUG_DHT_ROUTING
2099 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2101 dhtlog_handle->insert_route (NULL, message_context->unique_id,
2103 message_context->hop_count,
2104 GNUNET_NO, &my_identity, &message_context->key,
2105 message_context->peer, &pos->source);
2108 forward_result_message(msg, peer_info, message_context);
2113 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2114 "`%s:%s': NOT Forwarding response (bloom match) key %s uid %llu to peer %s\n", my_short_id,
2115 "DHT", GNUNET_h2s (&message_context->key), message_context->unique_id, GNUNET_i2s(&peer_info->id));
2121 if (message_context->bloom != NULL)
2122 GNUNET_CONTAINER_bloomfilter_free(message_context->bloom);
2127 * Iterator for local get request results,
2129 * @param cls closure for iterator, a DatacacheGetContext
2130 * @param exp when does this value expire?
2131 * @param key the key this data is stored under
2132 * @param size the size of the data identified by key
2133 * @param data the actual data
2134 * @param type the type of the data
2136 * @return GNUNET_OK to continue iteration, anything else
2137 * to stop iteration.
2140 datacache_get_iterator (void *cls,
2141 struct GNUNET_TIME_Absolute exp,
2142 const GNUNET_HashCode * key,
2143 size_t size, const char *data,
2144 enum GNUNET_BLOCK_Type type)
2146 struct DHT_MessageContext *msg_ctx = cls;
2147 struct DHT_MessageContext *new_msg_ctx;
2148 struct GNUNET_DHT_GetResultMessage *get_result;
2149 enum GNUNET_BLOCK_EvaluationResult eval;
2152 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2153 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
2155 eval = GNUNET_BLOCK_evaluate (block_context,
2159 msg_ctx->reply_bf_mutator,
2161 msg_ctx->xquery_size,
2166 case GNUNET_BLOCK_EVALUATION_OK_LAST:
2167 msg_ctx->do_forward = GNUNET_NO;
2168 case GNUNET_BLOCK_EVALUATION_OK_MORE:
2169 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2170 memcpy(new_msg_ctx, msg_ctx, sizeof(struct DHT_MessageContext));
2172 GNUNET_malloc (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2173 get_result->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_GET_RESULT);
2174 get_result->header.size =
2175 htons (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2176 get_result->expiration = GNUNET_TIME_absolute_hton(exp);
2177 get_result->type = htons (type);
2178 memcpy (&get_result[1], data, size);
2179 new_msg_ctx->peer = &my_identity;
2180 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2181 new_msg_ctx->hop_count = 0;
2182 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE * 2; /* Make result routing a higher priority */
2183 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2184 increment_stats(STAT_GET_RESPONSE_START);
2185 route_result_message(&get_result->header, new_msg_ctx);
2186 GNUNET_free(new_msg_ctx);
2187 GNUNET_free (get_result);
2189 case GNUNET_BLOCK_EVALUATION_OK_DUPLICATE:
2191 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2192 "`%s:%s': Duplicate block error\n", my_short_id, "DHT");
2195 case GNUNET_BLOCK_EVALUATION_RESULT_INVALID:
2197 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2198 "`%s:%s': Invalid request error\n", my_short_id, "DHT");
2201 case GNUNET_BLOCK_EVALUATION_REQUEST_VALID:
2203 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2204 "`%s:%s': Valid request, no results.\n", my_short_id, "DHT");
2208 case GNUNET_BLOCK_EVALUATION_REQUEST_INVALID:
2209 GNUNET_break_op (0);
2210 msg_ctx->do_forward = GNUNET_NO;
2212 case GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED:
2214 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2215 "`%s:%s': Unsupported block type (%u) in response!\n", my_short_id, "DHT", type);
2217 /* msg_ctx->do_forward = GNUNET_NO; // not sure... */
2225 * Main function that handles whether or not to route a message to other
2228 * @param msg the message to be routed
2229 * @param message_context the context containing all pertinent information about the message
2232 route_message(const struct GNUNET_MessageHeader *msg,
2233 struct DHT_MessageContext *message_context);
2237 * Server handler for all dht get requests, look for data,
2238 * if found, send response either to clients or other peers.
2240 * @param msg the actual get message
2241 * @param message_context struct containing pertinent information about the get request
2243 * @return number of items found for GET request
2246 handle_dht_get (const struct GNUNET_MessageHeader *msg,
2247 struct DHT_MessageContext *message_context)
2249 const struct GNUNET_DHT_GetMessage *get_msg;
2252 unsigned int results;
2254 enum GNUNET_BLOCK_Type type;
2256 msize = ntohs (msg->size);
2257 if (msize < sizeof (struct GNUNET_DHT_GetMessage))
2262 get_msg = (const struct GNUNET_DHT_GetMessage *) msg;
2263 bf_size = ntohs (get_msg->bf_size);
2264 message_context->xquery_size = ntohs (get_msg->xquery_size);
2265 message_context->reply_bf_mutator = get_msg->bf_mutator; /* FIXME: ntohl? */
2266 if (msize != sizeof (struct GNUNET_DHT_GetMessage) + bf_size + message_context->xquery_size)
2271 end = (const char*) &get_msg[1];
2272 if (message_context->xquery_size == 0)
2274 message_context->xquery = NULL;
2278 message_context->xquery = (const void*) end;
2279 end += message_context->xquery_size;
2283 message_context->reply_bf = NULL;
2287 message_context->reply_bf = GNUNET_CONTAINER_bloomfilter_init (end,
2289 GNUNET_DHT_GET_BLOOMFILTER_K);
2291 type = (enum GNUNET_BLOCK_Type) ntohl (get_msg->type);
2293 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2294 "`%s:%s': Received `%s' request, message type %u, key %s, uid %llu\n",
2298 GNUNET_h2s (&message_context->key),
2299 message_context->unique_id);
2301 increment_stats(STAT_GETS);
2304 if (type == GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE)
2306 GNUNET_CONTAINER_bloomfilter_free (message_context->reply_bf);
2310 message_context->do_forward = GNUNET_YES;
2311 if (datacache != NULL)
2313 = GNUNET_DATACACHE_get (datacache,
2314 &message_context->key, type,
2315 &datacache_get_iterator,
2318 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2319 "`%s:%s': Found %d results for `%s' request uid %llu\n", my_short_id, "DHT",
2320 results, "GET", message_context->unique_id);
2324 #if DEBUG_DHT_ROUTING
2325 if ((debug_routes) && (dhtlog_handle != NULL))
2327 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_GET,
2328 message_context->hop_count, GNUNET_YES, &my_identity,
2329 &message_context->key);
2332 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2334 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_ROUTE,
2335 message_context->hop_count, GNUNET_YES,
2336 &my_identity, &message_context->key, message_context->peer,
2343 /* check query valid */
2344 if (GNUNET_BLOCK_EVALUATION_REQUEST_INVALID
2345 == GNUNET_BLOCK_evaluate (block_context,
2347 &message_context->key,
2348 &message_context->reply_bf,
2349 message_context->reply_bf_mutator,
2350 message_context->xquery,
2351 message_context->xquery_size,
2354 GNUNET_break_op (0);
2355 message_context->do_forward = GNUNET_NO;
2359 if (message_context->hop_count == 0) /* Locally initiated request */
2361 #if DEBUG_DHT_ROUTING
2362 if ((debug_routes) && (dhtlog_handle != NULL))
2364 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_GET,
2365 message_context->hop_count, GNUNET_NO, &my_identity,
2366 &message_context->key);
2370 if (message_context->do_forward == GNUNET_YES)
2371 route_message (msg, message_context);
2372 GNUNET_CONTAINER_bloomfilter_free (message_context->reply_bf);
2377 remove_recent_find_peer(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
2379 GNUNET_HashCode *key = cls;
2381 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent_find_peer_requests, key, NULL));
2386 * Server handler for initiating local dht find peer requests
2388 * @param find_msg the actual find peer message
2389 * @param message_context struct containing pertinent information about the request
2393 handle_dht_find_peer (const struct GNUNET_MessageHeader *find_msg,
2394 struct DHT_MessageContext *message_context)
2396 struct GNUNET_MessageHeader *find_peer_result;
2397 struct GNUNET_DHT_FindPeerMessage *find_peer_message;
2398 struct DHT_MessageContext *new_msg_ctx;
2399 struct GNUNET_CONTAINER_BloomFilter *incoming_bloom;
2402 GNUNET_HashCode *recent_hash;
2403 struct GNUNET_MessageHeader *other_hello;
2404 size_t other_hello_size;
2405 struct GNUNET_PeerIdentity peer_id;
2407 find_peer_message = (struct GNUNET_DHT_FindPeerMessage *)find_msg;
2408 GNUNET_break_op(ntohs(find_msg->size) >= (sizeof(struct GNUNET_DHT_FindPeerMessage)));
2409 if (ntohs(find_msg->size) < sizeof(struct GNUNET_DHT_FindPeerMessage))
2412 other_hello_size = 0;
2413 if (ntohs(find_msg->size) > sizeof(struct GNUNET_DHT_FindPeerMessage))
2415 other_hello_size = ntohs(find_msg->size) - sizeof(struct GNUNET_DHT_FindPeerMessage);
2416 other_hello = GNUNET_malloc(other_hello_size);
2417 memcpy(other_hello, &find_peer_message[1], other_hello_size);
2418 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)))
2420 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Received invalid HELLO message in find peer request!\n");
2421 GNUNET_free(other_hello);
2424 #if FIND_PEER_WITH_HELLO
2425 if (GNUNET_YES == consider_peer(&peer_id))
2427 increment_stats(STAT_HELLOS_PROVIDED);
2428 GNUNET_TRANSPORT_offer_hello(transport_handle, other_hello);
2429 GNUNET_CORE_peer_request_connect(sched, cfg, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &peer_id, NULL, NULL);
2430 route_message (find_msg, message_context);
2431 GNUNET_free (other_hello);
2434 else /* We don't want this peer! */
2436 route_message (find_msg, message_context);
2443 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2444 "`%s:%s': Received `%s' request from client, key %s (msg size %d, we expected %d)\n",
2445 my_short_id, "DHT", "FIND PEER", GNUNET_h2s (&message_context->key),
2446 ntohs (find_msg->size),
2447 sizeof (struct GNUNET_MessageHeader));
2449 if (my_hello == NULL)
2452 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2453 "`%s': Our HELLO is null, can't return.\n",
2456 GNUNET_free_non_null (other_hello);
2457 route_message (find_msg, message_context);
2461 incoming_bloom = GNUNET_CONTAINER_bloomfilter_init(find_peer_message->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2462 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(incoming_bloom, &my_identity.hashPubKey))
2464 increment_stats(STAT_BLOOM_FIND_PEER);
2465 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2466 GNUNET_free_non_null(other_hello);
2467 route_message (find_msg, message_context);
2468 return; /* We match the bloomfilter, do not send a response to this peer (they likely already know us!)*/
2470 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2472 #if RESTRICT_FIND_PEER
2475 * Ignore any find peer requests from a peer we have seen very recently.
2477 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(recent_find_peer_requests, &message_context->key)) /* We have recently responded to a find peer request for this peer! */
2479 increment_stats("# dht find peer requests ignored (recently seen!)");
2480 GNUNET_free_non_null(other_hello);
2485 * Use this check to only allow the peer to respond to find peer requests if
2486 * it would be beneficial to have the requesting peer in this peers routing
2487 * table. Can be used to thwart peers flooding the network with find peer
2488 * requests that we don't care about. However, if a new peer is joining
2489 * the network and has no other peers this is a problem (assume all buckets
2490 * full, no one will respond!).
2492 memcpy(&peer_id.hashPubKey, &message_context->key, sizeof(GNUNET_HashCode));
2493 if (GNUNET_NO == consider_peer(&peer_id))
2495 increment_stats("# dht find peer requests ignored (do not need!)");
2496 GNUNET_free_non_null(other_hello);
2497 route_message (find_msg, message_context);
2502 recent_hash = GNUNET_malloc(sizeof(GNUNET_HashCode));
2503 memcpy(recent_hash, &message_context->key, sizeof(GNUNET_HashCode));
2504 if (GNUNET_SYSERR != GNUNET_CONTAINER_multihashmap_put (recent_find_peer_requests,
2505 &message_context->key, NULL,
2506 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
2508 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Adding recent remove task for key `%s`!\n", GNUNET_h2s(&message_context->key));
2509 /* Only add a task if there wasn't one for this key already! */
2510 GNUNET_SCHEDULER_add_delayed (sched, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30),
2511 &remove_recent_find_peer, recent_hash);
2515 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Received duplicate find peer request too soon!\n");
2518 /* Simplistic find_peer functionality, always return our hello */
2519 hello_size = ntohs(my_hello->size);
2520 tsize = hello_size + sizeof (struct GNUNET_MessageHeader);
2522 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
2524 GNUNET_break_op (0);
2525 GNUNET_free_non_null(other_hello);
2529 find_peer_result = GNUNET_malloc (tsize);
2530 find_peer_result->type = htons (GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT);
2531 find_peer_result->size = htons (tsize);
2532 memcpy (&find_peer_result[1], my_hello, hello_size);
2534 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2535 "`%s': Sending hello size %d to requesting peer.\n",
2538 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2539 memcpy(new_msg_ctx, message_context, sizeof(struct DHT_MessageContext));
2540 new_msg_ctx->peer = &my_identity;
2541 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2542 new_msg_ctx->hop_count = 0;
2543 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE * 2; /* Make find peer requests a higher priority */
2544 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2545 increment_stats(STAT_FIND_PEER_ANSWER);
2546 route_result_message(find_peer_result, new_msg_ctx);
2547 GNUNET_free(new_msg_ctx);
2548 #if DEBUG_DHT_ROUTING
2549 if ((debug_routes) && (dhtlog_handle != NULL))
2551 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_FIND_PEER,
2552 message_context->hop_count, GNUNET_YES, &my_identity,
2553 &message_context->key);
2556 GNUNET_free_non_null(other_hello);
2557 GNUNET_free(find_peer_result);
2558 route_message (find_msg, message_context);
2562 * Task used to republish data.
2563 * Forward declaration; function call loop.
2565 * @param cls closure (a struct RepublishContext)
2566 * @param tc runtime context for this task
2569 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc);
2572 * Server handler for initiating local dht put requests
2574 * @param msg the actual put message
2575 * @param message_context struct containing pertinent information about the request
2578 handle_dht_put (const struct GNUNET_MessageHeader *msg,
2579 struct DHT_MessageContext *message_context)
2581 const struct GNUNET_DHT_PutMessage *put_msg;
2582 enum GNUNET_BLOCK_Type put_type;
2585 struct RepublishContext *put_context;
2586 GNUNET_HashCode key;
2588 GNUNET_assert (ntohs (msg->size) >=
2589 sizeof (struct GNUNET_DHT_PutMessage));
2592 put_msg = (const struct GNUNET_DHT_PutMessage *)msg;
2593 put_type = (enum GNUNET_BLOCK_Type) ntohl (put_msg->type);
2595 if (put_type == GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE)
2597 data_size = ntohs (put_msg->header.size) - sizeof (struct GNUNET_DHT_PutMessage);
2598 ret = GNUNET_BLOCK_get_key (block_context,
2603 if (GNUNET_NO == ret)
2606 GNUNET_break_op (0);
2609 if ( (GNUNET_YES == ret) &&
2611 &message_context->key,
2612 sizeof (GNUNET_HashCode))) )
2614 /* invalid wrapper: key mismatch! */
2615 GNUNET_break_op (0);
2618 /* ret == GNUNET_SYSERR means that there is no known relationship between
2619 data and the key, so we cannot check it */
2621 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2622 "`%s:%s': Received `%s' request (inserting data!), message type %d, key %s, uid %llu\n",
2623 my_short_id, "DHT", "PUT", put_type, GNUNET_h2s (&message_context->key), message_context->unique_id);
2625 #if DEBUG_DHT_ROUTING
2626 if (message_context->hop_count == 0) /* Locally initiated request */
2628 if ((debug_routes) && (dhtlog_handle != NULL))
2630 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_PUT,
2631 message_context->hop_count, GNUNET_NO, &my_identity,
2632 &message_context->key);
2637 if (message_context->closest != GNUNET_YES)
2639 route_message (msg, message_context);
2644 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2645 "`%s:%s': Received `%s' request (inserting data!), message type %d, key %s, uid %llu\n",
2646 my_short_id, "DHT", "PUT", put_type, GNUNET_h2s (&message_context->key), message_context->unique_id);
2649 #if DEBUG_DHT_ROUTING
2650 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2652 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_ROUTE,
2653 message_context->hop_count, GNUNET_YES,
2654 &my_identity, &message_context->key, message_context->peer,
2658 if ((debug_routes) && (dhtlog_handle != NULL))
2660 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_PUT,
2661 message_context->hop_count, GNUNET_YES, &my_identity,
2662 &message_context->key);
2666 increment_stats(STAT_PUTS_INSERTED);
2667 if (datacache != NULL)
2669 ret = GNUNET_DATACACHE_put (datacache, &message_context->key, data_size,
2670 (char *) &put_msg[1], put_type,
2671 GNUNET_TIME_absolute_ntoh(put_msg->expiration));
2673 if ((ret == GNUNET_YES) && (do_republish == GNUNET_YES))
2675 put_context = GNUNET_malloc(sizeof(struct RepublishContext));
2676 memcpy(&put_context->key, &message_context->key, sizeof(GNUNET_HashCode));
2677 put_context->type = put_type;
2678 GNUNET_SCHEDULER_add_delayed (sched, dht_republish_frequency, &republish_content, put_context);
2682 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2683 "`%s:%s': %s request received, but have no datacache!\n",
2684 my_short_id, "DHT", "PUT");
2686 if (stop_on_closest == GNUNET_NO)
2687 route_message (msg, message_context);
2691 * Estimate the diameter of the network based
2692 * on how many buckets are currently in use.
2693 * Concept here is that the diameter of the network
2694 * is roughly the distance a message must travel in
2695 * order to reach its intended destination. Since
2696 * at each hop we expect to get one bit closer, and
2697 * we have one bit per bucket, the number of buckets
2698 * in use should be the largest number of hops for
2699 * a successful message. (of course, this assumes we
2700 * know all peers in the network!)
2702 * @return ballpark diameter figure
2704 static unsigned int estimate_diameter()
2706 return MAX_BUCKETS - lowest_bucket;
2710 * To how many peers should we (on average)
2711 * forward the request to obtain the desired
2712 * target_replication count (on average).
2714 * Always 0, 1 or 2 (don't send, send once, split)
2717 get_forward_count (unsigned int hop_count, size_t target_replication)
2720 double target_count;
2721 double random_probability;
2723 uint32_t random_value;
2725 unsigned int target_value;
2726 unsigned int diameter;
2729 * If we are behaving in strict kademlia mode, send multiple initial requests,
2730 * but then only send to 1 or 0 peers based strictly on the number of hops.
2732 if (strict_kademlia == GNUNET_YES)
2735 return DHT_KADEMLIA_REPLICATION;
2736 else if (hop_count < max_hops)
2742 /* FIXME: the smaller we think the network is the more lenient we should be for
2743 * routing right? The estimation below only works if we think we have reasonably
2744 * full routing tables, which for our RR topologies may not be the case!
2746 diameter = estimate_diameter ();
2747 if ((hop_count > (diameter + 1) * 2) && (MINIMUM_PEER_THRESHOLD < estimate_diameter() * bucket_size) && (use_max_hops == GNUNET_NO))
2750 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2751 "`%s:%s': Hop count too high (est %d, lowest %d), NOT Forwarding request\n", my_short_id,
2752 "DHT", estimate_diameter(), lowest_bucket);
2756 else if (hop_count > max_hops)
2759 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2760 "`%s:%s': Hop count too high (greater than max)\n", my_short_id,
2767 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Replication %d, hop_count %u, diameter %u\n", target_replication, hop_count, diameter);
2768 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Numerator %f, denominator %f\n", (double)target_replication, ((double)target_replication * (hop_count + 1) + diameter));
2769 target_count = /* target_count is ALWAYS < 1 unless replication is < 1 */
2770 (double)target_replication / ((double)target_replication * (hop_count + 1) + diameter);
2771 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Target count is %f\n", target_count);
2772 random_probability = ((double)GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
2773 RAND_MAX)) / RAND_MAX;
2774 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Random is %f\n", random_probability);
2777 //while (target_value < target_count)
2778 if (target_value < target_count)
2779 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? */
2782 //if ((target_count + 1 - (double)target_value) > random_probability)
2783 if ((target_count) > random_probability)
2787 random_value = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_STRONG, target_replication * (hop_count + 1) + diameter) + 1;
2788 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));
2790 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "random %u, target %u, max %u\n", random_value, target_replication, target_replication * (hop_count + 1) + diameter);
2791 if (random_value < target_replication)
2794 return target_value;
2798 * Check whether my identity is closer than any known peers.
2799 * If a non-null bloomfilter is given, check if this is the closest
2800 * peer that hasn't already been routed to.
2802 * @param target hash code to check closeness to
2803 * @param bloom bloomfilter, exclude these entries from the decision
2805 * Return GNUNET_YES if node location is closest, GNUNET_NO
2809 am_closest_peer (const GNUNET_HashCode * target, struct GNUNET_CONTAINER_BloomFilter *bloom)
2815 struct PeerInfo *pos;
2816 unsigned int my_distance;
2818 if (0 == memcmp(&my_identity.hashPubKey, target, sizeof(GNUNET_HashCode)))
2821 bucket_num = find_current_bucket(target);
2823 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, target);
2824 my_distance = distance(&my_identity.hashPubKey, target);
2825 pos = k_buckets[bucket_num].head;
2827 while ((pos != NULL) && (count < bucket_size))
2829 if ((bloom != NULL) && (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(bloom, &pos->id.hashPubKey)))
2832 continue; /* Skip already checked entries */
2835 other_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
2836 if (other_bits > bits)
2838 else if (other_bits == bits) /* We match the same number of bits, do distance comparison */
2840 if (strict_kademlia != GNUNET_YES) /* Return that we at as close as any other peer */
2842 else if (distance(&pos->id.hashPubKey, target) < my_distance) /* Check all known peers, only return if we are the true closest */
2848 /* No peers closer, we are the closest! */
2854 * Return this peers adjusted value based on the convergence
2855 * function chosen. This is the key function for randomized
2856 * routing decisions.
2858 * @param target the key of the request
2859 * @param peer the peer we would like the value of
2860 * @param hops number of hops this message has already traveled
2862 * @return bit distance from target to peer raised to an exponent
2863 * adjusted based on the current routing convergence algorithm
2866 static unsigned long long
2867 converge_distance (const GNUNET_HashCode *target,
2868 struct PeerInfo *peer,
2871 unsigned long long ret;
2872 unsigned int other_matching_bits;
2873 double base_converge_modifier = .1; /* Value that "looks" good (when plotted), have to start somewhere */
2874 double temp_modifier;
2880 curr_max_hops = max_hops;
2882 curr_max_hops = (estimate_diameter() + 1) * 2;
2884 if (converge_modifier > 0)
2885 temp_modifier = converge_modifier * base_converge_modifier;
2888 temp_modifier = base_converge_modifier;
2889 base_converge_modifier = 0.0;
2892 GNUNET_assert(temp_modifier > 0);
2894 other_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &peer->id.hashPubKey);
2896 switch (converge_option)
2898 case DHT_CONVERGE_RANDOM:
2899 return 1; /* Always return 1, choose equally among all peers */
2900 case DHT_CONVERGE_LINEAR:
2901 calc_value = hops * curr_max_hops * temp_modifier;
2903 case DHT_CONVERGE_SQUARE:
2905 * Simple square based curve.
2907 calc_value = (sqrt(hops) / sqrt(curr_max_hops)) * (curr_max_hops / (curr_max_hops * temp_modifier));
2909 case DHT_CONVERGE_EXPONENTIAL:
2911 * Simple exponential curve.
2913 if (base_converge_modifier > 0)
2914 calc_value = (temp_modifier * hops * hops) / curr_max_hops;
2916 calc_value = (hops * hops) / curr_max_hops;
2918 case DHT_CONVERGE_BINARY:
2920 * If below the cutoff, route randomly (return 1),
2921 * If above the cutoff, return the maximum possible
2922 * value first (always route to closest, because
2925 if (hops > converge_modifier) /* Past cutoff */
2932 /* Take the log (base e) of the number of bits matching the other peer */
2933 exponent = log(other_matching_bits);
2935 /* Check if we would overflow; our largest possible value is 2^64 approx. e^44.361419555836498 */
2936 if (exponent * calc_value >= 44.361419555836498)
2939 /* Clear errno and all math exceptions */
2941 feclearexcept(FE_ALL_EXCEPT);
2942 ret = (unsigned long long)pow(other_matching_bits, calc_value);
2943 if ((errno != 0) || fetestexcept(FE_INVALID | FE_DIVBYZERO | FE_OVERFLOW |
2946 if (0 != fetestexcept(FE_OVERFLOW))
2947 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_OVERFLOW\n");
2948 if (0 != fetestexcept(FE_INVALID))
2949 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_INVALID\n");
2950 if (0 != fetestexcept(FE_UNDERFLOW))
2951 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_UNDERFLOW\n");
2959 * Comparison function for two struct PeerInfo's
2960 * which have already had their matching bits to
2961 * some target calculated.
2963 * @param p1 a pointer pointer to a struct PeerInfo
2964 * @param p2 a pointer pointer to a struct PeerInfo
2966 * @return 0 if equidistant to target,
2967 * -1 if p1 is closer,
2971 compare_peers (const void *p1, const void *p2)
2973 struct PeerInfo **first = (struct PeerInfo **)p1;
2974 struct PeerInfo **second = (struct PeerInfo **)p2;
2976 if ((*first)->matching_bits > (*second)->matching_bits)
2978 if ((*first)->matching_bits < (*second)->matching_bits)
2986 * Select a peer from the routing table that would be a good routing
2987 * destination for sending a message for "target". The resulting peer
2988 * must not be in the set of blocked peers.<p>
2990 * Note that we should not ALWAYS select the closest peer to the
2991 * target, peers further away from the target should be chosen with
2992 * exponentially declining probability.
2994 * @param target the key we are selecting a peer to route to
2995 * @param bloom a bloomfilter containing entries this request has seen already
2997 * @return Peer to route to, or NULL on error
2999 static struct PeerInfo *
3000 select_peer (const GNUNET_HashCode * target,
3001 struct GNUNET_CONTAINER_BloomFilter *bloom, unsigned int hops)
3006 unsigned int offset;
3007 unsigned int my_matching_bits;
3009 struct PeerInfo *pos;
3010 struct PeerInfo *sorted_closest[bucket_size];
3011 unsigned long long temp_converge_distance;
3012 unsigned long long total_distance;
3013 unsigned long long selected;
3015 unsigned long long stats_total_distance;
3019 unsigned int distance;
3020 unsigned int largest_distance;
3021 struct PeerInfo *chosen;
3023 my_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &my_identity.hashPubKey);
3026 if (strict_kademlia == GNUNET_YES)
3028 largest_distance = 0;
3030 for (bc = lowest_bucket; bc < MAX_BUCKETS; bc++)
3032 pos = k_buckets[bc].head;
3034 while ((pos != NULL) && (count < bucket_size))
3036 /* If we are doing strict Kademlia routing, then checking the bloomfilter is basically cheating! */
3037 if (GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3039 distance = inverse_distance (target, &pos->id.hashPubKey);
3040 if (distance > largest_distance)
3043 largest_distance = distance;
3051 if ((largest_distance > 0) && (chosen != NULL))
3053 GNUNET_CONTAINER_bloomfilter_add(bloom, &chosen->id.hashPubKey);
3064 /* Three steps: order peers in closest bucket (most matching bits).
3065 * Then go over all LOWER buckets (matching same bits we do)
3066 * Then go over all HIGHER buckets (matching less then we do)
3069 closest_bucket = find_current_bucket(target);
3070 GNUNET_assert(closest_bucket >= lowest_bucket);
3071 pos = k_buckets[closest_bucket].head;
3073 offset = 0; /* Need offset as well as count in case peers are bloomfiltered */
3074 memset(sorted_closest, 0, sizeof(sorted_closest));
3075 /* Put any peers in the closest bucket in the sorting array */
3076 while ((pos != NULL) && (count < bucket_size))
3078 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3082 continue; /* Ignore bloomfiltered peers */
3084 pos->matching_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
3085 sorted_closest[offset] = pos;
3091 /* Sort the peers in descending order */
3092 qsort(&sorted_closest[0], offset, sizeof(struct PeerInfo *), &compare_peers);
3094 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3095 for (i = 0; i < offset; i++)
3097 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3098 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3099 break; /* Ignore bloomfiltered peers */
3100 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3101 total_distance += temp_converge_distance;
3103 break; /* overflow case */
3106 /* Now handle peers in lower buckets (matches same # of bits as target) */
3107 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3109 pos = k_buckets[bc].head;
3111 while ((pos != NULL) && (count < bucket_size))
3113 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3117 continue; /* Ignore bloomfiltered peers */
3119 temp_converge_distance = converge_distance(target, pos, hops);
3120 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3121 total_distance += temp_converge_distance;
3123 break; /* overflow case */
3129 /* Now handle all the further away peers */
3130 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3132 pos = k_buckets[bc].head;
3134 while ((pos != NULL) && (count < bucket_size))
3136 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3140 continue; /* Ignore bloomfiltered peers */
3142 temp_converge_distance = converge_distance(target, pos, hops);
3143 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3144 total_distance += temp_converge_distance;
3146 break; /* overflow case */
3152 if (total_distance == 0) /* No peers to select from! */
3154 increment_stats("# select_peer, total_distance == 0");
3158 #if DEBUG_DHT_ROUTING > 1
3161 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3162 stats_total_distance = 0;
3163 for (i = 0; i < offset; i++)
3165 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3166 break; /* Ignore bloomfiltered peers */
3167 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3168 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3169 stats_total_distance += temp_converge_distance;
3171 break; /* overflow case */
3172 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);
3175 /* Now handle peers in lower buckets (matches same # of bits as target) */
3176 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3178 pos = k_buckets[bc].head;
3180 while ((pos != NULL) && (count < bucket_size))
3182 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3186 continue; /* Ignore bloomfiltered peers */
3188 temp_converge_distance = converge_distance(target, pos, hops);
3189 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3190 stats_total_distance += temp_converge_distance;
3192 break; /* overflow case */
3193 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);
3199 /* Now handle all the further away peers */
3200 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3202 pos = k_buckets[bc].head;
3204 while ((pos != NULL) && (count < bucket_size))
3206 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3210 continue; /* Ignore bloomfiltered peers */
3212 temp_converge_distance = converge_distance(target, pos, hops);
3213 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3214 stats_total_distance += temp_converge_distance;
3216 break; /* overflow case */
3217 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);
3222 /* END PRINT STATS */
3225 /* Now actually choose a peer */
3226 selected = GNUNET_CRYPTO_random_u64 (GNUNET_CRYPTO_QUALITY_WEAK, total_distance);
3228 /* Go over closest sorted peers. */
3229 for (i = 0; i < offset; i++)
3231 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3232 break; /* Ignore bloomfiltered peers */
3233 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3234 if (temp_converge_distance >= selected)
3235 return sorted_closest[i];
3237 selected -= temp_converge_distance;
3240 /* Now handle peers in lower buckets (matches same # of bits as target) */
3241 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3243 pos = k_buckets[bc].head;
3245 while ((pos != NULL) && (count < bucket_size))
3247 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3251 continue; /* Ignore bloomfiltered peers */
3253 temp_converge_distance = converge_distance(target, pos, hops);
3254 if (temp_converge_distance >= selected)
3257 selected -= temp_converge_distance;
3263 /* Now handle all the further away peers */
3264 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3266 pos = k_buckets[bc].head;
3268 while ((pos != NULL) && (count < bucket_size))
3270 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3274 continue; /* Ignore bloomfiltered peers */
3276 temp_converge_distance = converge_distance(target, pos, hops);
3277 if (temp_converge_distance >= selected)
3280 selected -= temp_converge_distance;
3286 increment_stats("# failed to select peer");
3292 * Task used to remove recent entries, either
3293 * after timeout, when full, or on shutdown.
3295 * @param cls the entry to remove
3296 * @param tc context, reason, etc.
3299 remove_recent (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3301 struct RecentRequest *req = cls;
3302 static GNUNET_HashCode hash;
3304 GNUNET_assert(req != NULL);
3305 hash_from_uid(req->uid, &hash);
3306 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent.hashmap, &hash, req));
3307 GNUNET_CONTAINER_heap_remove_node(recent.minHeap, req->heap_node);
3308 GNUNET_CONTAINER_bloomfilter_free(req->bloom);
3311 if ((tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN) && (0 == GNUNET_CONTAINER_multihashmap_size(recent.hashmap)) && (0 == GNUNET_CONTAINER_heap_get_size(recent.minHeap)))
3313 GNUNET_CONTAINER_multihashmap_destroy(recent.hashmap);
3314 GNUNET_CONTAINER_heap_destroy(recent.minHeap);
3320 * Task used to remove forwarding entries, either
3321 * after timeout, when full, or on shutdown.
3323 * @param cls the entry to remove
3324 * @param tc context, reason, etc.
3327 remove_forward_entry (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3329 struct DHTRouteSource *source_info = cls;
3330 struct DHTQueryRecord *record;
3331 source_info = GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, source_info->hnode);
3332 record = source_info->record;
3333 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, source_info);
3335 if (record->head == NULL) /* No more entries in DLL */
3337 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3338 GNUNET_free(record);
3340 if (source_info->find_peers_responded != NULL)
3341 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3342 GNUNET_free(source_info);
3346 * Remember this routing request so that if a reply is
3347 * received we can either forward it to the correct peer
3348 * or return the result locally.
3350 * @param msg_ctx Context of the route request
3352 * @return GNUNET_YES if this response was cached, GNUNET_NO if not
3354 static int cache_response(struct DHT_MessageContext *msg_ctx)
3356 struct DHTQueryRecord *record;
3357 struct DHTRouteSource *source_info;
3358 struct DHTRouteSource *pos;
3359 struct GNUNET_TIME_Absolute now;
3360 unsigned int current_size;
3362 current_size = GNUNET_CONTAINER_multihashmap_size(forward_list.hashmap);
3363 while (current_size >= MAX_OUTSTANDING_FORWARDS)
3365 source_info = GNUNET_CONTAINER_heap_remove_root(forward_list.minHeap);
3366 GNUNET_assert(source_info != NULL);
3367 record = source_info->record;
3368 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, source_info);
3369 if (record->head == NULL) /* No more entries in DLL */
3371 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3372 GNUNET_free(record);
3374 if (source_info->delete_task != GNUNET_SCHEDULER_NO_TASK)
3375 GNUNET_SCHEDULER_cancel(sched, source_info->delete_task);
3376 if (source_info->find_peers_responded != NULL)
3377 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3378 GNUNET_free(source_info);
3379 current_size = GNUNET_CONTAINER_multihashmap_size(forward_list.hashmap);
3381 now = GNUNET_TIME_absolute_get();
3382 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &msg_ctx->key);
3383 if (record != NULL) /* Already know this request! */
3388 if (0 == memcmp(msg_ctx->peer, &pos->source, sizeof(struct GNUNET_PeerIdentity)))
3389 break; /* Already have this peer in reply list! */
3392 if ((pos != NULL) && (pos->client == msg_ctx->client)) /* Seen this already */
3394 GNUNET_CONTAINER_heap_update_cost(forward_list.minHeap, pos->hnode, now.abs_value);
3400 record = GNUNET_malloc(sizeof (struct DHTQueryRecord));
3401 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_multihashmap_put(forward_list.hashmap, &msg_ctx->key, record, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
3402 memcpy(&record->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
3405 source_info = GNUNET_malloc(sizeof(struct DHTRouteSource));
3406 source_info->record = record;
3407 source_info->delete_task = GNUNET_SCHEDULER_add_delayed(sched, DHT_FORWARD_TIMEOUT, &remove_forward_entry, source_info);
3408 source_info->find_peers_responded = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3409 memcpy(&source_info->source, msg_ctx->peer, sizeof(struct GNUNET_PeerIdentity));
3410 GNUNET_CONTAINER_DLL_insert_after(record->head, record->tail, record->tail, source_info);
3411 if (msg_ctx->client != NULL) /* For local request, set timeout so high it effectively never gets pushed out */
3413 source_info->client = msg_ctx->client;
3414 now = GNUNET_TIME_absolute_get_forever();
3416 source_info->hnode = GNUNET_CONTAINER_heap_insert(forward_list.minHeap, source_info, now.abs_value);
3418 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3419 "`%s:%s': Created new forward source info for %s uid %llu\n", my_short_id,
3420 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
3427 * Main function that handles whether or not to route a message to other
3430 * @param msg the message to be routed
3431 * @param message_context the context containing all pertinent information about the message
3434 route_message(const struct GNUNET_MessageHeader *msg,
3435 struct DHT_MessageContext *message_context)
3438 struct PeerInfo *selected;
3439 #if DEBUG_DHT_ROUTING > 1
3440 struct PeerInfo *nearest;
3442 unsigned int forward_count;
3443 struct RecentRequest *recent_req;
3444 GNUNET_HashCode unique_hash;
3445 char *stat_forward_count;
3446 char *temp_stat_str;
3447 #if DEBUG_DHT_ROUTING
3451 if (malicious_dropper == GNUNET_YES)
3453 #if DEBUG_DHT_ROUTING
3454 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3456 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_ROUTE,
3457 message_context->hop_count, GNUNET_SYSERR,
3458 &my_identity, &message_context->key, message_context->peer,
3462 if (message_context->bloom != NULL)
3463 GNUNET_CONTAINER_bloomfilter_free(message_context->bloom);
3467 increment_stats(STAT_ROUTES);
3468 /* Semantics of this call means we find whether we are the closest peer out of those already
3469 * routed to on this messages path.
3471 forward_count = get_forward_count(message_context->hop_count, message_context->replication);
3472 GNUNET_asprintf(&stat_forward_count, "# forward counts of %d", forward_count);
3473 increment_stats(stat_forward_count);
3474 GNUNET_free(stat_forward_count);
3475 if (message_context->bloom == NULL)
3476 message_context->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3478 if ((stop_on_closest == GNUNET_YES) && (message_context->closest == GNUNET_YES) && (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT))
3482 * NOTICE: In Kademlia, a find peer request goes no further if the peer doesn't return
3483 * any closer peers (which is being checked for below). Since we are doing recursive
3484 * routing we have no choice but to stop forwarding in this case. This means that at
3485 * any given step the request may NOT be forwarded to alpha peers (because routes will
3486 * stop and the parallel route will not be aware of it). Of course, assuming that we
3487 * have fulfilled the Kademlia requirements for routing table fullness this will never
3488 * ever ever be a problem.
3490 * However, is this fair?
3492 * Since we use these requests to build our routing tables (and we build them in the
3493 * testing driver) we will ignore this restriction for FIND_PEER messages so that
3494 * routing tables still get constructed.
3496 if ((GNUNET_YES == strict_kademlia) && (message_context->closest == GNUNET_YES) && (message_context->hop_count > 0) && (ntohs(msg->type) != GNUNET_MESSAGE_TYPE_DHT_FIND_PEER))
3499 #if DEBUG_DHT_ROUTING
3500 if (forward_count == 0)
3501 ret = GNUNET_SYSERR;
3505 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3507 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_ROUTE,
3508 message_context->hop_count, ret,
3509 &my_identity, &message_context->key, message_context->peer,
3515 GNUNET_CONTAINER_bloomfilter_add (message_context->bloom, &my_identity.hashPubKey);
3516 hash_from_uid (message_context->unique_id, &unique_hash);
3517 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains (recent.hashmap, &unique_hash))
3519 recent_req = GNUNET_CONTAINER_multihashmap_get(recent.hashmap, &unique_hash);
3520 GNUNET_assert(recent_req != NULL);
3521 if (0 != memcmp(&recent_req->key, &message_context->key, sizeof(GNUNET_HashCode)))
3522 increment_stats(STAT_DUPLICATE_UID);
3525 increment_stats(STAT_RECENT_SEEN);
3526 GNUNET_CONTAINER_bloomfilter_or2(message_context->bloom, recent_req->bloom, DHT_BLOOM_SIZE);
3531 recent_req = GNUNET_malloc(sizeof(struct RecentRequest));
3532 recent_req->uid = message_context->unique_id;
3533 memcpy(&recent_req->key, &message_context->key, sizeof(GNUNET_HashCode));
3534 recent_req->remove_task = GNUNET_SCHEDULER_add_delayed(sched, DEFAULT_RECENT_REMOVAL, &remove_recent, recent_req);
3535 recent_req->heap_node = GNUNET_CONTAINER_heap_insert(recent.minHeap, recent_req, GNUNET_TIME_absolute_get().abs_value);
3536 recent_req->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3537 GNUNET_CONTAINER_multihashmap_put(recent.hashmap, &unique_hash, recent_req, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
3540 if (GNUNET_CONTAINER_multihashmap_size(recent.hashmap) > DHT_MAX_RECENT)
3542 recent_req = GNUNET_CONTAINER_heap_peek(recent.minHeap);
3543 GNUNET_assert(recent_req != NULL);
3544 GNUNET_SCHEDULER_cancel(sched, recent_req->remove_task);
3545 GNUNET_SCHEDULER_add_now(sched, &remove_recent, recent_req);
3548 for (i = 0; i < forward_count; i++)
3550 selected = select_peer(&message_context->key, message_context->bloom, message_context->hop_count);
3552 if (selected != NULL)
3554 if (GNUNET_CRYPTO_hash_matching_bits(&selected->id.hashPubKey, &message_context->key) >= GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &message_context->key))
3555 GNUNET_asprintf(&temp_stat_str, "# requests routed to close(r) peer hop %u", message_context->hop_count);
3557 GNUNET_asprintf(&temp_stat_str, "# requests routed to less close peer hop %u", message_context->hop_count);
3558 if (temp_stat_str != NULL)
3560 increment_stats(temp_stat_str);
3561 GNUNET_free(temp_stat_str);
3563 GNUNET_CONTAINER_bloomfilter_add(message_context->bloom, &selected->id.hashPubKey);
3564 #if DEBUG_DHT_ROUTING > 1
3565 nearest = find_closest_peer(&message_context->key);
3566 nearest_buf = GNUNET_strdup(GNUNET_i2s(&nearest->id));
3567 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3568 "`%s:%s': Forwarding request key %s uid %llu to peer %s (closest %s, bits %d, distance %u)\n", my_short_id,
3569 "DHT", GNUNET_h2s (&message_context->key), message_context->unique_id, GNUNET_i2s(&selected->id), nearest_buf, GNUNET_CRYPTO_hash_matching_bits(&nearest->id.hashPubKey, message_context->key), distance(&nearest->id.hashPubKey, message_context->key));
3570 GNUNET_free(nearest_buf);
3572 #if DEBUG_DHT_ROUTING
3573 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3575 dhtlog_handle->insert_route (NULL, message_context->unique_id, DHTLOG_ROUTE,
3576 message_context->hop_count, GNUNET_NO,
3577 &my_identity, &message_context->key, message_context->peer,
3581 forward_message(msg, selected, message_context);
3585 if (message_context->bloom != NULL)
3587 GNUNET_CONTAINER_bloomfilter_or2(recent_req->bloom, message_context->bloom, DHT_BLOOM_SIZE);
3588 GNUNET_CONTAINER_bloomfilter_free(message_context->bloom);
3595 * Main function that handles whether or not to route a message to other
3598 * @param msg the message to be routed
3599 * @param message_context the context containing all pertinent information about the message
3602 demultiplex_message(const struct GNUNET_MessageHeader *msg,
3603 struct DHT_MessageContext *message_context)
3605 message_context->closest = am_closest_peer(&message_context->key, NULL);
3606 switch (ntohs(msg->type))
3608 case GNUNET_MESSAGE_TYPE_DHT_GET: /* Add to hashmap of requests seen, search for data (always) */
3609 cache_response (message_context);
3610 handle_dht_get (msg, message_context);
3612 case GNUNET_MESSAGE_TYPE_DHT_PUT: /* Check if closest, if so insert data. */
3613 increment_stats(STAT_PUTS);
3614 handle_dht_put (msg, message_context);
3616 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER: /* Check if closest and not started by us, check options, add to requests seen */
3617 increment_stats(STAT_FIND_PEER);
3618 if (((message_context->hop_count > 0) && (0 != memcmp(message_context->peer, &my_identity, sizeof(struct GNUNET_PeerIdentity)))) || (message_context->client != NULL))
3620 cache_response (message_context);
3621 if ((message_context->closest == GNUNET_YES) || (message_context->msg_options == GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE))
3622 handle_dht_find_peer (msg, message_context);
3625 route_message (msg, message_context);
3626 #if DEBUG_DHT_ROUTING
3627 if (message_context->hop_count == 0) /* Locally initiated request */
3629 if ((debug_routes) && (dhtlog_handle != NULL))
3631 dhtlog_handle->insert_dhtkey(NULL, &message_context->key);
3632 dhtlog_handle->insert_query (NULL, message_context->unique_id, DHTLOG_FIND_PEER,
3633 message_context->hop_count, GNUNET_NO, &my_identity,
3634 &message_context->key);
3640 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
3641 "`%s': Message type (%d) not handled, forwarding anyway!\n", "DHT", ntohs(msg->type));
3642 route_message (msg, message_context);
3650 * Iterator for local get request results,
3652 * @param cls closure for iterator, NULL
3653 * @param exp when does this value expire?
3654 * @param key the key this data is stored under
3655 * @param size the size of the data identified by key
3656 * @param data the actual data
3657 * @param type the type of the data
3659 * @return GNUNET_OK to continue iteration, anything else
3660 * to stop iteration.
3663 republish_content_iterator (void *cls,
3664 struct GNUNET_TIME_Absolute exp,
3665 const GNUNET_HashCode * key,
3666 size_t size, const char *data, uint32_t type)
3669 struct DHT_MessageContext *new_msg_ctx;
3670 struct GNUNET_DHT_PutMessage *put_msg;
3672 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3673 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
3675 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
3678 GNUNET_malloc (sizeof (struct GNUNET_DHT_PutMessage) + size);
3679 put_msg->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_PUT);
3680 put_msg->header.size = htons (sizeof (struct GNUNET_DHT_PutMessage) + size);
3681 put_msg->expiration = GNUNET_TIME_absolute_hton(exp);
3682 put_msg->type = htons (type);
3683 memcpy (&put_msg[1], data, size);
3684 new_msg_ctx->unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3685 new_msg_ctx->replication = ntohl (DHT_DEFAULT_PUT_REPLICATION);
3686 new_msg_ctx->msg_options = ntohl (0);
3687 new_msg_ctx->network_size = estimate_diameter();
3688 new_msg_ctx->peer = &my_identity;
3689 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3690 new_msg_ctx->hop_count = 0;
3691 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE;
3692 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
3693 increment_stats(STAT_PUT_START);
3694 demultiplex_message(&put_msg->header, new_msg_ctx);
3696 GNUNET_free(new_msg_ctx);
3697 GNUNET_free (put_msg);
3702 * Task used to republish data.
3704 * @param cls closure (a struct RepublishContext)
3705 * @param tc runtime context for this task
3708 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3710 struct RepublishContext *put_context = cls;
3712 unsigned int results;
3714 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3716 GNUNET_free(put_context);
3720 GNUNET_assert (datacache != NULL); /* If we have no datacache we never should have scheduled this! */
3721 results = GNUNET_DATACACHE_get(datacache, &put_context->key, put_context->type, &republish_content_iterator, NULL);
3722 if (results == 0) /* Data must have expired */
3723 GNUNET_free(put_context);
3724 else /* Reschedule task for next time period */
3725 GNUNET_SCHEDULER_add_delayed(sched, dht_republish_frequency, &republish_content, put_context);
3731 * Iterator over hash map entries.
3733 * @param cls client to search for in source routes
3734 * @param key current key code (ignored)
3735 * @param value value in the hash map, a DHTQueryRecord
3736 * @return GNUNET_YES if we should continue to
3740 static int find_client_records (void *cls,
3741 const GNUNET_HashCode * key, void *value)
3743 struct ClientList *client = cls;
3744 struct DHTQueryRecord *record = value;
3745 struct DHTRouteSource *pos;
3749 if (pos->client == client)
3755 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, pos);
3756 GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, pos->hnode);
3757 if (pos->delete_task != GNUNET_SCHEDULER_NO_TASK)
3758 GNUNET_SCHEDULER_cancel(sched, pos->delete_task);
3760 if (pos->find_peers_responded != NULL)
3761 GNUNET_CONTAINER_bloomfilter_free(pos->find_peers_responded);
3764 if (record->head == NULL) /* No more entries in DLL */
3766 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3767 GNUNET_free(record);
3773 * Functions with this signature are called whenever a client
3774 * is disconnected on the network level.
3776 * @param cls closure (NULL for dht)
3777 * @param client identification of the client; NULL
3778 * for the last call when the server is destroyed
3780 static void handle_client_disconnect (void *cls,
3781 struct GNUNET_SERVER_Client* client)
3783 struct ClientList *pos = client_list;
3784 struct ClientList *prev;
3785 struct ClientList *found;
3786 struct PendingMessage *reply;
3792 if (pos->client_handle == client)
3795 prev->next = pos->next;
3797 client_list = pos->next;
3807 while(NULL != (reply = found->pending_head))
3809 GNUNET_CONTAINER_DLL_remove(found->pending_head, found->pending_tail, reply);
3812 GNUNET_CONTAINER_multihashmap_iterate(forward_list.hashmap, &find_client_records, found);
3818 * Find a client if it exists, add it otherwise.
3820 * @param client the server handle to the client
3822 * @return the client if found, a new client otherwise
3824 static struct ClientList *
3825 find_active_client (struct GNUNET_SERVER_Client *client)
3827 struct ClientList *pos = client_list;
3828 struct ClientList *ret;
3832 if (pos->client_handle == client)
3837 ret = GNUNET_malloc (sizeof (struct ClientList));
3838 ret->client_handle = client;
3839 ret->next = client_list;
3846 * Task to send a malicious put message across the network.
3848 * @param cls closure for this task
3849 * @param tc the context under which the task is running
3852 malicious_put_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3854 static struct GNUNET_DHT_PutMessage put_message;
3855 static struct DHT_MessageContext message_context;
3856 static GNUNET_HashCode key;
3857 uint32_t random_key;
3859 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3862 put_message.header.size = htons(sizeof(struct GNUNET_DHT_PutMessage));
3863 put_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_PUT);
3864 put_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3865 put_message.expiration = GNUNET_TIME_absolute_hton(GNUNET_TIME_absolute_get_forever());
3866 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
3867 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3868 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3869 memcpy(&message_context.key, &key, sizeof(GNUNET_HashCode));
3870 message_context.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3871 message_context.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3872 message_context.msg_options = ntohl (0);
3873 message_context.network_size = estimate_diameter();
3874 message_context.peer = &my_identity;
3875 message_context.importance = DHT_DEFAULT_P2P_IMPORTANCE; /* Make result routing a higher priority */
3876 message_context.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3877 #if DEBUG_DHT_ROUTING
3878 if (dhtlog_handle != NULL)
3879 dhtlog_handle->insert_dhtkey(NULL, &key);
3881 increment_stats(STAT_PUT_START);
3882 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious PUT message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3883 demultiplex_message(&put_message.header, &message_context);
3884 GNUNET_SCHEDULER_add_delayed(sched, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_put_frequency), &malicious_put_task, NULL);
3889 * Task to send a malicious put message across the network.
3891 * @param cls closure for this task
3892 * @param tc the context under which the task is running
3895 malicious_get_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3897 static struct GNUNET_DHT_GetMessage get_message;
3898 struct DHT_MessageContext message_context;
3899 static GNUNET_HashCode key;
3900 uint32_t random_key;
3902 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3905 get_message.header.size = htons(sizeof(struct GNUNET_DHT_GetMessage));
3906 get_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_GET);
3907 get_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3908 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
3909 message_context.client = NULL;
3910 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3911 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3912 memcpy(&message_context.key, &key, sizeof(GNUNET_HashCode));
3913 message_context.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3914 message_context.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3915 message_context.msg_options = ntohl (0);
3916 message_context.network_size = estimate_diameter();
3917 message_context.peer = &my_identity;
3918 message_context.importance = DHT_DEFAULT_P2P_IMPORTANCE; /* Make result routing a higher priority */
3919 message_context.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3920 #if DEBUG_DHT_ROUTING
3921 if (dhtlog_handle != NULL)
3922 dhtlog_handle->insert_dhtkey(NULL, &key);
3924 increment_stats(STAT_GET_START);
3925 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious GET message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3926 demultiplex_message (&get_message.header, &message_context);
3927 GNUNET_SCHEDULER_add_delayed(sched, GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_get_frequency), &malicious_get_task, NULL);
3931 * Iterator over hash map entries.
3933 * @param cls closure
3934 * @param key current key code
3935 * @param value value in the hash map
3936 * @return GNUNET_YES if we should continue to
3941 add_known_to_bloom (void *cls,
3942 const GNUNET_HashCode * key,
3945 struct GNUNET_CONTAINER_BloomFilter *bloom = cls;
3946 GNUNET_CONTAINER_bloomfilter_add (bloom, key);
3951 * Task to send a find peer message for our own peer identifier
3952 * so that we can find the closest peers in the network to ourselves
3953 * and attempt to connect to them.
3955 * @param cls closure for this task
3956 * @param tc the context under which the task is running
3959 send_find_peer_message (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3961 struct GNUNET_DHT_FindPeerMessage *find_peer_msg;
3962 struct DHT_MessageContext message_context;
3963 struct GNUNET_TIME_Relative next_send_time;
3964 struct GNUNET_CONTAINER_BloomFilter *temp_bloom;
3966 struct GNUNET_TIME_Relative time_diff;
3967 struct GNUNET_TIME_Absolute end;
3969 double count_per_interval;
3971 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3974 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! */
3976 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Have %d newly found peers since last find peer message sent!\n", newly_found_peers);
3977 GNUNET_SCHEDULER_add_delayed (sched,
3978 GNUNET_TIME_UNIT_MINUTES,
3979 &send_find_peer_message, NULL);
3980 newly_found_peers = 0;
3984 increment_stats(STAT_FIND_PEER_START);
3986 end = GNUNET_TIME_absolute_get();
3987 time_diff = GNUNET_TIME_absolute_get_difference(find_peer_context.start, end);
3989 if (time_diff.abs_value > FIND_PEER_CALC_INTERVAL.abs_value)
3991 multiplier = time_diff.abs_value / FIND_PEER_CALC_INTERVAL.abs_value;
3992 count_per_interval = find_peer_context.count / multiplier;
3996 multiplier = FIND_PEER_CALC_INTERVAL.abs_value / time_diff.abs_value;
3997 count_per_interval = find_peer_context.count * multiplier;
4001 #if FIND_PEER_WITH_HELLO
4002 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4003 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4004 memcpy(&find_peer_msg[1], my_hello, GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4006 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage));
4007 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage));
4009 find_peer_msg->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_FIND_PEER);
4010 temp_bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4011 GNUNET_CONTAINER_multihashmap_iterate(all_known_peers, &add_known_to_bloom, temp_bloom);
4012 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(temp_bloom, find_peer_msg->bloomfilter, DHT_BLOOM_SIZE));
4013 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
4014 memcpy(&message_context.key, &my_identity.hashPubKey, sizeof(GNUNET_HashCode));
4015 message_context.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG, (uint64_t)-1));
4016 message_context.replication = DHT_DEFAULT_FIND_PEER_REPLICATION;
4017 message_context.msg_options = DHT_DEFAULT_FIND_PEER_OPTIONS;
4018 message_context.network_size = estimate_diameter();
4019 message_context.peer = &my_identity;
4020 message_context.importance = DHT_DEFAULT_FIND_PEER_IMPORTANCE;
4021 message_context.timeout = DHT_DEFAULT_FIND_PEER_TIMEOUT;
4023 demultiplex_message(&find_peer_msg->header, &message_context);
4024 GNUNET_free(find_peer_msg);
4025 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4026 "`%s:%s': Sent `%s' request to some (?) peers\n", my_short_id, "DHT",
4028 if (newly_found_peers < bucket_size)
4030 next_send_time.rel_value = (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) +
4031 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4032 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2);
4036 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4037 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4038 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4041 GNUNET_assert (next_send_time.rel_value != 0);
4042 find_peer_context.count = 0;
4043 newly_found_peers = 0;
4044 find_peer_context.start = GNUNET_TIME_absolute_get();
4045 if (GNUNET_YES == do_find_peer)
4047 GNUNET_SCHEDULER_add_delayed (sched,
4049 &send_find_peer_message, NULL);
4054 * Handler for any generic DHT messages, calls the appropriate handler
4055 * depending on message type, sends confirmation if responses aren't otherwise
4058 * @param cls closure for the service
4059 * @param client the client we received this message from
4060 * @param message the actual message received
4063 handle_dht_local_route_request (void *cls, struct GNUNET_SERVER_Client *client,
4064 const struct GNUNET_MessageHeader *message)
4066 const struct GNUNET_DHT_RouteMessage *dht_msg = (const struct GNUNET_DHT_RouteMessage *) message;
4067 const struct GNUNET_MessageHeader *enc_msg;
4068 struct DHT_MessageContext message_context;
4070 enc_msg = (const struct GNUNET_MessageHeader *) &dht_msg[1];
4072 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4073 "`%s:%s': Received `%s' request from client, message type %d, key %s, uid %llu\n",
4077 ntohs (message->type),
4078 GNUNET_h2s (&dht_msg->key),
4079 GNUNET_ntohll (dht_msg->unique_id));
4081 #if DEBUG_DHT_ROUTING
4082 if (dhtlog_handle != NULL)
4083 dhtlog_handle->insert_dhtkey (NULL, &dht_msg->key);
4085 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
4086 message_context.client = find_active_client (client);
4087 memcpy(&message_context.key, &dht_msg->key, sizeof(GNUNET_HashCode));
4088 message_context.unique_id = GNUNET_ntohll (dht_msg->unique_id);
4089 message_context.replication = ntohl (dht_msg->desired_replication_level);
4090 message_context.msg_options = ntohl (dht_msg->options);
4091 message_context.network_size = estimate_diameter();
4092 message_context.peer = &my_identity;
4093 message_context.importance = DHT_DEFAULT_P2P_IMPORTANCE * 4; /* Make local routing a higher priority */
4094 message_context.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4095 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET)
4096 increment_stats(STAT_GET_START);
4097 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT)
4098 increment_stats(STAT_PUT_START);
4099 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER)
4100 increment_stats(STAT_FIND_PEER_START);
4102 demultiplex_message(enc_msg, &message_context);
4104 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4109 * Handler for any locally received DHT control messages,
4110 * sets malicious flags mostly for now.
4112 * @param cls closure for the service
4113 * @param client the client we received this message from
4114 * @param message the actual message received
4118 handle_dht_control_message (void *cls, struct GNUNET_SERVER_Client *client,
4119 const struct GNUNET_MessageHeader *message)
4121 const struct GNUNET_DHT_ControlMessage *dht_control_msg =
4122 (const struct GNUNET_DHT_ControlMessage *) message;
4124 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4125 "`%s:%s': Received `%s' request from client, command %d\n", my_short_id, "DHT",
4126 "CONTROL", ntohs(dht_control_msg->command));
4129 switch (ntohs(dht_control_msg->command))
4131 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER:
4132 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Sending self seeking find peer request!\n");
4133 GNUNET_SCHEDULER_add_now(sched, &send_find_peer_message, NULL);
4135 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_GET:
4136 if (ntohs(dht_control_msg->variable) > 0)
4137 malicious_get_frequency = ntohs(dht_control_msg->variable);
4138 if (malicious_get_frequency == 0)
4139 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4140 if (malicious_getter != GNUNET_YES)
4141 GNUNET_SCHEDULER_add_now(sched, &malicious_get_task, NULL);
4142 malicious_getter = GNUNET_YES;
4143 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4144 "%s:%s Initiating malicious GET behavior, frequency %d\n", my_short_id, "DHT", malicious_get_frequency);
4146 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_PUT:
4147 if (ntohs(dht_control_msg->variable) > 0)
4148 malicious_put_frequency = ntohs(dht_control_msg->variable);
4149 if (malicious_put_frequency == 0)
4150 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4151 if (malicious_putter != GNUNET_YES)
4152 GNUNET_SCHEDULER_add_now(sched, &malicious_put_task, NULL);
4153 malicious_putter = GNUNET_YES;
4154 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4155 "%s:%s Initiating malicious PUT behavior, frequency %d\n", my_short_id, "DHT", malicious_put_frequency);
4157 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_DROP:
4158 #if DEBUG_DHT_ROUTING
4159 if ((malicious_dropper != GNUNET_YES) && (dhtlog_handle != NULL))
4160 dhtlog_handle->set_malicious(&my_identity);
4162 malicious_dropper = GNUNET_YES;
4163 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4164 "%s:%s Initiating malicious DROP behavior\n", my_short_id, "DHT");
4167 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4168 "%s:%s Unknown control command type `%d'!\n",
4170 ntohs(dht_control_msg->command));
4174 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4178 * Handler for any generic DHT stop messages, calls the appropriate handler
4179 * depending on message type (if processed locally)
4181 * @param cls closure for the service
4182 * @param client the client we received this message from
4183 * @param message the actual message received
4187 handle_dht_local_route_stop(void *cls, struct GNUNET_SERVER_Client *client,
4188 const struct GNUNET_MessageHeader *message)
4191 const struct GNUNET_DHT_StopMessage *dht_stop_msg =
4192 (const struct GNUNET_DHT_StopMessage *) message;
4193 struct DHTQueryRecord *record;
4194 struct DHTRouteSource *pos;
4196 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4197 "`%s:%s': Received `%s' request from client, uid %llu\n", my_short_id, "DHT",
4198 "GENERIC STOP", GNUNET_ntohll (dht_stop_msg->unique_id));
4200 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &dht_stop_msg->key);
4207 if ((pos->client != NULL) && (pos->client->client_handle == client))
4209 GNUNET_SCHEDULER_cancel(sched, pos->delete_task);
4210 pos->delete_task = GNUNET_SCHEDULER_NO_TASK;
4211 GNUNET_SCHEDULER_add_now(sched, &remove_forward_entry, pos);
4217 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4222 * Core handler for p2p route requests.
4225 handle_dht_p2p_route_request (void *cls,
4226 const struct GNUNET_PeerIdentity *peer,
4227 const struct GNUNET_MessageHeader *message,
4228 struct GNUNET_TIME_Relative latency, uint32_t distance)
4231 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4232 "`%s:%s': Received P2P request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4234 struct GNUNET_DHT_P2PRouteMessage *incoming = (struct GNUNET_DHT_P2PRouteMessage *)message;
4235 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4236 struct DHT_MessageContext *message_context;
4238 if (get_max_send_delay().rel_value > MAX_REQUEST_TIME.rel_value)
4240 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Sending of previous replies took too long, backing off!\n");
4241 increment_stats("# route requests dropped due to high load");
4242 decrease_max_send_delay(get_max_send_delay());
4246 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_P2P_PING) /* Throw these away. FIXME: Don't throw these away? (reply)*/
4249 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Received P2P Ping message.\n", my_short_id, "DHT");
4254 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4259 message_context = GNUNET_malloc(sizeof (struct DHT_MessageContext));
4260 message_context->bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4261 GNUNET_assert(message_context->bloom != NULL);
4262 message_context->hop_count = ntohl(incoming->hop_count);
4263 memcpy(&message_context->key, &incoming->key, sizeof(GNUNET_HashCode));
4264 message_context->replication = ntohl(incoming->desired_replication_level);
4265 message_context->unique_id = GNUNET_ntohll(incoming->unique_id);
4266 message_context->msg_options = ntohl(incoming->options);
4267 message_context->network_size = ntohl(incoming->network_size);
4268 message_context->peer = peer;
4269 message_context->importance = DHT_DEFAULT_P2P_IMPORTANCE;
4270 message_context->timeout = DHT_DEFAULT_P2P_TIMEOUT;
4271 demultiplex_message(enc_msg, message_context);
4272 GNUNET_free(message_context);
4278 * Core handler for p2p route results.
4281 handle_dht_p2p_route_result (void *cls,
4282 const struct GNUNET_PeerIdentity *peer,
4283 const struct GNUNET_MessageHeader *message,
4284 struct GNUNET_TIME_Relative latency, uint32_t distance)
4287 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4288 "`%s:%s': Received request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4290 struct GNUNET_DHT_P2PRouteResultMessage *incoming = (struct GNUNET_DHT_P2PRouteResultMessage *)message;
4291 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4292 struct DHT_MessageContext message_context;
4294 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4300 memset(&message_context, 0, sizeof(struct DHT_MessageContext));
4301 // FIXME: call GNUNET_BLOCK_evaluate (...) -- instead of doing your own bloomfilter!
4302 message_context.bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4303 GNUNET_assert(message_context.bloom != NULL);
4304 memcpy(&message_context.key, &incoming->key, sizeof(GNUNET_HashCode));
4305 message_context.unique_id = GNUNET_ntohll(incoming->unique_id);
4306 message_context.msg_options = ntohl(incoming->options);
4307 message_context.hop_count = ntohl(incoming->hop_count);
4308 message_context.peer = peer;
4309 message_context.importance = DHT_DEFAULT_P2P_IMPORTANCE * 2; /* Make result routing a higher priority */
4310 message_context.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4311 route_result_message(enc_msg, &message_context);
4317 * Receive the HELLO from transport service,
4318 * free current and replace if necessary.
4321 * @param message HELLO message of peer
4324 process_hello (void *cls, const struct GNUNET_MessageHeader *message)
4327 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4328 "Received our `%s' from transport service\n",
4332 GNUNET_assert (message != NULL);
4333 GNUNET_free_non_null(my_hello);
4334 my_hello = GNUNET_malloc(ntohs(message->size));
4335 memcpy(my_hello, message, ntohs(message->size));
4340 * Task run during shutdown.
4346 shutdown_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
4349 struct PeerInfo *pos;
4351 if (transport_handle != NULL)
4353 GNUNET_free_non_null(my_hello);
4354 GNUNET_TRANSPORT_get_hello_cancel(transport_handle, &process_hello, NULL);
4355 GNUNET_TRANSPORT_disconnect(transport_handle);
4357 for (bucket_count = lowest_bucket; bucket_count < MAX_BUCKETS; bucket_count++)
4359 while (k_buckets[bucket_count].head != NULL)
4361 pos = k_buckets[bucket_count].head;
4363 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4364 "%s:%s Removing peer %s from bucket %d!\n", my_short_id, "DHT", GNUNET_i2s(&pos->id), bucket_count);
4366 delete_peer(pos, bucket_count);
4369 if (coreAPI != NULL)
4372 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4373 "%s:%s Disconnecting core!\n", my_short_id, "DHT");
4375 GNUNET_CORE_disconnect (coreAPI);
4378 if (datacache != NULL)
4381 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4382 "%s:%s Destroying datacache!\n", my_short_id, "DHT");
4384 GNUNET_DATACACHE_destroy (datacache);
4389 GNUNET_STATISTICS_destroy (stats, GNUNET_YES);
4392 if (dhtlog_handle != NULL)
4394 GNUNET_DHTLOG_disconnect(dhtlog_handle);
4395 dhtlog_handle = NULL;
4397 if (block_context != NULL)
4399 GNUNET_BLOCK_context_destroy (block_context);
4400 block_context = NULL;
4402 GNUNET_free_non_null(my_short_id);
4408 * To be called on core init/fail.
4410 * @param cls service closure
4411 * @param server handle to the server for this service
4412 * @param identity the public identity of this peer
4413 * @param publicKey the public key of this peer
4416 core_init (void *cls,
4417 struct GNUNET_CORE_Handle *server,
4418 const struct GNUNET_PeerIdentity *identity,
4419 const struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded *publicKey)
4425 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4426 "%s: Connection to core FAILED!\n", "dht",
4427 GNUNET_i2s (identity));
4429 GNUNET_SCHEDULER_cancel (sched, cleanup_task);
4430 GNUNET_SCHEDULER_add_now (sched, &shutdown_task, NULL);
4434 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4435 "%s: Core connection initialized, I am peer: %s\n", "dht",
4436 GNUNET_i2s (identity));
4439 /* Copy our identity so we can use it */
4440 memcpy (&my_identity, identity, sizeof (struct GNUNET_PeerIdentity));
4441 if (my_short_id != NULL)
4442 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s Receive CORE INIT message but have already been initialized! Did CORE fail?\n", "DHT SERVICE");
4443 my_short_id = GNUNET_strdup(GNUNET_i2s(&my_identity));
4444 /* Set the server to local variable */
4447 if (dhtlog_handle != NULL)
4448 dhtlog_handle->insert_node (NULL, &my_identity);
4452 static struct GNUNET_SERVER_MessageHandler plugin_handlers[] = {
4453 {&handle_dht_local_route_request, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE, 0},
4454 {&handle_dht_local_route_stop, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_STOP, 0},
4455 {&handle_dht_control_message, NULL, GNUNET_MESSAGE_TYPE_DHT_CONTROL, 0},
4460 static struct GNUNET_CORE_MessageHandler core_handlers[] = {
4461 {&handle_dht_p2p_route_request, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE, 0},
4462 {&handle_dht_p2p_route_result, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT, 0},
4468 * Method called whenever a peer connects.
4470 * @param cls closure
4471 * @param peer peer identity this notification is about
4472 * @param latency reported latency of the connection with peer
4473 * @param distance reported distance (DV) to peer
4475 void handle_core_connect (void *cls,
4476 const struct GNUNET_PeerIdentity * peer,
4477 struct GNUNET_TIME_Relative latency,
4480 struct PeerInfo *ret;
4483 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4484 "%s:%s Receives core connect message for peer %s distance %d!\n", my_short_id, "dht", GNUNET_i2s(peer), distance);
4487 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4489 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));
4493 if (datacache != NULL)
4494 GNUNET_DATACACHE_put(datacache, &peer->hashPubKey, sizeof(struct GNUNET_PeerIdentity), (const char *)peer, GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_TIME_absolute_get_forever());
4495 ret = try_add_peer(peer,
4496 find_current_bucket(&peer->hashPubKey),
4501 newly_found_peers++;
4502 GNUNET_CONTAINER_multihashmap_put(all_known_peers, &peer->hashPubKey, ret, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
4505 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4506 "%s:%s Adding peer to routing list: %s\n", my_short_id, "DHT", ret == NULL ? "NOT ADDED" : "PEER ADDED");
4512 * Method called whenever a peer disconnects.
4514 * @param cls closure
4515 * @param peer peer identity this notification is about
4517 void handle_core_disconnect (void *cls,
4519 GNUNET_PeerIdentity * peer)
4521 struct PeerInfo *to_remove;
4524 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");
4526 if (GNUNET_YES != GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4528 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));
4531 increment_stats(STAT_DISCONNECTS);
4532 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey));
4533 to_remove = GNUNET_CONTAINER_multihashmap_get(all_known_peers, &peer->hashPubKey);
4534 GNUNET_assert(0 == memcmp(peer, &to_remove->id, sizeof(struct GNUNET_PeerIdentity)));
4535 current_bucket = find_current_bucket(&to_remove->id.hashPubKey);
4536 delete_peer(to_remove, current_bucket);
4541 * Process dht requests.
4543 * @param cls closure
4544 * @param scheduler scheduler to use
4545 * @param server the initialized server
4546 * @param c configuration to use
4550 struct GNUNET_SCHEDULER_Handle *scheduler,
4551 struct GNUNET_SERVER_Handle *server,
4552 const struct GNUNET_CONFIGURATION_Handle *c)
4554 struct GNUNET_TIME_Relative next_send_time;
4555 unsigned long long temp_config_num;
4556 char *converge_modifier_buf;
4560 datacache = GNUNET_DATACACHE_create (sched, cfg, "dhtcache");
4561 GNUNET_SERVER_add_handlers (server, plugin_handlers);
4562 GNUNET_SERVER_disconnect_notify (server, &handle_client_disconnect, NULL);
4563 coreAPI = GNUNET_CORE_connect (sched, /* Main scheduler */
4564 cfg, /* Main configuration */
4565 GNUNET_TIME_UNIT_FOREVER_REL,
4566 NULL, /* Closure passed to DHT functions */
4567 &core_init, /* Call core_init once connected */
4568 &handle_core_connect, /* Handle connects */
4569 &handle_core_disconnect, /* remove peers on disconnects */
4570 NULL, /* Do we care about "status" updates? */
4571 NULL, /* Don't want notified about all incoming messages */
4572 GNUNET_NO, /* For header only inbound notification */
4573 NULL, /* Don't want notified about all outbound messages */
4574 GNUNET_NO, /* For header only outbound notification */
4575 core_handlers); /* Register these handlers */
4577 if (coreAPI == NULL)
4579 transport_handle = GNUNET_TRANSPORT_connect(sched, cfg,
4580 NULL, NULL, NULL, NULL, NULL);
4581 if (transport_handle != NULL)
4582 GNUNET_TRANSPORT_get_hello (transport_handle, &process_hello, NULL);
4584 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4585 "Failed to connect to transport service!\n");
4586 block_context = GNUNET_BLOCK_context_create (cfg);
4587 lowest_bucket = MAX_BUCKETS - 1;
4588 forward_list.hashmap = GNUNET_CONTAINER_multihashmap_create(MAX_OUTSTANDING_FORWARDS / 10);
4589 forward_list.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4590 all_known_peers = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4591 recent_find_peer_requests = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4592 GNUNET_assert(all_known_peers != NULL);
4593 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing", "mysql_logging"))
4595 debug_routes = GNUNET_YES;
4599 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4602 strict_kademlia = GNUNET_YES;
4606 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4609 stop_on_closest = GNUNET_YES;
4613 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4616 stop_on_found = GNUNET_YES;
4620 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4621 "malicious_getter"))
4623 malicious_getter = GNUNET_YES;
4624 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4625 "MALICIOUS_GET_FREQUENCY",
4626 &malicious_get_frequency))
4627 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4630 if (GNUNET_YES != GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4634 max_hops = DEFAULT_MAX_HOPS;
4637 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno (cfg, "DHT",
4640 use_max_hops = GNUNET_YES;
4644 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4645 "malicious_putter"))
4647 malicious_putter = GNUNET_YES;
4648 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4649 "MALICIOUS_PUT_FREQUENCY",
4650 &malicious_put_frequency))
4651 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4654 dht_republish_frequency = GNUNET_DHT_DEFAULT_REPUBLISH_FREQUENCY;
4655 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_number(cfg, "DHT", "REPLICATION_FREQUENCY", &temp_config_num))
4657 dht_republish_frequency = GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, temp_config_num);
4661 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4662 "malicious_dropper"))
4664 malicious_dropper = GNUNET_YES;
4668 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4670 do_republish = GNUNET_NO;
4673 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4676 do_find_peer = GNUNET_NO;
4679 do_find_peer = GNUNET_YES;
4682 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4683 "use_real_distance"))
4684 use_real_distance = GNUNET_YES;
4687 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing",
4688 "mysql_logging_extended"))
4690 debug_routes = GNUNET_YES;
4691 debug_routes_extended = GNUNET_YES;
4694 #if DEBUG_DHT_ROUTING
4695 if (GNUNET_YES == debug_routes)
4697 dhtlog_handle = GNUNET_DHTLOG_connect(cfg);
4698 if (dhtlog_handle == NULL)
4700 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
4701 "Could not connect to mysql logging server, logging will not happen!");
4706 converge_option = DHT_CONVERGE_SQUARE;
4708 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4711 converge_option = DHT_CONVERGE_LINEAR;
4713 else if (GNUNET_YES ==
4714 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4715 "converge_exponential"))
4717 converge_option = DHT_CONVERGE_EXPONENTIAL;
4719 else if (GNUNET_YES ==
4720 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4723 converge_option = DHT_CONVERGE_RANDOM;
4725 else if (GNUNET_YES ==
4726 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4729 converge_option = DHT_CONVERGE_BINARY;
4732 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string(cfg, "dht_testing", "converge_modifier", &converge_modifier_buf))
4734 if (1 != sscanf(converge_modifier_buf, "%f", &converge_modifier))
4736 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Failed to read decimal value for %s from `%s'\n", "CONVERGE_MODIFIER", converge_modifier_buf);
4737 converge_modifier = 0.0;
4739 GNUNET_free(converge_modifier_buf);
4742 stats = GNUNET_STATISTICS_create(sched, "dht", cfg);
4746 GNUNET_STATISTICS_set(stats, STAT_ROUTES, 0, GNUNET_NO);
4747 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS, 0, GNUNET_NO);
4748 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS_CLOSEST, 0, GNUNET_NO);
4749 GNUNET_STATISTICS_set(stats, STAT_RESULTS, 0, GNUNET_NO);
4750 GNUNET_STATISTICS_set(stats, STAT_RESULTS_TO_CLIENT, 0, GNUNET_NO);
4751 GNUNET_STATISTICS_set(stats, STAT_RESULT_FORWARDS, 0, GNUNET_NO);
4752 GNUNET_STATISTICS_set(stats, STAT_GETS, 0, GNUNET_NO);
4753 GNUNET_STATISTICS_set(stats, STAT_PUTS, 0, GNUNET_NO);
4754 GNUNET_STATISTICS_set(stats, STAT_PUTS_INSERTED, 0, GNUNET_NO);
4755 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER, 0, GNUNET_NO);
4756 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_START, 0, GNUNET_NO);
4757 GNUNET_STATISTICS_set(stats, STAT_GET_START, 0, GNUNET_NO);
4758 GNUNET_STATISTICS_set(stats, STAT_PUT_START, 0, GNUNET_NO);
4759 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_REPLY, 0, GNUNET_NO);
4760 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_ANSWER, 0, GNUNET_NO);
4761 GNUNET_STATISTICS_set(stats, STAT_BLOOM_FIND_PEER, 0, GNUNET_NO);
4762 GNUNET_STATISTICS_set(stats, STAT_GET_REPLY, 0, GNUNET_NO);
4763 GNUNET_STATISTICS_set(stats, STAT_GET_RESPONSE_START, 0, GNUNET_NO);
4764 GNUNET_STATISTICS_set(stats, STAT_HELLOS_PROVIDED, 0, GNUNET_NO);
4765 GNUNET_STATISTICS_set(stats, STAT_DISCONNECTS, 0, GNUNET_NO);
4767 /* FIXME: if there are no recent requests then these never get freed, but alternative is _annoying_! */
4768 recent.hashmap = GNUNET_CONTAINER_multihashmap_create(DHT_MAX_RECENT / 2);
4769 recent.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4770 if (GNUNET_YES == do_find_peer)
4772 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4773 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4774 (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4775 find_peer_context.start = GNUNET_TIME_absolute_get();
4776 GNUNET_SCHEDULER_add_delayed (sched,
4778 &send_find_peer_message, &find_peer_context);
4781 /* Scheduled the task to clean up when shutdown is called */
4782 cleanup_task = GNUNET_SCHEDULER_add_delayed (sched,
4783 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_CONTAINER_multihashmap_destroy (recent_find_peer_requests);