2 This file is part of GNUnet.
3 (C) 2009, 2010 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file dht/gnunet-service-dht.c
23 * @brief GNUnet DHT service
24 * @author Christian Grothoff
25 * @author Nathan Evans
29 #include "gnunet_block_lib.h"
30 #include "gnunet_client_lib.h"
31 #include "gnunet_getopt_lib.h"
32 #include "gnunet_os_lib.h"
33 #include "gnunet_protocols.h"
34 #include "gnunet_service_lib.h"
35 #include "gnunet_core_service.h"
36 #include "gnunet_signal_lib.h"
37 #include "gnunet_util_lib.h"
38 #include "gnunet_datacache_lib.h"
39 #include "gnunet_transport_service.h"
40 #include "gnunet_hello_lib.h"
41 #include "gnunet_dht_service.h"
42 #include "gnunet_statistics_service.h"
47 #define PRINT_TABLES GNUNET_NO
49 #define REAL_DISTANCE GNUNET_NO
51 #define EXTRA_CHECKS GNUNET_NO
54 * How many buckets will we allow total.
56 #define MAX_BUCKETS sizeof (GNUNET_HashCode) * 8
59 * Should the DHT issue FIND_PEER requests to get better routing tables?
61 #define DEFAULT_DO_FIND_PEER GNUNET_YES
64 * Defines whether find peer requests send their HELLO's outgoing,
65 * or expect replies to contain hellos.
67 #define FIND_PEER_WITH_HELLO GNUNET_YES
70 * What is the maximum number of peers in a given bucket.
72 #define DEFAULT_BUCKET_SIZE 4
74 #define DEFAULT_CORE_QUEUE_SIZE 32
77 * Minimum number of peers we need for "good" routing,
78 * any less than this and we will allow messages to
79 * travel much further through the network!
81 #define MINIMUM_PEER_THRESHOLD 20
83 #define DHT_MAX_RECENT 1000
85 #define FIND_PEER_CALC_INTERVAL GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 60)
88 * Default time to wait to send messages on behalf of other peers.
90 #define DHT_DEFAULT_P2P_TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 10)
93 * Default importance for handling messages on behalf of other peers.
95 #define DHT_DEFAULT_P2P_IMPORTANCE 0
98 * How long to keep recent requests around by default.
100 #define DEFAULT_RECENT_REMOVAL GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 15)
103 * Default time to wait to send find peer messages sent by the dht service.
105 #define DHT_DEFAULT_FIND_PEER_TIMEOUT GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 30)
108 * Default importance for find peer messages sent by the dht service.
110 #define DHT_DEFAULT_FIND_PEER_IMPORTANCE 8
113 * Default replication parameter for find peer messages sent by the dht service.
115 #define DHT_DEFAULT_FIND_PEER_REPLICATION 4
118 * Default options for find peer requests sent by the dht service.
120 #define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE
121 /*#define DHT_DEFAULT_FIND_PEER_OPTIONS GNUNET_DHT_RO_NONE*/
124 * How long at least to wait before sending another find peer request.
126 #define DHT_MINIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
129 * How long at most to wait before sending another find peer request.
131 #define DHT_MAXIMUM_FIND_PEER_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 8)
134 * How often to update our preference levels for peers in our routing tables.
136 #define DHT_DEFAULT_PREFERENCE_INTERVAL GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
139 * How long at most on average will we allow a reply forward to take
140 * (before we quit sending out new requests)
142 #define MAX_REQUEST_TIME GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
145 * How many initial requests to send out (in true Kademlia fashion)
147 #define DHT_KADEMLIA_REPLICATION 3
150 * Default frequency for sending malicious get messages
152 #define DEFAULT_MALICIOUS_GET_FREQUENCY 1000 /* Number of milliseconds */
155 * Default frequency for sending malicious put messages
157 #define DEFAULT_MALICIOUS_PUT_FREQUENCY 1000 /* Default is in milliseconds */
160 #define DHT_DEFAULT_PING_DELAY GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 1)
163 * Real maximum number of hops, at which point we refuse
164 * to forward the message.
166 #define DEFAULT_MAX_HOPS 10
169 * How many time differences between requesting a core send and
170 * the actual callback to remember.
172 #define MAX_REPLY_TIMES 8
174 enum ConvergenceOptions
177 * Use the linear method for convergence.
182 * Converge using a fast converging square
188 * Converge using a slower exponential
191 DHT_CONVERGE_EXPONENTIAL,
194 * Don't do any special convergence, allow
195 * the algorithm to hopefully route to closer
201 * Binary convergence, start routing to closest
202 * only after set number of hops.
208 * Linked list of messages to send to clients.
210 struct P2PPendingMessage
213 * Pointer to next item in the list
215 struct P2PPendingMessage *next;
218 * Pointer to previous item in the list
220 struct P2PPendingMessage *prev;
223 * Message importance level.
225 unsigned int importance;
228 * Time when this request was scheduled to be sent.
230 struct GNUNET_TIME_Absolute scheduled;
233 * How long to wait before sending message.
235 struct GNUNET_TIME_Relative timeout;
238 * Actual message to be sent; // avoid allocation
240 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
245 * Per-peer information.
250 * Next peer entry (DLL)
252 struct PeerInfo *next;
255 * Prev peer entry (DLL)
257 struct PeerInfo *prev;
260 * Head of pending messages to be sent to this peer.
262 struct P2PPendingMessage *head;
265 * Tail of pending messages to be sent to this peer.
267 struct P2PPendingMessage *tail;
270 * Core handle for sending messages to this peer.
272 struct GNUNET_CORE_TransmitHandle *th;
275 * Task for scheduling message sends.
277 GNUNET_SCHEDULER_TaskIdentifier send_task;
280 * Task for scheduling preference updates
282 GNUNET_SCHEDULER_TaskIdentifier preference_task;
285 * Preference update context
287 struct GNUNET_CORE_InformationRequestContext *info_ctx;
290 * What is the identity of the peer?
292 struct GNUNET_PeerIdentity id;
296 * What is the average latency for replies received?
298 struct GNUNET_TIME_Relative latency;
301 * Transport level distance to peer.
303 unsigned int distance;
307 * Holds matching bits from peer to current target,
308 * used for distance comparisons between peers. May
309 * be considered a really bad idea.
310 * FIXME: remove this value (create struct which holds
311 * a single peerinfo and the matching bits, use
312 * that to pass to comparitor)
314 unsigned int matching_bits;
317 * Task for scheduling periodic ping messages for this peer.
319 GNUNET_SCHEDULER_TaskIdentifier ping_task;
323 * Peers are grouped into buckets.
330 struct PeerInfo *head;
335 struct PeerInfo *tail;
338 * Number of peers in the bucket.
340 unsigned int peers_size;
344 * Linked list of messages to send to clients.
346 struct PendingMessage
349 * Pointer to next item in the list
351 struct PendingMessage *next;
354 * Pointer to previous item in the list
356 struct PendingMessage *prev;
359 * Actual message to be sent; // avoid allocation
361 const struct GNUNET_MessageHeader *msg; // msg = (cast) &pm[1]; // memcpy (&pm[1], data, len);
366 * Struct containing information about a client,
367 * handle to connect to it, and any pending messages
368 * that need to be sent to it.
373 * Linked list of active clients
375 struct ClientList *next;
378 * The handle to this client
380 struct GNUNET_SERVER_Client *client_handle;
383 * Handle to the current transmission request, NULL
386 struct GNUNET_CONNECTION_TransmitHandle *transmit_handle;
389 * Linked list of pending messages for this client
391 struct PendingMessage *pending_head;
394 * Tail of linked list of pending messages for this client
396 struct PendingMessage *pending_tail;
401 * Context containing information about a DHT message received.
403 struct DHT_MessageContext
406 * The client this request was received from.
407 * (NULL if received from another peer)
409 struct ClientList *client;
412 * The peer this request was received from.
413 * (NULL if received from local client)
415 const struct GNUNET_PeerIdentity *peer;
418 * Bloomfilter for this routing request.
420 struct GNUNET_CONTAINER_BloomFilter *bloom;
423 * extended query (see gnunet_block_lib.h).
428 * Bloomfilter to filter out duplicate replies.
430 struct GNUNET_CONTAINER_BloomFilter *reply_bf;
433 * The key this request was about
438 * How long should we wait to transmit this request?
440 struct GNUNET_TIME_Relative timeout;
443 * The unique identifier of this request
448 * Number of bytes in xquery.
453 * Mutator value for the reply_bf, see gnunet_block_lib.h
455 uint32_t reply_bf_mutator;
458 * Desired replication level
460 uint32_t replication;
463 * Network size estimate, either ours or the sum of
464 * those routed to thus far. =~ Log of number of peers
465 * chosen from for this request.
467 uint32_t network_size;
470 * Any message options for this request
472 uint32_t msg_options;
475 * How many hops has the message already traversed?
480 * How important is this message?
482 unsigned int importance;
485 * Should we (still) forward the request on to other peers?
490 * Did we forward this message? (may need to remember it!)
495 * Are we the closest known peer to this key (out of our neighbors?)
501 * Record used for remembering what peers are waiting for what
502 * responses (based on search key).
504 struct DHTRouteSource
509 struct DHTRouteSource *next;
514 struct DHTRouteSource *prev;
517 * Source of the request. Replies should be forwarded to
520 struct GNUNET_PeerIdentity source;
523 * If this was a local request, remember the client; otherwise NULL.
525 struct ClientList *client;
528 * Pointer to this nodes heap location (for removal)
530 struct GNUNET_CONTAINER_HeapNode *hnode;
533 * Back pointer to the record storing this information.
535 struct DHTQueryRecord *record;
538 * Task to remove this entry on timeout.
540 GNUNET_SCHEDULER_TaskIdentifier delete_task;
543 * Bloomfilter of peers we have already sent back as
544 * replies to the initial request. Allows us to not
545 * forward the same peer multiple times for a find peer
548 struct GNUNET_CONTAINER_BloomFilter *find_peers_responded;
553 * Entry in the DHT routing table.
555 struct DHTQueryRecord
558 * Head of DLL for result forwarding.
560 struct DHTRouteSource *head;
563 * Tail of DLL for result forwarding.
565 struct DHTRouteSource *tail;
568 * Key that the record concerns.
573 * GET message of this record (what we already forwarded?).
575 //DV_DHT_MESSAGE get; Try to get away with not saving this.
578 * Bloomfilter of the peers we've replied to so far
580 //struct GNUNET_BloomFilter *bloom_results; Don't think we need this, just remove from DLL on response.
585 * Context used to calculate the number of find peer messages
586 * per X time units since our last scheduled find peer message
587 * was sent. If we have seen too many messages, delay or don't
590 struct FindPeerMessageContext
594 struct GNUNET_TIME_Absolute start;
596 struct GNUNET_TIME_Absolute end;
600 * DHT Routing results structure
605 * Min heap for removal upon reaching limit
607 struct GNUNET_CONTAINER_Heap *minHeap;
610 * Hashmap for fast key based lookup
612 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
617 * DHT structure for recent requests.
619 struct RecentRequests
622 * Min heap for removal upon reaching limit
624 struct GNUNET_CONTAINER_Heap *minHeap;
627 * Hashmap for key based lookup
629 struct GNUNET_CONTAINER_MultiHashMap *hashmap;
635 * Position of this node in the min heap.
637 struct GNUNET_CONTAINER_HeapNode *heap_node;
640 * Bloomfilter containing entries for peers
641 * we forwarded this request to.
643 struct GNUNET_CONTAINER_BloomFilter *bloom;
646 * Timestamp of this request, for ordering
649 struct GNUNET_TIME_Absolute timestamp;
652 * Key of this request.
657 * Unique identifier for this request.
662 * Task to remove this entry on timeout.
664 GNUNET_SCHEDULER_TaskIdentifier remove_task;
667 struct RepublishContext
682 * Which kind of convergence will we be using?
684 static enum ConvergenceOptions converge_option;
687 * Modifier for the convergence function
689 static float converge_modifier;
692 * Recent requests by hash/uid and by time inserted.
694 static struct RecentRequests recent;
697 * Context to use to calculate find peer rates.
699 static struct FindPeerMessageContext find_peer_context;
702 * Don't use our routing algorithm, always route
703 * to closest peer; initially send requests to 3
706 static unsigned int strict_kademlia;
709 * Routing option to end routing when closest peer found.
711 static unsigned int stop_on_closest;
714 * Routing option to end routing when data is found.
716 static unsigned int stop_on_found;
719 * Whether DHT needs to manage find peer requests, or
720 * an external force will do it on behalf of the DHT.
722 static unsigned int do_find_peer;
725 * Once we have stored an item in the DHT, refresh it
726 * according to our republish interval.
728 static unsigned int do_republish;
731 * Use the "real" distance metric when selecting the
732 * next routing hop. Can be less accurate.
734 static unsigned int use_real_distance;
737 * How many peers have we added since we sent out our last
740 static unsigned int newly_found_peers;
743 * Container of active queries we should remember
745 static struct DHTResults forward_list;
748 * Handle to the datacache service (for inserting/retrieving data)
750 static struct GNUNET_DATACACHE_Handle *datacache;
753 * Handle for the statistics service.
755 struct GNUNET_STATISTICS_Handle *stats;
759 * The configuration the DHT service is running with
761 static const struct GNUNET_CONFIGURATION_Handle *cfg;
764 * Handle to the core service
766 static struct GNUNET_CORE_Handle *coreAPI;
769 * Handle to the transport service, for getting our hello
771 static struct GNUNET_TRANSPORT_Handle *transport_handle;
774 * The identity of our peer.
776 static struct GNUNET_PeerIdentity my_identity;
779 * Short id of the peer, for printing
781 static char *my_short_id;
786 static struct GNUNET_MessageHeader *my_hello;
789 * Task to run when we shut down, cleaning up all our trash
791 static GNUNET_SCHEDULER_TaskIdentifier cleanup_task;
794 * The lowest currently used bucket.
796 static unsigned int lowest_bucket; /* Initially equal to MAX_BUCKETS - 1 */
799 * The maximum number of hops before we stop routing messages.
801 static unsigned long long max_hops;
804 * How often to republish content we have previously stored.
806 static struct GNUNET_TIME_Relative dht_republish_frequency;
809 * GNUNET_YES to stop at max_hops, GNUNET_NO to heuristically decide when to stop forwarding.
811 static int use_max_hops;
814 * The buckets (Kademlia routing table, complete with growth).
815 * Array of size MAX_BUCKET_SIZE.
817 static struct PeerBucket k_buckets[MAX_BUCKETS]; /* From 0 to MAX_BUCKETS - 1 */
820 * Hash map of all known peers, for easy removal from k_buckets on disconnect.
822 static struct GNUNET_CONTAINER_MultiHashMap *all_known_peers;
825 * Recently seen find peer requests.
827 static struct GNUNET_CONTAINER_MultiHashMap *recent_find_peer_requests;
830 * Maximum size for each bucket.
832 static unsigned int bucket_size = DEFAULT_BUCKET_SIZE; /* Initially equal to DEFAULT_BUCKET_SIZE */
835 * List of active clients.
837 static struct ClientList *client_list;
840 * Handle to the DHT logger.
842 static struct GNUNET_DHTLOG_Handle *dhtlog_handle;
845 * Whether or not to send routing debugging information
846 * to the dht logging server
848 static unsigned int debug_routes;
851 * Whether or not to send FULL route information to
854 static unsigned int debug_routes_extended;
857 * GNUNET_YES or GNUNET_NO, whether or not to act as
858 * a malicious node which drops all messages
860 static unsigned int malicious_dropper;
863 * GNUNET_YES or GNUNET_NO, whether or not to act as
864 * a malicious node which sends out lots of GETS
866 static unsigned int malicious_getter;
869 * GNUNET_YES or GNUNET_NO, whether or not to act as
870 * a malicious node which sends out lots of PUTS
872 static unsigned int malicious_putter;
875 * Frequency for malicious get requests.
877 static unsigned long long malicious_get_frequency;
880 * Frequency for malicious put requests.
882 static unsigned long long malicious_put_frequency;
885 * Reply times for requests, if we are busy, don't send any
888 static struct GNUNET_TIME_Relative reply_times[MAX_REPLY_TIMES];
891 * Current counter for replies.
893 static unsigned int reply_counter;
896 * Our handle to the BLOCK library.
898 static struct GNUNET_BLOCK_Context *block_context;
902 * Forward declaration.
905 send_generic_reply (void *cls, size_t size, void *buf);
908 /** Declare here so retry_core_send is aware of it */
910 core_transmit_notify (void *cls,
911 size_t size, void *buf);
914 * Convert unique ID to hash code.
916 * @param uid unique ID to convert
917 * @param hash set to uid (extended with zeros)
920 hash_from_uid (uint64_t uid,
921 GNUNET_HashCode *hash)
923 memset (hash, 0, sizeof(GNUNET_HashCode));
924 *((uint64_t*)hash) = uid;
929 * Calculate the average send time between messages so that we can
930 * ignore certain requests if we get too busy.
932 * @return the average time between asking core to send a message
933 * and when the buffer for copying it is passed
935 static struct GNUNET_TIME_Relative get_average_send_delay()
938 unsigned int divisor;
939 struct GNUNET_TIME_Relative average_time;
940 average_time = GNUNET_TIME_relative_get_zero();
942 for (i = 0; i < MAX_REPLY_TIMES; i++)
944 average_time = GNUNET_TIME_relative_add(average_time, reply_times[i]);
945 if (reply_times[i].abs_value == (uint64_t)0)
955 average_time = GNUNET_TIME_relative_divide(average_time, divisor);
957 "Avg send delay: %u sends is %llu\n",
959 (unsigned long long) average_time.abs_value);
965 * Given the largest send delay, artificially decrease it
966 * so the next time around we may have a chance at sending
969 static void decrease_max_send_delay(struct GNUNET_TIME_Relative max_time)
972 for (i = 0; i < MAX_REPLY_TIMES; i++)
974 if (reply_times[i].rel_value == max_time.rel_value)
976 reply_times[i].rel_value = reply_times[i].rel_value / 2;
983 * Find the maximum send time of the recently sent values.
985 * @return the average time between asking core to send a message
986 * and when the buffer for copying it is passed
988 static struct GNUNET_TIME_Relative get_max_send_delay()
991 struct GNUNET_TIME_Relative max_time;
992 max_time = GNUNET_TIME_relative_get_zero();
994 for (i = 0; i < MAX_REPLY_TIMES; i++)
996 if (reply_times[i].rel_value > max_time.rel_value)
997 max_time.rel_value = reply_times[i].rel_value;
1000 if (max_time.rel_value > MAX_REQUEST_TIME.rel_value)
1001 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Max send delay was %llu\n",
1002 (unsigned long long) max_time.rel_value);
1007 increment_stats(const char *value)
1011 GNUNET_STATISTICS_update (stats, value, 1, GNUNET_NO);
1016 * Try to send another message from our core send list
1019 try_core_send (void *cls,
1020 const struct GNUNET_SCHEDULER_TaskContext *tc)
1022 struct PeerInfo *peer = cls;
1023 struct P2PPendingMessage *pending;
1026 peer->send_task = GNUNET_SCHEDULER_NO_TASK;
1028 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1031 if (peer->th != NULL)
1032 return; /* Message send already in progress */
1034 pending = peer->head;
1035 if (pending != NULL)
1037 ssize = ntohs(pending->msg->size);
1039 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1040 "`%s:%s': Calling notify_transmit_ready with size %d for peer %s\n", my_short_id,
1041 "DHT", ssize, GNUNET_i2s(&peer->id));
1043 pending->scheduled = GNUNET_TIME_absolute_get();
1045 if (reply_counter >= MAX_REPLY_TIMES)
1047 peer->th = GNUNET_CORE_notify_transmit_ready(coreAPI, pending->importance,
1048 pending->timeout, &peer->id,
1049 ssize, &core_transmit_notify, peer);
1054 * Function called to send a request out to another peer.
1055 * Called both for locally initiated requests and those
1056 * received from other peers.
1058 * @param msg the encapsulated message
1059 * @param peer the peer to forward the message to
1060 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1063 forward_result_message (const struct GNUNET_MessageHeader *msg,
1064 struct PeerInfo *peer,
1065 struct DHT_MessageContext *msg_ctx)
1067 struct GNUNET_DHT_P2PRouteResultMessage *result_message;
1068 struct P2PPendingMessage *pending;
1072 increment_stats(STAT_RESULT_FORWARDS);
1073 msize = sizeof (struct GNUNET_DHT_P2PRouteResultMessage) + ntohs(msg->size);
1074 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1075 psize = sizeof(struct P2PPendingMessage) + msize;
1076 pending = GNUNET_malloc(psize);
1077 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1078 pending->importance = DHT_SEND_PRIORITY;
1079 pending->timeout = GNUNET_TIME_relative_get_forever();
1080 result_message = (struct GNUNET_DHT_P2PRouteResultMessage *)pending->msg;
1081 result_message->header.size = htons(msize);
1082 result_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT);
1083 result_message->put_path_length = htons(0); /* FIXME: implement */
1084 result_message->get_path_length = htons(0); /* FIXME: implement */
1085 result_message->options = htonl(msg_ctx->msg_options);
1086 result_message->hop_count = htonl(msg_ctx->hop_count + 1);
1087 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, result_message->bloomfilter, DHT_BLOOM_SIZE));
1088 result_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1089 memcpy(&result_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1090 memcpy(&result_message[1], msg, ntohs(msg->size));
1092 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));
1094 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1095 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1096 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1101 * Called when core is ready to send a message we asked for
1102 * out to the destination.
1104 * @param cls closure (NULL)
1105 * @param size number of bytes available in buf
1106 * @param buf where the callee should write the message
1107 * @return number of bytes written to buf
1110 core_transmit_notify (void *cls,
1111 size_t size, void *buf)
1113 struct PeerInfo *peer = cls;
1115 struct P2PPendingMessage *pending;
1122 /* client disconnected */
1124 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "`%s:%s': buffer was NULL\n", my_short_id, "DHT");
1129 if (peer->head == NULL)
1133 pending = peer->head;
1134 reply_times[reply_counter] = GNUNET_TIME_absolute_get_difference(pending->scheduled, GNUNET_TIME_absolute_get());
1135 msize = ntohs(pending->msg->size);
1139 memcpy (cbuf, pending->msg, msize);
1140 GNUNET_CONTAINER_DLL_remove (peer->head,
1144 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));
1146 GNUNET_free (pending);
1149 while (NULL != pending &&
1150 (size - off >= (msize = ntohs (pending->msg->size))))
1152 #if DEBUG_DHT_ROUTING
1153 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);
1155 memcpy (&cbuf[off], pending->msg, msize);
1157 GNUNET_CONTAINER_DLL_remove (peer->head,
1160 GNUNET_free (pending);
1161 pending = peer->head;
1164 if ((peer->head != NULL) && (peer->send_task == GNUNET_SCHEDULER_NO_TASK))
1165 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1167 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);
1174 * Compute the distance between have and target as a 32-bit value.
1175 * Differences in the lower bits must count stronger than differences
1176 * in the higher bits.
1178 * @return 0 if have==target, otherwise a number
1179 * that is larger as the distance between
1180 * the two hash codes increases
1183 distance (const GNUNET_HashCode * target, const GNUNET_HashCode * have)
1185 unsigned int bucket;
1190 /* We have to represent the distance between two 2^9 (=512)-bit
1191 numbers as a 2^5 (=32)-bit number with "0" being used for the
1192 two numbers being identical; furthermore, we need to
1193 guarantee that a difference in the number of matching
1194 bits is always represented in the result.
1196 We use 2^32/2^9 numerical values to distinguish between
1197 hash codes that have the same LSB bit distance and
1198 use the highest 2^9 bits of the result to signify the
1199 number of (mis)matching LSB bits; if we have 0 matching
1200 and hence 512 mismatching LSB bits we return -1 (since
1201 512 itself cannot be represented with 9 bits) */
1203 /* first, calculate the most significant 9 bits of our
1204 result, aka the number of LSBs */
1205 bucket = GNUNET_CRYPTO_hash_matching_bits (target, have);
1206 /* bucket is now a value between 0 and 512 */
1208 return 0; /* perfect match */
1210 return (unsigned int) -1; /* LSB differs; use max (if we did the bit-shifting
1211 below, we'd end up with max+1 (overflow)) */
1213 /* calculate the most significant bits of the final result */
1214 msb = (512 - bucket) << (32 - 9);
1215 /* calculate the 32-9 least significant bits of the final result by
1216 looking at the differences in the 32-9 bits following the
1217 mismatching bit at 'bucket' */
1219 for (i = bucket + 1;
1220 (i < sizeof (GNUNET_HashCode) * 8) && (i < bucket + 1 + 32 - 9); i++)
1222 if (GNUNET_CRYPTO_hash_get_bit (target, i) != GNUNET_CRYPTO_hash_get_bit (have, i))
1223 lsb |= (1 << (bucket + 32 - 9 - i)); /* first bit set will be 10,
1224 last bit set will be 31 -- if
1225 i does not reach 512 first... */
1231 * Return a number that is larger the closer the
1232 * "have" GNUNET_hash code is to the "target".
1234 * @return inverse distance metric, non-zero.
1235 * Must fudge the value if NO bits match.
1238 inverse_distance (const GNUNET_HashCode * target,
1239 const GNUNET_HashCode * have)
1241 if (GNUNET_CRYPTO_hash_matching_bits(target, have) == 0)
1242 return 1; /* Never return 0! */
1243 return ((unsigned int) -1) - distance (target, have);
1247 * Find the optimal bucket for this key, regardless
1248 * of the current number of buckets in use.
1250 * @param hc the hashcode to compare our identity to
1252 * @return the proper bucket index, or GNUNET_SYSERR
1253 * on error (same hashcode)
1255 static int find_bucket(const GNUNET_HashCode *hc)
1259 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, hc);
1260 if (bits == MAX_BUCKETS)
1261 return GNUNET_SYSERR;
1262 return MAX_BUCKETS - bits - 1;
1266 * Find which k-bucket this peer should go into,
1267 * taking into account the size of the k-bucket
1268 * array. This means that if more bits match than
1269 * there are currently buckets, lowest_bucket will
1272 * @param hc GNUNET_HashCode we are finding the bucket for.
1274 * @return the proper bucket index for this key,
1275 * or GNUNET_SYSERR on error (same hashcode)
1277 static int find_current_bucket(const GNUNET_HashCode *hc)
1280 actual_bucket = find_bucket(hc);
1282 if (actual_bucket == GNUNET_SYSERR) /* hc and our peer identity match! */
1283 return lowest_bucket;
1284 else if (actual_bucket < lowest_bucket) /* actual_bucket not yet used */
1285 return lowest_bucket;
1287 return actual_bucket;
1292 * Find a routing table entry from a peer identity
1294 * @param peer the peer to look up
1296 * @return the bucket number holding the peer, GNUNET_SYSERR if not found
1299 find_bucket_by_peer(const struct PeerInfo *peer)
1302 struct PeerInfo *pos;
1304 for (bucket = lowest_bucket; bucket < MAX_BUCKETS - 1; bucket++)
1306 pos = k_buckets[bucket].head;
1315 return GNUNET_SYSERR; /* No such peer. */
1321 * Print the complete routing table for this peer.
1324 print_routing_table ()
1327 struct PeerInfo *pos;
1328 char char_buf[30000];
1330 memset(char_buf, 0, sizeof(char_buf));
1332 char_pos += sprintf(&char_buf[char_pos], "Printing routing table for peer %s\n", my_short_id);
1333 //fprintf(stderr, "Printing routing table for peer %s\n", my_short_id);
1334 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1336 pos = k_buckets[bucket].head;
1337 char_pos += sprintf(&char_buf[char_pos], "Bucket %d:\n", bucket);
1338 //fprintf(stderr, "Bucket %d:\n", bucket);
1341 //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));
1342 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));
1346 fprintf(stderr, "%s", char_buf);
1352 * Find a routing table entry from a peer identity
1354 * @param peer the peer identity to look up
1356 * @return the routing table entry, or NULL if not found
1358 static struct PeerInfo *
1359 find_peer_by_id(const struct GNUNET_PeerIdentity *peer)
1362 struct PeerInfo *pos;
1363 bucket = find_current_bucket(&peer->hashPubKey);
1365 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1368 pos = k_buckets[bucket].head;
1371 if (0 == memcmp(&pos->id, peer, sizeof(struct GNUNET_PeerIdentity)))
1375 return NULL; /* No such peer. */
1378 /* Forward declaration */
1380 update_core_preference (void *cls,
1381 const struct GNUNET_SCHEDULER_TaskContext *tc);
1383 * Function called with statistics about the given peer.
1385 * @param cls closure
1386 * @param peer identifies the peer
1387 * @param bpm_out set to the current bandwidth limit (sending) for this peer
1388 * @param amount set to the amount that was actually reserved or unreserved;
1389 * either the full requested amount or zero (no partial reservations)
1390 * @param preference current traffic preference for the given peer
1393 update_core_preference_finish (void *cls,
1394 const struct GNUNET_PeerIdentity * peer,
1395 struct GNUNET_BANDWIDTH_Value32NBO bpm_out,
1396 int amount, uint64_t preference)
1398 struct PeerInfo *peer_info = cls;
1399 peer_info->info_ctx = NULL;
1400 GNUNET_SCHEDULER_add_delayed(DHT_DEFAULT_PREFERENCE_INTERVAL, &update_core_preference, peer_info);
1404 update_core_preference (void *cls,
1405 const struct GNUNET_SCHEDULER_TaskContext *tc)
1407 struct PeerInfo *peer = cls;
1408 uint64_t preference;
1409 unsigned int matching;
1410 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1414 matching = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->id.hashPubKey);
1417 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Peer identifier matches by %u bits, only shifting as much as we can!\n", matching);
1420 preference = 1LL << matching;
1421 peer->info_ctx = GNUNET_CORE_peer_change_preference (coreAPI,
1423 GNUNET_TIME_relative_get_forever(),
1424 GNUNET_BANDWIDTH_value_init (UINT32_MAX),
1427 &update_core_preference_finish,
1432 * Really add a peer to a bucket (only do assertions
1435 * @param peer GNUNET_PeerIdentity of the peer to add
1436 * @param bucket the already figured out bucket to add
1438 * @param atsi performance information
1440 * @return the newly added PeerInfo
1442 static struct PeerInfo *
1443 add_peer(const struct GNUNET_PeerIdentity *peer,
1444 unsigned int bucket,
1445 const struct GNUNET_TRANSPORT_ATS_Information *atsi)
1447 struct PeerInfo *new_peer;
1448 GNUNET_assert(bucket < MAX_BUCKETS);
1449 GNUNET_assert(peer != NULL);
1450 new_peer = GNUNET_malloc(sizeof(struct PeerInfo));
1452 new_peer->latency = latency;
1453 new_peer->distance = distance;
1456 memcpy(&new_peer->id, peer, sizeof(struct GNUNET_PeerIdentity));
1458 GNUNET_CONTAINER_DLL_insert_after(k_buckets[bucket].head,
1459 k_buckets[bucket].tail,
1460 k_buckets[bucket].tail,
1462 k_buckets[bucket].peers_size++;
1464 if ((GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &peer->hashPubKey) > 0) && (k_buckets[bucket].peers_size <= bucket_size))
1466 #if DO_UPDATE_PREFERENCE
1467 new_peer->preference_task = GNUNET_SCHEDULER_add_now(&update_core_preference, new_peer);
1475 * Given a peer and its corresponding bucket,
1476 * remove it from that bucket. Does not free
1477 * the PeerInfo struct, nor cancel messages
1478 * or free messages waiting to be sent to this
1481 * @param peer the peer to remove
1482 * @param bucket the bucket the peer belongs to
1484 static void remove_peer (struct PeerInfo *peer,
1485 unsigned int bucket)
1487 GNUNET_assert(k_buckets[bucket].peers_size > 0);
1488 GNUNET_CONTAINER_DLL_remove(k_buckets[bucket].head,
1489 k_buckets[bucket].tail,
1491 k_buckets[bucket].peers_size--;
1493 if ((bucket == lowest_bucket) && (k_buckets[lowest_bucket].peers_size == 0) && (lowest_bucket < MAX_BUCKETS - 1))
1499 * Removes peer from a bucket, then frees associated
1500 * resources and frees peer.
1502 * @param peer peer to be removed and freed
1503 * @param bucket which bucket this peer belongs to
1505 static void delete_peer (struct PeerInfo *peer,
1506 unsigned int bucket)
1508 struct P2PPendingMessage *pos;
1509 struct P2PPendingMessage *next;
1511 struct PeerInfo *peer_pos;
1513 peer_pos = k_buckets[bucket].head;
1514 while ((peer_pos != NULL) && (peer_pos != peer))
1515 peer_pos = peer_pos->next;
1516 if (peer_pos == NULL)
1518 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s: Expected peer `%s' in bucket %d\n", my_short_id, "DHT", GNUNET_i2s(&peer->id), bucket);
1519 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));
1521 GNUNET_assert(peer_pos != NULL);
1523 remove_peer(peer, bucket); /* First remove the peer from its bucket */
1525 if (peer->send_task != GNUNET_SCHEDULER_NO_TASK)
1526 GNUNET_SCHEDULER_cancel(peer->send_task);
1527 if ((peer->th != NULL) && (coreAPI != NULL))
1528 GNUNET_CORE_notify_transmit_ready_cancel(peer->th);
1531 while (pos != NULL) /* Remove any pending messages for this peer */
1538 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->id.hashPubKey));
1539 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove (all_known_peers, &peer->id.hashPubKey, peer));
1545 * Iterator over hash map entries.
1547 * @param cls closure
1548 * @param key current key code
1549 * @param value PeerInfo of the peer to move to new lowest bucket
1550 * @return GNUNET_YES if we should continue to
1554 static int move_lowest_bucket (void *cls,
1555 const GNUNET_HashCode * key,
1558 struct PeerInfo *peer = value;
1561 GNUNET_assert(lowest_bucket > 0);
1562 new_bucket = lowest_bucket - 1;
1563 remove_peer(peer, lowest_bucket);
1564 GNUNET_CONTAINER_DLL_insert_after(k_buckets[new_bucket].head,
1565 k_buckets[new_bucket].tail,
1566 k_buckets[new_bucket].tail,
1568 k_buckets[new_bucket].peers_size++;
1574 * The current lowest bucket is full, so change the lowest
1575 * bucket to the next lower down, and move any appropriate
1576 * entries in the current lowest bucket to the new bucket.
1578 static void enable_next_bucket()
1580 struct GNUNET_CONTAINER_MultiHashMap *to_remove;
1581 struct PeerInfo *pos;
1582 GNUNET_assert(lowest_bucket > 0);
1583 to_remove = GNUNET_CONTAINER_multihashmap_create(bucket_size);
1584 pos = k_buckets[lowest_bucket].head;
1587 fprintf(stderr, "Printing RT before new bucket\n");
1588 print_routing_table();
1590 /* Populate the array of peers which should be in the next lowest bucket */
1593 if (find_bucket(&pos->id.hashPubKey) < lowest_bucket)
1594 GNUNET_CONTAINER_multihashmap_put(to_remove, &pos->id.hashPubKey, pos, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
1598 /* Remove peers from lowest bucket, insert into next lowest bucket */
1599 GNUNET_CONTAINER_multihashmap_iterate(to_remove, &move_lowest_bucket, NULL);
1600 GNUNET_CONTAINER_multihashmap_destroy(to_remove);
1601 lowest_bucket = lowest_bucket - 1;
1603 fprintf(stderr, "Printing RT after new bucket\n");
1604 print_routing_table();
1609 * Find the closest peer in our routing table to the
1612 * @return The closest peer in our routing table to the
1613 * key, or NULL on error.
1615 static struct PeerInfo *
1616 find_closest_peer (const GNUNET_HashCode *hc)
1618 struct PeerInfo *pos;
1619 struct PeerInfo *current_closest;
1620 unsigned int lowest_distance;
1621 unsigned int temp_distance;
1625 lowest_distance = -1;
1627 if (k_buckets[lowest_bucket].peers_size == 0)
1630 current_closest = NULL;
1631 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1633 pos = k_buckets[bucket].head;
1635 while ((pos != NULL) && (count < bucket_size))
1637 temp_distance = distance(&pos->id.hashPubKey, hc);
1638 if (temp_distance <= lowest_distance)
1640 lowest_distance = temp_distance;
1641 current_closest = pos;
1647 GNUNET_assert(current_closest != NULL);
1648 return current_closest;
1653 * Function called to send a request out to another peer.
1654 * Called both for locally initiated requests and those
1655 * received from other peers.
1657 * @param msg the encapsulated message
1658 * @param peer the peer to forward the message to
1659 * @param msg_ctx the context of the message (hop count, bloom, etc.)
1661 static void forward_message (const struct GNUNET_MessageHeader *msg,
1662 struct PeerInfo *peer,
1663 struct DHT_MessageContext *msg_ctx)
1665 struct GNUNET_DHT_P2PRouteMessage *route_message;
1666 struct P2PPendingMessage *pending;
1670 increment_stats(STAT_ROUTE_FORWARDS);
1671 GNUNET_assert(peer != NULL);
1672 if ((msg_ctx->closest != GNUNET_YES) && (peer == find_closest_peer(&msg_ctx->key)))
1673 increment_stats(STAT_ROUTE_FORWARDS_CLOSEST);
1675 msize = sizeof (struct GNUNET_DHT_P2PRouteMessage) + ntohs(msg->size);
1676 GNUNET_assert(msize <= GNUNET_SERVER_MAX_MESSAGE_SIZE);
1677 psize = sizeof(struct P2PPendingMessage) + msize;
1678 pending = GNUNET_malloc(psize);
1679 pending->msg = (struct GNUNET_MessageHeader *)&pending[1];
1680 pending->importance = msg_ctx->importance;
1681 pending->timeout = msg_ctx->timeout;
1682 route_message = (struct GNUNET_DHT_P2PRouteMessage *)pending->msg;
1683 route_message->header.size = htons(msize);
1684 route_message->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE);
1685 route_message->options = htonl(msg_ctx->msg_options);
1686 route_message->hop_count = htonl(msg_ctx->hop_count + 1);
1687 route_message->network_size = htonl(msg_ctx->network_size);
1688 route_message->desired_replication_level = htonl(msg_ctx->replication);
1689 route_message->unique_id = GNUNET_htonll(msg_ctx->unique_id);
1690 if (msg_ctx->bloom != NULL)
1691 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(msg_ctx->bloom, route_message->bloomfilter, DHT_BLOOM_SIZE));
1692 memcpy(&route_message->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
1693 memcpy(&route_message[1], msg, ntohs(msg->size));
1695 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));
1697 GNUNET_CONTAINER_DLL_insert_after(peer->head, peer->tail, peer->tail, pending);
1698 if (peer->send_task == GNUNET_SCHEDULER_NO_TASK)
1699 peer->send_task = GNUNET_SCHEDULER_add_now(&try_core_send, peer);
1704 * Task used to send ping messages to peers so that
1705 * they don't get disconnected.
1707 * @param cls the peer to send a ping message to
1708 * @param tc context, reason, etc.
1711 periodic_ping_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1713 struct PeerInfo *peer = cls;
1714 struct GNUNET_MessageHeader ping_message;
1715 struct DHT_MessageContext msg_ctx;
1717 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
1720 ping_message.size = htons(sizeof(struct GNUNET_MessageHeader));
1721 ping_message.type = htons(GNUNET_MESSAGE_TYPE_DHT_P2P_PING);
1723 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
1725 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Sending periodic ping to %s\n", my_short_id, "DHT", GNUNET_i2s(&peer->id));
1727 forward_message(&ping_message, peer, &msg_ctx);
1728 peer->ping_task = GNUNET_SCHEDULER_add_delayed(DHT_DEFAULT_PING_DELAY, &periodic_ping_task, peer);
1732 * Schedule PING messages for the top X peers in each
1733 * bucket of the routing table (so core won't disconnect them!)
1735 void schedule_ping_messages()
1737 unsigned int bucket;
1739 struct PeerInfo *pos;
1740 for (bucket = lowest_bucket; bucket < MAX_BUCKETS; bucket++)
1742 pos = k_buckets[bucket].head;
1746 if ((count < bucket_size) && (pos->ping_task == GNUNET_SCHEDULER_NO_TASK))
1747 GNUNET_SCHEDULER_add_now(&periodic_ping_task, pos);
1748 else if ((count >= bucket_size) && (pos->ping_task != GNUNET_SCHEDULER_NO_TASK))
1750 GNUNET_SCHEDULER_cancel(pos->ping_task);
1751 pos->ping_task = GNUNET_SCHEDULER_NO_TASK;
1761 * Attempt to add a peer to our k-buckets.
1763 * @param peer the peer identity of the peer being added
1764 * @param bucket the bucket that we want this peer to go in
1765 * @param latency transport latency of this peer
1766 * @param distance transport distance to this peer
1768 * @return NULL if the peer was not added,
1769 * pointer to PeerInfo for new peer otherwise
1771 static struct PeerInfo *
1772 try_add_peer(const struct GNUNET_PeerIdentity *peer,
1773 unsigned int bucket,
1774 const struct GNUNET_TRANSPORT_ATS_Information *atsi)
1777 struct PeerInfo *new_peer;
1779 if (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity)))
1782 peer_bucket = find_current_bucket(&peer->hashPubKey);
1784 GNUNET_assert(peer_bucket >= lowest_bucket);
1785 new_peer = add_peer(peer, peer_bucket, atsi);
1787 if ((k_buckets[lowest_bucket].peers_size) >= bucket_size)
1788 enable_next_bucket();
1790 schedule_ping_messages();
1797 * Task run to check for messages that need to be sent to a client.
1799 * @param client a ClientList, containing the client and any messages to be sent to it
1802 process_pending_messages (struct ClientList *client)
1804 if (client->pending_head == NULL)
1806 if (client->transmit_handle != NULL)
1809 client->transmit_handle =
1810 GNUNET_SERVER_notify_transmit_ready (client->client_handle,
1811 ntohs (client->pending_head->msg->
1813 GNUNET_TIME_UNIT_FOREVER_REL,
1814 &send_generic_reply, client);
1818 * Callback called as a result of issuing a GNUNET_SERVER_notify_transmit_ready
1819 * request. A ClientList is passed as closure, take the head of the list
1820 * and copy it into buf, which has the result of sending the message to the
1823 * @param cls closure to this call
1824 * @param size maximum number of bytes available to send
1825 * @param buf where to copy the actual message to
1827 * @return the number of bytes actually copied, 0 indicates failure
1830 send_generic_reply (void *cls, size_t size, void *buf)
1832 struct ClientList *client = cls;
1834 struct PendingMessage *reply;
1838 client->transmit_handle = NULL;
1841 /* client disconnected */
1845 while ( (NULL != (reply = client->pending_head)) &&
1846 (size >= off + (msize = ntohs (reply->msg->size))))
1848 GNUNET_CONTAINER_DLL_remove (client->pending_head,
1849 client->pending_tail,
1851 memcpy (&cbuf[off], reply->msg, msize);
1852 GNUNET_free (reply);
1855 process_pending_messages (client);
1857 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1858 "Transmitted %u bytes of replies to client\n",
1859 (unsigned int) off);
1866 * Add a PendingMessage to the clients list of messages to be sent
1868 * @param client the active client to send the message to
1869 * @param pending_message the actual message to send
1872 add_pending_message (struct ClientList *client,
1873 struct PendingMessage *pending_message)
1875 GNUNET_CONTAINER_DLL_insert_after (client->pending_head,
1876 client->pending_tail,
1877 client->pending_tail,
1879 process_pending_messages (client);
1884 * Called when a reply needs to be sent to a client, as
1885 * a result it found to a GET or FIND PEER request.
1887 * @param client the client to send the reply to
1888 * @param message the encapsulated message to send
1889 * @param uid the unique identifier of this request
1892 send_reply_to_client (struct ClientList *client,
1893 const struct GNUNET_MessageHeader *message,
1894 unsigned long long uid,
1895 const GNUNET_HashCode *key)
1897 struct GNUNET_DHT_RouteResultMessage *reply;
1898 struct PendingMessage *pending_message;
1902 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1903 "`%s:%s': Sending reply to client.\n", my_short_id, "DHT");
1905 msize = ntohs (message->size);
1906 tsize = sizeof (struct GNUNET_DHT_RouteResultMessage) + msize;
1907 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
1909 GNUNET_break_op (0);
1912 pending_message = GNUNET_malloc (sizeof (struct PendingMessage) + tsize);
1913 pending_message->msg = (struct GNUNET_MessageHeader *)&pending_message[1];
1914 reply = (struct GNUNET_DHT_RouteResultMessage *)&pending_message[1];
1915 reply->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_RESULT);
1916 reply->header.size = htons (tsize);
1917 reply->put_path_length = htons(0); /* FIXME: implement */
1918 reply->get_path_length = htons(0); /* FIXME: implement */
1919 reply->unique_id = GNUNET_htonll (uid);
1921 memcpy (&reply[1], message, msize);
1922 add_pending_message (client, pending_message);
1926 * Consider whether or not we would like to have this peer added to
1927 * our routing table. Check whether bucket for this peer is full,
1928 * if so return negative; if not return positive. Since peers are
1929 * only added on CORE level connect, this doesn't actually add the
1930 * peer to the routing table.
1932 * @param peer the peer we are considering adding
1934 * @return GNUNET_YES if we want this peer, GNUNET_NO if not (bucket
1937 static int consider_peer (struct GNUNET_PeerIdentity *peer)
1941 if ((GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey)) || (0 == memcmp(&my_identity, peer, sizeof(struct GNUNET_PeerIdentity))))
1942 return GNUNET_NO; /* We already know this peer (are connected even!) */
1943 bucket = find_current_bucket(&peer->hashPubKey);
1945 if ((k_buckets[bucket].peers_size < bucket_size) || ((bucket == lowest_bucket) && (lowest_bucket > 0)))
1952 * Main function that handles whether or not to route a result
1953 * message to other peers, or to send to our local client.
1955 * @param msg the result message to be routed
1956 * @param msg_ctx context of the message we are routing
1958 * @return the number of peers the message was routed to,
1959 * GNUNET_SYSERR on failure
1961 static int route_result_message(struct GNUNET_MessageHeader *msg,
1962 struct DHT_MessageContext *msg_ctx)
1964 struct GNUNET_PeerIdentity new_peer;
1965 struct DHTQueryRecord *record;
1966 struct DHTRouteSource *pos;
1967 struct PeerInfo *peer_info;
1968 const struct GNUNET_MessageHeader *hello_msg;
1970 increment_stats(STAT_RESULTS);
1972 * If a find peer result message is received and contains a valid
1973 * HELLO for another peer, offer it to the transport service.
1975 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT)
1977 if (ntohs(msg->size) <= sizeof(struct GNUNET_MessageHeader))
1980 hello_msg = &msg[1];
1981 if ((ntohs(hello_msg->type) != GNUNET_MESSAGE_TYPE_HELLO) || (GNUNET_SYSERR == GNUNET_HELLO_get_id((const struct GNUNET_HELLO_Message *)hello_msg, &new_peer)))
1983 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s:%s Received non-HELLO message type in find peer result message!\n", my_short_id, "DHT");
1987 else /* We have a valid hello, and peer id stored in new_peer */
1989 find_peer_context.count++;
1990 increment_stats(STAT_FIND_PEER_REPLY);
1991 if (GNUNET_YES == consider_peer(&new_peer))
1993 increment_stats(STAT_HELLOS_PROVIDED);
1994 GNUNET_TRANSPORT_offer_hello(transport_handle, hello_msg);
1995 GNUNET_CORE_peer_request_connect(coreAPI,
1996 GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &new_peer, NULL, NULL);
2001 if (malicious_dropper == GNUNET_YES)
2004 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &msg_ctx->key);
2006 if (record == NULL) /* No record of this message! */
2009 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2010 "`%s:%s': Have no record of response key %s uid %llu\n", my_short_id,
2011 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2013 #if DEBUG_DHT_ROUTING
2014 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2016 dhtlog_handle->insert_route (NULL,
2023 msg_ctx->peer, NULL);
2026 if (msg_ctx->bloom != NULL)
2028 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
2029 msg_ctx->bloom = NULL;
2037 #if STRICT_FORWARDING
2038 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT) /* If we have already forwarded this peer id, don't do it again! */
2040 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (pos->find_peers_responded, &new_peer.hashPubKey))
2042 increment_stats("# find peer responses NOT forwarded (bloom match)");
2047 GNUNET_CONTAINER_bloomfilter_add(pos->find_peers_responded, &new_peer.hashPubKey);
2051 if (0 == memcmp(&pos->source, &my_identity, sizeof(struct GNUNET_PeerIdentity))) /* Local client (or DHT) initiated request! */
2054 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2055 "`%s:%s': Sending response key %s uid %llu to client\n", my_short_id,
2056 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
2058 #if DEBUG_DHT_ROUTING
2059 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2061 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_RESULT,
2063 GNUNET_YES, &my_identity, &msg_ctx->key,
2064 msg_ctx->peer, NULL);
2067 increment_stats(STAT_RESULTS_TO_CLIENT);
2068 if (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET_RESULT)
2069 increment_stats(STAT_GET_REPLY);
2071 send_reply_to_client(pos->client, msg,
2075 else /* Send to peer */
2077 peer_info = find_peer_by_id(&pos->source);
2078 if (peer_info == NULL) /* Didn't find the peer in our routing table, perhaps peer disconnected! */
2084 if (msg_ctx->bloom == NULL)
2085 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2086 GNUNET_CONTAINER_bloomfilter_add (msg_ctx->bloom, &my_identity.hashPubKey);
2087 if ((GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (msg_ctx->bloom, &peer_info->id.hashPubKey)))
2090 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2091 "`%s:%s': Forwarding response key %s uid %llu to peer %s\n", my_short_id,
2092 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&peer_info->id));
2094 #if DEBUG_DHT_ROUTING
2095 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2097 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id,
2100 GNUNET_NO, &my_identity, &msg_ctx->key,
2101 msg_ctx->peer, &pos->source);
2104 forward_result_message(msg, peer_info, msg_ctx);
2109 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2110 "`%s:%s': NOT Forwarding response (bloom match) key %s uid %llu to peer %s\n", my_short_id,
2111 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&peer_info->id));
2117 if (msg_ctx->bloom != NULL)
2118 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
2123 * Iterator for local get request results,
2125 * @param cls closure for iterator, a DatacacheGetContext
2126 * @param exp when does this value expire?
2127 * @param key the key this data is stored under
2128 * @param size the size of the data identified by key
2129 * @param data the actual data
2130 * @param type the type of the data
2132 * @return GNUNET_OK to continue iteration, anything else
2133 * to stop iteration.
2136 datacache_get_iterator (void *cls,
2137 struct GNUNET_TIME_Absolute exp,
2138 const GNUNET_HashCode * key,
2139 size_t size, const char *data,
2140 enum GNUNET_BLOCK_Type type)
2142 struct DHT_MessageContext *msg_ctx = cls;
2143 struct DHT_MessageContext *new_msg_ctx;
2144 struct GNUNET_DHT_GetResultMessage *get_result;
2145 enum GNUNET_BLOCK_EvaluationResult eval;
2148 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2149 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
2151 eval = GNUNET_BLOCK_evaluate (block_context,
2155 msg_ctx->reply_bf_mutator,
2157 msg_ctx->xquery_size,
2162 case GNUNET_BLOCK_EVALUATION_OK_LAST:
2163 msg_ctx->do_forward = GNUNET_NO;
2164 case GNUNET_BLOCK_EVALUATION_OK_MORE:
2165 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2166 memcpy(new_msg_ctx, msg_ctx, sizeof(struct DHT_MessageContext));
2168 GNUNET_malloc (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2169 get_result->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_GET_RESULT);
2170 get_result->header.size =
2171 htons (sizeof (struct GNUNET_DHT_GetResultMessage) + size);
2172 get_result->expiration = GNUNET_TIME_absolute_hton(exp);
2173 get_result->type = htons (type);
2174 memcpy (&get_result[1], data, size);
2175 new_msg_ctx->peer = &my_identity;
2176 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2177 new_msg_ctx->hop_count = 0;
2178 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make result routing a higher priority */
2179 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2180 increment_stats(STAT_GET_RESPONSE_START);
2181 route_result_message(&get_result->header, new_msg_ctx);
2182 GNUNET_free(new_msg_ctx);
2183 GNUNET_free (get_result);
2185 case GNUNET_BLOCK_EVALUATION_OK_DUPLICATE:
2187 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2188 "`%s:%s': Duplicate block error\n", my_short_id, "DHT");
2191 case GNUNET_BLOCK_EVALUATION_RESULT_INVALID:
2193 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2194 "`%s:%s': Invalid request error\n", my_short_id, "DHT");
2197 case GNUNET_BLOCK_EVALUATION_REQUEST_VALID:
2199 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2200 "`%s:%s': Valid request, no results.\n", my_short_id, "DHT");
2204 case GNUNET_BLOCK_EVALUATION_REQUEST_INVALID:
2205 GNUNET_break_op (0);
2206 msg_ctx->do_forward = GNUNET_NO;
2208 case GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED:
2210 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2211 "`%s:%s': Unsupported block type (%u) in response!\n", my_short_id, "DHT", type);
2213 /* msg_ctx->do_forward = GNUNET_NO; // not sure... */
2221 * Main function that handles whether or not to route a message to other
2224 * @param msg the message to be routed
2225 * @param msg_ctx the context containing all pertinent information about the message
2228 route_message(const struct GNUNET_MessageHeader *msg,
2229 struct DHT_MessageContext *msg_ctx);
2233 * Server handler for all dht get requests, look for data,
2234 * if found, send response either to clients or other peers.
2236 * @param msg the actual get message
2237 * @param msg_ctx struct containing pertinent information about the get request
2239 * @return number of items found for GET request
2242 handle_dht_get (const struct GNUNET_MessageHeader *msg,
2243 struct DHT_MessageContext *msg_ctx)
2245 const struct GNUNET_DHT_GetMessage *get_msg;
2248 unsigned int results;
2250 enum GNUNET_BLOCK_Type type;
2252 msize = ntohs (msg->size);
2253 if (msize < sizeof (struct GNUNET_DHT_GetMessage))
2258 get_msg = (const struct GNUNET_DHT_GetMessage *) msg;
2259 bf_size = ntohs (get_msg->bf_size);
2260 msg_ctx->xquery_size = ntohs (get_msg->xquery_size);
2261 msg_ctx->reply_bf_mutator = get_msg->bf_mutator; /* FIXME: ntohl? */
2262 if (msize != sizeof (struct GNUNET_DHT_GetMessage) + bf_size + msg_ctx->xquery_size)
2267 end = (const char*) &get_msg[1];
2268 if (msg_ctx->xquery_size == 0)
2270 msg_ctx->xquery = NULL;
2274 msg_ctx->xquery = (const void*) end;
2275 end += msg_ctx->xquery_size;
2279 msg_ctx->reply_bf = NULL;
2283 msg_ctx->reply_bf = GNUNET_CONTAINER_bloomfilter_init (end,
2285 GNUNET_DHT_GET_BLOOMFILTER_K);
2287 type = (enum GNUNET_BLOCK_Type) ntohl (get_msg->type);
2289 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2290 "`%s:%s': Received `%s' request, message type %u, key %s, uid %llu\n",
2294 GNUNET_h2s (&msg_ctx->key),
2295 msg_ctx->unique_id);
2297 increment_stats(STAT_GETS);
2300 if (type == GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE)
2302 GNUNET_CONTAINER_bloomfilter_free (msg_ctx->reply_bf);
2306 msg_ctx->do_forward = GNUNET_YES;
2307 if (datacache != NULL)
2309 = GNUNET_DATACACHE_get (datacache,
2310 &msg_ctx->key, type,
2311 &datacache_get_iterator,
2314 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2315 "`%s:%s': Found %d results for `%s' request uid %llu\n", my_short_id, "DHT",
2316 results, "GET", msg_ctx->unique_id);
2320 #if DEBUG_DHT_ROUTING
2321 if ((debug_routes) && (dhtlog_handle != NULL))
2323 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_GET,
2324 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2328 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2330 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
2331 msg_ctx->hop_count, GNUNET_YES,
2332 &my_identity, &msg_ctx->key, msg_ctx->peer,
2339 /* check query valid */
2340 if (GNUNET_BLOCK_EVALUATION_REQUEST_INVALID
2341 == GNUNET_BLOCK_evaluate (block_context,
2345 msg_ctx->reply_bf_mutator,
2347 msg_ctx->xquery_size,
2350 GNUNET_break_op (0);
2351 msg_ctx->do_forward = GNUNET_NO;
2355 if (msg_ctx->hop_count == 0) /* Locally initiated request */
2357 #if DEBUG_DHT_ROUTING
2358 if ((debug_routes) && (dhtlog_handle != NULL))
2360 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_GET,
2361 msg_ctx->hop_count, GNUNET_NO, &my_identity,
2366 if (msg_ctx->do_forward == GNUNET_YES)
2367 route_message (msg, msg_ctx);
2368 GNUNET_CONTAINER_bloomfilter_free (msg_ctx->reply_bf);
2373 remove_recent_find_peer(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
2375 GNUNET_HashCode *key = cls;
2377 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent_find_peer_requests, key, NULL));
2382 * Server handler for initiating local dht find peer requests
2384 * @param find_msg the actual find peer message
2385 * @param msg_ctx struct containing pertinent information about the request
2389 handle_dht_find_peer (const struct GNUNET_MessageHeader *find_msg,
2390 struct DHT_MessageContext *msg_ctx)
2392 struct GNUNET_MessageHeader *find_peer_result;
2393 struct GNUNET_DHT_FindPeerMessage *find_peer_message;
2394 struct DHT_MessageContext *new_msg_ctx;
2395 struct GNUNET_CONTAINER_BloomFilter *incoming_bloom;
2398 GNUNET_HashCode *recent_hash;
2399 struct GNUNET_MessageHeader *other_hello;
2400 size_t other_hello_size;
2401 struct GNUNET_PeerIdentity peer_id;
2403 find_peer_message = (struct GNUNET_DHT_FindPeerMessage *)find_msg;
2404 GNUNET_break_op(ntohs(find_msg->size) >= (sizeof(struct GNUNET_DHT_FindPeerMessage)));
2405 if (ntohs(find_msg->size) < sizeof(struct GNUNET_DHT_FindPeerMessage))
2408 other_hello_size = 0;
2409 if (ntohs(find_msg->size) > sizeof(struct GNUNET_DHT_FindPeerMessage))
2411 other_hello_size = ntohs(find_msg->size) - sizeof(struct GNUNET_DHT_FindPeerMessage);
2412 other_hello = GNUNET_malloc(other_hello_size);
2413 memcpy(other_hello, &find_peer_message[1], other_hello_size);
2414 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)))
2416 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Received invalid HELLO message in find peer request!\n");
2417 GNUNET_free(other_hello);
2420 #if FIND_PEER_WITH_HELLO
2421 if (GNUNET_YES == consider_peer(&peer_id))
2423 increment_stats(STAT_HELLOS_PROVIDED);
2424 GNUNET_TRANSPORT_offer_hello(transport_handle, other_hello);
2425 GNUNET_CORE_peer_request_connect(coreAPI,
2426 GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 5), &peer_id, NULL, NULL);
2427 route_message (find_msg, msg_ctx);
2428 GNUNET_free (other_hello);
2431 else /* We don't want this peer! */
2433 route_message (find_msg, msg_ctx);
2434 GNUNET_free (other_hello);
2441 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2442 "`%s:%s': Received `%s' request from client, key %s (msg size %d, we expected %d)\n",
2443 my_short_id, "DHT", "FIND PEER", GNUNET_h2s (&msg_ctx->key),
2444 ntohs (find_msg->size),
2445 sizeof (struct GNUNET_MessageHeader));
2447 if (my_hello == NULL)
2450 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2451 "`%s': Our HELLO is null, can't return.\n",
2454 GNUNET_free_non_null (other_hello);
2455 route_message (find_msg, msg_ctx);
2459 incoming_bloom = GNUNET_CONTAINER_bloomfilter_init(find_peer_message->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2460 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(incoming_bloom, &my_identity.hashPubKey))
2462 increment_stats(STAT_BLOOM_FIND_PEER);
2463 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2464 GNUNET_free_non_null(other_hello);
2465 route_message (find_msg, msg_ctx);
2466 return; /* We match the bloomfilter, do not send a response to this peer (they likely already know us!)*/
2468 GNUNET_CONTAINER_bloomfilter_free(incoming_bloom);
2470 #if RESTRICT_FIND_PEER
2473 * Ignore any find peer requests from a peer we have seen very recently.
2475 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(recent_find_peer_requests, &msg_ctx->key)) /* We have recently responded to a find peer request for this peer! */
2477 increment_stats("# dht find peer requests ignored (recently seen!)");
2478 GNUNET_free_non_null(other_hello);
2483 * Use this check to only allow the peer to respond to find peer requests if
2484 * it would be beneficial to have the requesting peer in this peers routing
2485 * table. Can be used to thwart peers flooding the network with find peer
2486 * requests that we don't care about. However, if a new peer is joining
2487 * the network and has no other peers this is a problem (assume all buckets
2488 * full, no one will respond!).
2490 memcpy(&peer_id.hashPubKey, &msg_ctx->key, sizeof(GNUNET_HashCode));
2491 if (GNUNET_NO == consider_peer(&peer_id))
2493 increment_stats("# dht find peer requests ignored (do not need!)");
2494 GNUNET_free_non_null(other_hello);
2495 route_message (find_msg, msg_ctx);
2500 recent_hash = GNUNET_malloc(sizeof(GNUNET_HashCode));
2501 memcpy(recent_hash, &msg_ctx->key, sizeof(GNUNET_HashCode));
2502 if (GNUNET_SYSERR != GNUNET_CONTAINER_multihashmap_put (recent_find_peer_requests,
2503 &msg_ctx->key, NULL,
2504 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
2506 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Adding recent remove task for key `%s`!\n", GNUNET_h2s(&msg_ctx->key));
2507 /* Only add a task if there wasn't one for this key already! */
2508 GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30),
2509 &remove_recent_find_peer, recent_hash);
2513 GNUNET_free(recent_hash);
2514 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Received duplicate find peer request too soon!\n");
2517 /* Simplistic find_peer functionality, always return our hello */
2518 hello_size = ntohs(my_hello->size);
2519 tsize = hello_size + sizeof (struct GNUNET_MessageHeader);
2521 if (tsize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
2523 GNUNET_break_op (0);
2524 GNUNET_free_non_null(other_hello);
2528 find_peer_result = GNUNET_malloc (tsize);
2529 find_peer_result->type = htons (GNUNET_MESSAGE_TYPE_DHT_FIND_PEER_RESULT);
2530 find_peer_result->size = htons (tsize);
2531 memcpy (&find_peer_result[1], my_hello, hello_size);
2533 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2534 "`%s': Sending hello size %d to requesting peer.\n",
2537 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
2538 memcpy(new_msg_ctx, msg_ctx, sizeof(struct DHT_MessageContext));
2539 new_msg_ctx->peer = &my_identity;
2540 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
2541 new_msg_ctx->hop_count = 0;
2542 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make find peer requests a higher priority */
2543 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
2544 increment_stats(STAT_FIND_PEER_ANSWER);
2545 route_result_message(find_peer_result, new_msg_ctx);
2546 GNUNET_free(new_msg_ctx);
2547 #if DEBUG_DHT_ROUTING
2548 if ((debug_routes) && (dhtlog_handle != NULL))
2550 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_FIND_PEER,
2551 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2555 GNUNET_free_non_null(other_hello);
2556 GNUNET_free(find_peer_result);
2557 route_message (find_msg, msg_ctx);
2561 * Task used to republish data.
2562 * Forward declaration; function call loop.
2564 * @param cls closure (a struct RepublishContext)
2565 * @param tc runtime context for this task
2568 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc);
2571 * Server handler for initiating local dht put requests
2573 * @param msg the actual put message
2574 * @param msg_ctx struct containing pertinent information about the request
2577 handle_dht_put (const struct GNUNET_MessageHeader *msg,
2578 struct DHT_MessageContext *msg_ctx)
2580 const struct GNUNET_DHT_PutMessage *put_msg;
2581 enum GNUNET_BLOCK_Type put_type;
2584 struct RepublishContext *put_context;
2585 GNUNET_HashCode key;
2587 GNUNET_assert (ntohs (msg->size) >=
2588 sizeof (struct GNUNET_DHT_PutMessage));
2591 put_msg = (const struct GNUNET_DHT_PutMessage *)msg;
2592 put_type = (enum GNUNET_BLOCK_Type) ntohl (put_msg->type);
2594 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) &&
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 (&msg_ctx->key), msg_ctx->unique_id);
2625 #if DEBUG_DHT_ROUTING
2626 if (msg_ctx->hop_count == 0) /* Locally initiated request */
2628 if ((debug_routes) && (dhtlog_handle != NULL))
2630 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_PUT,
2631 msg_ctx->hop_count, GNUNET_NO, &my_identity,
2637 if (msg_ctx->closest != GNUNET_YES)
2639 route_message (msg, msg_ctx);
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 (&msg_ctx->key), msg_ctx->unique_id);
2649 #if DEBUG_DHT_ROUTING
2650 if ((debug_routes_extended) && (dhtlog_handle != NULL))
2652 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
2653 msg_ctx->hop_count, GNUNET_YES,
2654 &my_identity, &msg_ctx->key, msg_ctx->peer,
2658 if ((debug_routes) && (dhtlog_handle != NULL))
2660 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_PUT,
2661 msg_ctx->hop_count, GNUNET_YES, &my_identity,
2666 increment_stats(STAT_PUTS_INSERTED);
2667 if (datacache != NULL)
2669 ret = GNUNET_DATACACHE_put (datacache, &msg_ctx->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, &msg_ctx->key, sizeof(GNUNET_HashCode));
2677 put_context->type = put_type;
2678 GNUNET_SCHEDULER_add_delayed (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, msg_ctx);
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 * returns: target_replication / (est. hops) + (target_replication * hop_count)
2715 * where est. hops is typically 2 * the routing table depth
2717 * @param hop_count number of hops the message has traversed
2718 * @param target_replication the number of total paths desired
2720 * @return Some number of peers to forward the message to
2723 get_forward_count (unsigned int hop_count, size_t target_replication)
2725 uint32_t random_value;
2726 unsigned int forward_count;
2727 unsigned int target_value;
2728 unsigned int diameter;
2731 * If we are behaving in strict kademlia mode, send multiple initial requests,
2732 * but then only send to 1 or 0 peers based strictly on the number of hops.
2734 if (strict_kademlia == GNUNET_YES)
2737 return DHT_KADEMLIA_REPLICATION;
2738 else if (hop_count < max_hops)
2744 /* FIXME: the smaller we think the network is the more lenient we should be for
2745 * routing right? The estimation below only works if we think we have reasonably
2746 * full routing tables, which for our RR topologies may not be the case!
2748 diameter = estimate_diameter ();
2749 if ((hop_count > (diameter + 1) * 2) && (MINIMUM_PEER_THRESHOLD < estimate_diameter() * bucket_size) && (use_max_hops == GNUNET_NO))
2752 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2753 "`%s:%s': Hop count too high (est %d, lowest %d), NOT Forwarding request\n", my_short_id,
2754 "DHT", estimate_diameter(), lowest_bucket);
2758 else if (hop_count > max_hops)
2761 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2762 "`%s:%s': Hop count too high (greater than max)\n", my_short_id,
2769 target_value = target_replication / ((2.0 * (diameter)) + ((float)target_replication * hop_count));
2770 if (target_value > 1)
2771 return (unsigned int)target_value;
2773 random_value = GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_STRONG, (unsigned int)-1);
2775 if (random_value < (target_value * (unsigned int)-1))
2780 return forward_count;
2784 * Check whether my identity is closer than any known peers.
2785 * If a non-null bloomfilter is given, check if this is the closest
2786 * peer that hasn't already been routed to.
2788 * @param target hash code to check closeness to
2789 * @param bloom bloomfilter, exclude these entries from the decision
2791 * Return GNUNET_YES if node location is closest, GNUNET_NO
2795 am_closest_peer (const GNUNET_HashCode * target, struct GNUNET_CONTAINER_BloomFilter *bloom)
2801 struct PeerInfo *pos;
2802 unsigned int my_distance;
2804 if (0 == memcmp(&my_identity.hashPubKey, target, sizeof(GNUNET_HashCode)))
2807 bucket_num = find_current_bucket(target);
2809 bits = GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, target);
2810 my_distance = distance(&my_identity.hashPubKey, target);
2811 pos = k_buckets[bucket_num].head;
2813 while ((pos != NULL) && (count < bucket_size))
2815 if ((bloom != NULL) && (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test(bloom, &pos->id.hashPubKey)))
2818 continue; /* Skip already checked entries */
2821 other_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
2822 if (other_bits > bits)
2824 else if (other_bits == bits) /* We match the same number of bits, do distance comparison */
2826 if (strict_kademlia != GNUNET_YES) /* Return that we at as close as any other peer */
2828 else if (distance(&pos->id.hashPubKey, target) < my_distance) /* Check all known peers, only return if we are the true closest */
2834 /* No peers closer, we are the closest! */
2840 * Return this peers adjusted value based on the convergence
2841 * function chosen. This is the key function for randomized
2842 * routing decisions.
2844 * @param target the key of the request
2845 * @param peer the peer we would like the value of
2846 * @param hops number of hops this message has already traveled
2848 * @return bit distance from target to peer raised to an exponent
2849 * adjusted based on the current routing convergence algorithm
2852 static unsigned long long
2853 converge_distance (const GNUNET_HashCode *target,
2854 struct PeerInfo *peer,
2857 unsigned long long ret;
2858 unsigned int other_matching_bits;
2859 double base_converge_modifier = .1; /* Value that "looks" good (when plotted), have to start somewhere */
2860 double temp_modifier;
2866 curr_max_hops = max_hops;
2868 curr_max_hops = (estimate_diameter() + 1) * 2;
2870 if (converge_modifier > 0)
2871 temp_modifier = converge_modifier * base_converge_modifier;
2874 temp_modifier = base_converge_modifier;
2875 base_converge_modifier = 0.0;
2878 GNUNET_assert(temp_modifier > 0);
2880 other_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &peer->id.hashPubKey);
2882 switch (converge_option)
2884 case DHT_CONVERGE_RANDOM:
2885 return 1; /* Always return 1, choose equally among all peers */
2886 case DHT_CONVERGE_LINEAR:
2887 calc_value = hops * curr_max_hops * temp_modifier;
2889 case DHT_CONVERGE_SQUARE:
2891 * Simple square based curve.
2893 calc_value = (sqrt(hops) / sqrt(curr_max_hops)) * (curr_max_hops / (curr_max_hops * temp_modifier));
2895 case DHT_CONVERGE_EXPONENTIAL:
2897 * Simple exponential curve.
2899 if (base_converge_modifier > 0)
2900 calc_value = (temp_modifier * hops * hops) / curr_max_hops;
2902 calc_value = (hops * hops) / curr_max_hops;
2904 case DHT_CONVERGE_BINARY:
2906 * If below the cutoff, route randomly (return 1),
2907 * If above the cutoff, return the maximum possible
2908 * value first (always route to closest, because
2912 if (hops > converge_modifier) /* Past cutoff */
2921 /* Take the log (base e) of the number of bits matching the other peer */
2922 exponent = log(other_matching_bits);
2924 /* Check if we would overflow; our largest possible value is 2^64 approx. e^44.361419555836498 */
2925 if (exponent * calc_value >= 44.361419555836498)
2928 /* Clear errno and all math exceptions */
2930 feclearexcept(FE_ALL_EXCEPT);
2931 ret = (unsigned long long)pow(other_matching_bits, calc_value);
2932 if ((errno != 0) || fetestexcept(FE_INVALID | FE_DIVBYZERO | FE_OVERFLOW |
2935 if (0 != fetestexcept(FE_OVERFLOW))
2936 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_OVERFLOW\n");
2937 if (0 != fetestexcept(FE_INVALID))
2938 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_INVALID\n");
2939 if (0 != fetestexcept(FE_UNDERFLOW))
2940 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "FE_UNDERFLOW\n");
2948 * Comparison function for two struct PeerInfo's
2949 * which have already had their matching bits to
2950 * some target calculated.
2952 * @param p1 a pointer pointer to a struct PeerInfo
2953 * @param p2 a pointer pointer to a struct PeerInfo
2955 * @return 0 if equidistant to target,
2956 * -1 if p1 is closer,
2960 compare_peers (const void *p1, const void *p2)
2962 struct PeerInfo **first = (struct PeerInfo **)p1;
2963 struct PeerInfo **second = (struct PeerInfo **)p2;
2965 if ((*first)->matching_bits > (*second)->matching_bits)
2967 if ((*first)->matching_bits < (*second)->matching_bits)
2975 * Select a peer from the routing table that would be a good routing
2976 * destination for sending a message for "target". The resulting peer
2977 * must not be in the set of blocked peers.<p>
2979 * Note that we should not ALWAYS select the closest peer to the
2980 * target, peers further away from the target should be chosen with
2981 * exponentially declining probability.
2983 * @param target the key we are selecting a peer to route to
2984 * @param bloom a bloomfilter containing entries this request has seen already
2986 * @return Peer to route to, or NULL on error
2988 static struct PeerInfo *
2989 select_peer (const GNUNET_HashCode * target,
2990 struct GNUNET_CONTAINER_BloomFilter *bloom, unsigned int hops)
2995 unsigned int offset;
2996 unsigned int my_matching_bits;
2998 struct PeerInfo *pos;
2999 struct PeerInfo *sorted_closest[bucket_size];
3000 unsigned long long temp_converge_distance;
3001 unsigned long long total_distance;
3002 unsigned long long selected;
3004 unsigned long long stats_total_distance;
3008 unsigned int distance;
3009 unsigned int largest_distance;
3010 struct PeerInfo *chosen;
3012 my_matching_bits = GNUNET_CRYPTO_hash_matching_bits(target, &my_identity.hashPubKey);
3015 if (strict_kademlia == GNUNET_YES)
3017 largest_distance = 0;
3019 for (bc = lowest_bucket; bc < MAX_BUCKETS; bc++)
3021 pos = k_buckets[bc].head;
3023 while ((pos != NULL) && (count < bucket_size))
3025 /* If we are doing strict Kademlia routing, then checking the bloomfilter is basically cheating! */
3026 if (GNUNET_NO == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3028 distance = inverse_distance (target, &pos->id.hashPubKey);
3029 if (distance > largest_distance)
3032 largest_distance = distance;
3040 if ((largest_distance > 0) && (chosen != NULL))
3042 GNUNET_CONTAINER_bloomfilter_add(bloom, &chosen->id.hashPubKey);
3053 /* Three steps: order peers in closest bucket (most matching bits).
3054 * Then go over all LOWER buckets (matching same bits we do)
3055 * Then go over all HIGHER buckets (matching less then we do)
3058 closest_bucket = find_current_bucket(target);
3059 GNUNET_assert(closest_bucket >= lowest_bucket);
3060 pos = k_buckets[closest_bucket].head;
3062 offset = 0; /* Need offset as well as count in case peers are bloomfiltered */
3063 memset(sorted_closest, 0, sizeof(sorted_closest));
3064 /* Put any peers in the closest bucket in the sorting array */
3065 while ((pos != NULL) && (count < bucket_size))
3067 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3071 continue; /* Ignore bloomfiltered peers */
3073 pos->matching_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->id.hashPubKey, target);
3074 sorted_closest[offset] = pos;
3080 /* Sort the peers in descending order */
3081 qsort(&sorted_closest[0], offset, sizeof(struct PeerInfo *), &compare_peers);
3083 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3084 for (i = 0; i < offset; i++)
3086 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3087 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3088 break; /* Ignore bloomfiltered peers */
3089 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3090 total_distance += temp_converge_distance;
3092 break; /* overflow case */
3095 /* Now handle peers in lower buckets (matches same # of bits as target) */
3096 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3098 pos = k_buckets[bc].head;
3100 while ((pos != NULL) && (count < bucket_size))
3102 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3106 continue; /* Ignore bloomfiltered peers */
3108 temp_converge_distance = converge_distance(target, pos, hops);
3109 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3110 total_distance += temp_converge_distance;
3112 break; /* overflow case */
3118 /* Now handle all the further away peers */
3119 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3121 pos = k_buckets[bc].head;
3123 while ((pos != NULL) && (count < bucket_size))
3125 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3129 continue; /* Ignore bloomfiltered peers */
3131 temp_converge_distance = converge_distance(target, pos, hops);
3132 if ((temp_converge_distance <= ULLONG_MAX) && (total_distance + temp_converge_distance > total_distance)) /* Handle largest case and overflow */
3133 total_distance += temp_converge_distance;
3135 break; /* overflow case */
3141 if (total_distance == 0) /* No peers to select from! */
3143 increment_stats("# select_peer, total_distance == 0");
3147 #if DEBUG_DHT_ROUTING > 1
3150 /* Put the sorted closest peers into the possible bins first, in case of overflow. */
3151 stats_total_distance = 0;
3152 for (i = 0; i < offset; i++)
3154 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3155 break; /* Ignore bloomfiltered peers */
3156 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3157 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3158 stats_total_distance += temp_converge_distance;
3160 break; /* overflow case */
3161 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);
3164 /* Now handle peers in lower buckets (matches same # of bits as target) */
3165 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3167 pos = k_buckets[bc].head;
3169 while ((pos != NULL) && (count < bucket_size))
3171 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3175 continue; /* Ignore bloomfiltered peers */
3177 temp_converge_distance = converge_distance(target, pos, hops);
3178 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3179 stats_total_distance += temp_converge_distance;
3181 break; /* overflow case */
3182 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);
3188 /* Now handle all the further away peers */
3189 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3191 pos = k_buckets[bc].head;
3193 while ((pos != NULL) && (count < bucket_size))
3195 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3199 continue; /* Ignore bloomfiltered peers */
3201 temp_converge_distance = converge_distance(target, pos, hops);
3202 if ((temp_converge_distance <= ULLONG_MAX) && (stats_total_distance + temp_converge_distance > stats_total_distance)) /* Handle largest case and overflow */
3203 stats_total_distance += temp_converge_distance;
3205 break; /* overflow case */
3206 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);
3211 /* END PRINT STATS */
3214 /* Now actually choose a peer */
3215 selected = GNUNET_CRYPTO_random_u64 (GNUNET_CRYPTO_QUALITY_WEAK, total_distance);
3217 /* Go over closest sorted peers. */
3218 for (i = 0; i < offset; i++)
3220 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &sorted_closest[i]->id.hashPubKey))
3221 break; /* Ignore bloomfiltered peers */
3222 temp_converge_distance = converge_distance(target, sorted_closest[i], hops);
3223 if (temp_converge_distance >= selected)
3224 return sorted_closest[i];
3226 selected -= temp_converge_distance;
3229 /* Now handle peers in lower buckets (matches same # of bits as target) */
3230 for (bc = lowest_bucket; bc < closest_bucket; bc++)
3232 pos = k_buckets[bc].head;
3234 while ((pos != NULL) && (count < bucket_size))
3236 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3240 continue; /* Ignore bloomfiltered peers */
3242 temp_converge_distance = converge_distance(target, pos, hops);
3243 if (temp_converge_distance >= selected)
3246 selected -= temp_converge_distance;
3252 /* Now handle all the further away peers */
3253 for (bc = closest_bucket + 1; bc < MAX_BUCKETS; bc++)
3255 pos = k_buckets[bc].head;
3257 while ((pos != NULL) && (count < bucket_size))
3259 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (bloom, &pos->id.hashPubKey))
3263 continue; /* Ignore bloomfiltered peers */
3265 temp_converge_distance = converge_distance(target, pos, hops);
3266 if (temp_converge_distance >= selected)
3269 selected -= temp_converge_distance;
3275 increment_stats("# failed to select peer");
3281 * Task used to remove recent entries, either
3282 * after timeout, when full, or on shutdown.
3284 * @param cls the entry to remove
3285 * @param tc context, reason, etc.
3288 remove_recent (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3290 struct RecentRequest *req = cls;
3291 static GNUNET_HashCode hash;
3293 GNUNET_assert(req != NULL);
3294 hash_from_uid(req->uid, &hash);
3295 GNUNET_assert (GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(recent.hashmap, &hash, req));
3296 GNUNET_CONTAINER_heap_remove_node(recent.minHeap, req->heap_node);
3297 GNUNET_CONTAINER_bloomfilter_free(req->bloom);
3301 if ((tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN) && (0 == GNUNET_CONTAINER_multihashmap_size(recent.hashmap)) && (0 == GNUNET_CONTAINER_heap_get_size(recent.minHeap)))
3303 GNUNET_CONTAINER_multihashmap_destroy(recent.hashmap);
3304 GNUNET_CONTAINER_heap_destroy(recent.minHeap);
3311 * Task used to remove forwarding entries, either
3312 * after timeout, when full, or on shutdown.
3314 * @param cls the entry to remove
3315 * @param tc context, reason, etc.
3318 remove_forward_entry (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3320 struct DHTRouteSource *source_info = cls;
3321 struct DHTQueryRecord *record;
3322 source_info = GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, source_info->hnode);
3323 record = source_info->record;
3324 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, source_info);
3326 if (record->head == NULL) /* No more entries in DLL */
3328 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove (forward_list.hashmap, &record->key, record));
3329 GNUNET_free(record);
3331 if (source_info->find_peers_responded != NULL)
3332 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3333 GNUNET_free(source_info);
3337 * Remember this routing request so that if a reply is
3338 * received we can either forward it to the correct peer
3339 * or return the result locally.
3341 * @param msg_ctx Context of the route request
3343 * @return GNUNET_YES if this response was cached, GNUNET_NO if not
3345 static int cache_response(struct DHT_MessageContext *msg_ctx)
3347 struct DHTQueryRecord *record;
3348 struct DHTRouteSource *source_info;
3349 struct DHTRouteSource *pos;
3350 struct GNUNET_TIME_Absolute now;
3351 unsigned int current_size;
3353 current_size = GNUNET_CONTAINER_multihashmap_size (forward_list.hashmap);
3355 #if DELETE_WHEN_FULL
3356 while (current_size >= MAX_OUTSTANDING_FORWARDS)
3358 source_info = GNUNET_CONTAINER_heap_remove_root (forward_list.minHeap);
3359 GNUNET_assert(source_info != NULL);
3360 record = source_info->record;
3361 GNUNET_CONTAINER_DLL_remove (record->head, record->tail, source_info);
3362 if (record->head == NULL) /* No more entries in DLL */
3364 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3365 GNUNET_free(record);
3367 if (source_info->delete_task != GNUNET_SCHEDULER_NO_TASK)
3368 GNUNET_SCHEDULER_cancel(source_info->delete_task);
3369 if (source_info->find_peers_responded != NULL)
3370 GNUNET_CONTAINER_bloomfilter_free(source_info->find_peers_responded);
3371 GNUNET_free(source_info);
3372 current_size = GNUNET_CONTAINER_multihashmap_size(forward_list.hashmap);
3375 /** Non-local request and have too many outstanding forwards, discard! */
3376 if ((current_size >= MAX_OUTSTANDING_FORWARDS) && (msg_ctx->client == NULL))
3379 now = GNUNET_TIME_absolute_get();
3380 record = GNUNET_CONTAINER_multihashmap_get(forward_list.hashmap, &msg_ctx->key);
3381 if (record != NULL) /* Already know this request! */
3386 if (0 == memcmp(msg_ctx->peer, &pos->source, sizeof(struct GNUNET_PeerIdentity)))
3387 break; /* Already have this peer in reply list! */
3390 if ((pos != NULL) && (pos->client == msg_ctx->client)) /* Seen this already */
3392 GNUNET_CONTAINER_heap_update_cost(forward_list.minHeap, pos->hnode, now.abs_value);
3398 record = GNUNET_malloc(sizeof (struct DHTQueryRecord));
3399 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_multihashmap_put(forward_list.hashmap, &msg_ctx->key, record, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
3400 memcpy(&record->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
3403 source_info = GNUNET_malloc(sizeof(struct DHTRouteSource));
3404 source_info->record = record;
3405 source_info->delete_task = GNUNET_SCHEDULER_add_delayed (DHT_FORWARD_TIMEOUT, &remove_forward_entry, source_info);
3406 source_info->find_peers_responded = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3407 memcpy(&source_info->source, msg_ctx->peer, sizeof(struct GNUNET_PeerIdentity));
3408 GNUNET_CONTAINER_DLL_insert_after (record->head, record->tail, record->tail, source_info);
3409 if (msg_ctx->client != NULL) /* For local request, set timeout so high it effectively never gets pushed out */
3411 source_info->client = msg_ctx->client;
3412 now = GNUNET_TIME_absolute_get_forever();
3414 source_info->hnode = GNUNET_CONTAINER_heap_insert(forward_list.minHeap, source_info, now.abs_value);
3416 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3417 "`%s:%s': Created new forward source info for %s uid %llu\n", my_short_id,
3418 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id);
3425 * Main function that handles whether or not to route a message to other
3428 * @param msg the message to be routed
3429 * @param msg_ctx the context containing all pertinent information about the message
3432 route_message(const struct GNUNET_MessageHeader *msg,
3433 struct DHT_MessageContext *msg_ctx)
3436 struct PeerInfo *selected;
3437 #if DEBUG_DHT_ROUTING > 1
3438 struct PeerInfo *nearest;
3440 unsigned int forward_count;
3441 struct RecentRequest *recent_req;
3442 GNUNET_HashCode unique_hash;
3443 char *stat_forward_count;
3444 char *temp_stat_str;
3445 #if DEBUG_DHT_ROUTING
3449 if (malicious_dropper == GNUNET_YES)
3451 #if DEBUG_DHT_ROUTING
3452 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3454 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3455 msg_ctx->hop_count, GNUNET_SYSERR,
3456 &my_identity, &msg_ctx->key, msg_ctx->peer,
3460 if (msg_ctx->bloom != NULL)
3461 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
3465 increment_stats(STAT_ROUTES);
3466 forward_count = get_forward_count(msg_ctx->hop_count, msg_ctx->replication);
3467 GNUNET_asprintf(&stat_forward_count, "# forward counts of %d", forward_count);
3468 increment_stats(stat_forward_count);
3469 GNUNET_free(stat_forward_count);
3470 if (msg_ctx->bloom == NULL)
3471 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3473 if ((stop_on_closest == GNUNET_YES) && (msg_ctx->closest == GNUNET_YES) && (ntohs(msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT))
3477 * NOTICE: In Kademlia, a find peer request goes no further if the peer doesn't return
3478 * any closer peers (which is being checked for below). Since we are doing recursive
3479 * routing we have no choice but to stop forwarding in this case. This means that at
3480 * any given step the request may NOT be forwarded to alpha peers (because routes will
3481 * stop and the parallel route will not be aware of it). Of course, assuming that we
3482 * have fulfilled the Kademlia requirements for routing table fullness this will never
3483 * ever ever be a problem.
3485 * However, is this fair?
3487 * Since we use these requests to build our routing tables (and we build them in the
3488 * testing driver) we will ignore this restriction for FIND_PEER messages so that
3489 * routing tables still get constructed.
3491 if ((GNUNET_YES == strict_kademlia) && (msg_ctx->closest == GNUNET_YES) && (msg_ctx->hop_count > 0) && (ntohs(msg->type) != GNUNET_MESSAGE_TYPE_DHT_FIND_PEER))
3494 #if DEBUG_DHT_ROUTING
3495 if (forward_count == 0)
3496 ret = GNUNET_SYSERR;
3500 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3502 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3503 msg_ctx->hop_count, ret,
3504 &my_identity, &msg_ctx->key, msg_ctx->peer,
3510 GNUNET_CONTAINER_bloomfilter_add (msg_ctx->bloom, &my_identity.hashPubKey);
3511 hash_from_uid (msg_ctx->unique_id, &unique_hash);
3512 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains (recent.hashmap, &unique_hash))
3514 recent_req = GNUNET_CONTAINER_multihashmap_get(recent.hashmap, &unique_hash);
3515 GNUNET_assert(recent_req != NULL);
3516 if (0 != memcmp(&recent_req->key, &msg_ctx->key, sizeof(GNUNET_HashCode)))
3517 increment_stats(STAT_DUPLICATE_UID);
3520 increment_stats(STAT_RECENT_SEEN);
3521 GNUNET_CONTAINER_bloomfilter_or2(msg_ctx->bloom, recent_req->bloom, DHT_BLOOM_SIZE);
3526 recent_req = GNUNET_malloc(sizeof(struct RecentRequest));
3527 recent_req->uid = msg_ctx->unique_id;
3528 memcpy(&recent_req->key, &msg_ctx->key, sizeof(GNUNET_HashCode));
3529 recent_req->remove_task = GNUNET_SCHEDULER_add_delayed(DEFAULT_RECENT_REMOVAL, &remove_recent, recent_req);
3530 recent_req->heap_node = GNUNET_CONTAINER_heap_insert(recent.minHeap, recent_req, GNUNET_TIME_absolute_get().abs_value);
3531 recent_req->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3532 GNUNET_CONTAINER_multihashmap_put(recent.hashmap, &unique_hash, recent_req, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
3535 if (GNUNET_CONTAINER_multihashmap_size(recent.hashmap) > DHT_MAX_RECENT)
3537 recent_req = GNUNET_CONTAINER_heap_peek(recent.minHeap);
3538 GNUNET_assert(recent_req != NULL);
3539 GNUNET_SCHEDULER_cancel(recent_req->remove_task);
3540 GNUNET_SCHEDULER_add_now(&remove_recent, recent_req);
3543 for (i = 0; i < forward_count; i++)
3545 selected = select_peer(&msg_ctx->key, msg_ctx->bloom, msg_ctx->hop_count);
3547 if (selected != NULL)
3549 if (GNUNET_CRYPTO_hash_matching_bits(&selected->id.hashPubKey, &msg_ctx->key) >= GNUNET_CRYPTO_hash_matching_bits(&my_identity.hashPubKey, &msg_ctx->key))
3550 GNUNET_asprintf(&temp_stat_str, "# requests routed to close(r) peer hop %u", msg_ctx->hop_count);
3552 GNUNET_asprintf(&temp_stat_str, "# requests routed to less close peer hop %u", msg_ctx->hop_count);
3553 if (temp_stat_str != NULL)
3555 increment_stats(temp_stat_str);
3556 GNUNET_free(temp_stat_str);
3558 GNUNET_CONTAINER_bloomfilter_add(msg_ctx->bloom, &selected->id.hashPubKey);
3559 #if DEBUG_DHT_ROUTING > 1
3560 nearest = find_closest_peer(&msg_ctx->key);
3561 nearest_buf = GNUNET_strdup(GNUNET_i2s(&nearest->id));
3562 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3563 "`%s:%s': Forwarding request key %s uid %llu to peer %s (closest %s, bits %d, distance %u)\n", my_short_id,
3564 "DHT", GNUNET_h2s (&msg_ctx->key), msg_ctx->unique_id, GNUNET_i2s(&selected->id), nearest_buf, GNUNET_CRYPTO_hash_matching_bits(&nearest->id.hashPubKey, msg_ctx->key), distance(&nearest->id.hashPubKey, msg_ctx->key));
3565 GNUNET_free(nearest_buf);
3567 #if DEBUG_DHT_ROUTING
3568 if ((debug_routes_extended) && (dhtlog_handle != NULL))
3570 dhtlog_handle->insert_route (NULL, msg_ctx->unique_id, DHTLOG_ROUTE,
3571 msg_ctx->hop_count, GNUNET_NO,
3572 &my_identity, &msg_ctx->key, msg_ctx->peer,
3576 forward_message(msg, selected, msg_ctx);
3580 if (msg_ctx->bloom != NULL)
3582 GNUNET_CONTAINER_bloomfilter_or2(recent_req->bloom, msg_ctx->bloom, DHT_BLOOM_SIZE);
3583 GNUNET_CONTAINER_bloomfilter_free(msg_ctx->bloom);
3590 * Main function that handles whether or not to route a message to other
3593 * @param msg the message to be routed
3594 * @param msg_ctx the context containing all pertinent information about the message
3597 demultiplex_message(const struct GNUNET_MessageHeader *msg,
3598 struct DHT_MessageContext *msg_ctx)
3600 msg_ctx->closest = am_closest_peer(&msg_ctx->key, NULL);
3601 switch (ntohs(msg->type))
3603 case GNUNET_MESSAGE_TYPE_DHT_GET: /* Add to hashmap of requests seen, search for data (always) */
3604 cache_response (msg_ctx);
3605 handle_dht_get (msg, msg_ctx);
3607 case GNUNET_MESSAGE_TYPE_DHT_PUT: /* Check if closest, if so insert data. */
3608 increment_stats(STAT_PUTS);
3609 handle_dht_put (msg, msg_ctx);
3611 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER: /* Check if closest and not started by us, check options, add to requests seen */
3612 increment_stats(STAT_FIND_PEER);
3613 if (((msg_ctx->hop_count > 0) && (0 != memcmp(msg_ctx->peer, &my_identity, sizeof(struct GNUNET_PeerIdentity)))) || (msg_ctx->client != NULL))
3615 cache_response (msg_ctx);
3616 if ((msg_ctx->closest == GNUNET_YES) || (msg_ctx->msg_options == GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE))
3617 handle_dht_find_peer (msg, msg_ctx);
3620 route_message (msg, msg_ctx);
3621 #if DEBUG_DHT_ROUTING
3622 if (msg_ctx->hop_count == 0) /* Locally initiated request */
3624 if ((debug_routes) && (dhtlog_handle != NULL))
3626 dhtlog_handle->insert_dhtkey(NULL, &msg_ctx->key);
3627 dhtlog_handle->insert_query (NULL, msg_ctx->unique_id, DHTLOG_FIND_PEER,
3628 msg_ctx->hop_count, GNUNET_NO, &my_identity,
3635 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
3636 "`%s': Message type (%d) not handled, forwarding anyway!\n", "DHT", ntohs(msg->type));
3637 route_message (msg, msg_ctx);
3645 * Iterator for local get request results,
3647 * @param cls closure for iterator, NULL
3648 * @param exp when does this value expire?
3649 * @param key the key this data is stored under
3650 * @param size the size of the data identified by key
3651 * @param data the actual data
3652 * @param type the type of the data
3654 * @return GNUNET_OK to continue iteration, anything else
3655 * to stop iteration.
3658 republish_content_iterator (void *cls,
3659 struct GNUNET_TIME_Absolute exp,
3660 const GNUNET_HashCode * key,
3661 size_t size, const char *data, uint32_t type)
3664 struct DHT_MessageContext *new_msg_ctx;
3665 struct GNUNET_DHT_PutMessage *put_msg;
3667 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
3668 "`%s:%s': Received `%s' response from datacache\n", my_short_id, "DHT", "GET");
3670 new_msg_ctx = GNUNET_malloc(sizeof(struct DHT_MessageContext));
3673 GNUNET_malloc (sizeof (struct GNUNET_DHT_PutMessage) + size);
3674 put_msg->header.type = htons (GNUNET_MESSAGE_TYPE_DHT_PUT);
3675 put_msg->header.size = htons (sizeof (struct GNUNET_DHT_PutMessage) + size);
3676 put_msg->expiration = GNUNET_TIME_absolute_hton(exp);
3677 put_msg->type = htons (type);
3678 memcpy (&put_msg[1], data, size);
3679 new_msg_ctx->unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3680 new_msg_ctx->replication = ntohl (DEFAULT_PUT_REPLICATION);
3681 new_msg_ctx->msg_options = ntohl (0);
3682 new_msg_ctx->network_size = estimate_diameter();
3683 new_msg_ctx->peer = &my_identity;
3684 new_msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
3685 new_msg_ctx->hop_count = 0;
3686 new_msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE;
3687 new_msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
3688 increment_stats(STAT_PUT_START);
3689 demultiplex_message(&put_msg->header, new_msg_ctx);
3691 GNUNET_free(new_msg_ctx);
3692 GNUNET_free (put_msg);
3697 * Task used to republish data.
3699 * @param cls closure (a struct RepublishContext)
3700 * @param tc runtime context for this task
3703 republish_content(void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3705 struct RepublishContext *put_context = cls;
3707 unsigned int results;
3709 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3711 GNUNET_free(put_context);
3715 GNUNET_assert (datacache != NULL); /* If we have no datacache we never should have scheduled this! */
3716 results = GNUNET_DATACACHE_get(datacache, &put_context->key, put_context->type, &republish_content_iterator, NULL);
3717 if (results == 0) /* Data must have expired */
3718 GNUNET_free(put_context);
3719 else /* Reschedule task for next time period */
3720 GNUNET_SCHEDULER_add_delayed(dht_republish_frequency, &republish_content, put_context);
3726 * Iterator over hash map entries.
3728 * @param cls client to search for in source routes
3729 * @param key current key code (ignored)
3730 * @param value value in the hash map, a DHTQueryRecord
3731 * @return GNUNET_YES if we should continue to
3735 static int find_client_records (void *cls,
3736 const GNUNET_HashCode * key, void *value)
3738 struct ClientList *client = cls;
3739 struct DHTQueryRecord *record = value;
3740 struct DHTRouteSource *pos;
3744 if (pos->client == client)
3750 GNUNET_CONTAINER_DLL_remove(record->head, record->tail, pos);
3751 GNUNET_CONTAINER_heap_remove_node(forward_list.minHeap, pos->hnode);
3752 if (pos->delete_task != GNUNET_SCHEDULER_NO_TASK)
3753 GNUNET_SCHEDULER_cancel(pos->delete_task);
3755 if (pos->find_peers_responded != NULL)
3756 GNUNET_CONTAINER_bloomfilter_free(pos->find_peers_responded);
3759 if (record->head == NULL) /* No more entries in DLL */
3761 GNUNET_assert(GNUNET_YES == GNUNET_CONTAINER_multihashmap_remove(forward_list.hashmap, &record->key, record));
3762 GNUNET_free(record);
3768 * Functions with this signature are called whenever a client
3769 * is disconnected on the network level.
3771 * @param cls closure (NULL for dht)
3772 * @param client identification of the client; NULL
3773 * for the last call when the server is destroyed
3775 static void handle_client_disconnect (void *cls,
3776 struct GNUNET_SERVER_Client* client)
3778 struct ClientList *pos = client_list;
3779 struct ClientList *prev;
3780 struct ClientList *found;
3781 struct PendingMessage *reply;
3787 if (pos->client_handle == client)
3790 prev->next = pos->next;
3792 client_list = pos->next;
3802 while(NULL != (reply = found->pending_head))
3804 GNUNET_CONTAINER_DLL_remove(found->pending_head, found->pending_tail, reply);
3807 GNUNET_CONTAINER_multihashmap_iterate(forward_list.hashmap, &find_client_records, found);
3813 * Find a client if it exists, add it otherwise.
3815 * @param client the server handle to the client
3817 * @return the client if found, a new client otherwise
3819 static struct ClientList *
3820 find_active_client (struct GNUNET_SERVER_Client *client)
3822 struct ClientList *pos = client_list;
3823 struct ClientList *ret;
3827 if (pos->client_handle == client)
3832 ret = GNUNET_malloc (sizeof (struct ClientList));
3833 ret->client_handle = client;
3834 ret->next = client_list;
3842 * Task to send a malicious put message across the network.
3844 * @param cls closure for this task
3845 * @param tc the context under which the task is running
3848 malicious_put_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3850 static struct GNUNET_DHT_PutMessage put_message;
3851 static struct DHT_MessageContext msg_ctx;
3852 static GNUNET_HashCode key;
3853 uint32_t random_key;
3855 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3857 put_message.header.size = htons(sizeof(struct GNUNET_DHT_PutMessage));
3858 put_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_PUT);
3859 put_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3860 put_message.expiration = GNUNET_TIME_absolute_hton(GNUNET_TIME_absolute_get_forever());
3861 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
3862 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3863 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3864 memcpy(&msg_ctx.key, &key, sizeof(GNUNET_HashCode));
3865 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3866 msg_ctx.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3867 msg_ctx.msg_options = ntohl (0);
3868 msg_ctx.network_size = estimate_diameter();
3869 msg_ctx.peer = &my_identity;
3870 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE;
3871 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3872 #if DEBUG_DHT_ROUTING
3873 if (dhtlog_handle != NULL)
3874 dhtlog_handle->insert_dhtkey(NULL, &key);
3876 increment_stats(STAT_PUT_START);
3877 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious PUT message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3878 demultiplex_message(&put_message.header, &msg_ctx);
3879 GNUNET_SCHEDULER_add_delayed(GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_put_frequency), &malicious_put_task, NULL);
3884 * Task to send a malicious put message across the network.
3886 * @param cls closure for this task
3887 * @param tc the context under which the task is running
3890 malicious_get_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3892 static struct GNUNET_DHT_GetMessage get_message;
3893 struct DHT_MessageContext msg_ctx;
3894 static GNUNET_HashCode key;
3895 uint32_t random_key;
3897 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3900 get_message.header.size = htons(sizeof(struct GNUNET_DHT_GetMessage));
3901 get_message.header.type = htons(GNUNET_MESSAGE_TYPE_DHT_GET);
3902 get_message.type = htonl(GNUNET_BLOCK_DHT_MALICIOUS_MESSAGE_TYPE);
3903 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
3904 random_key = GNUNET_CRYPTO_random_u32(GNUNET_CRYPTO_QUALITY_WEAK, (uint32_t)-1);
3905 GNUNET_CRYPTO_hash(&random_key, sizeof(uint32_t), &key);
3906 memcpy(&msg_ctx.key, &key, sizeof(GNUNET_HashCode));
3907 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_WEAK, (uint64_t)-1));
3908 msg_ctx.replication = ntohl (DHT_DEFAULT_FIND_PEER_REPLICATION);
3909 msg_ctx.msg_options = ntohl (0);
3910 msg_ctx.network_size = estimate_diameter();
3911 msg_ctx.peer = &my_identity;
3912 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE;
3913 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
3914 #if DEBUG_DHT_ROUTING
3915 if (dhtlog_handle != NULL)
3916 dhtlog_handle->insert_dhtkey(NULL, &key);
3918 increment_stats(STAT_GET_START);
3919 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Sending malicious GET message with hash %s\n", my_short_id, "DHT", GNUNET_h2s(&key));
3920 demultiplex_message (&get_message.header, &msg_ctx);
3921 GNUNET_SCHEDULER_add_delayed(GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MILLISECONDS, malicious_get_frequency), &malicious_get_task, NULL);
3927 * Iterator over hash map entries.
3929 * @param cls closure
3930 * @param key current key code
3931 * @param value value in the hash map
3932 * @return GNUNET_YES if we should continue to
3937 add_known_to_bloom (void *cls,
3938 const GNUNET_HashCode * key,
3941 struct GNUNET_CONTAINER_BloomFilter *bloom = cls;
3942 GNUNET_CONTAINER_bloomfilter_add (bloom, key);
3947 * Task to send a find peer message for our own peer identifier
3948 * so that we can find the closest peers in the network to ourselves
3949 * and attempt to connect to them.
3951 * @param cls closure for this task
3952 * @param tc the context under which the task is running
3955 send_find_peer_message (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
3957 struct GNUNET_DHT_FindPeerMessage *find_peer_msg;
3958 struct DHT_MessageContext msg_ctx;
3959 struct GNUNET_TIME_Relative next_send_time;
3960 struct GNUNET_CONTAINER_BloomFilter *temp_bloom;
3962 struct GNUNET_TIME_Relative time_diff;
3963 struct GNUNET_TIME_Absolute end;
3965 double count_per_interval;
3967 if (tc->reason == GNUNET_SCHEDULER_REASON_SHUTDOWN)
3970 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! */
3972 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Have %d newly found peers since last find peer message sent!\n", newly_found_peers);
3973 GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_UNIT_MINUTES,
3974 &send_find_peer_message, NULL);
3975 newly_found_peers = 0;
3979 increment_stats(STAT_FIND_PEER_START);
3981 end = GNUNET_TIME_absolute_get();
3982 time_diff = GNUNET_TIME_absolute_get_difference(find_peer_context.start, end);
3984 if (time_diff.abs_value > FIND_PEER_CALC_INTERVAL.abs_value)
3986 multiplier = time_diff.abs_value / FIND_PEER_CALC_INTERVAL.abs_value;
3987 count_per_interval = find_peer_context.count / multiplier;
3991 multiplier = FIND_PEER_CALC_INTERVAL.abs_value / time_diff.abs_value;
3992 count_per_interval = find_peer_context.count * multiplier;
3996 #if FIND_PEER_WITH_HELLO
3997 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
3998 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage) + GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
3999 memcpy(&find_peer_msg[1], my_hello, GNUNET_HELLO_size((struct GNUNET_HELLO_Message *)my_hello));
4001 find_peer_msg = GNUNET_malloc(sizeof(struct GNUNET_DHT_FindPeerMessage));
4002 find_peer_msg->header.size = htons(sizeof(struct GNUNET_DHT_FindPeerMessage));
4004 find_peer_msg->header.type = htons(GNUNET_MESSAGE_TYPE_DHT_FIND_PEER);
4005 temp_bloom = GNUNET_CONTAINER_bloomfilter_init (NULL, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4006 GNUNET_CONTAINER_multihashmap_iterate(all_known_peers, &add_known_to_bloom, temp_bloom);
4007 GNUNET_assert(GNUNET_OK == GNUNET_CONTAINER_bloomfilter_get_raw_data(temp_bloom, find_peer_msg->bloomfilter, DHT_BLOOM_SIZE));
4008 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4009 memcpy(&msg_ctx.key, &my_identity.hashPubKey, sizeof(GNUNET_HashCode));
4010 msg_ctx.unique_id = GNUNET_ntohll (GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG, (uint64_t)-1));
4011 msg_ctx.replication = DHT_DEFAULT_FIND_PEER_REPLICATION;
4012 msg_ctx.msg_options = DHT_DEFAULT_FIND_PEER_OPTIONS;
4013 msg_ctx.network_size = estimate_diameter();
4014 msg_ctx.peer = &my_identity;
4015 msg_ctx.importance = DHT_DEFAULT_FIND_PEER_IMPORTANCE;
4016 msg_ctx.timeout = DHT_DEFAULT_FIND_PEER_TIMEOUT;
4018 demultiplex_message(&find_peer_msg->header, &msg_ctx);
4019 GNUNET_free(find_peer_msg);
4020 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4021 "`%s:%s': Sent `%s' request to some (?) peers\n", my_short_id, "DHT",
4023 if (newly_found_peers < bucket_size)
4025 next_send_time.rel_value = (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) +
4026 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4027 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2);
4031 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4032 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4033 DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4036 GNUNET_assert (next_send_time.rel_value != 0);
4037 find_peer_context.count = 0;
4038 newly_found_peers = 0;
4039 find_peer_context.start = GNUNET_TIME_absolute_get();
4040 if (GNUNET_YES == do_find_peer)
4042 GNUNET_SCHEDULER_add_delayed (next_send_time,
4043 &send_find_peer_message, NULL);
4048 * Handler for any generic DHT messages, calls the appropriate handler
4049 * depending on message type, sends confirmation if responses aren't otherwise
4052 * @param cls closure for the service
4053 * @param client the client we received this message from
4054 * @param message the actual message received
4057 handle_dht_local_route_request (void *cls, struct GNUNET_SERVER_Client *client,
4058 const struct GNUNET_MessageHeader *message)
4060 const struct GNUNET_DHT_RouteMessage *dht_msg = (const struct GNUNET_DHT_RouteMessage *) message;
4061 const struct GNUNET_MessageHeader *enc_msg;
4062 struct DHT_MessageContext msg_ctx;
4064 enc_msg = (const struct GNUNET_MessageHeader *) &dht_msg[1];
4066 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4067 "`%s:%s': Received `%s' request from client, message type %d, key %s, uid %llu\n",
4071 ntohs (message->type),
4072 GNUNET_h2s (&dht_msg->key),
4073 GNUNET_ntohll (dht_msg->unique_id));
4075 #if DEBUG_DHT_ROUTING
4076 if (dhtlog_handle != NULL)
4077 dhtlog_handle->insert_dhtkey (NULL, &dht_msg->key);
4079 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4080 msg_ctx.client = find_active_client (client);
4081 memcpy(&msg_ctx.key, &dht_msg->key, sizeof(GNUNET_HashCode));
4082 msg_ctx.unique_id = GNUNET_ntohll (dht_msg->unique_id);
4083 msg_ctx.replication = ntohl (dht_msg->desired_replication_level);
4084 msg_ctx.msg_options = ntohl (dht_msg->options);
4085 msg_ctx.network_size = estimate_diameter();
4086 msg_ctx.peer = &my_identity;
4087 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE + 4; /* Make local routing a higher priority */
4088 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4089 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_GET)
4090 increment_stats(STAT_GET_START);
4091 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_PUT)
4092 increment_stats(STAT_PUT_START);
4093 else if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_FIND_PEER)
4094 increment_stats(STAT_FIND_PEER_START);
4096 demultiplex_message(enc_msg, &msg_ctx);
4098 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4103 * Handler for any locally received DHT control messages,
4104 * sets malicious flags mostly for now.
4106 * @param cls closure for the service
4107 * @param client the client we received this message from
4108 * @param message the actual message received
4112 handle_dht_control_message (void *cls, struct GNUNET_SERVER_Client *client,
4113 const struct GNUNET_MessageHeader *message)
4115 const struct GNUNET_DHT_ControlMessage *dht_control_msg =
4116 (const struct GNUNET_DHT_ControlMessage *) message;
4118 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4119 "`%s:%s': Received `%s' request from client, command %d\n", my_short_id, "DHT",
4120 "CONTROL", ntohs(dht_control_msg->command));
4123 switch (ntohs(dht_control_msg->command))
4125 case GNUNET_MESSAGE_TYPE_DHT_FIND_PEER:
4126 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Sending self seeking find peer request!\n");
4127 GNUNET_SCHEDULER_add_now(&send_find_peer_message, NULL);
4130 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_GET:
4131 if (ntohs(dht_control_msg->variable) > 0)
4132 malicious_get_frequency = ntohs(dht_control_msg->variable);
4133 if (malicious_get_frequency == 0)
4134 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4135 if (malicious_getter != GNUNET_YES)
4136 GNUNET_SCHEDULER_add_now(&malicious_get_task, NULL);
4137 malicious_getter = GNUNET_YES;
4138 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4139 "%s:%s Initiating malicious GET behavior, frequency %d\n", my_short_id, "DHT", malicious_get_frequency);
4141 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_PUT:
4142 if (ntohs(dht_control_msg->variable) > 0)
4143 malicious_put_frequency = ntohs(dht_control_msg->variable);
4144 if (malicious_put_frequency == 0)
4145 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4146 if (malicious_putter != GNUNET_YES)
4147 GNUNET_SCHEDULER_add_now(&malicious_put_task, NULL);
4148 malicious_putter = GNUNET_YES;
4149 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4150 "%s:%s Initiating malicious PUT behavior, frequency %d\n", my_short_id, "DHT", malicious_put_frequency);
4152 case GNUNET_MESSAGE_TYPE_DHT_MALICIOUS_DROP:
4153 #if DEBUG_DHT_ROUTING
4154 if ((malicious_dropper != GNUNET_YES) && (dhtlog_handle != NULL))
4155 dhtlog_handle->set_malicious(&my_identity);
4157 malicious_dropper = GNUNET_YES;
4158 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG,
4159 "%s:%s Initiating malicious DROP behavior\n", my_short_id, "DHT");
4163 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4164 "%s:%s Unknown control command type `%d'!\n",
4166 ntohs(dht_control_msg->command));
4170 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4174 * Handler for any generic DHT stop messages, calls the appropriate handler
4175 * depending on message type (if processed locally)
4177 * @param cls closure for the service
4178 * @param client the client we received this message from
4179 * @param message the actual message received
4183 handle_dht_local_route_stop(void *cls, struct GNUNET_SERVER_Client *client,
4184 const struct GNUNET_MessageHeader *message)
4187 const struct GNUNET_DHT_StopMessage *dht_stop_msg =
4188 (const struct GNUNET_DHT_StopMessage *) message;
4189 struct DHTQueryRecord *record;
4190 struct DHTRouteSource *pos;
4192 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4193 "`%s:%s': Received `%s' request from client, uid %llu\n", my_short_id, "DHT",
4194 "GENERIC STOP", GNUNET_ntohll (dht_stop_msg->unique_id));
4196 record = GNUNET_CONTAINER_multihashmap_get (forward_list.hashmap, &dht_stop_msg->key);
4203 /* If the client is non-null (local request) and the client matches the requesting client, remove the entry. */
4204 if ((pos->client != NULL) && (pos->client->client_handle == client))
4206 GNUNET_SCHEDULER_cancel(pos->delete_task);
4207 pos->delete_task = GNUNET_SCHEDULER_NO_TASK;
4208 GNUNET_SCHEDULER_add_continuation (&remove_forward_entry, pos, GNUNET_SCHEDULER_REASON_PREREQ_DONE);
4214 GNUNET_SERVER_receive_done (client, GNUNET_OK);
4219 * Core handler for p2p route requests.
4222 handle_dht_p2p_route_request (void *cls,
4223 const struct GNUNET_PeerIdentity *peer,
4224 const struct GNUNET_MessageHeader *message,
4225 const struct GNUNET_TRANSPORT_ATS_Information *atsi)
4228 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4229 "`%s:%s': Received P2P request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4231 struct GNUNET_DHT_P2PRouteMessage *incoming = (struct GNUNET_DHT_P2PRouteMessage *)message;
4232 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4233 struct DHT_MessageContext *msg_ctx;
4235 if (get_max_send_delay().rel_value > MAX_REQUEST_TIME.rel_value)
4237 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "Sending of previous replies took too long, backing off!\n");
4238 increment_stats("# route requests dropped due to high load");
4239 decrease_max_send_delay(get_max_send_delay());
4243 if (ntohs(enc_msg->type) == GNUNET_MESSAGE_TYPE_DHT_P2P_PING) /* Throw these away. FIXME: Don't throw these away? (reply)*/
4246 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "%s:%s Received P2P Ping message.\n", my_short_id, "DHT");
4251 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4256 msg_ctx = GNUNET_malloc(sizeof (struct DHT_MessageContext));
4257 msg_ctx->bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4258 GNUNET_assert(msg_ctx->bloom != NULL);
4259 msg_ctx->hop_count = ntohl(incoming->hop_count);
4260 memcpy(&msg_ctx->key, &incoming->key, sizeof(GNUNET_HashCode));
4261 msg_ctx->replication = ntohl(incoming->desired_replication_level);
4262 msg_ctx->unique_id = GNUNET_ntohll(incoming->unique_id);
4263 msg_ctx->msg_options = ntohl(incoming->options);
4264 msg_ctx->network_size = ntohl(incoming->network_size);
4265 msg_ctx->peer = peer;
4266 msg_ctx->importance = DHT_DEFAULT_P2P_IMPORTANCE;
4267 msg_ctx->timeout = DHT_DEFAULT_P2P_TIMEOUT;
4268 demultiplex_message(enc_msg, msg_ctx);
4269 GNUNET_free(msg_ctx);
4275 * Core handler for p2p route results.
4278 handle_dht_p2p_route_result (void *cls,
4279 const struct GNUNET_PeerIdentity *peer,
4280 const struct GNUNET_MessageHeader *message,
4281 const struct GNUNET_TRANSPORT_ATS_Information *atsi)
4284 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4285 "`%s:%s': Received request from peer %s\n", my_short_id, "DHT", GNUNET_i2s(peer));
4287 struct GNUNET_DHT_P2PRouteResultMessage *incoming = (struct GNUNET_DHT_P2PRouteResultMessage *)message;
4288 struct GNUNET_MessageHeader *enc_msg = (struct GNUNET_MessageHeader *)&incoming[1];
4289 struct DHT_MessageContext msg_ctx;
4291 if (ntohs(enc_msg->size) >= GNUNET_SERVER_MAX_MESSAGE_SIZE - 1)
4297 memset(&msg_ctx, 0, sizeof(struct DHT_MessageContext));
4298 // FIXME: call GNUNET_BLOCK_evaluate (...) -- instead of doing your own bloomfilter!
4299 msg_ctx.bloom = GNUNET_CONTAINER_bloomfilter_init(incoming->bloomfilter, DHT_BLOOM_SIZE, DHT_BLOOM_K);
4300 GNUNET_assert(msg_ctx.bloom != NULL);
4301 memcpy(&msg_ctx.key, &incoming->key, sizeof(GNUNET_HashCode));
4302 msg_ctx.unique_id = GNUNET_ntohll(incoming->unique_id);
4303 msg_ctx.msg_options = ntohl(incoming->options);
4304 msg_ctx.hop_count = ntohl(incoming->hop_count);
4305 msg_ctx.peer = peer;
4306 msg_ctx.importance = DHT_DEFAULT_P2P_IMPORTANCE + 2; /* Make result routing a higher priority */
4307 msg_ctx.timeout = DHT_DEFAULT_P2P_TIMEOUT;
4308 route_result_message(enc_msg, &msg_ctx);
4314 * Receive the HELLO from transport service,
4315 * free current and replace if necessary.
4318 * @param message HELLO message of peer
4321 process_hello (void *cls, const struct GNUNET_MessageHeader *message)
4324 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4325 "Received our `%s' from transport service\n",
4329 GNUNET_assert (message != NULL);
4330 GNUNET_free_non_null(my_hello);
4331 my_hello = GNUNET_malloc(ntohs(message->size));
4332 memcpy(my_hello, message, ntohs(message->size));
4337 * Task run during shutdown.
4343 shutdown_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
4346 struct PeerInfo *pos;
4348 if (transport_handle != NULL)
4350 GNUNET_free_non_null(my_hello);
4351 GNUNET_TRANSPORT_get_hello_cancel(transport_handle, &process_hello, NULL);
4352 GNUNET_TRANSPORT_disconnect(transport_handle);
4354 for (bucket_count = lowest_bucket; bucket_count < MAX_BUCKETS; bucket_count++)
4356 while (k_buckets[bucket_count].head != NULL)
4358 pos = k_buckets[bucket_count].head;
4360 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4361 "%s:%s Removing peer %s from bucket %d!\n", my_short_id, "DHT", GNUNET_i2s(&pos->id), bucket_count);
4363 delete_peer(pos, bucket_count);
4366 if (coreAPI != NULL)
4369 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4370 "%s:%s Disconnecting core!\n", my_short_id, "DHT");
4372 GNUNET_CORE_disconnect (coreAPI);
4375 if (datacache != NULL)
4378 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4379 "%s:%s Destroying datacache!\n", my_short_id, "DHT");
4381 GNUNET_DATACACHE_destroy (datacache);
4386 GNUNET_STATISTICS_destroy (stats, GNUNET_YES);
4389 if (dhtlog_handle != NULL)
4391 GNUNET_DHTLOG_disconnect(dhtlog_handle);
4392 dhtlog_handle = NULL;
4394 if (block_context != NULL)
4396 GNUNET_BLOCK_context_destroy (block_context);
4397 block_context = NULL;
4399 GNUNET_free_non_null(my_short_id);
4405 * To be called on core init/fail.
4407 * @param cls service closure
4408 * @param server handle to the server for this service
4409 * @param identity the public identity of this peer
4410 * @param publicKey the public key of this peer
4413 core_init (void *cls,
4414 struct GNUNET_CORE_Handle *server,
4415 const struct GNUNET_PeerIdentity *identity,
4416 const struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded *publicKey)
4422 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4423 "%s: Connection to core FAILED!\n", "dht",
4424 GNUNET_i2s (identity));
4426 GNUNET_SCHEDULER_cancel (cleanup_task);
4427 GNUNET_SCHEDULER_add_now (&shutdown_task, NULL);
4431 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4432 "%s: Core connection initialized, I am peer: %s\n", "dht",
4433 GNUNET_i2s (identity));
4436 /* Copy our identity so we can use it */
4437 memcpy (&my_identity, identity, sizeof (struct GNUNET_PeerIdentity));
4438 if (my_short_id != NULL)
4439 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%s Receive CORE INIT message but have already been initialized! Did CORE fail?\n", "DHT SERVICE");
4440 my_short_id = GNUNET_strdup(GNUNET_i2s(&my_identity));
4441 /* Set the server to local variable */
4444 if (dhtlog_handle != NULL)
4445 dhtlog_handle->insert_node (NULL, &my_identity);
4449 static struct GNUNET_SERVER_MessageHandler plugin_handlers[] = {
4450 {&handle_dht_local_route_request, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE, 0},
4451 {&handle_dht_local_route_stop, NULL, GNUNET_MESSAGE_TYPE_DHT_LOCAL_ROUTE_STOP, 0},
4452 {&handle_dht_control_message, NULL, GNUNET_MESSAGE_TYPE_DHT_CONTROL, 0},
4457 static struct GNUNET_CORE_MessageHandler core_handlers[] = {
4458 {&handle_dht_p2p_route_request, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE, 0},
4459 {&handle_dht_p2p_route_result, GNUNET_MESSAGE_TYPE_DHT_P2P_ROUTE_RESULT, 0},
4465 * Method called whenever a peer connects.
4467 * @param cls closure
4468 * @param peer peer identity this notification is about
4469 * @param atsi performance data
4472 handle_core_connect (void *cls,
4473 const struct GNUNET_PeerIdentity * peer,
4474 const struct GNUNET_TRANSPORT_ATS_Information *atsi)
4476 struct PeerInfo *ret;
4479 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4480 "%s:%s Receives core connect message for peer %s distance %d!\n", my_short_id, "dht", GNUNET_i2s(peer), distance);
4483 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4485 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));
4489 if (datacache != NULL)
4490 GNUNET_DATACACHE_put(datacache, &peer->hashPubKey, sizeof(struct GNUNET_PeerIdentity), (const char *)peer, GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_TIME_absolute_get_forever());
4491 ret = try_add_peer(peer,
4492 find_current_bucket(&peer->hashPubKey),
4496 newly_found_peers++;
4497 GNUNET_CONTAINER_multihashmap_put(all_known_peers, &peer->hashPubKey, ret, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
4500 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
4501 "%s:%s Adding peer to routing list: %s\n", my_short_id, "DHT", ret == NULL ? "NOT ADDED" : "PEER ADDED");
4507 * Method called whenever a peer disconnects.
4509 * @param cls closure
4510 * @param peer peer identity this notification is about
4513 handle_core_disconnect (void *cls,
4515 GNUNET_PeerIdentity * peer)
4517 struct PeerInfo *to_remove;
4520 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");
4522 if (GNUNET_YES != GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey))
4524 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));
4527 increment_stats(STAT_DISCONNECTS);
4528 GNUNET_assert(GNUNET_CONTAINER_multihashmap_contains(all_known_peers, &peer->hashPubKey));
4529 to_remove = GNUNET_CONTAINER_multihashmap_get(all_known_peers, &peer->hashPubKey);
4530 GNUNET_assert (to_remove != NULL);
4531 GNUNET_assert(0 == memcmp(peer, &to_remove->id, sizeof(struct GNUNET_PeerIdentity)));
4532 current_bucket = find_current_bucket(&to_remove->id.hashPubKey);
4533 delete_peer(to_remove, current_bucket);
4538 * Process dht requests.
4540 * @param cls closure
4541 * @param server the initialized server
4542 * @param c configuration to use
4546 struct GNUNET_SERVER_Handle *server,
4547 const struct GNUNET_CONFIGURATION_Handle *c)
4549 struct GNUNET_TIME_Relative next_send_time;
4550 unsigned long long temp_config_num;
4551 char *converge_modifier_buf;
4554 datacache = GNUNET_DATACACHE_create (cfg, "dhtcache");
4555 GNUNET_SERVER_add_handlers (server, plugin_handlers);
4556 GNUNET_SERVER_disconnect_notify (server, &handle_client_disconnect, NULL);
4557 coreAPI = GNUNET_CORE_connect (cfg, /* Main configuration */
4558 DEFAULT_CORE_QUEUE_SIZE, /* queue size */
4559 NULL, /* Closure passed to DHT functions */
4560 &core_init, /* Call core_init once connected */
4561 &handle_core_connect, /* Handle connects */
4562 &handle_core_disconnect, /* remove peers on disconnects */
4563 NULL, /* Do we care about "status" updates? */
4564 NULL, /* Don't want notified about all incoming messages */
4565 GNUNET_NO, /* For header only inbound notification */
4566 NULL, /* Don't want notified about all outbound messages */
4567 GNUNET_NO, /* For header only outbound notification */
4568 core_handlers); /* Register these handlers */
4570 if (coreAPI == NULL)
4572 transport_handle = GNUNET_TRANSPORT_connect(cfg,
4573 NULL, NULL, NULL, NULL, NULL);
4574 if (transport_handle != NULL)
4575 GNUNET_TRANSPORT_get_hello (transport_handle, &process_hello, NULL);
4577 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
4578 "Failed to connect to transport service!\n");
4579 block_context = GNUNET_BLOCK_context_create (cfg);
4580 lowest_bucket = MAX_BUCKETS - 1;
4581 forward_list.hashmap = GNUNET_CONTAINER_multihashmap_create(MAX_OUTSTANDING_FORWARDS / 10);
4582 forward_list.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4583 all_known_peers = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4584 recent_find_peer_requests = GNUNET_CONTAINER_multihashmap_create(MAX_BUCKETS / 8);
4585 GNUNET_assert(all_known_peers != NULL);
4586 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing", "mysql_logging"))
4588 debug_routes = GNUNET_YES;
4592 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4595 strict_kademlia = GNUNET_YES;
4599 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4602 stop_on_closest = GNUNET_YES;
4606 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4609 stop_on_found = GNUNET_YES;
4613 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4614 "malicious_getter"))
4616 malicious_getter = GNUNET_YES;
4617 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4618 "MALICIOUS_GET_FREQUENCY",
4619 &malicious_get_frequency))
4620 malicious_get_frequency = DEFAULT_MALICIOUS_GET_FREQUENCY;
4623 if (GNUNET_YES != GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4627 max_hops = DEFAULT_MAX_HOPS;
4630 if (GNUNET_YES == GNUNET_CONFIGURATION_get_value_yesno (cfg, "DHT",
4633 use_max_hops = GNUNET_YES;
4637 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4638 "malicious_putter"))
4640 malicious_putter = GNUNET_YES;
4641 if (GNUNET_NO == GNUNET_CONFIGURATION_get_value_number (cfg, "DHT",
4642 "MALICIOUS_PUT_FREQUENCY",
4643 &malicious_put_frequency))
4644 malicious_put_frequency = DEFAULT_MALICIOUS_PUT_FREQUENCY;
4647 dht_republish_frequency = GNUNET_DHT_DEFAULT_REPUBLISH_FREQUENCY;
4648 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_number(cfg, "DHT", "REPLICATION_FREQUENCY", &temp_config_num))
4650 dht_republish_frequency = GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, temp_config_num);
4654 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4655 "malicious_dropper"))
4657 malicious_dropper = GNUNET_YES;
4661 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4663 do_republish = GNUNET_NO;
4666 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4669 do_find_peer = GNUNET_NO;
4672 do_find_peer = GNUNET_YES;
4675 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4676 "use_real_distance"))
4677 use_real_distance = GNUNET_YES;
4680 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht_testing",
4681 "mysql_logging_extended"))
4683 debug_routes = GNUNET_YES;
4684 debug_routes_extended = GNUNET_YES;
4687 #if DEBUG_DHT_ROUTING
4688 if (GNUNET_YES == debug_routes)
4690 dhtlog_handle = GNUNET_DHTLOG_connect(cfg);
4691 if (dhtlog_handle == NULL)
4693 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
4694 "Could not connect to mysql logging server, logging will not happen!");
4699 converge_option = DHT_CONVERGE_SQUARE;
4701 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4704 converge_option = DHT_CONVERGE_LINEAR;
4706 else if (GNUNET_YES ==
4707 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4708 "converge_exponential"))
4710 converge_option = DHT_CONVERGE_EXPONENTIAL;
4712 else if (GNUNET_YES ==
4713 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4716 converge_option = DHT_CONVERGE_RANDOM;
4718 else if (GNUNET_YES ==
4719 GNUNET_CONFIGURATION_get_value_yesno(cfg, "dht",
4722 converge_option = DHT_CONVERGE_BINARY;
4725 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string(cfg, "dht", "converge_modifier", &converge_modifier_buf))
4727 if (1 != sscanf(converge_modifier_buf, "%f", &converge_modifier))
4729 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Failed to read decimal value for %s from `%s'\n", "CONVERGE_MODIFIER", converge_modifier_buf);
4730 converge_modifier = 0.0;
4732 GNUNET_free(converge_modifier_buf);
4735 stats = GNUNET_STATISTICS_create("dht", cfg);
4739 GNUNET_STATISTICS_set(stats, STAT_ROUTES, 0, GNUNET_NO);
4740 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS, 0, GNUNET_NO);
4741 GNUNET_STATISTICS_set(stats, STAT_ROUTE_FORWARDS_CLOSEST, 0, GNUNET_NO);
4742 GNUNET_STATISTICS_set(stats, STAT_RESULTS, 0, GNUNET_NO);
4743 GNUNET_STATISTICS_set(stats, STAT_RESULTS_TO_CLIENT, 0, GNUNET_NO);
4744 GNUNET_STATISTICS_set(stats, STAT_RESULT_FORWARDS, 0, GNUNET_NO);
4745 GNUNET_STATISTICS_set(stats, STAT_GETS, 0, GNUNET_NO);
4746 GNUNET_STATISTICS_set(stats, STAT_PUTS, 0, GNUNET_NO);
4747 GNUNET_STATISTICS_set(stats, STAT_PUTS_INSERTED, 0, GNUNET_NO);
4748 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER, 0, GNUNET_NO);
4749 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_START, 0, GNUNET_NO);
4750 GNUNET_STATISTICS_set(stats, STAT_GET_START, 0, GNUNET_NO);
4751 GNUNET_STATISTICS_set(stats, STAT_PUT_START, 0, GNUNET_NO);
4752 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_REPLY, 0, GNUNET_NO);
4753 GNUNET_STATISTICS_set(stats, STAT_FIND_PEER_ANSWER, 0, GNUNET_NO);
4754 GNUNET_STATISTICS_set(stats, STAT_BLOOM_FIND_PEER, 0, GNUNET_NO);
4755 GNUNET_STATISTICS_set(stats, STAT_GET_REPLY, 0, GNUNET_NO);
4756 GNUNET_STATISTICS_set(stats, STAT_GET_RESPONSE_START, 0, GNUNET_NO);
4757 GNUNET_STATISTICS_set(stats, STAT_HELLOS_PROVIDED, 0, GNUNET_NO);
4758 GNUNET_STATISTICS_set(stats, STAT_DISCONNECTS, 0, GNUNET_NO);
4760 /* FIXME: if there are no recent requests then these never get freed, but alternative is _annoying_! */
4761 recent.hashmap = GNUNET_CONTAINER_multihashmap_create(DHT_MAX_RECENT / 2);
4762 recent.minHeap = GNUNET_CONTAINER_heap_create(GNUNET_CONTAINER_HEAP_ORDER_MIN);
4763 if (GNUNET_YES == do_find_peer)
4765 next_send_time.rel_value = DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value +
4766 GNUNET_CRYPTO_random_u64(GNUNET_CRYPTO_QUALITY_STRONG,
4767 (DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value / 2) - DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value);
4768 find_peer_context.start = GNUNET_TIME_absolute_get();
4769 GNUNET_SCHEDULER_add_delayed (next_send_time,
4770 &send_find_peer_message, &find_peer_context);
4773 /* Scheduled the task to clean up when shutdown is called */
4774 cleanup_task = GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_UNIT_FOREVER_REL,
4775 &shutdown_task, NULL);
4779 * The main function for the dht service.
4781 * @param argc number of arguments from the command line
4782 * @param argv command line arguments
4783 * @return 0 ok, 1 on error
4786 main (int argc, char *const *argv)
4791 GNUNET_SERVICE_run (argc,
4794 GNUNET_SERVICE_OPTION_NONE,
4795 &run, NULL)) ? 0 : 1;
4796 GNUNET_assert (0 == GNUNET_CONTAINER_multihashmap_size(recent.hashmap));
4797 GNUNET_assert (0 == GNUNET_CONTAINER_heap_get_size(recent.minHeap));
4798 GNUNET_CONTAINER_multihashmap_destroy (recent_find_peer_requests);
4799 GNUNET_CONTAINER_multihashmap_destroy (recent.hashmap);
4800 GNUNET_CONTAINER_heap_destroy (recent.minHeap);