218 "Sending removed element (size %u) to client\n",
221 "# Element removed messages sent",
263 "FIMA called for %s:%u\n",
270 "Reduced initialization, not starting with %s:%u (wrong generation)\n",
281 "Testing mingled hash %s with salt %u\n",
292 "Reduced initialization, not starting with %s:%u\n",
302 "Filtered initialization of my_elements, adding %s:%u\n",
337 "Testing mingled hash %s with salt %u\n",
350 "Bloom filter reduction of my_elements, removing %s:%u\n",
363 "Bloom filter reduction of my_elements, keeping %s:%u\n",
392 "Initializing BF with hash %s with salt %u\n",
414 "Intersection operation failed\n");
416 "# Intersection operations failed",
448 uint32_t bf_elementbits;
457 bf_elementbits = 2 + ceil (log2 ((
double)
460 if (bf_elementbits < 1)
464 * bf_elementbits / log (2)));
466 "Sending Bloom filter (%u) of size %u bytes\n",
467 (
unsigned int) bf_elementbits,
468 (
unsigned int) bf_size);
480 "# Intersection Bloom filters sent",
483 chunk_size = 60 * 1024 -
sizeof(
struct BFMessage);
484 if (bf_size <= chunk_size)
487 chunk_size = bf_size;
497 msg->bloomfilter_total_length = htonl (bf_size);
498 msg->bits_per_element = htonl (bf_elementbits);
499 msg->sender_mutator = htonl (op->
state->
salt);
513 while (offset < bf_size)
515 if (bf_size - chunk_size < offset)
516 chunk_size = bf_size - offset;
523 offset += chunk_size;
552 "Intersection succeeded, sending DONE to local client\n");
554 "# Intersection operations succeeded",
583 "DONE sent to other peer, now waiting for other end to close the channel\n");
639 "Sending done and destroy because iterator ran out\n");
661 "Sending element %s:%u to client (full set)\n",
706 "Initial full initialization of my_elements, adding %s:%u\n",
731 "Sending our element count (%u)\n",
779 "Received remote element count (%u), I have %u\n",
807 "Received BF in phase %u, foreign count is %u, my element count is %u/%u\n",
861 "Intersection succeeded, sending DONE to other peer\n");
867 "Sending full result set (%u elements)\n",
933 if (bf_size == chunk_size)
945 bf_bits_per_element);
946 op->
state->
salt = ntohl (msg->sender_mutator);
977 (
const char *) &msg[1],
986 bf_bits_per_element);
1025 "Final reduction of my_elements, removing %s:%u\n",
1082 "Got IntersectionDoneMessage, have %u elements in intersection\n",
1091 "Sending full result set to client (%u elements)\n",
1130 "Initiating intersection operation evaluation\n");
1144 if (NULL != opaque_context)
1146 "Sent op request with context message\n");
1149 "Sent op request without context message\n");
1166 "Accepting set intersection operation\n");
1225 "Destroying intersection op state done\n");
1240 "Intersection set created\n");
1316 const struct SetVT *
1319 static const struct SetVT intersection_vt = {
1330 return &intersection_vt;
void GNUNET_CONTAINER_multihashmap_iterator_destroy(struct GNUNET_CONTAINER_MultiHashMapIterator *iter)
Destroy a multihashmap iterator.
State of an evaluate operation with another peer.
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_init(const char *data, size_t size, unsigned int k)
Create a Bloom filter from raw bits.
static void intersection_add(struct SetState *set_state, struct ElementEntry *ee)
Add the element from the given element message to the set.
int GNUNET_CONTAINER_multihashmap_iterator_next(struct GNUNET_CONTAINER_MultiHashMapIterator *iter, struct GNUNET_HashCode *key, const void **value)
Retrieve the next element from the hash map at the iterator's position.
struct GNUNET_MessageHeader * msg
enum GNUNET_SET_ResultMode result_mode
When are elements sent to the client, and which elements are sent?
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
uint32_t final_element_count
Final number of elements in intersection.
unsigned int GNUNET_CONTAINER_multihashmap_size(const struct GNUNET_CONTAINER_MultiHashMap *map)
Get the number of key-value pairs in the map.
int _GSS_is_element_of_operation(struct ElementEntry *ee, struct Operation *op)
Is element ee part of the set used by op?
uint32_t element_count
For Intersection: my element count.
static void fail_intersection_operation(struct Operation *op)
Inform the client that the intersection operation has failed, and proceed to destroy the evaluate ope...
#define GNUNET_MQ_msg_nested_mh(mvar, type, mh)
Allocate a GNUNET_MQ_Envelope, and append a payload message after the given message struct...
int check_intersection_p2p_bf(void *cls, const struct BFMessage *msg)
Check an BF message from a remote peer.
struct GNUNET_MQ_Handle * mq
MQ to talk to client.
struct GNUNET_CONTAINER_MultiHashMapIterator * GNUNET_CONTAINER_multihashmap_iterator_create(const struct GNUNET_CONTAINER_MultiHashMap *map)
Create an iterator for a multihashmap.
static void send_remaining_elements(void *cls)
Send all elements in the full result iterator.
struct SetState * state
Implementation-specific state.
#define GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_BF
Bloom filter message for intersection exchange started by Bob.
uint32_t bf_data_size
size of the bloomfilter in bf_data.
Message sent by the service to the client to indicate an element that is removed (set intersection) o...
uint32_t salt
Salt currently used for BF construction (by us or the other peer, depending on where we are in the co...
static void begin_bf_exchange(struct Operation *op)
We go first, initialize our map with all elements and send the first Bloom filter.
struct GNUNET_HashCode element_hash
Hash of the element.
uint32_t sender_element_count
Number of elements the sender still has in the set.
static struct OperationState * intersection_evaluate(struct Operation *op, const struct GNUNET_MessageHeader *opaque_context)
Initiate a set intersection operation with a remote peer.
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static int initialize_map_unfiltered(void *cls, const struct GNUNET_HashCode *key, void *value)
Fills the "my_elements" hashmap with the initial set of (non-deleted) elements from the set of the sp...
uint32_t bf_bits_per_element
size of the bloomfilter
static int filtered_map_initialization(void *cls, const struct GNUNET_HashCode *key, void *value)
Fills the "my_elements" hashmap with all relevant elements.
#define GNUNET_MESSAGE_TYPE_SET_RESULT
Create an empty set.
static void send_client_done_and_destroy(void *cls)
Signal to the client that the operation has finished and destroy the operation.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_BF.
static void process_bf(struct Operation *op)
Process a Bloomfilter once we got all the chunks.
uint32_t request_id
id the result belongs to
We have initialized our set and are now reducing it by exchanging Bloom filters until one party notic...
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
struct GNUNET_CONTAINER_BloomFilter * local_bf
BF of the set's element.
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
uint32_t my_element_count
Current element count contained within my_elements.
struct GNUNET_CONTAINER_MultiHashMap * elements
Maps struct GNUNET_HashCode * to struct ElementEntry *.
static int filter_all(void *cls, const struct GNUNET_HashCode *key, void *value)
Remove all elements from our hashmap.
void _GSS_operation_destroy(struct Operation *op, int gc)
Destroy the given operation.
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
#define GNUNET_new(type)
Allocate a struct or union of the given type.
int client_done_sent
Did we send the client that we are done?
Client gets every element in the resulting set.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
unsigned int generation_created
Generation in which the operation handle was created.
static void send_client_removed_element(struct Operation *op, struct GNUNET_SET_Element *element)
If applicable in the current operation mode, send a result message to the client indicating we remove...
Success, all elements have been sent (and received).
uint32_t bloomfilter_total_length
Total length of the bloomfilter data.
Internal representation of the hash map.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
const void * data
Actual data of the element.
static void send_p2p_done(struct Operation *op)
Notify the other peer that we are done.
struct GNUNET_STATISTICS_Handle * _GSS_statistics
Statistics handle.
static int iterator_bf_reduce(void *cls, const struct GNUNET_HashCode *key, void *value)
Removes elements from our hashmap if they are not contained within the provided remote bloomfilter...
struct OperationState * next
Evaluate operations are held in a linked list.
#define GNUNET_MQ_msg_extra(mvar, esize, type)
Allocate an envelope, with extra space allocated after the space needed by the message struct...
#define GNUNET_MESSAGE_TYPE_SET_P2P_OPERATION_REQUEST
Request a set operation from a remote peer.
enum State state
current state of profiling
void handle_intersection_p2p_done(void *cls, const struct IntersectionDoneMessage *idm)
Handle a done message from a remote peer.
void GNUNET_MQ_notify_sent(struct GNUNET_MQ_Envelope *ev, GNUNET_SCHEDULER_TaskCallback cb, void *cb_cls)
Call a callback once the envelope has been sent, that is, sending it can not be canceled anymore...
static char * value
Value of the record to add/remove.
Information about an element element in the set.
The other peer refused to to the operation with us, or something went wrong.
uint32_t bf_data_offset
How many bytes of bf_data are valid?
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
Everything went ok, we are transmitting an element of the result (in set, or to be removed from set...
Dispatch table for a specific set operation.
void GNUNET_CONTAINER_multihashmap_destroy(struct GNUNET_CONTAINER_MultiHashMap *map)
Destroy a hash map.
static void finished_local_operations(void *cls)
Remember that we are done dealing with the local client AND have sent the other peer our message that...
enum IntersectionOperationPhase phase
Current state of the operation.
uint16_t result_status
Was the evaluation successful? Contains an enum GNUNET_SET_Status in NBO.
uint32_t sender_element_count
mutator used with this bloomfilter.
We must next send the P2P DONE message (after finishing mostly with the local client).
int GNUNET_CONTAINER_multihashmap_remove(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, const void *value)
Remove the given key-value pair from the map.
struct Set * set
Set associated with the operation, NULL until the spec has been associated with a set...
IntersectionOperationPhase
Current phase we are in for a intersection operation.
static struct SetState * intersection_set_create()
Create a new set supporting the intersection operation.
struct GNUNET_HashCode element_xor_hash
XOR of all hashes over all elements remaining in the set.
void handle_intersection_p2p_element_info(void *cls, const struct IntersectionElementInfoMessage *msg)
Handle the initial struct IntersectionElementInfoMessage from a remote peer.
Bloom filter messages exchanged for set intersection calculation.
struct GNUNET_HashCode element_xor_hash
XOR of all hashes over all elements remaining in the set.
char * bf_data
For multipart BF transmissions, we have to store the bloomfilter-data until we fully received it...
uint16_t element_type
Type of the element attachted to the message, if any.
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_HashCode key
The key used in the DHT.
#define GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_ELEMENT_INFO
Information about the element count for intersection.
struct ClientState * cs
Client that owns the set.
Cursor into a multihashmap.
uint32_t current_set_element_count
Number of currently valid elements in the set which have not been removed.
int GNUNET_CONTAINER_bloomfilter_get_raw_data(const struct GNUNET_CONTAINER_BloomFilter *bf, char *data, size_t size)
Copy the raw data of this Bloom filter into the given data array.
enum GNUNET_SET_OperationType operation
Type of operation supported for this set.
Operation context used to execute a set operation.
int GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
static void send_element_count(struct Operation *op)
Send our element count to the peer, in case our element count is lower than theirs.
const struct SetVT * _GSS_intersection_vt()
Get the table with implementing functions for set intersection.
Extra state required for efficient set intersection.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
uint32_t bits_per_element
Number of bits (k-value) used in encoding the bloomfilter.
We have received the P2P DONE message, and must finish with the local client before terminating the c...
We have send the number of our elements to the other peer, but did not setup our element set yet...
static int iterator_bf_create(void *cls, const struct GNUNET_HashCode *key, void *value)
Create initial bloomfilter based on all the elements given.
During intersection, the first (and possibly second) message send it the number of elements in the se...
struct GNUNET_CONTAINER_MultiHashMapIterator * full_result_iter
Iterator for sending the final set of my_elements to the client.
void GNUNET_CADET_receive_done(struct GNUNET_CADET_Channel *channel)
Send an ack on the channel to confirm the processing of a message.
struct GNUNET_CADET_Channel * channel
Channel to the peer.
struct OperationState * prev
Evaluate operations are held in a linked list.
uint32_t client_request_id
ID used to identify an operation between service and client.
struct GNUNET_HashCode other_xor
XOR of the keys of all of the elements (remaining) in the other peer's set.
static void intersection_remove(struct SetState *set_state, struct ElementEntry *element)
Remove the element given in the element message from the set.
struct SetContent * content
Content, possibly shared by multiple sets, and thus reference counted.
struct GNUNET_CONTAINER_BloomFilter * remote_bf
The bf we currently receive.
uint16_t size
Number of bytes in the buffer pointed to by data.
common components for the implementation the different set operations
#define GNUNET_log(kind,...)
#define GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_DONE
Intersection operation is done.
struct GNUNET_SET_Element element
The actual element.
uint32_t operation
Operation to request, values from enum GNUNET_SET_OperationType
Client gets only elements that have been removed from the set.
struct GNUNET_CONTAINER_MultiHashMap * GNUNET_CONTAINER_multihashmap_create(unsigned int len, int do_not_copy_keys)
Create a multi hash map.
static void intersection_channel_death(struct Operation *op)
Callback for channel death for the intersection operation.
static void send_bloomfilter(struct Operation *op)
Send a bloomfilter to our peer.
void GNUNET_CRYPTO_hash_xor(const struct GNUNET_HashCode *a, const struct GNUNET_HashCode *b, struct GNUNET_HashCode *result)
compute result = a ^ b
Last message, send to confirm the final set.
void GNUNET_MQ_send(struct GNUNET_MQ_Handle *mq, struct GNUNET_MQ_Envelope *ev)
Send a message with the given message queue.
int channel_death_expected
Set whenever we reach the state where the death of the channel is perfectly find and should NOT resul...
Set intersection, only return elements that are in both sets.
static void intersection_set_destroy(struct SetState *set_state)
Destroy a set that supports the intersection operation.
uint32_t remote_element_count
Remote peers element count.
void handle_intersection_p2p_bf(void *cls, const struct BFMessage *msg)
Handle an BF message from a remote peer.
SetCreateImpl create
Callback for the set creation.
struct OperationState * state
Operation-specific operation state.
static struct GNUNET_ARM_Operation * op
Current operation.
static struct OperationState * intersection_accept(struct Operation *op)
Accept an intersection operation request from a remote peer.
static void intersection_op_cancel(struct Operation *op)
Destroy the intersection operation.
int GNUNET_CONTAINER_multihashmap_iterate(struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_MulitHashMapIteratorCallback it, void *it_cls)
Iterate over all entries in the map.
struct GNUNET_HashCode my_xor
XOR of the keys of all of the elements (remaining) in my set.
struct GNUNET_MQ_Handle * mq
Message queue for the channel.
struct GNUNET_CONTAINER_MultiHashMap * my_elements
Remaining elements in the intersection operation.
void GNUNET_CONTAINER_bloomfilter_free(struct GNUNET_CONTAINER_BloomFilter *bf)
Free the space associated with a filter in memory, flush to drive if needed (do not free the space on...
Peer-to-Peer messages for gnunet set.
void GNUNET_BLOCK_mingle_hash(const struct GNUNET_HashCode *in, uint32_t mingle_number, struct GNUNET_HashCode *hc)
Mingle hash with the mingle_number to produce different bits.
uint32_t sender_mutator
Mutator used with this bloomfilter.
#define GNUNET_malloc(size)
Wrapper around malloc.
#define GNUNET_free(ptr)
Wrapper around free.
uint16_t element_type
Application-specific element type.