/**
* Which of the optional hash codes are present at the end of the
* message? See GET_MESSAGE_BIT_xx constants. For each bit that is
- * set, an additional GNUNET_HashCode with the respective content
+ * set, an additional struct GNUNET_HashCode with the respective content
* (in order of the bits) will be appended to the end of the GET
* message.
*/
* Hashcodes of the file(s) we're looking for.
* Details depend on the query type.
*/
- GNUNET_HashCode query GNUNET_PACKED;
+ struct GNUNET_HashCode query;
/* this is followed by hash codes as specified in the "hash_bitmap";
* after that, an optional bloomfilter (with bits set for replies
struct GSF_RequestPlan;
/**
- * DLL of request plans a particular pending request is
- * involved with.
+ * Bijection between request plans and pending requests.
*/
-struct GSF_RequestPlanReference;
+struct GSF_PendingRequestPlanBijection;
/**
* Our connection to the datastore.
*/
extern int GSF_enable_randomized_delays;
+/**
+ * Size of the datastore queue we assume for common requests.
+ */
+extern unsigned int GSF_datastore_queue_size;
+
+
/**
* Test if the DATABASE (GET) load on this peer is too high
* to even consider processing the query at