2 This file is part of GNUnet.
3 (C) 2009 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 2, 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 fs/gnunet-service-fs.c
23 * @brief program that provides the file-sharing service
24 * @author Christian Grothoff
27 * - fix gazillion of minor FIXME's
28 * - possible major issue: we may queue "gazillions" of (K|S)Blocks for the
29 * core to transmit to another peer; need to make sure this is bounded overall...
30 * - randomly delay processing for improved anonymity (can wait)
31 * - content migration (put in local DS) (can wait)
32 * - handle some special cases when forwarding replies based on tracked requests (can wait)
33 * - tracking of success correlations for hot-path routing (can wait)
34 * - various load-based actions (can wait)
35 * - validation of KSBLOCKS (can wait)
36 * - remove on-demand blocks if they keep failing (can wait)
37 * - check that we decrement PIDs always where necessary (can wait)
38 * - find out how to use core-pulling instead of pushing (at least for some cases)
42 #include "gnunet_core_service.h"
43 #include "gnunet_datastore_service.h"
44 #include "gnunet_peer_lib.h"
45 #include "gnunet_protocols.h"
46 #include "gnunet_signatures.h"
47 #include "gnunet_util_lib.h"
50 #define DEBUG_FS GNUNET_NO
54 * In-memory information about indexed files (also available
61 * This is a linked list.
63 struct IndexInfo *next;
66 * Name of the indexed file. Memory allocated
67 * at the end of this struct (do not free).
72 * Context for transmitting confirmation to client,
73 * NULL if we've done this already.
75 struct GNUNET_SERVER_TransmitContext *tc;
78 * Hash of the contents of the file.
80 GNUNET_HashCode file_id;
86 * Signature of a function that is called whenever a datastore
87 * request can be processed (or an entry put on the queue times out).
90 * @param ok GNUNET_OK if DS is ready, GNUNET_SYSERR on timeout
92 typedef void (*RequestFunction)(void *cls,
97 * Doubly-linked list of our requests for the datastore.
99 struct DatastoreRequestQueue
103 * This is a doubly-linked list.
105 struct DatastoreRequestQueue *next;
108 * This is a doubly-linked list.
110 struct DatastoreRequestQueue *prev;
113 * Function to call (will issue the request).
123 * When should this request time-out because we don't care anymore?
125 struct GNUNET_TIME_Absolute timeout;
128 * ID of task used for signaling timeout.
130 GNUNET_SCHEDULER_TaskIdentifier task;
136 * Closure for processing START_SEARCH messages from a client.
138 struct LocalGetContext
142 * This is a doubly-linked list.
144 struct LocalGetContext *next;
147 * This is a doubly-linked list.
149 struct LocalGetContext *prev;
152 * Client that initiated the search.
154 struct GNUNET_SERVER_Client *client;
157 * Array of results that we've already received
160 GNUNET_HashCode *results;
163 * Bloomfilter over all results (for fast query construction);
164 * NULL if we don't have any results.
166 * FIXME: this member is not used, is that OK? If so, it should
169 struct GNUNET_CONTAINER_BloomFilter *results_bf;
172 * DS request associated with this operation.
174 struct DatastoreRequestQueue *req;
177 * Current result message to transmit to client (or NULL).
179 struct ContentMessage *result;
182 * Type of the content that we're looking for.
188 * Desired anonymity level.
190 uint32_t anonymity_level;
193 * Number of results actually stored in the results array.
195 unsigned int results_used;
198 * Size of the results array in memory.
200 unsigned int results_size;
203 * Size (in bytes) of the 'results_bf' bloomfilter.
205 * FIXME: this member is not used, is that OK? If so, it should
208 size_t results_bf_size;
211 * If the request is for a DBLOCK or IBLOCK, this is the identity of
212 * the peer that is known to have a response. Set to all-zeros if
213 * such a target is not known (note that even if OUR anonymity
214 * level is >0 we may happen to know the responder's identity;
215 * nevertheless, we should probably not use it for a DHT-lookup
216 * or similar blunt actions in order to avoid exposing ourselves).
218 struct GNUNET_PeerIdentity target;
221 * If the request is for an SBLOCK, this is the identity of the
222 * pseudonym to which the SBLOCK belongs.
224 GNUNET_HashCode namespace;
227 * Hash of the keyword (aka query) for KBLOCKs; Hash of
228 * the CHK-encoded block for DBLOCKS and IBLOCKS (aka query)
229 * and hash of the identifier XORed with the target for
230 * SBLOCKS (aka query).
232 GNUNET_HashCode query;
238 * Possible routing policies for an FS-GET request.
243 * Simply drop the request.
245 ROUTING_POLICY_NONE = 0,
248 * Answer it if we can from local datastore.
250 ROUTING_POLICY_ANSWER = 1,
253 * Forward the request to other peers (if possible).
255 ROUTING_POLICY_FORWARD = 2,
258 * Forward to other peers, and ask them to route
259 * the response via ourselves.
261 ROUTING_POLICY_INDIRECT = 6,
264 * Do everything we could possibly do (that would
267 ROUTING_POLICY_ALL = 7
272 * Internal context we use for our initial processing
275 struct ProcessGetContext
278 * The search query (used for datastore lookup).
280 GNUNET_HashCode query;
283 * Which peer we should forward the response to.
285 struct GNUNET_PeerIdentity reply_to;
288 * Namespace for the result (only set for SKS requests)
290 GNUNET_HashCode namespace;
293 * Peer that we should forward the query to if possible
294 * (since that peer likely has the content).
296 struct GNUNET_PeerIdentity prime_target;
299 * When did we receive this request?
301 struct GNUNET_TIME_Absolute start_time;
304 * Our entry in the DRQ (non-NULL while we wait for our
305 * turn to interact with the local database).
307 struct DatastoreRequestQueue *drq;
310 * Filter used to eliminate duplicate results. Can be NULL if we
311 * are not yet filtering any results.
313 struct GNUNET_CONTAINER_BloomFilter *bf;
316 * Bitmap describing which of the optional
317 * hash codes / peer identities were given to us.
322 * Desired block type.
327 * Priority of the request.
332 * Size of the 'bf' (in bytes).
337 * In what ways are we going to process
340 enum RoutingPolicy policy;
343 * Time-to-live for the request (value
349 * Number to mingle hashes for bloom-filter
355 * Number of results that were found so far.
357 unsigned int results_found;
362 * Information we keep for each pending reply.
367 * This is a linked list.
369 struct PendingReply *next;
372 * Size of the reply; actual reply message follows
373 * at the end of this struct.
381 * All requests from a client are kept in a doubly-linked list.
383 struct ClientRequestList;
387 * Information we keep for each pending request. We should try to
388 * keep this struct as small as possible since its memory consumption
389 * is key to how many requests we can have pending at once.
391 struct PendingRequest
395 * ID of a client making a request, NULL if this entry is for a
398 struct GNUNET_SERVER_Client *client;
401 * If this request was made by a client,
402 * this is our entry in the client request
403 * list; otherwise NULL.
405 struct ClientRequestList *crl_entry;
408 * If this is a namespace query, pointer to the hash of the public
409 * key of the namespace; otherwise NULL.
411 GNUNET_HashCode *namespace;
414 * Bloomfilter we use to filter out replies that we don't care about
415 * (anymore). NULL as long as we are interested in all replies.
417 struct GNUNET_CONTAINER_BloomFilter *bf;
420 * Replies that we have received but were unable to forward yet
421 * (typically non-null only if we have a pending transmission
422 * request with the client or the respective peer).
424 struct PendingReply *replies_pending;
427 * Pending transmission request with the core service for the target
428 * peer (for processing of 'replies_pending') or Handle for a
429 * pending query-request for P2P-transmission with the core service.
430 * If non-NULL, this request must be cancelled should this struct be
433 struct GNUNET_CORE_TransmitHandle *cth;
436 * Pending transmission request for the target client (for processing of
437 * 'replies_pending').
439 struct GNUNET_CONNECTION_TransmitHandle *th;
442 * Hash code of all replies that we have seen so far (only valid
443 * if client is not NULL since we only track replies like this for
446 GNUNET_HashCode *replies_seen;
449 * When did we first see this request (form this peer), or, if our
450 * client is initiating, when did we last initiate a search?
452 struct GNUNET_TIME_Absolute start_time;
455 * The query that this request is for.
457 GNUNET_HashCode query;
460 * The task responsible for transmitting queries
463 GNUNET_SCHEDULER_TaskIdentifier task;
466 * (Interned) Peer identifier (only valid if "client" is NULL)
467 * that identifies a peer that gave us this request.
469 GNUNET_PEER_Id source_pid;
472 * (Interned) Peer identifier that identifies a preferred target
475 GNUNET_PEER_Id target_pid;
478 * (Interned) Peer identifiers of peers that have already
479 * received our query for this content.
481 GNUNET_PEER_Id *used_pids;
484 * Size of the 'bf' (in bytes).
489 * Desired anonymity level; only valid for requests from a local client.
491 uint32_t anonymity_level;
494 * How many entries in "used_pids" are actually valid?
496 unsigned int used_pids_off;
499 * How long is the "used_pids" array?
501 unsigned int used_pids_size;
504 * How many entries in "replies_seen" are actually valid?
506 unsigned int replies_seen_off;
509 * How long is the "replies_seen" array?
511 unsigned int replies_seen_size;
514 * Priority with which this request was made. If one of our clients
515 * made the request, then this is the current priority that we are
516 * using when initiating the request. This value is used when
517 * we decide to reward other peers with trust for providing a reply.
522 * Priority points left for us to spend when forwarding this request
525 uint32_t remaining_priority;
528 * Number to mingle hashes for bloom-filter
534 * TTL with which we saw this request (or, if we initiated, TTL that
535 * we used for the request).
540 * Type of the content that this request is for.
548 * All requests from a client are kept in a doubly-linked list.
550 struct ClientRequestList
553 * This is a doubly-linked list.
555 struct ClientRequestList *next;
558 * This is a doubly-linked list.
560 struct ClientRequestList *prev;
563 * A request from this client.
565 struct PendingRequest *req;
568 * Client list with the head and tail of this DLL.
570 struct ClientList *cl;
575 * Linked list of all clients that we are
576 * currently processing requests for.
582 * This is a linked list.
584 struct ClientList *next;
587 * What client is this entry for?
589 struct GNUNET_SERVER_Client* client;
592 * Head of the DLL of requests from this client.
594 struct ClientRequestList *head;
597 * Tail of the DLL of requests from this client.
599 struct ClientRequestList *tail;
605 * Closure for "process_reply" function.
607 struct ProcessReplyClosure
610 * The data for the reply.
615 * When the reply expires.
617 struct GNUNET_TIME_Absolute expiration;
625 * Namespace that this reply belongs to
626 * (if it is of type SBLOCK).
628 GNUNET_HashCode namespace;
636 * How much was this reply worth to us?
643 * Information about a peer that we are connected to.
644 * We track data that is useful for determining which
645 * peers should receive our requests.
651 * List of the last clients for which this peer
652 * successfully answered a query.
654 struct GNUNET_SERVER_Client *last_client_replies[CS2P_SUCCESS_LIST_SIZE];
657 * List of the last PIDs for which
658 * this peer successfully answered a query;
659 * We use 0 to indicate no successful reply.
661 GNUNET_PEER_Id last_p2p_replies[P2P_SUCCESS_LIST_SIZE];
664 * Average delay between sending the peer a request and
665 * getting a reply (only calculated over the requests for
666 * which we actually got a reply). Calculated
667 * as a moving average: new_delay = ((n-1)*last_delay+curr_delay) / n
669 struct GNUNET_TIME_Relative avg_delay;
672 * Average priority of successful replies. Calculated
673 * as a moving average: new_avg = ((n-1)*last_avg+curr_prio) / n
678 * The peer's identity.
683 * Number of requests we have currently pending
684 * with this peer (that is, requests that were
685 * transmitted so recently that we would not retransmit
688 unsigned int pending_requests;
691 * Which offset in "last_p2p_replies" will be updated next?
692 * (we go round-robin).
694 unsigned int last_p2p_replies_woff;
697 * Which offset in "last_client_replies" will be updated next?
698 * (we go round-robin).
700 unsigned int last_client_replies_woff;
706 * Our connection to the datastore.
708 static struct GNUNET_DATASTORE_Handle *dsh;
713 static struct GNUNET_SCHEDULER_Handle *sched;
718 const struct GNUNET_CONFIGURATION_Handle *cfg;
721 * Handle to the core service (NULL until we've connected to it).
723 struct GNUNET_CORE_Handle *core;
726 * Head of doubly-linked LGC list.
728 static struct LocalGetContext *lgc_head;
731 * Tail of doubly-linked LGC list.
733 static struct LocalGetContext *lgc_tail;
736 * Head of request queue for the datastore, sorted by timeout.
738 static struct DatastoreRequestQueue *drq_head;
741 * Tail of request queue for the datastore.
743 static struct DatastoreRequestQueue *drq_tail;
746 * Linked list of indexed files.
748 static struct IndexInfo *indexed_files;
751 * Maps hash over content of indexed files to the respective filename.
752 * The filenames are pointers into the indexed_files linked list and
753 * do not need to be freed.
755 static struct GNUNET_CONTAINER_MultiHashMap *ifm;
758 * Map of query hash codes to requests.
760 static struct GNUNET_CONTAINER_MultiHashMap *requests_by_query;
763 * Map of peer IDs to requests (for those requests coming
766 static struct GNUNET_CONTAINER_MultiHashMap *requests_by_peer;
769 * Linked list of all of our clients and their requests.
771 static struct ClientList *clients;
774 * Heap with the request that will expire next at the top. Contains
775 * pointers of type "struct PendingRequest*"; these will *also* be
776 * aliased from the "requests_by_peer" data structures and the
777 * "requests_by_query" table. Note that requests from our clients
778 * don't expire and are thus NOT in the "requests_by_expiration"
779 * (or the "requests_by_peer" tables).
781 static struct GNUNET_CONTAINER_Heap *requests_by_expiration;
784 * Map of peer identifiers to "struct ConnectedPeer" (for that peer).
786 static struct GNUNET_CONTAINER_MultiHashMap *connected_peers;
789 * Maximum number of requests (from other peers) that we're
790 * willing to have pending at any given point in time.
791 * FIXME: set from configuration (and 32 is a tiny value for testing only).
793 static uint64_t max_pending_requests = 32;
797 * Write the current index information list to disk.
802 struct GNUNET_BIO_WriteHandle *wh;
804 struct IndexInfo *pos;
807 GNUNET_CONFIGURATION_get_value_filename (cfg,
812 GNUNET_log (GNUNET_ERROR_TYPE_ERROR | GNUNET_ERROR_TYPE_BULK,
813 _("Configuration option `%s' in section `%s' missing.\n"),
818 wh = GNUNET_BIO_write_open (fn);
821 GNUNET_log (GNUNET_ERROR_TYPE_ERROR | GNUNET_ERROR_TYPE_BULK,
822 _("Could not open `%s'.\n"),
831 GNUNET_BIO_write (wh,
833 sizeof (GNUNET_HashCode))) ||
835 GNUNET_BIO_write_string (wh,
841 GNUNET_BIO_write_close (wh))
843 GNUNET_log (GNUNET_ERROR_TYPE_ERROR | GNUNET_ERROR_TYPE_BULK,
844 _("Error writing `%s'.\n"),
854 * Read index information from disk.
859 struct GNUNET_BIO_ReadHandle *rh;
861 struct IndexInfo *pos;
868 GNUNET_CONFIGURATION_get_value_filename (cfg,
873 GNUNET_log (GNUNET_ERROR_TYPE_ERROR | GNUNET_ERROR_TYPE_BULK,
874 _("Configuration option `%s' in section `%s' missing.\n"),
879 if (GNUNET_NO == GNUNET_DISK_file_test (fn))
881 /* no index info yet */
885 rh = GNUNET_BIO_read_open (fn);
888 GNUNET_log (GNUNET_ERROR_TYPE_ERROR | GNUNET_ERROR_TYPE_BULK,
889 _("Could not open `%s'.\n"),
895 while ( (GNUNET_OK ==
897 "Hash of indexed file",
899 sizeof (GNUNET_HashCode))) &&
901 GNUNET_BIO_read_string (rh,
902 "Name of indexed file",
906 slen = strlen (fname) + 1;
907 pos = GNUNET_malloc (sizeof (struct IndexInfo) + slen);
909 pos->filename = (const char *) &pos[1];
910 memcpy (&pos[1], fname, slen);
912 GNUNET_CONTAINER_multihashmap_put (ifm,
914 (void*) pos->filename,
915 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
921 pos->next = indexed_files;
927 GNUNET_BIO_read_close (rh, &emsg))
934 * We've validated the hash of the file we're about to
935 * index. Signal success to the client and update
936 * our internal data structures.
938 * @param ii the index info entry for the request
941 signal_index_ok (struct IndexInfo *ii)
944 GNUNET_CONTAINER_multihashmap_put (ifm,
946 (void*) ii->filename,
947 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
949 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
950 _("Index request received for file `%s' is indexed as `%s'. Permitting anyway.\n"),
952 (const char*) GNUNET_CONTAINER_multihashmap_get (ifm,
954 GNUNET_SERVER_transmit_context_append (ii->tc,
956 GNUNET_MESSAGE_TYPE_FS_INDEX_START_OK);
957 GNUNET_SERVER_transmit_context_run (ii->tc,
958 GNUNET_TIME_UNIT_MINUTES);
962 ii->next = indexed_files;
965 GNUNET_SERVER_transmit_context_append (ii->tc,
967 GNUNET_MESSAGE_TYPE_FS_INDEX_START_OK);
968 GNUNET_SERVER_transmit_context_run (ii->tc,
969 GNUNET_TIME_UNIT_MINUTES);
975 * Function called once the hash computation over an
976 * indexed file has completed.
978 * @param cls closure, our publishing context
979 * @param res resulting hash, NULL on error
982 hash_for_index_val (void *cls,
983 const GNUNET_HashCode *
986 struct IndexInfo *ii = cls;
988 if ( (res == NULL) ||
991 sizeof(GNUNET_HashCode))) )
993 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
994 _("Hash mismatch trying to index file `%s' which has hash `%s'\n"),
998 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1000 GNUNET_h2s (&ii->file_id));
1002 GNUNET_SERVER_transmit_context_append (ii->tc,
1004 GNUNET_MESSAGE_TYPE_FS_INDEX_START_FAILED);
1005 GNUNET_SERVER_transmit_context_run (ii->tc,
1006 GNUNET_TIME_UNIT_MINUTES);
1010 signal_index_ok (ii);
1015 * Handle INDEX_START-message.
1017 * @param cls closure
1018 * @param client identification of the client
1019 * @param message the actual message
1022 handle_index_start (void *cls,
1023 struct GNUNET_SERVER_Client *client,
1024 const struct GNUNET_MessageHeader *message)
1026 const struct IndexStartMessage *ism;
1029 struct IndexInfo *ii;
1036 msize = ntohs(message->size);
1037 if ( (msize <= sizeof (struct IndexStartMessage)) ||
1038 ( ((const char *)message)[msize-1] != '\0') )
1041 GNUNET_SERVER_receive_done (client,
1045 ism = (const struct IndexStartMessage*) message;
1046 fn = (const char*) &ism[1];
1047 dev = ntohl (ism->device);
1048 ino = GNUNET_ntohll (ism->inode);
1049 ism = (const struct IndexStartMessage*) message;
1050 slen = strlen (fn) + 1;
1051 ii = GNUNET_malloc (sizeof (struct IndexInfo) + slen);
1052 ii->filename = (const char*) &ii[1];
1053 memcpy (&ii[1], fn, slen);
1054 ii->file_id = ism->file_id;
1055 ii->tc = GNUNET_SERVER_transmit_context_create (client);
1056 if ( ( (dev != 0) ||
1058 (GNUNET_OK == GNUNET_DISK_file_get_identifiers (fn,
1064 /* fast validation OK! */
1065 signal_index_ok (ii);
1069 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1070 "Mismatch in file identifiers (%llu != %llu or %u != %u), need to hash.\n",
1071 (unsigned long long) ino,
1072 (unsigned long long) myino,
1074 (unsigned int) mydev);
1076 /* slow validation, need to hash full file (again) */
1077 GNUNET_CRYPTO_hash_file (sched,
1078 GNUNET_SCHEDULER_PRIORITY_IDLE,
1081 &hash_for_index_val,
1087 * Handle INDEX_LIST_GET-message.
1089 * @param cls closure
1090 * @param client identification of the client
1091 * @param message the actual message
1094 handle_index_list_get (void *cls,
1095 struct GNUNET_SERVER_Client *client,
1096 const struct GNUNET_MessageHeader *message)
1098 struct GNUNET_SERVER_TransmitContext *tc;
1099 struct IndexInfoMessage *iim;
1100 char buf[GNUNET_SERVER_MAX_MESSAGE_SIZE];
1103 struct GNUNET_MessageHeader *msg;
1104 struct IndexInfo *pos;
1106 tc = GNUNET_SERVER_transmit_context_create (client);
1107 iim = (struct IndexInfoMessage*) buf;
1109 pos = indexed_files;
1113 iim->file_id = pos->file_id;
1115 slen = strlen (fn) + 1;
1116 if (slen + sizeof (struct IndexInfoMessage) >
1117 GNUNET_SERVER_MAX_MESSAGE_SIZE)
1122 memcpy (&iim[1], fn, slen);
1123 GNUNET_SERVER_transmit_context_append
1126 sizeof (struct IndexInfoMessage)
1127 - sizeof (struct GNUNET_MessageHeader) + slen,
1128 GNUNET_MESSAGE_TYPE_FS_INDEX_LIST_ENTRY);
1131 GNUNET_SERVER_transmit_context_append (tc,
1133 GNUNET_MESSAGE_TYPE_FS_INDEX_LIST_END);
1134 GNUNET_SERVER_transmit_context_run (tc,
1135 GNUNET_TIME_UNIT_MINUTES);
1140 * Handle UNINDEX-message.
1142 * @param cls closure
1143 * @param client identification of the client
1144 * @param message the actual message
1147 handle_unindex (void *cls,
1148 struct GNUNET_SERVER_Client *client,
1149 const struct GNUNET_MessageHeader *message)
1151 const struct UnindexMessage *um;
1152 struct IndexInfo *pos;
1153 struct IndexInfo *prev;
1154 struct IndexInfo *next;
1155 struct GNUNET_SERVER_TransmitContext *tc;
1158 um = (const struct UnindexMessage*) message;
1161 pos = indexed_files;
1165 if (0 == memcmp (&pos->file_id,
1167 sizeof (GNUNET_HashCode)))
1170 indexed_files = pos->next;
1172 prev->next = pos->next;
1183 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1184 "Client requested unindexing of file `%s': %s\n",
1185 GNUNET_h2s (&um->file_id),
1186 found ? "found" : "not found");
1188 if (GNUNET_YES == found)
1189 write_index_list ();
1190 tc = GNUNET_SERVER_transmit_context_create (client);
1191 GNUNET_SERVER_transmit_context_append (tc,
1193 GNUNET_MESSAGE_TYPE_FS_UNINDEX_OK);
1194 GNUNET_SERVER_transmit_context_run (tc,
1195 GNUNET_TIME_UNIT_MINUTES);
1200 * Run the next DS request in our
1201 * queue, we're done with the current one.
1206 struct DatastoreRequestQueue *e;
1208 while (NULL != (e = drq_head))
1210 if (0 != GNUNET_TIME_absolute_get_remaining (e->timeout).value)
1212 if (e->task != GNUNET_SCHEDULER_NO_TASK)
1213 GNUNET_SCHEDULER_cancel (sched, e->task);
1214 GNUNET_CONTAINER_DLL_remove (drq_head, drq_tail, e);
1215 e->req (e->req_cls, GNUNET_NO);
1220 if (e->task != GNUNET_SCHEDULER_NO_TASK)
1221 GNUNET_SCHEDULER_cancel (sched, e->task);
1222 e->task = GNUNET_SCHEDULER_NO_TASK;
1223 e->req (e->req_cls, GNUNET_YES);
1224 GNUNET_CONTAINER_DLL_remove (drq_head, drq_tail, e);
1230 * A datastore request had to be timed out.
1232 * @param cls closure (of type "struct DatastoreRequestQueue*")
1233 * @param tc task context, unused
1236 timeout_ds_request (void *cls,
1237 const struct GNUNET_SCHEDULER_TaskContext *tc)
1239 struct DatastoreRequestQueue *e = cls;
1241 e->task = GNUNET_SCHEDULER_NO_TASK;
1242 GNUNET_CONTAINER_DLL_remove (drq_head, drq_tail, e);
1243 e->req (e->req_cls, GNUNET_NO);
1249 * Queue a request for the datastore.
1251 * @param deadline by when the request should run
1252 * @param fun function to call once the request can be run
1253 * @param fun_cls closure for fun
1255 static struct DatastoreRequestQueue *
1256 queue_ds_request (struct GNUNET_TIME_Relative deadline,
1257 RequestFunction fun,
1260 struct DatastoreRequestQueue *e;
1261 struct DatastoreRequestQueue *bef;
1263 if (drq_head == NULL)
1265 /* no other requests pending, run immediately */
1266 fun (fun_cls, GNUNET_OK);
1269 e = GNUNET_malloc (sizeof (struct DatastoreRequestQueue));
1270 e->timeout = GNUNET_TIME_relative_to_absolute (deadline);
1272 e->req_cls = fun_cls;
1273 if (deadline.value == GNUNET_TIME_UNIT_FOREVER_REL.value)
1275 /* local request, highest prio, put at head of queue
1276 regardless of deadline */
1282 while ( (NULL != bef) &&
1283 (e->timeout.value < bef->timeout.value) )
1286 GNUNET_CONTAINER_DLL_insert_after (drq_head, drq_tail, bef, e);
1287 if (deadline.value == GNUNET_TIME_UNIT_FOREVER_REL.value)
1289 e->task = GNUNET_SCHEDULER_add_delayed (sched,
1291 &timeout_ds_request,
1298 * Free the state associated with a local get context.
1300 * @param lgc the lgc to free
1303 local_get_context_free (struct LocalGetContext *lgc)
1305 GNUNET_CONTAINER_DLL_remove (lgc_head, lgc_tail, lgc);
1306 GNUNET_SERVER_client_drop (lgc->client);
1307 GNUNET_free_non_null (lgc->results);
1308 if (lgc->results_bf != NULL)
1309 GNUNET_CONTAINER_bloomfilter_free (lgc->results_bf);
1310 if (lgc->req != NULL)
1312 if (lgc->req->task != GNUNET_SCHEDULER_NO_TASK)
1313 GNUNET_SCHEDULER_cancel (sched, lgc->req->task);
1314 GNUNET_CONTAINER_DLL_remove (lgc_head, lgc_tail, lgc);
1315 GNUNET_free (lgc->req);
1322 * We're able to transmit the next (local) result to the client.
1323 * Do it and ask the datastore for more. Or, on error, tell
1324 * the datastore to stop giving us more.
1326 * @param cls our closure (struct LocalGetContext)
1327 * @param max maximum number of bytes we can transmit
1328 * @param buf where to copy our message
1329 * @return number of bytes copied to buf
1332 transmit_local_result (void *cls,
1336 struct LocalGetContext *lgc = cls;
1342 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1343 "Failed to transmit result to local client, aborting datastore iteration.\n");
1346 GNUNET_free (lgc->result);
1348 GNUNET_DATASTORE_get_next (dsh, GNUNET_NO);
1351 msize = ntohs (lgc->result->header.size);
1353 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1354 "Transmitting %u bytes of result to local client.\n",
1357 GNUNET_assert (max >= msize);
1358 memcpy (buf, lgc->result, msize);
1359 GNUNET_free (lgc->result);
1361 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
1367 * Continuation called from datastore's remove
1371 * @param success did the deletion work?
1372 * @param msg error message
1375 remove_cont (void *cls,
1379 if (GNUNET_OK != success)
1380 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
1381 _("Failed to delete bogus block: %s\n"),
1383 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
1388 * Mingle hash with the mingle_number to
1389 * produce different bits.
1392 mingle_hash (const GNUNET_HashCode * in,
1393 int32_t mingle_number,
1394 GNUNET_HashCode * hc)
1398 GNUNET_CRYPTO_hash (&mingle_number,
1401 GNUNET_CRYPTO_hash_xor (&m, in, hc);
1406 * We've received an on-demand encoded block
1407 * from the datastore. Attempt to do on-demand
1408 * encoding and (if successful), call the
1409 * continuation with the resulting block. On
1410 * error, clean up and ask the datastore for
1413 * @param key key for the content
1414 * @param size number of bytes in data
1415 * @param data content stored
1416 * @param type type of the content
1417 * @param priority priority of the content
1418 * @param anonymity anonymity-level for the content
1419 * @param expiration expiration time for the content
1420 * @param uid unique identifier for the datum;
1421 * maybe 0 if no unique identifier is available
1422 * @param cont function to call with the actual block
1423 * @param cont_cls closure for cont
1426 handle_on_demand_block (const GNUNET_HashCode * key,
1432 struct GNUNET_TIME_Absolute
1433 expiration, uint64_t uid,
1434 GNUNET_DATASTORE_Iterator cont,
1437 const struct OnDemandBlock *odb;
1438 GNUNET_HashCode nkey;
1439 struct GNUNET_CRYPTO_AesSessionKey skey;
1440 struct GNUNET_CRYPTO_AesInitializationVector iv;
1441 GNUNET_HashCode query;
1443 char ndata[DBLOCK_SIZE];
1444 char edata[DBLOCK_SIZE];
1446 struct GNUNET_DISK_FileHandle *fh;
1449 if (size != sizeof (struct OnDemandBlock))
1452 GNUNET_DATASTORE_remove (dsh,
1458 GNUNET_TIME_UNIT_FOREVER_REL);
1461 odb = (const struct OnDemandBlock*) data;
1462 off = GNUNET_ntohll (odb->offset);
1463 fn = (const char*) GNUNET_CONTAINER_multihashmap_get (ifm,
1466 if ( (NULL == fn) ||
1467 (NULL == (fh = GNUNET_DISK_file_open (fn,
1468 GNUNET_DISK_OPEN_READ,
1469 GNUNET_DISK_PERM_NONE))) ||
1471 GNUNET_DISK_file_seek (fh,
1473 GNUNET_DISK_SEEK_SET)) ||
1475 (nsize = GNUNET_DISK_file_read (fh,
1479 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
1480 _("Could not access indexed file `%s' at offset %llu: %s\n"),
1481 GNUNET_h2s (&odb->file_id),
1482 (unsigned long long) off,
1485 GNUNET_DISK_file_close (fh);
1486 /* FIXME: if this happens often, we need
1487 to remove the OnDemand block from the DS! */
1488 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
1491 GNUNET_DISK_file_close (fh);
1492 GNUNET_CRYPTO_hash (ndata,
1495 GNUNET_CRYPTO_hash_to_aes_key (&nkey, &skey, &iv);
1496 GNUNET_CRYPTO_aes_encrypt (ndata,
1501 GNUNET_CRYPTO_hash (edata,
1504 if (0 != memcmp (&query,
1506 sizeof (GNUNET_HashCode)))
1508 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
1509 _("Indexed file `%s' changed at offset %llu\n"),
1511 (unsigned long long) off);
1512 /* FIXME: if this happens often, we need
1513 to remove the OnDemand block from the DS! */
1514 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
1521 GNUNET_DATASTORE_BLOCKTYPE_DBLOCK,
1530 * How many bytes should a bloomfilter be if we have already seen
1531 * entry_count responses? Note that BLOOMFILTER_K gives us the number
1532 * of bits set per entry. Furthermore, we should not re-size the
1533 * filter too often (to keep it cheap).
1535 * Since other peers will also add entries but not resize the filter,
1536 * we should generally pick a slightly larger size than what the
1537 * strict math would suggest.
1539 * @return must be a power of two and smaller or equal to 2^15.
1542 compute_bloomfilter_size (unsigned int entry_count)
1545 unsigned int ideal = (entry_count * BLOOMFILTER_K) / 4;
1546 uint16_t max = 1 << 15;
1548 if (entry_count > max)
1551 while ((size < max) && (size < ideal))
1560 * Recalculate our bloom filter for filtering replies.
1562 * @param count number of entries we are filtering right now
1563 * @param mingle set to our new mingling value
1564 * @param bf_size set to the size of the bloomfilter
1565 * @param entries the entries to filter
1566 * @return updated bloomfilter, NULL for none
1568 static struct GNUNET_CONTAINER_BloomFilter *
1569 refresh_bloomfilter (unsigned int count,
1572 const GNUNET_HashCode *entries)
1574 struct GNUNET_CONTAINER_BloomFilter *bf;
1577 GNUNET_HashCode mhash;
1581 nsize = compute_bloomfilter_size (count);
1582 *mingle = GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, -1);
1584 bf = GNUNET_CONTAINER_bloomfilter_init (NULL,
1587 for (i=0;i<count;i++)
1589 mingle_hash (&entries[i], *mingle, &mhash);
1590 GNUNET_CONTAINER_bloomfilter_add (bf, &mhash);
1597 * Closure used for "target_peer_select_cb".
1599 struct PeerSelectionContext
1602 * The request for which we are selecting
1605 struct PendingRequest *pr;
1608 * Current "prime" target.
1610 struct GNUNET_PeerIdentity target;
1613 * How much do we like this target?
1615 double target_score;
1621 * Function called for each connected peer to determine
1622 * which one(s) would make good targets for forwarding.
1624 * @param cls closure (struct PeerSelectionContext)
1625 * @param key current key code (peer identity)
1626 * @param value value in the hash map (struct ConnectedPeer)
1627 * @return GNUNET_YES if we should continue to
1632 target_peer_select_cb (void *cls,
1633 const GNUNET_HashCode * key,
1636 struct PeerSelectionContext *psc = cls;
1637 struct ConnectedPeer *cp = value;
1638 struct PendingRequest *pr = psc->pr;
1642 /* 1) check if we have already (recently) forwarded to this peer */
1643 for (i=0;i<pr->used_pids_off;i++)
1644 if (pr->used_pids[i] == cp->pid)
1645 return GNUNET_YES; /* skip */
1646 // 2) calculate how much we'd like to forward to this peer
1647 score = 0; // FIXME!
1649 /* store best-fit in closure */
1650 if (score > psc->target_score)
1652 psc->target_score = score;
1653 psc->target.hashPubKey = *key;
1660 * We use a random delay to make the timing of requests
1661 * less predictable. This function returns such a random
1664 * @return random delay to use for some request, between 0 and TTL_DECREMENT ms
1666 static struct GNUNET_TIME_Relative
1667 get_processing_delay ()
1669 return GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MILLISECONDS,
1670 GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
1676 * Task that is run for each request with the
1677 * goal of forwarding the associated query to
1678 * other peers. The task should re-schedule
1679 * itself to be re-run once the TTL has expired.
1680 * (or at a later time if more peers should
1681 * be queried earlier).
1683 * @param cls the requests "struct PendingRequest*"
1684 * @param tc task context (unused)
1687 forward_request_task (void *cls,
1688 const struct GNUNET_SCHEDULER_TaskContext *tc);
1692 * We've selected a peer for forwarding of a query.
1693 * Construct the message and then re-schedule the
1694 * task to forward again to (other) peers.
1696 * @param cls closure
1697 * @param size number of bytes available in buf
1698 * @param buf where the callee should write the message
1699 * @return number of bytes written to buf
1702 transmit_request_cb (void *cls,
1706 struct PendingRequest *pr = cls;
1707 struct GetMessage *gm;
1708 GNUNET_HashCode *ext;
1714 /* (1) check for timeout */
1717 /* timeout, try another peer immediately again */
1718 pr->task = GNUNET_SCHEDULER_add_with_priority (sched,
1719 GNUNET_SCHEDULER_PRIORITY_IDLE,
1720 &forward_request_task,
1724 /* (2) build query message */
1725 k = 0; // FIXME: count hash codes!
1726 msize = sizeof (struct GetMessage) + pr->bf_size + k * sizeof(GNUNET_HashCode);
1727 GNUNET_assert (msize < GNUNET_SERVER_MAX_MESSAGE_SIZE);
1728 gm = (struct GetMessage*) buf;
1729 gm->header.type = htons (GNUNET_MESSAGE_TYPE_FS_GET);
1730 gm->header.size = htons (msize);
1731 gm->type = htonl (pr->type);
1732 pr->remaining_priority /= 2;
1733 gm->priority = htonl (pr->remaining_priority);
1734 gm->ttl = htonl (pr->ttl);
1735 gm->filter_mutator = htonl(pr->mingle);
1736 gm->hash_bitmap = htonl (42);
1737 gm->query = pr->query;
1738 ext = (GNUNET_HashCode*) &gm[1];
1739 // FIXME: setup "ext[0]..[k-1]"
1740 bfdata = (char *) &ext[k];
1742 GNUNET_CONTAINER_bloomfilter_get_raw_data (pr->bf,
1746 /* (3) schedule job to do it again (or another peer, etc.) */
1747 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1748 get_processing_delay (), // FIXME!
1749 &forward_request_task,
1757 * Function called after we've tried to reserve
1758 * a certain amount of bandwidth for a reply.
1759 * Check if we succeeded and if so send our query.
1761 * @param cls the requests "struct PendingRequest*"
1762 * @param peer identifies the peer
1763 * @param latency current latency estimate, "FOREVER" if we have been
1765 * @param bpm_in set to the current bandwidth limit (receiving) for this peer
1766 * @param bpm_out set to the current bandwidth limit (sending) for this peer
1767 * @param amount set to the amount that was actually reserved or unreserved
1768 * @param preference current traffic preference for the given peer
1771 target_reservation_cb (void *cls,
1773 GNUNET_PeerIdentity * peer,
1774 unsigned int bpm_in,
1775 unsigned int bpm_out,
1776 struct GNUNET_TIME_Relative
1777 latency, int amount,
1778 unsigned long long preference)
1780 struct PendingRequest *pr = cls;
1783 struct GNUNET_TIME_Relative maxdelay;
1785 GNUNET_assert (peer != NULL);
1786 if ( (amount != DBLOCK_SIZE) ||
1789 /* try again later; FIXME: we may need to un-reserve "amount"? */
1790 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1791 get_processing_delay (), // FIXME: longer?
1792 &forward_request_task,
1796 // (2) transmit, update ttl/priority
1797 // FIXME: calculate priority, maxdelay, size properly!
1800 maxdelay = GNUNET_CONSTANTS_SERVICE_TIMEOUT;
1801 pr->cth = GNUNET_CORE_notify_transmit_ready (core,
1806 &transmit_request_cb,
1808 if (pr->cth == NULL)
1810 /* try again later */
1811 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1812 get_processing_delay (), // FIXME: longer?
1813 &forward_request_task,
1820 * Task that is run for each request with the
1821 * goal of forwarding the associated query to
1822 * other peers. The task should re-schedule
1823 * itself to be re-run once the TTL has expired.
1824 * (or at a later time if more peers should
1825 * be queried earlier).
1827 * @param cls the requests "struct PendingRequest*"
1828 * @param tc task context (unused)
1831 forward_request_task (void *cls,
1832 const struct GNUNET_SCHEDULER_TaskContext *tc)
1834 struct PendingRequest *pr = cls;
1835 struct PeerSelectionContext psc;
1837 pr->task = GNUNET_SCHEDULER_NO_TASK;
1838 if (pr->cth != NULL)
1840 /* we're busy transmitting a result, wait a bit */
1841 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1842 get_processing_delay (),
1843 &forward_request_task,
1847 /* (1) select target */
1849 psc.target_score = DBL_MIN;
1850 GNUNET_CONTAINER_multihashmap_iterate (connected_peers,
1851 &target_peer_select_cb,
1853 if (psc.target_score == DBL_MIN)
1855 /* no possible target found, wait some time */
1856 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1857 get_processing_delay (), // FIXME: exponential back-off? or at least wait longer...
1858 &forward_request_task,
1862 /* (2) reserve reply bandwidth */
1863 // FIXME: need a way to cancel; this
1864 // async operation is problematic (segv-problematic)
1865 // if "pr" is destroyed while it happens!
1866 GNUNET_CORE_peer_configure (core,
1868 GNUNET_CONSTANTS_SERVICE_TIMEOUT,
1870 DBLOCK_SIZE, // FIXME: make dependent on type?
1872 &target_reservation_cb,
1878 * We're processing (local) results for a search request
1879 * from a (local) client. Pass applicable results to the
1880 * client and if we are done either clean up (operation
1881 * complete) or switch to P2P search (more results possible).
1883 * @param cls our closure (struct LocalGetContext)
1884 * @param key key for the content
1885 * @param size number of bytes in data
1886 * @param data content stored
1887 * @param type type of the content
1888 * @param priority priority of the content
1889 * @param anonymity anonymity-level for the content
1890 * @param expiration expiration time for the content
1891 * @param uid unique identifier for the datum;
1892 * maybe 0 if no unique identifier is available
1895 process_local_get_result (void *cls,
1896 const GNUNET_HashCode * key,
1902 struct GNUNET_TIME_Absolute
1906 struct LocalGetContext *lgc = cls;
1907 struct PendingRequest *pr;
1908 struct ClientRequestList *crl;
1909 struct ClientList *cl;
1916 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1917 "Received last result for `%s' from local datastore, deciding what to do next.\n",
1918 GNUNET_h2s (&lgc->query));
1920 /* no further results from datastore; continue
1921 processing further requests from the client and
1922 allow the next task to use the datastore; also,
1923 switch to P2P requests or clean up our state. */
1925 GNUNET_SERVER_receive_done (lgc->client,
1927 if ( (lgc->results_used == 0) ||
1928 (lgc->type == GNUNET_DATASTORE_BLOCKTYPE_KBLOCK) ||
1929 (lgc->type == GNUNET_DATASTORE_BLOCKTYPE_SBLOCK) ||
1930 (lgc->type == GNUNET_DATASTORE_BLOCKTYPE_SKBLOCK) )
1933 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1934 "Forwarding query for `%s' to network.\n",
1935 GNUNET_h2s (&lgc->query));
1938 while ( (NULL != cl) &&
1939 (cl->client != lgc->client) )
1943 cl = GNUNET_malloc (sizeof (struct ClientList));
1944 cl->client = lgc->client;
1948 crl = GNUNET_malloc (sizeof (struct ClientRequestList));
1950 GNUNET_CONTAINER_DLL_insert (cl->head, cl->tail, crl);
1951 pr = GNUNET_malloc (sizeof (struct PendingRequest));
1952 pr->client = lgc->client;
1953 GNUNET_SERVER_client_keep (pr->client);
1954 pr->crl_entry = crl;
1956 if (lgc->type == GNUNET_DATASTORE_BLOCKTYPE_SBLOCK)
1958 pr->namespace = GNUNET_malloc (sizeof (GNUNET_HashCode));
1959 *pr->namespace = lgc->namespace;
1961 pr->replies_seen = lgc->results;
1962 lgc->results = NULL;
1963 pr->start_time = GNUNET_TIME_absolute_get ();
1964 pr->query = lgc->query;
1965 pr->target_pid = GNUNET_PEER_intern (&lgc->target);
1966 pr->replies_seen_off = lgc->results_used;
1967 pr->replies_seen_size = lgc->results_size;
1968 lgc->results_size = 0;
1969 pr->type = lgc->type;
1970 pr->anonymity_level = lgc->anonymity_level;
1971 pr->bf = refresh_bloomfilter (pr->replies_seen_off,
1975 GNUNET_CONTAINER_multihashmap_put (requests_by_query,
1978 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE);
1979 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
1980 get_processing_delay (),
1981 &forward_request_task,
1983 local_get_context_free (lgc);
1986 /* got all possible results, clean up! */
1988 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1989 "Found all possible results for query for `%s', done!\n",
1990 GNUNET_h2s (&lgc->query));
1992 local_get_context_free (lgc);
1995 if (type == GNUNET_DATASTORE_BLOCKTYPE_ONDEMAND)
1998 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1999 "Received on-demand block for `%s' from local datastore, fetching data.\n",
2000 GNUNET_h2s (&lgc->query));
2002 handle_on_demand_block (key, size, data, type, priority,
2003 anonymity, expiration, uid,
2004 &process_local_get_result,
2008 if ( (type != lgc->type) &&
2009 (lgc->type != GNUNET_DATASTORE_BLOCKTYPE_ANY) )
2011 /* this should be virtually impossible to reach (DBLOCK
2012 query hash being identical to KBLOCK/SBLOCK query hash);
2013 nevertheless, if it happens, the correct thing is to
2014 simply skip the result. */
2016 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2017 "Received block of unexpected type (%u, want %u) for `%s' from local datastore, ignoring.\n",
2020 GNUNET_h2s (&lgc->query));
2022 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
2025 /* check if this is a result we've alredy
2027 for (i=0;i<lgc->results_used;i++)
2028 if (0 == memcmp (key,
2030 sizeof (GNUNET_HashCode)))
2033 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2034 "Received duplicate result for `%s' from local datastore, ignoring.\n",
2035 GNUNET_h2s (&lgc->query));
2037 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
2040 if (lgc->results_used == lgc->results_size)
2041 GNUNET_array_grow (lgc->results,
2043 lgc->results_size * 2 + 2);
2044 GNUNET_CRYPTO_hash (data,
2046 &lgc->results[lgc->results_used++]);
2047 msize = size + sizeof (struct ContentMessage);
2048 GNUNET_assert (msize < GNUNET_SERVER_MAX_MESSAGE_SIZE);
2049 lgc->result = GNUNET_malloc (msize);
2050 lgc->result->header.size = htons (msize);
2051 lgc->result->header.type = htons (GNUNET_MESSAGE_TYPE_FS_CONTENT);
2052 lgc->result->type = htonl (type);
2053 lgc->result->expiration = GNUNET_TIME_absolute_hton (expiration);
2054 memcpy (&lgc->result[1],
2058 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2059 "Received new result for `%s' from local datastore, passing to client.\n",
2060 GNUNET_h2s (&lgc->query));
2062 GNUNET_SERVER_notify_transmit_ready (lgc->client,
2064 GNUNET_TIME_UNIT_FOREVER_REL,
2065 &transmit_local_result,
2071 * We're processing a search request from a local
2072 * client. Now it is our turn to query the datastore.
2074 * @param cls our closure (struct LocalGetContext)
2078 transmit_local_get (void *cls,
2079 const struct GNUNET_SCHEDULER_TaskContext *tc)
2081 struct LocalGetContext *lgc = cls;
2085 if (type == GNUNET_DATASTORE_BLOCKTYPE_DBLOCK)
2086 type = GNUNET_DATASTORE_BLOCKTYPE_ANY; /* to get on-demand as well */
2087 GNUNET_DATASTORE_get (dsh,
2090 &process_local_get_result,
2092 GNUNET_TIME_UNIT_FOREVER_REL);
2097 * We're processing a search request from a local
2098 * client. Now it is our turn to query the datastore.
2100 * @param cls our closure (struct LocalGetContext)
2101 * @param ok did we succeed to queue for datastore access, should always be GNUNET_OK
2104 transmit_local_get_ready (void *cls,
2107 struct LocalGetContext *lgc = cls;
2109 GNUNET_assert (GNUNET_OK == ok);
2110 GNUNET_SCHEDULER_add_continuation (sched,
2111 &transmit_local_get,
2113 GNUNET_SCHEDULER_REASON_PREREQ_DONE);
2118 * Handle START_SEARCH-message (search request from client).
2120 * @param cls closure
2121 * @param client identification of the client
2122 * @param message the actual message
2125 handle_start_search (void *cls,
2126 struct GNUNET_SERVER_Client *client,
2127 const struct GNUNET_MessageHeader *message)
2129 const struct SearchMessage *sm;
2130 struct LocalGetContext *lgc;
2134 msize = ntohs (message->size);
2135 if ( (msize < sizeof (struct SearchMessage)) ||
2136 (0 != (msize - sizeof (struct SearchMessage)) % sizeof (GNUNET_HashCode)) )
2139 GNUNET_SERVER_receive_done (client,
2143 sc = (msize - sizeof (struct SearchMessage)) / sizeof (GNUNET_HashCode);
2144 sm = (const struct SearchMessage*) message;
2145 GNUNET_SERVER_client_keep (client);
2146 lgc = GNUNET_malloc (sizeof (struct LocalGetContext));
2149 lgc->results_used = sc;
2150 GNUNET_array_grow (lgc->results,
2153 memcpy (lgc->results,
2155 sc * sizeof (GNUNET_HashCode));
2157 lgc->client = client;
2158 lgc->type = ntohl (sm->type);
2159 lgc->anonymity_level = ntohl (sm->anonymity_level);
2162 case GNUNET_DATASTORE_BLOCKTYPE_DBLOCK:
2163 case GNUNET_DATASTORE_BLOCKTYPE_IBLOCK:
2164 lgc->target.hashPubKey = sm->target;
2166 case GNUNET_DATASTORE_BLOCKTYPE_SBLOCK:
2167 lgc->namespace = sm->target;
2172 lgc->query = sm->query;
2173 GNUNET_CONTAINER_DLL_insert (lgc_head, lgc_tail, lgc);
2174 lgc->req = queue_ds_request (GNUNET_TIME_UNIT_FOREVER_REL,
2175 &transmit_local_get_ready,
2181 * List of handlers for the messages understood by this
2184 static struct GNUNET_SERVER_MessageHandler handlers[] = {
2185 {&handle_index_start, NULL,
2186 GNUNET_MESSAGE_TYPE_FS_INDEX_START, 0},
2187 {&handle_index_list_get, NULL,
2188 GNUNET_MESSAGE_TYPE_FS_INDEX_LIST_GET, sizeof(struct GNUNET_MessageHeader) },
2189 {&handle_unindex, NULL, GNUNET_MESSAGE_TYPE_FS_UNINDEX,
2190 sizeof (struct UnindexMessage) },
2191 {&handle_start_search, NULL, GNUNET_MESSAGE_TYPE_FS_START_SEARCH,
2198 * Clean up the memory used by the PendingRequest structure (except
2199 * for the client or peer list that the request may be part of).
2201 * @param pr request to clean up
2204 destroy_pending_request (struct PendingRequest *pr)
2206 struct PendingReply *reply;
2207 struct ClientList *cl;
2209 GNUNET_CONTAINER_multihashmap_remove (requests_by_query,
2212 // FIXME: not sure how this can work (efficiently)
2213 // also, what does the return value mean?
2214 if (pr->client == NULL)
2216 GNUNET_CONTAINER_heap_remove_node (requests_by_expiration,
2221 cl = pr->crl_entry->cl;
2222 GNUNET_CONTAINER_DLL_remove (cl->head,
2226 if (GNUNET_SCHEDULER_NO_TASK != pr->task)
2227 GNUNET_SCHEDULER_cancel (sched, pr->task);
2228 if (NULL != pr->cth)
2229 GNUNET_CORE_notify_transmit_ready_cancel (pr->cth);
2231 GNUNET_CONTAINER_bloomfilter_free (pr->bf);
2233 GNUNET_CONNECTION_notify_transmit_ready_cancel (pr->th);
2234 while (NULL != (reply = pr->replies_pending))
2236 pr->replies_pending = reply->next;
2237 GNUNET_free (reply);
2239 GNUNET_PEER_change_rc (pr->source_pid, -1);
2240 GNUNET_PEER_change_rc (pr->target_pid, -1);
2241 GNUNET_PEER_decrement_rcs (pr->used_pids, pr->used_pids_off);
2242 GNUNET_free_non_null (pr->used_pids);
2243 GNUNET_free_non_null (pr->replies_seen);
2244 GNUNET_free_non_null (pr->namespace);
2250 * A client disconnected. Remove all of its pending queries.
2252 * @param cls closure, NULL
2253 * @param client identification of the client
2256 handle_client_disconnect (void *cls,
2257 struct GNUNET_SERVER_Client
2260 struct LocalGetContext *lgc;
2261 struct ClientList *cpos;
2262 struct ClientList *cprev;
2263 struct ClientRequestList *rl;
2266 while ( (NULL != lgc) &&
2267 (lgc->client != client) )
2270 local_get_context_free (lgc);
2273 while ( (NULL != cpos) &&
2274 (clients->client != client) )
2282 clients = cpos->next;
2284 cprev->next = cpos->next;
2285 while (NULL != (rl = cpos->head))
2287 cpos->head = rl->next;
2288 destroy_pending_request (rl->req);
2297 * Iterator over entries in the "requests_by_query" map
2298 * that frees all the entries.
2300 * @param cls closure, NULL
2301 * @param key current key code (the query, unused)
2302 * @param value value in the hash map, of type "struct PendingRequest*"
2303 * @return GNUNET_YES (we should continue to iterate)
2306 destroy_pending_request_cb (void *cls,
2307 const GNUNET_HashCode * key,
2310 struct PendingRequest *pr = value;
2312 destroy_pending_request (pr);
2318 * Task run during shutdown.
2324 shutdown_task (void *cls,
2325 const struct GNUNET_SCHEDULER_TaskContext *tc)
2327 struct IndexInfo *pos;
2331 GNUNET_CORE_disconnect (core);
2336 GNUNET_DATASTORE_disconnect (dsh,
2340 GNUNET_CONTAINER_multihashmap_iterate (requests_by_query,
2341 &destroy_pending_request_cb,
2343 while (clients != NULL)
2344 handle_client_disconnect (NULL,
2346 GNUNET_CONTAINER_multihashmap_destroy (requests_by_query);
2347 requests_by_query = NULL;
2348 GNUNET_CONTAINER_multihashmap_destroy (requests_by_peer);
2349 requests_by_peer = NULL;
2350 GNUNET_CONTAINER_heap_destroy (requests_by_expiration);
2351 requests_by_expiration = NULL;
2352 // FIXME: iterate over entries and free individually?
2353 // (or do we get disconnect notifications?)
2354 GNUNET_CONTAINER_multihashmap_destroy (connected_peers);
2355 connected_peers = NULL;
2356 GNUNET_CONTAINER_multihashmap_destroy (ifm);
2358 while (NULL != (pos = indexed_files))
2360 indexed_files = pos->next;
2367 * Free (each) request made by the peer.
2369 * @param cls closure, points to peer that the request belongs to
2370 * @param key current key code
2371 * @param value value in the hash map
2372 * @return GNUNET_YES (we should continue to iterate)
2375 destroy_request (void *cls,
2376 const GNUNET_HashCode * key,
2379 const struct GNUNET_PeerIdentity * peer = cls;
2380 struct PendingRequest *pr = value;
2382 GNUNET_CONTAINER_multihashmap_remove (requests_by_peer,
2385 destroy_pending_request (pr);
2392 * Method called whenever a given peer connects.
2394 * @param cls closure, not used
2395 * @param peer peer identity this notification is about
2398 peer_connect_handler (void *cls,
2400 GNUNET_PeerIdentity * peer)
2402 struct ConnectedPeer *cp;
2404 cp = GNUNET_malloc (sizeof (struct ConnectedPeer));
2405 cp->pid = GNUNET_PEER_intern (peer);
2406 GNUNET_CONTAINER_multihashmap_put (connected_peers,
2409 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
2414 * Method called whenever a peer disconnects.
2416 * @param cls closure, not used
2417 * @param peer peer identity this notification is about
2420 peer_disconnect_handler (void *cls,
2422 GNUNET_PeerIdentity * peer)
2424 struct ConnectedPeer *cp;
2426 cp = GNUNET_CONTAINER_multihashmap_get (connected_peers,
2428 GNUNET_PEER_change_rc (cp->pid, -1);
2429 GNUNET_PEER_decrement_rcs (cp->last_p2p_replies, P2P_SUCCESS_LIST_SIZE);
2431 GNUNET_CONTAINER_multihashmap_get_multiple (requests_by_peer,
2439 * We're processing a GET request from
2440 * another peer and have decided to forward
2441 * it to other peers.
2443 * @param cls our "struct ProcessGetContext *"
2447 forward_get_request (void *cls,
2448 const struct GNUNET_SCHEDULER_TaskContext *tc)
2450 struct ProcessGetContext *pgc = cls;
2451 struct PendingRequest *pr;
2452 struct PendingRequest *eer;
2453 struct GNUNET_PeerIdentity target;
2455 pr = GNUNET_malloc (sizeof (struct PendingRequest));
2456 if (GET_MESSAGE_BIT_SKS_NAMESPACE == (GET_MESSAGE_BIT_SKS_NAMESPACE & pgc->bm))
2458 pr->namespace = GNUNET_malloc (sizeof(GNUNET_HashCode));
2459 *pr->namespace = pgc->namespace;
2462 pr->bf_size = pgc->bf_size;
2464 pr->start_time = pgc->start_time;
2465 pr->query = pgc->query;
2466 pr->source_pid = GNUNET_PEER_intern (&pgc->reply_to);
2467 if (GET_MESSAGE_BIT_TRANSMIT_TO == (GET_MESSAGE_BIT_TRANSMIT_TO & pgc->bm))
2468 pr->target_pid = GNUNET_PEER_intern (&pgc->prime_target);
2469 pr->anonymity_level = 1; /* default */
2470 pr->priority = pgc->priority;
2471 pr->remaining_priority = pr->priority;
2472 pr->mingle = pgc->mingle;
2474 pr->type = pgc->type;
2475 GNUNET_CONTAINER_multihashmap_put (requests_by_query,
2478 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE);
2479 GNUNET_CONTAINER_multihashmap_put (requests_by_peer,
2480 &pgc->reply_to.hashPubKey,
2482 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE);
2483 GNUNET_CONTAINER_heap_insert (requests_by_expiration,
2485 pr->start_time.value + pr->ttl);
2486 if (GNUNET_CONTAINER_heap_get_size (requests_by_expiration) > max_pending_requests)
2488 /* expire oldest request! */
2489 eer = GNUNET_CONTAINER_heap_peek (requests_by_expiration);
2490 GNUNET_PEER_resolve (eer->source_pid,
2492 GNUNET_CONTAINER_multihashmap_remove (requests_by_peer,
2495 destroy_pending_request (eer);
2497 pr->task = GNUNET_SCHEDULER_add_delayed (sched,
2498 get_processing_delay (),
2499 &forward_request_task,
2504 * Transmit the given message by copying it to
2505 * the target buffer "buf". "buf" will be
2506 * NULL and "size" zero if the socket was closed for
2507 * writing in the meantime. In that case, only
2511 * @param cls closure, pointer to the message
2512 * @param size number of bytes available in buf
2513 * @param buf where the callee should write the message
2514 * @return number of bytes written to buf
2517 transmit_message (void *cls,
2518 size_t size, void *buf)
2520 struct GNUNET_MessageHeader *msg = cls;
2526 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2527 "Dropping reply, core too busy.\n");
2532 msize = ntohs (msg->size);
2533 GNUNET_assert (size >= msize);
2534 memcpy (buf, msg, msize);
2541 * Test if the load on this peer is too high
2542 * to even consider processing the query at
2545 * @return GNUNET_YES if the load is too high, GNUNET_NO otherwise
2548 test_load_too_high ()
2550 return GNUNET_NO; // FIXME
2555 * We're processing (local) results for a search request
2556 * from another peer. Pass applicable results to the
2557 * peer and if we are done either clean up (operation
2558 * complete) or forward to other peers (more results possible).
2560 * @param cls our closure (struct LocalGetContext)
2561 * @param key key for the content
2562 * @param size number of bytes in data
2563 * @param data content stored
2564 * @param type type of the content
2565 * @param priority priority of the content
2566 * @param anonymity anonymity-level for the content
2567 * @param expiration expiration time for the content
2568 * @param uid unique identifier for the datum;
2569 * maybe 0 if no unique identifier is available
2572 process_p2p_get_result (void *cls,
2573 const GNUNET_HashCode * key,
2579 struct GNUNET_TIME_Absolute
2583 struct ProcessGetContext *pgc = cls;
2584 GNUNET_HashCode dhash;
2585 GNUNET_HashCode mhash;
2586 struct PutMessage *reply;
2590 /* no more results */
2591 if ( ( (pgc->policy & ROUTING_POLICY_FORWARD) == ROUTING_POLICY_FORWARD) &&
2592 ( (0 == pgc->results_found) ||
2593 (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_KBLOCK) ||
2594 (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_SBLOCK) ||
2595 (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_SKBLOCK) ) )
2597 GNUNET_SCHEDULER_add_continuation (sched,
2598 &forward_get_request,
2600 GNUNET_SCHEDULER_REASON_PREREQ_DONE);
2604 if (pgc->bf != NULL)
2605 GNUNET_CONTAINER_bloomfilter_free (pgc->bf);
2611 if (type == GNUNET_DATASTORE_BLOCKTYPE_ONDEMAND)
2613 handle_on_demand_block (key, size, data, type, priority,
2614 anonymity, expiration, uid,
2615 &process_p2p_get_result,
2619 /* check for duplicates */
2620 GNUNET_CRYPTO_hash (data, size, &dhash);
2621 mingle_hash (&dhash,
2624 if ( (pgc->bf != NULL) &&
2626 GNUNET_CONTAINER_bloomfilter_test (pgc->bf,
2630 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2631 "Result from datastore filtered by bloomfilter.\n");
2633 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
2636 pgc->results_found++;
2637 if ( (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_KBLOCK) ||
2638 (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_SBLOCK) ||
2639 (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_SKBLOCK) )
2641 if (pgc->bf == NULL)
2644 pgc->bf = GNUNET_CONTAINER_bloomfilter_init (NULL,
2648 GNUNET_CONTAINER_bloomfilter_add (pgc->bf,
2652 reply = GNUNET_malloc (sizeof (struct PutMessage) + size);
2653 reply->header.size = htons (sizeof (struct PutMessage) + size);
2654 reply->header.type = htons (GNUNET_MESSAGE_TYPE_FS_PUT);
2655 reply->type = htonl (type);
2656 reply->expiration = GNUNET_TIME_relative_hton (GNUNET_TIME_absolute_get_remaining (expiration));
2657 memcpy (&reply[1], data, size);
2658 GNUNET_CORE_notify_transmit_ready (core,
2660 ACCEPTABLE_REPLY_DELAY,
2662 sizeof (struct PutMessage) + size,
2665 if ( (GNUNET_YES == test_load_too_high()) ||
2666 (pgc->results_found > 5 + 2 * pgc->priority) )
2668 GNUNET_DATASTORE_get_next (dsh, GNUNET_NO);
2669 pgc->policy &= ~ ROUTING_POLICY_FORWARD;
2672 GNUNET_DATASTORE_get_next (dsh, GNUNET_YES);
2677 * We're processing a GET request from another peer. Give it to our
2680 * @param cls our "struct ProcessGetContext"
2681 * @param ok did we get a datastore slice or not?
2684 ds_get_request (void *cls,
2687 struct ProcessGetContext *pgc = cls;
2689 struct GNUNET_TIME_Relative timeout;
2691 if (GNUNET_OK != ok)
2693 /* no point in doing P2P stuff if we can't even do local */
2698 if (type == GNUNET_DATASTORE_BLOCKTYPE_DBLOCK)
2699 type = GNUNET_DATASTORE_BLOCKTYPE_ANY; /* to get on-demand as well */
2700 timeout = GNUNET_TIME_relative_multiply (BASIC_DATASTORE_REQUEST_DELAY,
2701 (pgc->priority + 1));
2702 GNUNET_DATASTORE_get (dsh,
2705 &process_p2p_get_result,
2712 * The priority level imposes a bound on the maximum
2713 * value for the ttl that can be requested.
2715 * @param ttl_in requested ttl
2716 * @param prio given priority
2717 * @return ttl_in if ttl_in is below the limit,
2718 * otherwise the ttl-limit for the given priority
2721 bound_ttl (int32_t ttl_in, uint32_t prio)
2723 unsigned long long allowed;
2727 allowed = ((unsigned long long) prio) * TTL_DECREMENT / 1000;
2728 if (ttl_in > allowed)
2730 if (allowed >= (1 << 30))
2739 * We've received a request with the specified
2740 * priority. Bound it according to how much
2741 * we trust the given peer.
2743 * @param prio_in requested priority
2744 * @param peer the peer making the request
2745 * @return effective priority
2748 bound_priority (uint32_t prio_in,
2749 const struct GNUNET_PeerIdentity *peer)
2756 * Handle P2P "GET" request.
2758 * @param cls closure, always NULL
2759 * @param other the other peer involved (sender or receiver, NULL
2760 * for loopback messages where we are both sender and receiver)
2761 * @param message the actual message
2762 * @return GNUNET_OK to keep the connection open,
2763 * GNUNET_SYSERR to close it (signal serious error)
2766 handle_p2p_get (void *cls,
2767 const struct GNUNET_PeerIdentity *other,
2768 const struct GNUNET_MessageHeader *message)
2771 const struct GetMessage *gm;
2773 const GNUNET_HashCode *opt;
2774 struct ProcessGetContext *pgc;
2777 uint32_t ttl_decrement;
2782 msize = ntohs(message->size);
2783 if (msize < sizeof (struct GetMessage))
2785 GNUNET_break_op (0);
2786 return GNUNET_SYSERR;
2788 gm = (const struct GetMessage*) message;
2789 bm = ntohl (gm->hash_bitmap);
2797 if (msize < sizeof (struct GetMessage) + bits * sizeof (GNUNET_HashCode))
2799 GNUNET_break_op (0);
2800 return GNUNET_SYSERR;
2802 opt = (const GNUNET_HashCode*) &gm[1];
2803 bfsize = msize - sizeof (struct GetMessage) + bits * sizeof (GNUNET_HashCode);
2804 pgc = GNUNET_malloc (sizeof (struct ProcessGetContext));
2807 pgc->bf = GNUNET_CONTAINER_bloomfilter_init ((const char*) &pgc[1],
2810 pgc->bf_size = bfsize;
2812 pgc->type = ntohl (gm->type);
2813 pgc->bm = ntohl (gm->hash_bitmap);
2814 pgc->mingle = gm->filter_mutator;
2816 if (0 != (pgc->bm & GET_MESSAGE_BIT_RETURN_TO))
2817 pgc->reply_to.hashPubKey = opt[bits++];
2819 pgc->reply_to = *other;
2820 if (0 != (pgc->bm & GET_MESSAGE_BIT_SKS_NAMESPACE))
2821 pgc->namespace = opt[bits++];
2822 else if (pgc->type == GNUNET_DATASTORE_BLOCKTYPE_SBLOCK)
2824 GNUNET_break_op (0);
2826 return GNUNET_SYSERR;
2828 if (0 != (pgc->bm & GET_MESSAGE_BIT_TRANSMIT_TO))
2829 pgc->prime_target.hashPubKey = opt[bits++];
2830 /* note that we can really only check load here since otherwise
2831 peers could find out that we are overloaded by being disconnected
2832 after sending us a malformed query... */
2833 if (GNUNET_YES == test_load_too_high ())
2835 if (NULL != pgc->bf)
2836 GNUNET_CONTAINER_bloomfilter_free (pgc->bf);
2839 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2840 "Dropping query from `%s', this peer is too busy.\n",
2841 GNUNET_i2s (other));
2845 net_load_up = 50; // FIXME
2846 net_load_down = 50; // FIXME
2847 pgc->policy = ROUTING_POLICY_NONE;
2848 if ( (net_load_up < IDLE_LOAD_THRESHOLD) &&
2849 (net_load_down < IDLE_LOAD_THRESHOLD) )
2851 pgc->policy |= ROUTING_POLICY_ALL;
2852 pgc->priority = 0; /* no charge */
2856 pgc->priority = bound_priority (ntohl (gm->priority), other);
2858 IDLE_LOAD_THRESHOLD + pgc->priority * pgc->priority) &&
2860 IDLE_LOAD_THRESHOLD + pgc->priority * pgc->priority) )
2862 pgc->policy |= ROUTING_POLICY_ALL;
2866 // FIXME: is this sound?
2867 if (net_load_up < 90 + 10 * pgc->priority)
2868 pgc->policy |= ROUTING_POLICY_FORWARD;
2869 if (net_load_down < 90 + 10 * pgc->priority)
2870 pgc->policy |= ROUTING_POLICY_ANSWER;
2873 if (pgc->policy == ROUTING_POLICY_NONE)
2876 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2877 "Dropping query from `%s', network saturated.\n",
2878 GNUNET_i2s (other));
2880 if (NULL != pgc->bf)
2881 GNUNET_CONTAINER_bloomfilter_free (pgc->bf);
2883 return GNUNET_OK; /* drop */
2885 if ((pgc->policy & ROUTING_POLICY_INDIRECT) != ROUTING_POLICY_INDIRECT)
2886 pgc->priority = 0; /* kill the priority (we cannot benefit) */
2887 pgc->ttl = bound_ttl (ntohl (gm->ttl), pgc->priority);
2888 /* decrement ttl (always) */
2889 ttl_decrement = 2 * TTL_DECREMENT +
2890 GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
2892 if ( (pgc->ttl < 0) &&
2893 (pgc->ttl - ttl_decrement > 0) )
2896 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2897 "Dropping query from `%s' due to TTL underflow.\n",
2898 GNUNET_i2s (other));
2900 /* integer underflow => drop (should be very rare)! */
2901 if (NULL != pgc->bf)
2902 GNUNET_CONTAINER_bloomfilter_free (pgc->bf);
2906 pgc->ttl -= ttl_decrement;
2907 pgc->start_time = GNUNET_TIME_absolute_get ();
2908 preference = (double) pgc->priority;
2909 if (preference < QUERY_BANDWIDTH_VALUE)
2910 preference = QUERY_BANDWIDTH_VALUE;
2911 // FIXME: also reserve bandwidth for reply?
2912 GNUNET_CORE_peer_configure (core,
2914 GNUNET_TIME_UNIT_FOREVER_REL,
2915 0, 0, preference, NULL, NULL);
2916 if (0 != (pgc->policy & ROUTING_POLICY_ANSWER))
2917 pgc->drq = queue_ds_request (BASIC_DATASTORE_REQUEST_DELAY,
2921 GNUNET_SCHEDULER_add_continuation (sched,
2922 &forward_get_request,
2924 GNUNET_SCHEDULER_REASON_PREREQ_DONE);
2930 * Function called to notify us that we can now transmit a reply to a
2931 * client or peer. "buf" will be NULL and "size" zero if the socket was
2932 * closed for writing in the meantime.
2934 * @param cls closure, points to a "struct PendingRequest*" with
2935 * one or more pending replies
2936 * @param size number of bytes available in buf
2937 * @param buf where the callee should write the message
2938 * @return number of bytes written to buf
2941 transmit_result (void *cls,
2945 struct PendingRequest *pr = cls;
2947 struct PendingReply *reply;
2951 while (NULL != (reply = pr->replies_pending))
2953 if ( (reply->msize + ret < ret) ||
2954 (reply->msize + ret > size) )
2956 pr->replies_pending = reply->next;
2957 memcpy (&cbuf[ret], &reply[1], reply->msize);
2958 ret += reply->msize;
2959 GNUNET_free (reply);
2966 * Iterator over pending requests.
2968 * @param cls response (struct ProcessReplyClosure)
2969 * @param key our query
2970 * @param value value in the hash map (meta-info about the query)
2971 * @return GNUNET_YES (we should continue to iterate)
2974 process_reply (void *cls,
2975 const GNUNET_HashCode * key,
2978 struct ProcessReplyClosure *prq = cls;
2979 struct PendingRequest *pr = value;
2980 struct PendingRequest *eer;
2981 struct PendingReply *reply;
2982 struct PutMessage *pm;
2983 struct ContentMessage *cm;
2984 GNUNET_HashCode chash;
2985 GNUNET_HashCode mhash;
2986 struct GNUNET_PeerIdentity target;
2989 struct GNUNET_TIME_Relative max_delay;
2991 GNUNET_CRYPTO_hash (prq->data,
2996 case GNUNET_DATASTORE_BLOCKTYPE_DBLOCK:
2997 case GNUNET_DATASTORE_BLOCKTYPE_IBLOCK:
2999 case GNUNET_DATASTORE_BLOCKTYPE_SBLOCK:
3000 /* FIXME: does prq->namespace match our expectations? */
3001 /* then: fall-through??? */
3002 case GNUNET_DATASTORE_BLOCKTYPE_KBLOCK:
3005 mingle_hash (&chash, pr->mingle, &mhash);
3006 if (GNUNET_YES == GNUNET_CONTAINER_bloomfilter_test (pr->bf,
3008 return GNUNET_YES; /* duplicate */
3009 GNUNET_CONTAINER_bloomfilter_add (pr->bf,
3013 case GNUNET_DATASTORE_BLOCKTYPE_SKBLOCK:
3014 // FIXME: any checks against duplicates for SKBlocks?
3017 prio = pr->priority;
3018 prq->priority += pr->remaining_priority;
3019 pr->remaining_priority = 0;
3020 if (pr->client != NULL)
3022 if (pr->replies_seen_size == pr->replies_seen_off)
3023 GNUNET_array_grow (pr->replies_seen,
3024 pr->replies_seen_size,
3025 pr->replies_seen_size * 2 + 4);
3026 pr->replies_seen[pr->replies_seen_off++] = chash;
3027 // FIXME: possibly recalculate BF!
3029 if (pr->client == NULL)
3031 msize = sizeof (struct ContentMessage) + prq->size;
3032 reply = GNUNET_malloc (msize + sizeof (struct PendingReply));
3033 reply->msize = msize;
3034 cm = (struct ContentMessage*) &reply[1];
3035 cm->header.type = htons (GNUNET_MESSAGE_TYPE_FS_CONTENT);
3036 cm->header.size = htons (msize);
3037 cm->type = htonl (prq->type);
3038 cm->expiration = GNUNET_TIME_absolute_hton (prq->expiration);
3039 reply->next = pr->replies_pending;
3040 pr->replies_pending = reply;
3041 memcpy (&reply[1], prq->data, prq->size);
3042 if (pr->cth != NULL)
3044 max_delay = GNUNET_TIME_UNIT_FOREVER_REL;
3045 if (GNUNET_CONTAINER_heap_get_size (requests_by_expiration) >= max_pending_requests)
3047 /* estimate expiration time from time difference between
3048 first request that will be discarded and this request */
3049 eer = GNUNET_CONTAINER_heap_peek (requests_by_expiration);
3050 max_delay = GNUNET_TIME_absolute_get_difference (pr->start_time,
3053 GNUNET_PEER_resolve (pr->source_pid,
3055 pr->cth = GNUNET_CORE_notify_transmit_ready (core,
3062 if (NULL == pr->cth)
3064 // FIXME: now what? discard?
3069 msize = sizeof (struct PutMessage) + prq->size;
3070 reply = GNUNET_malloc (msize + sizeof (struct PendingReply));
3071 reply->msize = msize;
3072 reply->next = pr->replies_pending;
3073 pm = (struct PutMessage*) &reply[1];
3074 pm->header.type = htons (GNUNET_MESSAGE_TYPE_FS_PUT);
3075 pm->header.size = htons (msize);
3076 pm->type = htonl (prq->type);
3077 pm->expiration = GNUNET_TIME_relative_hton (GNUNET_TIME_absolute_get_remaining (prq->expiration));
3078 pr->replies_pending = reply;
3079 memcpy (&reply[1], prq->data, prq->size);
3082 pr->th = GNUNET_SERVER_notify_transmit_ready (pr->client,
3084 GNUNET_TIME_UNIT_FOREVER_REL,
3089 // FIXME: need to try again later (not much
3090 // to do here specifically, but we need to
3091 // check somewhere else to handle this case!)
3094 // FIXME: implement hot-path routing statistics keeping!
3100 * Check if the given KBlock is well-formed.
3102 * @param kb the kblock data (or at least "dsize" bytes claiming to be one)
3103 * @param dsize size of "kb" in bytes; check for < sizeof(struct KBlock)!
3104 * @param query where to store the query that this block answers
3105 * @return GNUNET_OK if this is actually a well-formed KBlock
3108 check_kblock (const struct KBlock *kb,
3110 GNUNET_HashCode *query)
3112 if (dsize < sizeof (struct KBlock))
3114 GNUNET_break_op (0);
3115 return GNUNET_SYSERR;
3117 if (dsize - sizeof (struct KBlock) !=
3118 ntohs (kb->purpose.size)
3119 - sizeof (struct GNUNET_CRYPTO_RsaSignaturePurpose)
3120 - sizeof(struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded) )
3122 GNUNET_break_op (0);
3123 return GNUNET_SYSERR;
3126 GNUNET_CRYPTO_rsa_verify (GNUNET_SIGNATURE_PURPOSE_FS_KBLOCK,
3131 GNUNET_break_op (0);
3132 return GNUNET_SYSERR;
3135 GNUNET_CRYPTO_hash (&kb->keyspace,
3136 sizeof (struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded),
3143 * Check if the given SBlock is well-formed.
3145 * @param sb the sblock data (or at least "dsize" bytes claiming to be one)
3146 * @param dsize size of "kb" in bytes; check for < sizeof(struct SBlock)!
3147 * @param query where to store the query that this block answers
3148 * @param namespace where to store the namespace that this block belongs to
3149 * @return GNUNET_OK if this is actually a well-formed SBlock
3152 check_sblock (const struct SBlock *sb,
3154 GNUNET_HashCode *query,
3155 GNUNET_HashCode *namespace)
3157 if (dsize < sizeof (struct SBlock))
3159 GNUNET_break_op (0);
3160 return GNUNET_SYSERR;
3163 ntohs (sb->purpose.size) + sizeof (struct GNUNET_CRYPTO_RsaSignature))
3165 GNUNET_break_op (0);
3166 return GNUNET_SYSERR;
3169 GNUNET_CRYPTO_rsa_verify (GNUNET_SIGNATURE_PURPOSE_FS_SBLOCK,
3174 GNUNET_break_op (0);
3175 return GNUNET_SYSERR;
3178 *query = sb->identifier;
3179 if (namespace != NULL)
3180 GNUNET_CRYPTO_hash (&sb->subspace,
3181 sizeof (struct GNUNET_CRYPTO_RsaPublicKeyBinaryEncoded),
3188 * Handle P2P "PUT" request.
3190 * @param cls closure, always NULL
3191 * @param other the other peer involved (sender or receiver, NULL
3192 * for loopback messages where we are both sender and receiver)
3193 * @param message the actual message
3194 * @return GNUNET_OK to keep the connection open,
3195 * GNUNET_SYSERR to close it (signal serious error)
3198 handle_p2p_put (void *cls,
3199 const struct GNUNET_PeerIdentity *other,
3200 const struct GNUNET_MessageHeader *message)
3202 const struct PutMessage *put;
3206 struct GNUNET_TIME_Absolute expiration;
3207 GNUNET_HashCode query;
3208 struct ProcessReplyClosure prq;
3210 msize = ntohs (message->size);
3211 if (msize < sizeof (struct PutMessage))
3214 return GNUNET_SYSERR;
3216 put = (const struct PutMessage*) message;
3217 dsize = msize - sizeof (struct PutMessage);
3218 type = ntohl (put->type);
3219 expiration = GNUNET_TIME_relative_to_absolute (GNUNET_TIME_relative_ntoh (put->expiration));
3221 /* first, validate! */
3224 case GNUNET_DATASTORE_BLOCKTYPE_DBLOCK:
3225 case GNUNET_DATASTORE_BLOCKTYPE_IBLOCK:
3226 GNUNET_CRYPTO_hash (&put[1], dsize, &query);
3228 case GNUNET_DATASTORE_BLOCKTYPE_KBLOCK:
3230 check_kblock ((const struct KBlock*) &put[1],
3233 return GNUNET_SYSERR;
3235 case GNUNET_DATASTORE_BLOCKTYPE_SBLOCK:
3237 check_sblock ((const struct SBlock*) &put[1],
3241 return GNUNET_SYSERR;
3243 case GNUNET_DATASTORE_BLOCKTYPE_SKBLOCK:
3244 // FIXME -- validate SKBLOCK!
3248 /* unknown block type */
3249 GNUNET_break_op (0);
3250 return GNUNET_SYSERR;
3253 /* now, lookup 'query' */
3254 prq.data = (const void*) &put[1];
3257 prq.expiration = expiration;
3259 GNUNET_CONTAINER_multihashmap_get_multiple (requests_by_query,
3263 // FIXME: if migration is on and load is low,
3264 // queue to store data in datastore;
3265 // use "prq.priority" for that!
3271 * List of handlers for P2P messages
3272 * that we care about.
3274 static struct GNUNET_CORE_MessageHandler p2p_handlers[] =
3277 GNUNET_MESSAGE_TYPE_FS_GET, 0 },
3279 GNUNET_MESSAGE_TYPE_FS_PUT, 0 },
3285 * Process fs requests.
3287 * @param cls closure
3288 * @param s scheduler to use
3289 * @param server the initialized server
3290 * @param c configuration to use
3294 struct GNUNET_SCHEDULER_Handle *s,
3295 struct GNUNET_SERVER_Handle *server,
3296 const struct GNUNET_CONFIGURATION_Handle *c)
3301 ifm = GNUNET_CONTAINER_multihashmap_create (128);
3302 requests_by_query = GNUNET_CONTAINER_multihashmap_create (128); // FIXME: get size from config
3303 requests_by_peer = GNUNET_CONTAINER_multihashmap_create (128); // FIXME: get size from config
3304 connected_peers = GNUNET_CONTAINER_multihashmap_create (64);
3305 requests_by_expiration = GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MIN);
3307 dsh = GNUNET_DATASTORE_connect (cfg,
3309 core = GNUNET_CORE_connect (sched,
3311 GNUNET_TIME_UNIT_FOREVER_REL,
3314 &peer_connect_handler,
3315 &peer_disconnect_handler,
3321 GNUNET_SERVER_disconnect_notify (server,
3322 &handle_client_disconnect,
3324 GNUNET_SERVER_add_handlers (server, handlers);
3325 GNUNET_SCHEDULER_add_delayed (sched,
3326 GNUNET_TIME_UNIT_FOREVER_REL,
3331 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
3332 _("Failed to connect to `%s' service.\n"),
3334 GNUNET_SCHEDULER_shutdown (sched);
3339 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
3340 _("Failed to connect to `%s' service.\n"),
3342 GNUNET_SCHEDULER_shutdown (sched);
3349 * The main function for the fs service.
3351 * @param argc number of arguments from the command line
3352 * @param argv command line arguments
3353 * @return 0 ok, 1 on error
3356 main (int argc, char *const *argv)
3358 return (GNUNET_OK ==
3359 GNUNET_SERVICE_run (argc,
3362 GNUNET_SERVICE_OPTION_NONE,
3363 &run, NULL)) ? 0 : 1;
3366 /* end of gnunet-service-fs.c */