GNUnet  0.10.x
gnunet-service-set_intersection.c
Go to the documentation of this file.
1 /*
2  This file is part of GNUnet
3  Copyright (C) 2013-2017 GNUnet e.V.
4 
5  GNUnet is free software: you can redistribute it and/or modify it
6  under the terms of the GNU Affero General Public License as published
7  by the Free Software Foundation, either version 3 of the License,
8  or (at your option) any later version.
9 
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  Affero General Public License for more details.
14 
15  You should have received a copy of the GNU Affero General Public License
16  along with this program. If not, see <http://www.gnu.org/licenses/>.
17 
18  SPDX-License-Identifier: AGPL3.0-or-later
19 */
26 #include "platform.h"
27 #include "gnunet_util_lib.h"
29 #include "gnunet-service-set.h"
30 #include "gnunet_block_lib.h"
33 #include <gcrypt.h>
34 
35 
40 {
45 
51 
58 
64 
70 
76 
77 };
78 
79 
84 {
89 
94 
100 
105 
110 
115 
120  char *bf_data;
121 
128 
135 
139  uint32_t bf_data_offset;
140 
146 
150  uint32_t bf_data_size;
151 
156 
161  uint32_t salt;
162 
167 
172  unsigned int generation_created;
173 
178 
185 };
186 
187 
192 struct SetState
193 {
199 };
200 
201 
209 static void
211  struct GNUNET_SET_Element *element)
212 {
213  struct GNUNET_MQ_Envelope *ev;
214  struct GNUNET_SET_ResultMessage *rm;
215 
217  return; /* Wrong mode for transmitting removed elements */
219  "Sending removed element (size %u) to client\n",
220  element->size);
222  "# Element removed messages sent",
223  1,
224  GNUNET_NO);
225  GNUNET_assert (0 != op->client_request_id);
226  ev = GNUNET_MQ_msg_extra (rm,
227  element->size,
229  if (NULL == ev)
230  {
231  GNUNET_break (0);
232  return;
233  }
234  rm->result_status = htons (GNUNET_SET_STATUS_OK);
235  rm->request_id = htonl (op->client_request_id);
236  rm->element_type = element->element_type;
237  GNUNET_memcpy (&rm[1],
238  element->data,
239  element->size);
240  GNUNET_MQ_send (op->set->cs->mq,
241  ev);
242 }
243 
244 
253 static int
255  const struct GNUNET_HashCode *key,
256  void *value)
257 {
258  struct Operation *op = cls;
259  struct ElementEntry *ee = value;
260  struct GNUNET_HashCode mutated_hash;
261 
262 
264  "FIMA called for %s:%u\n",
265  GNUNET_h2s (&ee->element_hash),
266  ee->element.size);
267 
268  if (GNUNET_NO == _GSS_is_element_of_operation (ee, op))
269  {
271  "Reduced initialization, not starting with %s:%u (wrong generation)\n",
272  GNUNET_h2s (&ee->element_hash),
273  ee->element.size);
274  return GNUNET_YES; /* element not valid in our operation's generation */
275  }
276 
277  /* Test if element is in other peer's bloomfilter */
279  op->state->salt,
280  &mutated_hash);
282  "Testing mingled hash %s with salt %u\n",
283  GNUNET_h2s (&mutated_hash),
284  op->state->salt);
285  if (GNUNET_NO ==
287  &mutated_hash))
288  {
289  /* remove this element */
291  &ee->element);
293  "Reduced initialization, not starting with %s:%u\n",
294  GNUNET_h2s (&ee->element_hash),
295  ee->element.size);
296  return GNUNET_YES;
297  }
298  op->state->my_element_count++;
300  &ee->element_hash,
301  &op->state->my_xor);
303  "Filtered initialization of my_elements, adding %s:%u\n",
304  GNUNET_h2s (&ee->element_hash),
305  ee->element.size);
308  &ee->element_hash,
309  ee,
311 
312  return GNUNET_YES;
313 }
314 
315 
325 static int
327  const struct GNUNET_HashCode *key,
328  void *value)
329 {
330  struct Operation *op = cls;
331  struct ElementEntry *ee = value;
332  struct GNUNET_HashCode mutated_hash;
333 
335  op->state->salt,
336  &mutated_hash);
338  "Testing mingled hash %s with salt %u\n",
339  GNUNET_h2s (&mutated_hash),
340  op->state->salt);
341  if (GNUNET_NO ==
343  &mutated_hash))
344  {
346  op->state->my_element_count--;
348  &ee->element_hash,
349  &op->state->my_xor);
351  "Bloom filter reduction of my_elements, removing %s:%u\n",
352  GNUNET_h2s (&ee->element_hash),
353  ee->element.size);
356  &ee->element_hash,
357  ee));
359  &ee->element);
360  }
361  else
362  {
364  "Bloom filter reduction of my_elements, keeping %s:%u\n",
365  GNUNET_h2s (&ee->element_hash),
366  ee->element.size);
367  }
368  return GNUNET_YES;
369 }
370 
371 
380 static int
382  const struct GNUNET_HashCode *key,
383  void *value)
384 {
385  struct Operation *op = cls;
386  struct ElementEntry *ee = value;
387  struct GNUNET_HashCode mutated_hash;
388 
390  op->state->salt,
391  &mutated_hash);
393  "Initializing BF with hash %s with salt %u\n",
394  GNUNET_h2s (&mutated_hash),
395  op->state->salt);
397  &mutated_hash);
398  return GNUNET_YES;
399 }
400 
401 
408 static void
410 {
411  struct GNUNET_MQ_Envelope *ev;
413 
415  "Intersection operation failed\n");
417  "# Intersection operations failed",
418  1,
419  GNUNET_NO);
420  if (NULL != op->state->my_elements)
421  {
423  op->state->my_elements = NULL;
424  }
425  ev = GNUNET_MQ_msg (msg,
428  msg->request_id = htonl (op->client_request_id);
429  msg->element_type = htons (0);
430  GNUNET_MQ_send (op->set->cs->mq,
431  ev);
433  GNUNET_YES);
434 }
435 
436 
443 static void
445 {
446  struct GNUNET_MQ_Envelope *ev;
447  struct BFMessage *msg;
448  uint32_t bf_size;
449  uint32_t bf_elementbits;
450  uint32_t chunk_size;
451  char *bf_data;
452  uint32_t offset;
453 
454  /* We consider the ratio of the set sizes to determine
455  the number of bits per element, as the smaller set
456  should use more bits to maximize its set reduction
457  potential and minimize overall bandwidth consumption. */
458  bf_elementbits = 2 + ceil (log2((double)
459  (op->remote_element_count /
460  (double) op->state->my_element_count)));
461  if (bf_elementbits < 1)
462  bf_elementbits = 1; /* make sure k is not 0 */
463  /* optimize BF-size to ~50% of bits set */
464  bf_size = ceil ((double) (op->state->my_element_count
465  * bf_elementbits / log(2)));
467  "Sending Bloom filter (%u) of size %u bytes\n",
468  (unsigned int) bf_elementbits,
469  (unsigned int) bf_size);
471  bf_size,
472  bf_elementbits);
474  UINT32_MAX);
477  op);
478 
479  /* send our Bloom filter */
481  "# Intersection Bloom filters sent",
482  1,
483  GNUNET_NO);
484  chunk_size = 60 * 1024 - sizeof (struct BFMessage);
485  if (bf_size <= chunk_size)
486  {
487  /* singlepart */
488  chunk_size = bf_size;
489  ev = GNUNET_MQ_msg_extra (msg,
490  chunk_size,
494  (char*) &msg[1],
495  bf_size));
496  msg->sender_element_count = htonl (op->state->my_element_count);
497  msg->bloomfilter_total_length = htonl (bf_size);
498  msg->bits_per_element = htonl (bf_elementbits);
499  msg->sender_mutator = htonl (op->state->salt);
500  msg->element_xor_hash = op->state->my_xor;
501  GNUNET_MQ_send (op->mq, ev);
502  }
503  else
504  {
505  /* multipart */
506  bf_data = GNUNET_malloc (bf_size);
509  bf_data,
510  bf_size));
511  offset = 0;
512  while (offset < bf_size)
513  {
514  if (bf_size - chunk_size < offset)
515  chunk_size = bf_size - offset;
516  ev = GNUNET_MQ_msg_extra (msg,
517  chunk_size,
519  GNUNET_memcpy (&msg[1],
520  &bf_data[offset],
521  chunk_size);
522  offset += chunk_size;
523  msg->sender_element_count = htonl (op->state->my_element_count);
524  msg->bloomfilter_total_length = htonl (bf_size);
525  msg->bits_per_element = htonl (bf_elementbits);
526  msg->sender_mutator = htonl (op->state->salt);
527  msg->element_xor_hash = op->state->my_xor;
528  GNUNET_MQ_send (op->mq, ev);
529  }
530  GNUNET_free (bf_data);
531  }
533  op->state->local_bf = NULL;
534 }
535 
536 
543 static void
545 {
546  struct Operation *op = cls;
547  struct GNUNET_MQ_Envelope *ev;
548  struct GNUNET_SET_ResultMessage *rm;
549 
551  "Intersection succeeded, sending DONE to local client\n");
553  "# Intersection operations succeeded",
554  1,
555  GNUNET_NO);
556  ev = GNUNET_MQ_msg (rm,
558  rm->request_id = htonl (op->client_request_id);
560  rm->element_type = htons (0);
561  GNUNET_MQ_send (op->set->cs->mq,
562  ev);
564  GNUNET_YES);
565 }
566 
567 
576 static void
578 {
579  struct Operation *op = cls;
580 
582  "DONE sent to other peer, now waiting for other end to close the channel\n");
583  op->state->phase = PHASE_FINISHED;
585 }
586 
587 
595 static void
597 {
598  struct GNUNET_MQ_Envelope *ev;
599  struct IntersectionDoneMessage *idm;
600 
603  ev = GNUNET_MQ_msg (idm,
605  idm->final_element_count = htonl (op->state->my_element_count);
606  idm->element_xor_hash = op->state->my_xor;
609  op);
610  GNUNET_MQ_send (op->mq,
611  ev);
612 }
613 
614 
620 static void
622 {
623  struct Operation *op = cls;
624  const void *nxt;
625  const struct ElementEntry *ee;
626  struct GNUNET_MQ_Envelope *ev;
627  struct GNUNET_SET_ResultMessage *rm;
628  const struct GNUNET_SET_Element *element;
629  int res;
630 
632  NULL,
633  &nxt);
634  if (GNUNET_NO == res)
635  {
637  "Sending done and destroy because iterator ran out\n");
639  op->state->full_result_iter = NULL;
640  if (PHASE_DONE_RECEIVED == op->state->phase)
641  {
642  op->state->phase = PHASE_FINISHED;
644  }
645  else if (PHASE_MUST_SEND_DONE == op->state->phase)
646  {
647  send_p2p_done (op);
648  }
649  else
650  {
651  GNUNET_assert (0);
652  }
653  return;
654  }
655  ee = nxt;
656  element = &ee->element;
658  "Sending element %s:%u to client (full set)\n",
659  GNUNET_h2s (&ee->element_hash),
660  element->size);
661  GNUNET_assert (0 != op->client_request_id);
662  ev = GNUNET_MQ_msg_extra (rm,
663  element->size,
665  GNUNET_assert (NULL != ev);
666  rm->result_status = htons (GNUNET_SET_STATUS_OK);
667  rm->request_id = htonl (op->client_request_id);
668  rm->element_type = element->element_type;
669  GNUNET_memcpy (&rm[1],
670  element->data,
671  element->size);
674  op);
675  GNUNET_MQ_send (op->set->cs->mq,
676  ev);
677 }
678 
679 
689 static int
691  const struct GNUNET_HashCode *key,
692  void *value)
693 {
694  struct ElementEntry *ee = value;
695  struct Operation *op = cls;
696 
697  if (GNUNET_NO == _GSS_is_element_of_operation (ee, op))
698  return GNUNET_YES; /* element not live in operation's generation */
700  &ee->element_hash,
701  &op->state->my_xor);
703  "Initial full initialization of my_elements, adding %s:%u\n",
704  GNUNET_h2s (&ee->element_hash),
705  ee->element.size);
708  &ee->element_hash,
709  ee,
711  return GNUNET_YES;
712 }
713 
714 
721 static void
723 {
724  struct GNUNET_MQ_Envelope *ev;
726 
728  "Sending our element count (%u)\n",
729  op->state->my_element_count);
730  ev = GNUNET_MQ_msg (msg,
732  msg->sender_element_count = htonl (op->state->my_element_count);
733  GNUNET_MQ_send (op->mq, ev);
734 }
735 
736 
743 static void
745 {
749  op);
750  send_bloomfilter (op);
751 }
752 
753 
761 void
763  const struct IntersectionElementInfoMessage *msg)
764 {
765  struct Operation *op = cls;
766 
768  {
769  GNUNET_break_op (0);
771  return;
772  }
773  op->remote_element_count = ntohl (msg->sender_element_count);
775  "Received remote element count (%u), I have %u\n",
777  op->state->my_element_count);
778  if ( ( (PHASE_INITIAL != op->state->phase) &&
779  (PHASE_COUNT_SENT != op->state->phase) ) ||
781  (0 == op->state->my_element_count) ||
782  (0 == op->remote_element_count) )
783  {
784  GNUNET_break_op (0);
786  return;
787  }
788  GNUNET_break (NULL == op->state->remote_bf);
789  begin_bf_exchange (op);
791 }
792 
793 
799 static void
801 {
803  "Received BF in phase %u, foreign count is %u, my element count is %u/%u\n",
804  op->state->phase,
806  op->state->my_element_count,
808  switch (op->state->phase)
809  {
810  case PHASE_INITIAL:
811  GNUNET_break_op (0);
813  return;
814  case PHASE_COUNT_SENT:
815  /* This is the first BF being sent, build our initial map with
816  filtering in place */
817  op->state->my_element_count = 0;
820  op);
821  break;
822  case PHASE_BF_EXCHANGE:
823  /* Update our set by reduction */
826  op);
827  break;
829  GNUNET_break_op (0);
831  return;
832  case PHASE_DONE_RECEIVED:
833  GNUNET_break_op (0);
835  return;
836  case PHASE_FINISHED:
837  GNUNET_break_op (0);
839  return;
840  }
842  op->state->remote_bf = NULL;
843 
844  if ( (0 == op->state->my_element_count) || /* fully disjoint */
845  ( (op->state->my_element_count == op->remote_element_count) &&
846  (0 == GNUNET_memcmp (&op->state->my_xor,
847  &op->state->other_xor)) ) )
848  {
849  /* we are done */
852  "Intersection succeeded, sending DONE to other peer\n");
854  op->state->local_bf = NULL;
856  {
858  "Sending full result set (%u elements)\n",
863  return;
864  }
865  send_p2p_done (op);
866  return;
867  }
869  send_bloomfilter (op);
870 }
871 
872 
880 int
882  const struct BFMessage *msg)
883 {
884  struct Operation *op = cls;
885 
887  {
888  GNUNET_break_op (0);
889  return GNUNET_SYSERR;
890  }
891  return GNUNET_OK;
892 }
893 
894 
901 void
903  const struct BFMessage *msg)
904 {
905  struct Operation *op = cls;
906  uint32_t bf_size;
907  uint32_t chunk_size;
908  uint32_t bf_bits_per_element;
909 
910  switch (op->state->phase)
911  {
912  case PHASE_INITIAL:
913  GNUNET_break_op (0);
915  return;
916  case PHASE_COUNT_SENT:
917  case PHASE_BF_EXCHANGE:
918  bf_size = ntohl (msg->bloomfilter_total_length);
919  bf_bits_per_element = ntohl (msg->bits_per_element);
920  chunk_size = htons (msg->header.size) - sizeof (struct BFMessage);
921  op->state->other_xor = msg->element_xor_hash;
922  if (bf_size == chunk_size)
923  {
924  if (NULL != op->state->bf_data)
925  {
926  GNUNET_break_op (0);
928  return;
929  }
930  /* single part, done here immediately */
931  op->state->remote_bf
932  = GNUNET_CONTAINER_bloomfilter_init ((const char*) &msg[1],
933  bf_size,
934  bf_bits_per_element);
935  op->state->salt = ntohl (msg->sender_mutator);
936  op->remote_element_count = ntohl (msg->sender_element_count);
937  process_bf (op);
938  break;
939  }
940  /* multipart chunk */
941  if (NULL == op->state->bf_data)
942  {
943  /* first chunk, initialize */
944  op->state->bf_data = GNUNET_malloc (bf_size);
945  op->state->bf_data_size = bf_size;
947  op->state->bf_data_offset = 0;
948  op->state->salt = ntohl (msg->sender_mutator);
949  op->remote_element_count = ntohl (msg->sender_element_count);
950  }
951  else
952  {
953  /* increment */
954  if ( (op->state->bf_data_size != bf_size) ||
955  (op->state->bf_bits_per_element != bf_bits_per_element) ||
956  (op->state->bf_data_offset + chunk_size > bf_size) ||
957  (op->state->salt != ntohl (msg->sender_mutator)) ||
958  (op->remote_element_count != ntohl (msg->sender_element_count)) )
959  {
960  GNUNET_break_op (0);
962  return;
963  }
964  }
966  (const char*) &msg[1],
967  chunk_size);
968  op->state->bf_data_offset += chunk_size;
969  if (op->state->bf_data_offset == bf_size)
970  {
971  /* last chunk, run! */
972  op->state->remote_bf
974  bf_size,
975  bf_bits_per_element);
976  GNUNET_free (op->state->bf_data);
977  op->state->bf_data = NULL;
978  op->state->bf_data_size = 0;
979  process_bf (op);
980  }
981  break;
982  default:
983  GNUNET_break_op (0);
985  return;
986  }
988 }
989 
990 
999 static int
1000 filter_all (void *cls,
1001  const struct GNUNET_HashCode *key,
1002  void *value)
1003 {
1004  struct Operation *op = cls;
1005  struct ElementEntry *ee = value;
1006 
1007  GNUNET_break (0 < op->state->my_element_count);
1008  op->state->my_element_count--;
1010  &ee->element_hash,
1011  &op->state->my_xor);
1013  "Final reduction of my_elements, removing %s:%u\n",
1014  GNUNET_h2s (&ee->element_hash),
1015  ee->element.size);
1018  &ee->element_hash,
1019  ee));
1021  &ee->element);
1022  return GNUNET_YES;
1023 }
1024 
1025 
1032 void
1034  const struct IntersectionDoneMessage *idm)
1035 {
1036  struct Operation *op = cls;
1037 
1039  {
1040  GNUNET_break_op (0);
1042  return;
1043  }
1044  if (PHASE_BF_EXCHANGE != op->state->phase)
1045  {
1046  /* wrong phase to conclude? FIXME: Or should we allow this
1047  if the other peer has _initially_ already an empty set? */
1048  GNUNET_break_op (0);
1050  return;
1051  }
1052  if (0 == ntohl (idm->final_element_count))
1053  {
1054  /* other peer determined empty set is the intersection,
1055  remove all elements */
1057  &filter_all,
1058  op);
1059  }
1060  if ( (op->state->my_element_count != ntohl (idm->final_element_count)) ||
1061  (0 != GNUNET_memcmp (&op->state->my_xor,
1062  &idm->element_xor_hash)) )
1063  {
1064  /* Other peer thinks we are done, but we disagree on the result! */
1065  GNUNET_break_op (0);
1067  return;
1068  }
1070  "Got IntersectionDoneMessage, have %u elements in intersection\n",
1071  op->state->my_element_count);
1074 
1077  {
1079  "Sending full result set to client (%u elements)\n",
1081  op->state->full_result_iter
1084  return;
1085  }
1086  op->state->phase = PHASE_FINISHED;
1088 }
1089 
1090 
1100 static struct OperationState *
1102  const struct GNUNET_MessageHeader *opaque_context)
1103 {
1104  struct OperationState *state;
1105  struct GNUNET_MQ_Envelope *ev;
1106  struct OperationRequestMessage *msg;
1107 
1108  ev = GNUNET_MQ_msg_nested_mh (msg,
1110  opaque_context);
1111  if (NULL == ev)
1112  {
1113  /* the context message is too large!? */
1114  GNUNET_break (0);
1115  return NULL;
1116  }
1118  "Initiating intersection operation evaluation\n");
1119  state = GNUNET_new (struct OperationState);
1120  /* we started the operation, thus we have to send the operation request */
1121  state->phase = PHASE_INITIAL;
1123  state->my_elements
1125  GNUNET_YES);
1126 
1128  msg->element_count = htonl (state->my_element_count);
1129  GNUNET_MQ_send (op->mq,
1130  ev);
1131  state->phase = PHASE_COUNT_SENT;
1132  if (NULL != opaque_context)
1134  "Sent op request with context message\n");
1135  else
1137  "Sent op request without context message\n");
1138  return state;
1139 }
1140 
1141 
1148 static struct OperationState *
1150 {
1151  struct OperationState *state;
1152 
1154  "Accepting set intersection operation\n");
1155  state = GNUNET_new (struct OperationState);
1156  state->phase = PHASE_INITIAL;
1157  state->my_element_count
1159  state->my_elements
1161  op->remote_element_count),
1162  GNUNET_YES);
1163  op->state = state;
1164  if (op->remote_element_count < state->my_element_count)
1165  {
1166  /* If the other peer (Alice) has fewer elements than us (Bob),
1167  we just send the count as Alice should send the first BF */
1168  send_element_count (op);
1169  state->phase = PHASE_COUNT_SENT;
1170  return state;
1171  }
1172  /* We have fewer elements, so we start with the BF */
1173  begin_bf_exchange (op);
1174  return state;
1175 }
1176 
1177 
1184 static void
1186 {
1187  /* check if the op was canceled twice */
1188  GNUNET_assert (NULL != op->state);
1189  if (NULL != op->state->remote_bf)
1190  {
1192  op->state->remote_bf = NULL;
1193  }
1194  if (NULL != op->state->local_bf)
1195  {
1197  op->state->local_bf = NULL;
1198  }
1199  if (NULL != op->state->my_elements)
1200  {
1202  op->state->my_elements = NULL;
1203  }
1204  if (NULL != op->state->full_result_iter)
1205  {
1207  op->state->full_result_iter = NULL;
1208  }
1209  GNUNET_free (op->state);
1210  op->state = NULL;
1212  "Destroying intersection op state done\n");
1213 }
1214 
1215 
1221 static struct SetState *
1223 {
1224  struct SetState *set_state;
1225 
1227  "Intersection set created\n");
1228  set_state = GNUNET_new (struct SetState);
1229  set_state->current_set_element_count = 0;
1230 
1231  return set_state;
1232 }
1233 
1234 
1241 static void
1242 intersection_add (struct SetState *set_state,
1243  struct ElementEntry *ee)
1244 {
1245  set_state->current_set_element_count++;
1246 }
1247 
1248 
1254 static void
1256 {
1257  GNUNET_free (set_state);
1258 }
1259 
1260 
1267 static void
1268 intersection_remove (struct SetState *set_state,
1269  struct ElementEntry *element)
1270 {
1271  GNUNET_assert (0 < set_state->current_set_element_count);
1272  set_state->current_set_element_count--;
1273 }
1274 
1275 
1281 static void
1283 {
1285  {
1286  /* oh goodie, we are done! */
1288  }
1289  else
1290  {
1291  /* sorry, channel went down early, too bad. */
1293  GNUNET_YES);
1294  }
1295 }
1296 
1297 
1303 const struct SetVT *
1305 {
1306  static const struct SetVT intersection_vt = {
1308  .add = &intersection_add,
1309  .remove = &intersection_remove,
1310  .destroy_set = &intersection_set_destroy,
1311  .evaluate = &intersection_evaluate,
1312  .accept = &intersection_accept,
1313  .cancel = &intersection_op_cancel,
1314  .channel_death = &intersection_channel_death,
1315  };
1316 
1317  return &intersection_vt;
1318 }
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&#39;s position.
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
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.
We are just starting.
uint32_t final_element_count
Final number of elements in intersection.
struct Set * set
Set associated with the operation, NULL until the spec has been associated with a set...
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...
Definition: set.h:246
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.
Element stored in a set.
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...
struct GNUNET_CADET_Channel * channel
Channel to the peer.
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
Definition: set.h:261
We have initialized our set and are now reducing it by exchanging Bloom filters until one party notic...
struct GNUNET_CONTAINER_BloomFilter * local_bf
BF of the set&#39;s element.
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
uint32_t my_element_count
Current element count contained within my_elements.
int GNUNET_CONTAINER_multihashmap_iterate(struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_HashMapIterator it, void *it_cls)
Iterate over all entries in the map.
#define GNUNET_NO
Definition: gnunet_common.h:81
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.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:78
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.
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
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...
Definition: gnunet_mq_lib.h:52
#define GNUNET_MESSAGE_TYPE_SET_P2P_OPERATION_REQUEST
Request a set operation from a remote peer.
enum State state
current state of profiling
#define GNUNET_memcpy(dst, src, n)
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...
Definition: mq.c:774
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.
The protocol is over.
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...
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:83
enum IntersectionOperationPhase phase
Current state of the operation.
uint16_t result_status
Was the evaluation successful? Contains an enum GNUNET_SET_Status in NBO.
Definition: set.h:267
uint32_t sender_element_count
mutator used with this bloomfilter.
Randomness for IVs etc.
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.
IntersectionOperationPhase
Current phase we are in for a intersection operation.
static struct SetState * intersection_set_create()
Create a new set supporting the intersection operation.
A 512-bit hashcode.
struct GNUNET_HashCode element_xor_hash
XOR of all hashes over all elements remaining in the set.
static int res
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.
Definition: set.h:272
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_SYSERR
Definition: gnunet_common.h:79
#define GNUNET_MESSAGE_TYPE_SET_INTERSECTION_P2P_ELEMENT_INFO
Information about the element count for intersection.
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.
two-peer set operations
void GNUNET_CADET_receive_done(struct GNUNET_CADET_Channel *channel)
Send an ack on the channel to confirm the processing of a message.
Definition: cadet_api.c:973
struct GNUNET_MQ_Handle * mq
Message queue for the channel.
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&#39;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 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 * elements
Maps struct GNUNET_HashCode * to struct ElementEntry *.
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.
Header for all communications.
#define GNUNET_YES
Definition: gnunet_common.h:80
void GNUNET_CRYPTO_hash_xor(const struct GNUNET_HashCode *a, const struct GNUNET_HashCode *b, struct GNUNET_HashCode *result)
compute result = a ^ b
Definition: crypto_hash.c:193
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.
Definition: mq.c:353
int channel_death_expected
Set whenever we reach the state where the death of the channel is perfectly find and should NOT resul...
struct ClientState * cs
Client that owns the set.
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.
Definition: gnunet-arm.c:139
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.
struct GNUNET_HashCode my_xor
XOR of the keys of all of the elements (remaining) in my set.
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 associcated with a filter in memory, flush to drive if needed (do not free the space o...
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.
Definition: block.c:81
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.
struct SetContent * content
Content, possibly shared by multiple sets, and thus reference counted.