summaryrefslogtreecommitdiff
path: root/src/dv/gnunet-service-dv.c
blob: 6dc37f7d90411b3999b560ea4d0ece5f253a203c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
/*
     This file is part of GNUnet.
     (C) 2013 Christian Grothoff (and other contributing authors)

     GNUnet is free software; you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published
     by the Free Software Foundation; either version 3, or (at your
     option) any later version.

     GNUnet is distributed in the hope that it will be useful, but
     WITHOUT ANY WARRANTY; without even the implied warranty of
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
     General Public License for more details.

     You should have received a copy of the GNU General Public License
     along with GNUnet; see the file COPYING.  If not, write to the
     Free Software Foundation, Inc., 59 Temple Place - Suite 330,
     Boston, MA 02111-1307, USA.
*/

/**
 * @file dv/gnunet-service-dv.c
 * @brief the distance vector service, primarily handles gossip of nearby
 * peers and sending/receiving DV messages from core and decapsulating
 * them
 *
 * @author Christian Grothoff
 * @author Nathan Evans
 */
#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_protocols.h"
#include "gnunet_core_service.h"
#include "gnunet_hello_lib.h"
#include "gnunet_peerinfo_service.h"
#include "gnunet_statistics_service.h"
#include "gnunet_consensus_service.h"
#include "gnunet_ats_service.h"
#include "dv.h"
#include <gcrypt.h>


/**
 * How often do we establish the consensu?
 */
#define GNUNET_DV_CONSENSUS_FREQUENCY GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 5)

/**
 * Maximum number of messages we queue per peer.
 */
#define MAX_QUEUE_SIZE 16

/**
 * Maximum number of messages we queue towards the clients/plugin.
 */
#define MAX_QUEUE_SIZE_PLUGIN 1024

/**
 * The default fisheye depth, from how many hops away will
 * we keep peers?
 */
#define DEFAULT_FISHEYE_DEPTH 3

/**
 * How many hops is a direct neighbor away?
 */
#define DIRECT_NEIGHBOR_COST 1


GNUNET_NETWORK_STRUCT_BEGIN

/**
 * Information about a peer DV can route to.  These entries are what
 * we use as the binary format to establish consensus to create our
 * routing table and as the address format in the HELLOs.
 */
struct Target
{

  /**
   * Identity of the peer we can reach.
   */
  struct GNUNET_PeerIdentity peer;

  /**
   * How many hops (1-3) is this peer away? in network byte order
   */
  uint32_t distance GNUNET_PACKED;

};


/**
 * Message exchanged between DV services (via core), requesting a
 * message to be routed.  
 */
struct RouteMessage
{
  /**
   * Type: GNUNET_MESSAGE_TYPE_DV_ROUTE
   */
  struct GNUNET_MessageHeader header;

  /**
   * Expected (remaining) distance.  Must be always smaller than
   * DEFAULT_FISHEYE_DEPTH, should be zero at the target.  Must
   * be decremented by one at each hop.  Peers must not forward
   * these messages further once the counter has reached zero.
   */
  uint32_t distance GNUNET_PACKED;

  /**
   * The (actual) target of the message (this peer, if distance is zero).
   */
  struct GNUNET_PeerIdentity target;

  /**
   * The (actual) sender of the message.
   */
  struct GNUNET_PeerIdentity sender;

};

GNUNET_NETWORK_STRUCT_END


/**
 * Linked list of messages to send to clients.
 */
struct PendingMessage
{
  /**
   * Pointer to next item in the list
   */
  struct PendingMessage *next;

  /**
   * Pointer to previous item in the list
   */
  struct PendingMessage *prev;

  /**
   * Actual message to be sent, allocated after this struct.
   */
  const struct GNUNET_MessageHeader *msg;

  /**
   * Ultimate target for the message.
   */
  struct GNUNET_PeerIdentity ultimate_target;

  /**
   * Unique ID of the message.
   */
  uint32_t uid;

};


/**
 * Information about a direct neighbor (core-level, excluding
 * DV-links, only DV-enabled peers).
 */
struct DirectNeighbor
{

  /**
   * Identity of the peer.
   */
  struct GNUNET_PeerIdentity peer;
  
  /**
   * Head of linked list of messages to send to this peer.
   */
  struct PendingMessage *pm_head;

  /**
   * Tail of linked list of messages to send to this peer.
   */
  struct PendingMessage *pm_tail;

  /**
   * Transmit handle to core service.
   */
  struct GNUNET_CORE_TransmitHandle *cth;

  /**
   * Routing table of the neighbor, NULL if not yet established.
   * Keys are peer identities, values are 'struct Target' entries.
   * Note that the distances in the targets are from the point-of-view
   * of the peer, not from us!
   */ 
  struct GNUNET_CONTAINER_MultiHashMap *neighbor_table;

  /**
   * Updated routing table of the neighbor, under construction,
   * NULL if we are not currently building it.
   * Keys are peer identities, values are 'struct Target' entries.
   * Note that the distances in the targets are from the point-of-view
   * of the peer, not from us!
   */ 
  struct GNUNET_CONTAINER_MultiHashMap *neighbor_table_consensus;

  /**
   * Active consensus, if we are currently synchronizing the
   * routing tables.
   */
  struct GNUNET_CONSENSUS_Handle *consensus;

  /**
   * ID of the task we use to (periodically) update our consensus
   * with this peer.
   */
  GNUNET_SCHEDULER_TaskIdentifier consensus_task;

  /**
   * At what offset are we, with respect to inserting our own routes
   * into the consensus?
   */
  unsigned int consensus_insertion_offset;

  /**
   * At what distance are we, with respect to inserting our own routes
   * into the consensus?
   */
  unsigned int consensus_insertion_distance;

  /**
   * Number of messages currently in the 'pm_XXXX'-DLL.
   */
  unsigned int pm_queue_size;

  /**
   * Flag set within 'check_target_removed' to trigger full global route refresh.
   */
  int target_removed;

  /**
   * Our distance to this peer, 0 for unknown.
   */
  uint32_t distance;

  /**
   * Is this neighbor connected at the core level?
   */
  int connected;

};


/**
 * A route includes information about the next hop,
 * the target, and the ultimate distance to the
 * target.
 */
struct Route
{

  /**
   * Which peer do we need to forward the message to?
   */
  struct DirectNeighbor *next_hop;

  /**
   * What would be the target, and how far is it away?
   */
  struct Target target;

  /**
   * Offset of this target in the respective consensus set.
   */
  unsigned int set_offset;

};


/**
 * Set of targets we bring to a consensus; all targets in a set have a
 * distance equal to the sets distance (which is implied by the array
 * index of the set).
 */
struct ConsensusSet
{

  /**
   * Array of targets in the set, may include NULL entries if a
   * neighbor has disconnected; the targets are allocated with the
   * respective container (all_routes), not here.
   */
  struct Route **targets;

  /**
   * Size of the 'targets' array.
   */
  unsigned int array_length;

};


/**
 * Hashmap of all of our neighbors; processing these usually requires
 * first checking to see if the peer is core-connected and if the 
 * distance is 1, in which case they are direct neighbors.
 */
static struct GNUNET_CONTAINER_MultiHashMap *direct_neighbors;

/**
 * Hashmap with all routes that we currently support; contains 
 * routing information for all peers from distance 2
 * up to distance DEFAULT_FISHEYE_DEPTH.
 */
static struct GNUNET_CONTAINER_MultiHashMap *all_routes;

/**
 * Array of consensus sets we expose to the outside world.  Sets
 * are structured by the distance to the target.
 */
static struct ConsensusSet consensi[DEFAULT_FISHEYE_DEPTH - 1];

/**
 * Handle to the core service api.
 */
static struct GNUNET_CORE_Handle *core_api;

/**
 * The identity of our peer.
 */
static struct GNUNET_PeerIdentity my_identity;

/**
 * The configuration for this service.
 */
static const struct GNUNET_CONFIGURATION_Handle *cfg;

/**
 * The client, the DV plugin connected to us (or an event monitor).
 * Hopefully this client will never change, although if the plugin
 * dies and returns for some reason it may happen.
 */
static struct GNUNET_SERVER_NotificationContext *nc;

/**
 * Handle for the statistics service.
 */
static struct GNUNET_STATISTICS_Handle *stats;

/**
 * Handle to ATS service.
 */
static struct GNUNET_ATS_PerformanceHandle *ats;
 

/**
 * Start creating a new consensus from scratch.
 *
 * @param cls the 'struct DirectNeighbor' of the peer we're building
 *        a routing consensus with
 * @param tc scheduler context
 */    
static void
start_consensus (void *cls,
		 const struct GNUNET_SCHEDULER_TaskContext *tc);


/**
 * Forward a message from another peer to the plugin.
 *
 * @param message the message to send to the plugin
 * @param origin the original sender of the message
 * @param distance distance to the original sender of the message
 */
static void
send_data_to_plugin (const struct GNUNET_MessageHeader *message, 
		     const struct GNUNET_PeerIdentity *origin,
		     uint32_t distance)
{
  struct GNUNET_DV_ReceivedMessage *received_msg;
  size_t size;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Delivering message from peer `%s'\n",
              GNUNET_i2s (origin));
  size = sizeof (struct GNUNET_DV_ReceivedMessage) + 
    ntohs (message->size);
  if (size >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
  {    
    GNUNET_break (0); /* too big */
    return;
  }
  received_msg = GNUNET_malloc (size);
  received_msg->header.size = htons (size);
  received_msg->header.type = htons (GNUNET_MESSAGE_TYPE_DV_RECV);
  received_msg->distance = htonl (distance);
  received_msg->sender = *origin;
  memcpy (&received_msg[1], message, ntohs (message->size));
  GNUNET_SERVER_notification_context_broadcast (nc, 
						&received_msg->header,
						GNUNET_YES);
  GNUNET_free (received_msg);
}


/**
 * Forward a control message to the plugin.
 *
 * @param message the message to send to the plugin
 */
static void
send_control_to_plugin (const struct GNUNET_MessageHeader *message)
{
  GNUNET_SERVER_notification_context_broadcast (nc, 
						message,
						GNUNET_NO);
}


/**
 * Give an (N)ACK message to the plugin, we transmitted a message for it.
 *
 * @param target peer that received the message
 * @param uid plugin-chosen UID for the message
 * @param nack GNUNET_NO to send ACK, GNUNET_YES to send NACK
 */
static void
send_ack_to_plugin (const struct GNUNET_PeerIdentity *target, 
		    uint32_t uid,
		    int nack)
{
  struct GNUNET_DV_AckMessage ack_msg;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Delivering ACK for message to peer `%s'\n",
              GNUNET_i2s (target));
  ack_msg.header.size = htons (sizeof (ack_msg));
  ack_msg.header.type = htons ((GNUNET_YES == nack) 
			       ? GNUNET_MESSAGE_TYPE_DV_SEND_NACK
			       : GNUNET_MESSAGE_TYPE_DV_SEND_ACK);
  ack_msg.uid = htonl (uid);
  ack_msg.target = *target;
  send_control_to_plugin (&ack_msg.header);
}


/**
 * Send a DISTANCE_CHANGED message to the plugin.
 *
 * @param peer peer with a changed distance
 * @param distance new distance to the peer
 */
static void
send_distance_change_to_plugin (const struct GNUNET_PeerIdentity *peer, 
				uint32_t distance)
{
  struct GNUNET_DV_DistanceUpdateMessage du_msg;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Delivering DISTANCE_CHANGED for message about peer `%s'\n",
              GNUNET_i2s (peer));
  du_msg.header.size = htons (sizeof (du_msg));
  du_msg.header.type = htons (GNUNET_MESSAGE_TYPE_DV_DISTANCE_CHANGED);
  du_msg.distance = htonl (distance);
  du_msg.peer = *peer;
  send_control_to_plugin (&du_msg.header);
}


/**
 * Give a CONNECT message to the plugin.
 *
 * @param target peer that connected
 * @param distance distance to the target
 */
static void
send_connect_to_plugin (const struct GNUNET_PeerIdentity *target, 
			uint32_t distance)
{
  struct GNUNET_DV_ConnectMessage cm;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Delivering CONNECT about peer `%s'\n",
              GNUNET_i2s (target));
  cm.header.size = htons (sizeof (cm));
  cm.header.type = htons (GNUNET_MESSAGE_TYPE_DV_CONNECT);
  cm.distance = htonl (distance);
  cm.peer = *target;
  send_control_to_plugin (&cm.header);
}


/**
 * Give a DISCONNECT message to the plugin.
 *
 * @param target peer that disconnected
 */
static void
send_disconnect_to_plugin (const struct GNUNET_PeerIdentity *target)
{
  struct GNUNET_DV_DisconnectMessage dm;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Delivering DISCONNECT about peer `%s'\n",
              GNUNET_i2s (target));
  dm.header.size = htons (sizeof (dm));
  dm.header.type = htons (GNUNET_MESSAGE_TYPE_DV_DISCONNECT);
  dm.reserved = htonl (0);
  dm.peer = *target;
  send_control_to_plugin (&dm.header);
}


/**
 * Function called to transfer a message to another peer
 * via core.
 *
 * @param cls closure with the direct neighbor
 * @param size number of bytes available in buf
 * @param buf where the callee should write the message
 * @return number of bytes written to buf
 */
static size_t
core_transmit_notify (void *cls, size_t size, void *buf)
{
  struct DirectNeighbor *dn = cls;
  char *cbuf = buf;
  struct PendingMessage *pending;
  size_t off;
  size_t msize;

  dn->cth = NULL;
  if (NULL == buf)
  {
    /* peer disconnected */
    return 0;
  }
  off = 0;
  pending = dn->pm_head;
  off = 0;
  while ( (NULL != (pending = dn->pm_head)) &&
	  (size >= off + (msize = ntohs (pending->msg->size))))
  {
    dn->pm_queue_size--;
    GNUNET_CONTAINER_DLL_remove (dn->pm_head,
				 dn->pm_tail,
                                 pending);
    memcpy (&cbuf[off], pending->msg, msize);
    if (0 != pending->uid) 
      send_ack_to_plugin (&pending->ultimate_target,
			  pending->uid,
			  GNUNET_NO);
    GNUNET_free (pending);
    off += msize;
  }
  if (NULL != dn->pm_head)
    dn->cth =
      GNUNET_CORE_notify_transmit_ready (core_api,
					 GNUNET_YES /* cork */,
					 0 /* priority */,
					 GNUNET_TIME_UNIT_FOREVER_REL,
					 &dn->peer,
					 msize,					 
					 &core_transmit_notify, dn);
  return off;
}


/**
 * Forward the given payload to the given target.
 *
 * @param target where to send the message
 * @param uid unique ID for the message
 * @param ultimate_target ultimate recipient for the message
 * @param distance expected (remaining) distance to the target
 * @param sender original sender of the message
 * @param payload payload of the message
 */
static void
forward_payload (struct DirectNeighbor *target,
		 uint32_t distance,
		 uint32_t uid,
		 const struct GNUNET_PeerIdentity *sender,
		 const struct GNUNET_PeerIdentity *ultimate_target,
		 const struct GNUNET_MessageHeader *payload)
{
  struct PendingMessage *pm;
  struct RouteMessage *rm;
  size_t msize;

  if ( (target->pm_queue_size >= MAX_QUEUE_SIZE) &&
       (0 != memcmp (sender,
		     &my_identity,
		     sizeof (struct GNUNET_PeerIdentity))) )
  {
    GNUNET_break (0 == uid);
    return;
  }
  msize = sizeof (struct RouteMessage) + ntohs (payload->size);
  if (msize >= GNUNET_SERVER_MAX_MESSAGE_SIZE)
  {
    GNUNET_break (0);
    return;
  }
  pm = GNUNET_malloc (sizeof (struct PendingMessage) + msize);
  pm->ultimate_target = *ultimate_target;
  pm->uid = uid;
  pm->msg = (const struct GNUNET_MessageHeader *) &pm[1];
  rm = (struct RouteMessage *) &pm[1];
  rm->header.size = htons ((uint16_t) msize);
  rm->header.type = htons (GNUNET_MESSAGE_TYPE_DV_ROUTE);
  rm->distance = htonl (distance);
  rm->target = target->peer;
  rm->sender = *sender;
  memcpy (&rm[1], payload, ntohs (payload->size));
  GNUNET_CONTAINER_DLL_insert_tail (target->pm_head,
				    target->pm_tail,
				    pm);
  target->pm_queue_size++;
  if (NULL == target->cth)
    target->cth = GNUNET_CORE_notify_transmit_ready (core_api,
						     GNUNET_YES /* cork */,
						     0 /* priority */,
						     GNUNET_TIME_UNIT_FOREVER_REL,
						     &target->peer,
						     msize,					 
						     &core_transmit_notify, target);
}


/**
 * Find a free slot for storing a 'route' in the 'consensi'
 * set at the given distance.
 *
 * @param distance distance to use for the set slot
 */
static unsigned int
get_consensus_slot (uint32_t distance)
{
  struct ConsensusSet *cs;
  unsigned int i;

  cs = &consensi[distance];
  i = 0;
  while ( (i < cs->array_length) &&
	  (NULL != cs->targets[i]) ) i++;
  if (i == cs->array_length)
    GNUNET_array_grow (cs->targets,
		       cs->array_length,
		       cs->array_length * 2 + 2);
  return i;
}


/**
 * Allocate a slot in the consensus set for a route.
 *
 * @param route route to initialize
 * @param distance which consensus set to use
 */
static void
allocate_route (struct Route *route,
		uint32_t distance)
{
  unsigned int i;

  i = get_consensus_slot (distance);
  route->set_offset = i;
  consensi[distance].targets[i] = route;
  route->target.distance = htonl (distance);
}


/**
 * Release a slot in the consensus set for a route.
 *
 * @param route route to release the slot from
 */
static void
release_route (struct Route *route)
{
  consensi[ntohl (route->target.distance)].targets[route->set_offset] = NULL;
  route->set_offset = UINT_MAX; /* indicate invalid slot */
}


/**
 * Move a route from one consensus set to another.
 *
 * @param route route to move
 * @param new_distance new distance for the route (destination set)
 */
static void
move_route (struct Route *route,
	    uint32_t new_distance)
{
  unsigned int i;

  release_route (route);
  i = get_consensus_slot (new_distance);
  route->set_offset = i;
  consensi[new_distance].targets[i] = route;     
  route->target.distance = htonl (new_distance);
}


/**
 * A peer is now connected to us at distance 1.  Initiate DV exchange.
 *
 * @param neighbor entry for the neighbor at distance 1
 */
static void
handle_direct_connect (struct DirectNeighbor *neighbor)
{
  struct Route *route;

  GNUNET_STATISTICS_update (stats,
			    "# peers connected (1-hop)",
			    1, GNUNET_NO);
  route = GNUNET_CONTAINER_multihashmap_get (all_routes, 
					     &neighbor->peer.hashPubKey);
  if (NULL != route)  
  {
    send_disconnect_to_plugin (&neighbor->peer);
    release_route (route);
    GNUNET_free (route);
  }
  neighbor->consensus_task = GNUNET_SCHEDULER_add_now (&start_consensus,
						       neighbor);
}


/**
 * Method called whenever a peer connects.
 *
 * @param cls closure
 * @param peer peer identity this notification is about
 */
static void
handle_core_connect (void *cls, const struct GNUNET_PeerIdentity *peer)
{
  struct DirectNeighbor *neighbor;
 
  /* Check for connect to self message */
  if (0 == memcmp (&my_identity, peer, sizeof (struct GNUNET_PeerIdentity)))
    return;
  /* check if entry exists */
  neighbor = GNUNET_CONTAINER_multihashmap_get (direct_neighbors, 
						&peer->hashPubKey);
  if (NULL != neighbor)
  {
    GNUNET_break (GNUNET_YES != neighbor->connected);
    neighbor->connected = GNUNET_YES;
    GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
		"Core connected to %s (distance %u)\n",
		GNUNET_i2s (peer),
		(unsigned int) neighbor->distance);
    if (DIRECT_NEIGHBOR_COST != neighbor->distance)
      return;
    handle_direct_connect (neighbor);
    return;
  }
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "Core connected to %s (distance unknown)\n",
	      GNUNET_i2s (peer));
  neighbor = GNUNET_malloc (sizeof (struct DirectNeighbor));
  neighbor->peer = *peer;
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_put (direct_neighbors,
						    &peer->hashPubKey,
						    neighbor,
						    GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
  neighbor->connected = GNUNET_YES;
  neighbor->distance = 0; /* unknown */
}


/**
 * Called for each 'target' in a neighbor table to free the associated memory.
 *
 * @param cls NULL
 * @param key key of the value
 * @param value value to free
 * @return GNUNET_OK to continue to iterate
 */
static int
free_targets (void *cls,
	      const struct GNUNET_HashCode *key,
	      void *value)
{
  GNUNET_free (value);
  return GNUNET_OK;
}


/**
 * Multihashmap iterator for checking if a given route is
 * (now) useful to this peer.
 *
 * @param cls the direct neighbor for the given route
 * @param key key value stored under
 * @param value a 'struct Target' that may or may not be useful; not that
 *        the distance in 'target' does not include the first hop yet
 * @return GNUNET_YES to continue iteration, GNUNET_NO to stop
 */
static int
check_possible_route (void *cls, const struct GNUNET_HashCode * key, void *value)
{
  struct DirectNeighbor *neighbor = cls;
  struct Target *target = value;
  struct Route *route;
  
  route = GNUNET_CONTAINER_multihashmap_get (all_routes,
					   key);
  if (NULL != route)
  {
    if (ntohl (route->target.distance) > ntohl (target->distance) + 1)
    {
      /* this 'target' is cheaper than the existing route; switch to alternative route! */
      move_route (route, ntohl (target->distance) + 1);
      route->next_hop = neighbor;
      send_distance_change_to_plugin (&target->peer, ntohl (target->distance) + 1);
    }
    return GNUNET_YES; /* got a route to this target already */
  }
  route = GNUNET_malloc (sizeof (struct Route));
  route->next_hop = neighbor;
  route->target.distance = htonl (ntohl (target->distance) + 1);
  route->target.peer = target->peer;
  allocate_route (route, ntohl (route->target.distance));
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_put (all_routes,
						    &route->target.peer.hashPubKey,
						    route,
						    GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
  send_connect_to_plugin (&route->target.peer, ntohl (target->distance));
  return GNUNET_YES;
}


/**
 * Multihashmap iterator for finding routes that were previously
 * "hidden" due to a better route (called after a disconnect event).
 *
 * @param cls NULL
 * @param key peer identity of the given direct neighbor
 * @param value a 'struct DirectNeighbor' to check for additional routes
 * @return GNUNET_YES to continue iteration
 */
static int
refresh_routes (void *cls, const struct GNUNET_HashCode * key, void *value)
{
  struct DirectNeighbor *neighbor = value;

  if ( (GNUNET_YES != neighbor->connected) ||
       (DIRECT_NEIGHBOR_COST != neighbor->distance) )
    return GNUNET_YES;    
  if (NULL != neighbor->neighbor_table)
    GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table,
					   &check_possible_route,
					   neighbor);
  return GNUNET_YES;
}


/**
 * Get distance information from 'atsi'.
 *
 * @param atsi performance data
 * @param atsi_count number of entries in atsi
 * @return connected transport distance
 */
static uint32_t
get_atsi_distance (const struct GNUNET_ATS_Information *atsi,
                   uint32_t atsi_count)
{
  uint32_t i;

  for (i = 0; i < atsi_count; i++)
    if (ntohl (atsi[i].type) == GNUNET_ATS_QUALITY_NET_DISTANCE)
      return (0 == ntohl (atsi->value)) ? DIRECT_NEIGHBOR_COST : ntohl (atsi->value); // FIXME: 0 check should not be required once ATS is fixed!
  /* If we do not have explicit distance data, assume direct neighbor. */
  return DIRECT_NEIGHBOR_COST;
}


/**
 * Multihashmap iterator for freeing routes that go via a particular
 * neighbor that disconnected and is thus no longer available.
 *
 * @param cls the direct neighbor that is now unavailable
 * @param key key value stored under
 * @param value a 'struct Route' that may or may not go via neighbor
 *
 * @return GNUNET_YES to continue iteration, GNUNET_NO to stop
 */
static int
cull_routes (void *cls, const struct GNUNET_HashCode * key, void *value)
{
  struct DirectNeighbor *neighbor = cls;
  struct Route *route = value;

  if (route->next_hop != neighbor)
    return GNUNET_YES; /* not affected */
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_remove (all_routes, key, value));
  release_route (route);
  send_disconnect_to_plugin (&route->target.peer);
  GNUNET_free (route);
  return GNUNET_YES;
}


/**
 * Handle the case that a direct connection to a peer is
 * disrupted.  Remove all routes via that peer and
 * stop the consensus with it.
 *
 * @param neighbor peer that was disconnected (or at least is no 
 *    longer at distance 1)
 */
static void
handle_direct_disconnect (struct DirectNeighbor *neighbor)
{
  GNUNET_CONTAINER_multihashmap_iterate (all_routes,
					 &cull_routes,
                                         neighbor);
  if (NULL != neighbor->cth)
  {
    GNUNET_CORE_notify_transmit_ready_cancel (neighbor->cth);
    neighbor->cth = NULL;
  }
  if (NULL != neighbor->neighbor_table_consensus)
  {
    GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table_consensus,
					   &free_targets,
					   NULL);
    GNUNET_CONTAINER_multihashmap_destroy (neighbor->neighbor_table_consensus);
    neighbor->neighbor_table_consensus = NULL;
  }
  if (NULL != neighbor->neighbor_table)
  {
    GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table,
					   &free_targets,
					   NULL);
    GNUNET_CONTAINER_multihashmap_destroy (neighbor->neighbor_table);
    neighbor->neighbor_table = NULL;
  }
  if (GNUNET_SCHEDULER_NO_TASK != neighbor->consensus_task)
  {
    GNUNET_SCHEDULER_cancel (neighbor->consensus_task);
    neighbor->consensus_task = GNUNET_SCHEDULER_NO_TASK;
  }
  if (NULL != neighbor->consensus)
  {
    GNUNET_CONSENSUS_destroy (neighbor->consensus);
    neighbor->consensus = NULL;
  }
}


/**
 * Function that is called with QoS information about an address; used
 * to update our current distance to another peer.
 *
 * @param cls closure
 * @param address the address
 * @param active is this address in active use
 * @param bandwidth_out assigned outbound bandwidth for the connection
 * @param bandwidth_in assigned inbound bandwidth for the connection
 * @param ats performance data for the address (as far as known)
 * @param ats_count number of performance records in 'ats'
 */
static void
handle_ats_update (void *cls,
		   const struct GNUNET_HELLO_Address *address,
		   int active,
		   struct GNUNET_BANDWIDTH_Value32NBO bandwidth_out,
		   struct GNUNET_BANDWIDTH_Value32NBO bandwidth_in,
		   const struct GNUNET_ATS_Information *ats, 
		   uint32_t ats_count)
{
  struct DirectNeighbor *neighbor;
  uint32_t distance;

  if (GNUNET_NO == active)
  	return;
  distance = get_atsi_distance (ats, ats_count); 
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "ATS says distance to %s is %u\n",
	      GNUNET_i2s (&address->peer),
	      (unsigned int) distance);
  /* check if entry exists */
  neighbor = GNUNET_CONTAINER_multihashmap_get (direct_neighbors, 
						&address->peer.hashPubKey);
  if (NULL != neighbor)
  {    
    if ( (DIRECT_NEIGHBOR_COST == neighbor->distance) &&
	 (DIRECT_NEIGHBOR_COST == distance) )
      return; /* no change */
    if (DIRECT_NEIGHBOR_COST == neighbor->distance) 
    {
      neighbor->distance = distance;
      GNUNET_STATISTICS_update (stats,
				"# peers connected (1-hop)",
				-1, GNUNET_NO);  
      handle_direct_disconnect (neighbor);
      GNUNET_CONTAINER_multihashmap_iterate (direct_neighbors,
					     &refresh_routes,
					     NULL);
      return;
    }
    neighbor->distance = distance;
    if (DIRECT_NEIGHBOR_COST != neighbor->distance)
      return;    
    if (GNUNET_YES != neighbor->connected)
      return;
    handle_direct_connect (neighbor);
    return;
  }
  neighbor = GNUNET_malloc (sizeof (struct DirectNeighbor));
  neighbor->peer = address->peer;
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_put (direct_neighbors,
						    &address->peer.hashPubKey,
						    neighbor,
						    GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
  neighbor->connected = GNUNET_NO; /* not yet */
  neighbor->distance = distance; 
}


/**
 * Check if a target was removed from the set of the other peer; if so,
 * if we also used it for our route, we need to remove it from our
 * 'all_routes' set (and later check if an alternative path now exists).
 *
 * @param cls the 'struct DirectNeighbor'
 * @param key peer identity for the target
 * @param value a 'struct Target' previously reachable via the given neighbor
 */
static int
check_target_removed (void *cls,
		      const struct GNUNET_HashCode *key,
		      void *value)
{
  struct DirectNeighbor *neighbor = cls;
  struct Target *new_target;
  struct Route *current_route;

  new_target = GNUNET_CONTAINER_multihashmap_get (neighbor->neighbor_table_consensus,
						  key);
  if (NULL == new_target)
  {
    /* target was revoked, check if it was used */
    current_route = GNUNET_CONTAINER_multihashmap_get (all_routes,
						       key);
    if ( (NULL == current_route) ||
	 (current_route->next_hop != neighbor) )
    {
      /* didn't matter, wasn't used */
      return GNUNET_OK;
    }
    /* remove existing route */
    GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
		"Lost route to %s\n",
		GNUNET_i2s (&current_route->target.peer));
    GNUNET_assert (GNUNET_YES ==
		   GNUNET_CONTAINER_multihashmap_remove (all_routes, key, current_route));
    send_disconnect_to_plugin (&current_route->target.peer);
    GNUNET_free (current_route);
    neighbor->target_removed = GNUNET_YES;
    return GNUNET_OK;
  }
  return GNUNET_OK;
}


/**
 * Check if a target was added to the set of the other peer; if it
 * was added or impoves the existing route, do the needed updates.
 *
 * @param cls the 'struct DirectNeighbor'
 * @param key peer identity for the target
 * @param value a 'struct Target' now reachable via the given neighbor
 */
static int
check_target_added (void *cls,
		      const struct GNUNET_HashCode *key,
		      void *value)
{
  struct DirectNeighbor *neighbor = cls;
  struct Target *target = value;
  struct Route *current_route;

  /* target was revoked, check if it was used */
  current_route = GNUNET_CONTAINER_multihashmap_get (all_routes,
						     key);
  if (NULL != current_route)
  {
    /* route exists */
    if (current_route->next_hop == neighbor)
    {
      /* we had the same route before, no change */
      if (ntohl (target->distance) + 1 != ntohl (current_route->target.distance))
      {
	current_route->target.distance = htonl (ntohl (target->distance) + 1);
	send_distance_change_to_plugin (&target->peer, ntohl (target->distance) + 1);
      }
      return GNUNET_OK;
    }
    if (ntohl (current_route->target.distance) >= ntohl (target->distance) + 1)
    {
      /* alternative, shorter route exists, ignore */
      return GNUNET_OK;
    }
    /* new route is better than the existing one, take over! */
    /* NOTE: minor security issue: malicious peers may advertise
       very short routes to take over longer paths; as we don't
       check that the shorter routes actually work, a malicious
       direct neighbor can use this to DoS our long routes */
    current_route->next_hop = neighbor;
    current_route->target.distance = htonl (ntohl (target->distance) + 1);
    send_distance_change_to_plugin (&target->peer, ntohl (target->distance) + 1);
    return GNUNET_OK;
  }
  /* new route */
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "Discovered new route to %s using %u hops\n",
	      GNUNET_i2s (&target->peer),
	      (unsigned int) (ntohl (target->distance) + 1));
  current_route = GNUNET_malloc (sizeof (struct Route));
  current_route->next_hop = neighbor;
  current_route->target.peer = target->peer;
  current_route->target.distance = htonl (ntohl (target->distance) + 1);
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_put (all_routes,
						    &current_route->target.peer.hashPubKey,
						    current_route,
						    GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
  send_connect_to_plugin (&current_route->target.peer,
			  ntohl (current_route->target.distance));
  return GNUNET_OK;
}



/**
 * The consensus has concluded, clean up and schedule the next one.
 *
 * @param cls the 'struct GNUNET_DirectNeighbor' with which we created the consensus
 */
static void
consensus_done_cb (void *cls)
{
  struct DirectNeighbor *neighbor = cls;

  GNUNET_CONSENSUS_destroy (neighbor->consensus);
  neighbor->consensus = NULL;
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "Finished consensus with %s!\n",
	      GNUNET_i2s (&neighbor->peer));
  /* remove targets that disappeared */
  neighbor->target_removed = GNUNET_NO;
  GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table,
					 &check_target_removed,
					 neighbor);
  if (GNUNET_YES == neighbor->target_removed)
  {
    /* check if we got an alternative for the removed routes */
    GNUNET_CONTAINER_multihashmap_iterate (direct_neighbors,
					   &refresh_routes,
					   NULL);    
  }
  /* add targets that appeared (and check for improved routes) */
  GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table_consensus,
					 &check_target_added,
					 neighbor);
  if (NULL != neighbor->neighbor_table)
  {
    GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table,
					   &free_targets,
					   NULL);
    GNUNET_CONTAINER_multihashmap_destroy (neighbor->neighbor_table);
    neighbor->neighbor_table = NULL;
  }
  neighbor->neighbor_table = neighbor->neighbor_table_consensus;
  neighbor->neighbor_table_consensus = NULL;
  neighbor->consensus_task = GNUNET_SCHEDULER_add_delayed (GNUNET_DV_CONSENSUS_FREQUENCY,
							   &start_consensus,
							   neighbor);
}


/**
 * We inserted the last element into the consensus, get ready to
 * insert the next element into the consensus or conclude if
 * we're done.
 *
 * @param cls the 'struct DirectNeighbor' of the peer we're building
 *        a routing consensus with
 * @param success GNUNET_OK if the last element was added successfully,
 *                GNUNET_SYSERR if we failed
 */
static void
insert_next_element (void *cls,
		     int success)
{
  struct DirectNeighbor *neighbor = cls;
  struct GNUNET_CONSENSUS_Element element;

  while ( (DEFAULT_FISHEYE_DEPTH - 1 > neighbor->consensus_insertion_distance) &&
	  (consensi[neighbor->consensus_insertion_distance].array_length == neighbor->consensus_insertion_offset) )
  {
    neighbor->consensus_insertion_offset = 0;
    neighbor->consensus_insertion_distance++;
    /* skip over NULL entries */
    while ( (DEFAULT_FISHEYE_DEPTH - 1 > neighbor->consensus_insertion_distance) &&
	    (consensi[neighbor->consensus_insertion_distance].array_length < neighbor->consensus_insertion_offset) &&
	    (NULL == consensi[neighbor->consensus_insertion_distance].targets[neighbor->consensus_insertion_offset]) )
      neighbor->consensus_insertion_offset++;
  }
  if (DEFAULT_FISHEYE_DEPTH - 1 == neighbor->consensus_insertion_distance)
  {
    /* we're done, conclude! */
    GNUNET_CONSENSUS_conclude (neighbor->consensus,
			       GNUNET_DV_CONSENSUS_FREQUENCY,
			       &consensus_done_cb,
			       neighbor);
    return;
  }
  element.size = sizeof (struct Target);
  element.data = &consensi[neighbor->consensus_insertion_distance].targets[neighbor->consensus_insertion_offset++]->target;

  /* skip over NULL entries */
  while ( (DEFAULT_FISHEYE_DEPTH - 1 > neighbor->consensus_insertion_distance) &&
	  (consensi[neighbor->consensus_insertion_distance].array_length < neighbor->consensus_insertion_offset) &&
	  (NULL == consensi[neighbor->consensus_insertion_distance].targets[neighbor->consensus_insertion_offset]) )
    neighbor->consensus_insertion_offset++;  
  GNUNET_CONSENSUS_insert (neighbor->consensus,
			   &element,
			   &insert_next_element,
			   neighbor);
}


/**
 * We have learned a new route from the other peer.  Add it to the
 * route set we're building.
 *
 * @param cls the 'struct DirectNeighbor' we're building the consensus with
 * @param element the new element we have learned
 */
static void
learn_route_cb (void *cls,
		const struct GNUNET_CONSENSUS_Element *element)
{
  struct DirectNeighbor *neighbor = cls;
  struct Target *target;

  if (NULL == element)
  {
    GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
		"Failed to establish DV consensus, will try again later\n");
    GNUNET_CONSENSUS_destroy (neighbor->consensus);
    if (NULL != neighbor->neighbor_table_consensus)
    {
      GNUNET_CONTAINER_multihashmap_iterate (neighbor->neighbor_table_consensus,
					     &free_targets,
					     NULL);
      GNUNET_CONTAINER_multihashmap_destroy (neighbor->neighbor_table_consensus);
      neighbor->neighbor_table_consensus = NULL;
    }
    neighbor->consensus = NULL;
    neighbor->consensus_task = GNUNET_SCHEDULER_add_delayed (GNUNET_DV_CONSENSUS_FREQUENCY,
							     &start_consensus,
							     neighbor);
    return;
  }
  if (sizeof (struct Target) != element->size)
  {
    GNUNET_break_op (0);
    return;
  }
  target = GNUNET_malloc (sizeof (struct Target));
  memcpy (target, element->data, sizeof (struct Target));
  if (GNUNET_YES !=
      GNUNET_CONTAINER_multihashmap_put (neighbor->neighbor_table_consensus,
					 &target->peer.hashPubKey,
					 target,
					 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY))
  {
    GNUNET_break_op (0);
    GNUNET_free (target);
    return;
  }
}


/**
 * Start creating a new consensus from scratch.
 *
 * @param cls the 'struct DirectNeighbor' of the peer we're building
 *        a routing consensus with
 * @param tc scheduler context
 */    
static void
start_consensus (void *cls,
		 const struct GNUNET_SCHEDULER_TaskContext *tc)
{
  struct DirectNeighbor *neighbor = cls;
  struct GNUNET_HashCode session_id;
  struct GNUNET_HashCode real_session_id;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "Starting to create consensus with %s!\n",
	      GNUNET_i2s (&neighbor->peer));
  neighbor->consensus_task = GNUNET_SCHEDULER_NO_TASK;
  neighbor->consensus_insertion_offset = 0;
  neighbor->consensus_insertion_distance = 0;
  GNUNET_assert (NULL == neighbor->neighbor_table_consensus);
  GNUNET_assert (NULL == neighbor->consensus);
  neighbor->neighbor_table_consensus = GNUNET_CONTAINER_multihashmap_create (1024, GNUNET_YES);
  /* construct session ID seed as XOR of both peer's identities */
  GNUNET_CRYPTO_hash_xor (&my_identity.hashPubKey, 
			  &neighbor->peer.hashPubKey, 
			  &session_id);
  /* make sure session ID is unique across applications by salting it with 'DV' */
  GNUNET_CRYPTO_hkdf (&real_session_id, sizeof (real_session_id),
		      GCRY_MD_SHA512, GCRY_MD_SHA256,
		      "DV-SALT", 2,
		      &session_id, sizeof (session_id),
		      NULL, 0);
  neighbor->consensus = GNUNET_CONSENSUS_create (cfg,
						 1,
						 &neighbor->peer,
						 &real_session_id,
						 &learn_route_cb,
						 neighbor);
  if (NULL == neighbor->consensus)
  {
    GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
		"Failed to setup consensus, will try again later!\n");
    neighbor->consensus_task = GNUNET_SCHEDULER_add_delayed (GNUNET_DV_CONSENSUS_FREQUENCY,
							     &start_consensus,
							     neighbor);
    return;
  }
  insert_next_element (neighbor, GNUNET_OK);
}


/**
 * Core handler for DV data messages.  Whatever this message
 * contains all we really have to do is rip it out of its
 * DV layering and give it to our pal the DV plugin to report
 * in with.
 *
 * @param cls closure
 * @param peer peer which sent the message (immediate sender)
 * @param message the message
 * @return GNUNET_OK on success, GNUNET_SYSERR if the other peer violated the protocol
 */
static int
handle_dv_route_message (void *cls, const struct GNUNET_PeerIdentity *peer,
			 const struct GNUNET_MessageHeader *message)
{
  const struct RouteMessage *rm;
  const struct GNUNET_MessageHeader *payload;
  struct Route *route;

  if (ntohs (message->size) < sizeof (struct RouteMessage) + sizeof (struct GNUNET_MessageHeader))
  {
    GNUNET_break_op (0);
    return GNUNET_SYSERR;
  }
  rm = (const struct RouteMessage *) message;
  payload = (const struct GNUNET_MessageHeader *) &rm[1];
  if (ntohs (message->size) != sizeof (struct RouteMessage) + ntohs (payload->size))
  {
    GNUNET_break_op (0);
    return GNUNET_SYSERR;
  }
  if (0 == memcmp (&rm->target,
		   &my_identity,
		   sizeof (struct GNUNET_PeerIdentity)))
  {
    /* message is for me, check reverse route! */
    route = GNUNET_CONTAINER_multihashmap_get (all_routes,
					       &rm->sender.hashPubKey);
    if (NULL == route)
    {
      /* don't have reverse route, drop */
      GNUNET_STATISTICS_update (stats,
				"# message discarded (no reverse route)",
				1, GNUNET_NO);
      return GNUNET_OK;
    }
    GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
		"Delivering %u bytes to myself!\n",
		ntohs (payload->size));
    send_data_to_plugin (payload,
			 &rm->sender,
			 ntohl (route->target.distance));
    return GNUNET_OK;
  }
  route = GNUNET_CONTAINER_multihashmap_get (all_routes,
					     &rm->target.hashPubKey);
  if (NULL == route)
  {
    GNUNET_STATISTICS_update (stats,
			      "# messages discarded (no route)",
			      1, GNUNET_NO);
    return GNUNET_OK;
  }
  if (ntohl (route->target.distance) > ntohl (rm->distance) + 1)
  {
    GNUNET_STATISTICS_update (stats,
			      "# messages discarded (target too far)",
			      1, GNUNET_NO);
    return GNUNET_OK;
  }
  forward_payload (route->next_hop,
		   ntohl (route->target.distance),
		   0,
		   &rm->target,
		   &rm->sender,
		   payload);
  return GNUNET_OK;  
}


/**
 * Service server's handler for message send requests (which come
 * bubbling up to us through the DV plugin).
 *
 * @param cls closure
 * @param client identification of the client
 * @param message the actual message
 */
static void
handle_dv_send_message (void *cls, struct GNUNET_SERVER_Client *client,
                        const struct GNUNET_MessageHeader *message)
{
  struct Route *route;
  const struct GNUNET_DV_SendMessage *msg;
  const struct GNUNET_MessageHeader *payload;

  if (ntohs (message->size) < sizeof (struct GNUNET_DV_SendMessage) + sizeof (struct GNUNET_MessageHeader))
  {
    GNUNET_break (0);
    GNUNET_SERVER_receive_done (client, GNUNET_SYSERR);
    return;
  }
  msg = (const struct GNUNET_DV_SendMessage *) message;
  GNUNET_break (0 != ntohl (msg->uid));
  payload = (const struct GNUNET_MessageHeader *) &msg[1];
  if (ntohs (message->size) != sizeof (struct GNUNET_DV_SendMessage) + ntohs (payload->size))
  {
    GNUNET_break (0);
    GNUNET_SERVER_receive_done (client, GNUNET_SYSERR);
    return;
  }
  route = GNUNET_CONTAINER_multihashmap_get (all_routes,
					     &msg->target.hashPubKey);
  if (NULL == route)
  {
    /* got disconnected */
    GNUNET_STATISTICS_update (stats,
			      "# local messages discarded (no route)",
			      1, GNUNET_NO);
    send_ack_to_plugin (&msg->target, ntohl (msg->uid), GNUNET_YES);
    GNUNET_SERVER_receive_done (client, GNUNET_OK);
    return;
  }
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
	      "Forwarding %u bytes to %s\n",
	      ntohs (payload->size),
	      GNUNET_i2s (&msg->target));

  forward_payload (route->next_hop,
		   ntohl (route->target.distance),
		   htonl (msg->uid),
		   &msg->target,
		   &my_identity,
		   payload);
  GNUNET_SERVER_receive_done (client, GNUNET_OK);
}


/**
 * Cleanup all of the data structures associated with a given neighbor.
 *
 * @param neighbor neighbor to clean up
 */
static void
cleanup_neighbor (struct DirectNeighbor *neighbor)
{
  struct PendingMessage *pending;

  while (NULL != (pending = neighbor->pm_head))
  {
    neighbor->pm_queue_size--;
    GNUNET_CONTAINER_DLL_remove (neighbor->pm_head,
				 neighbor->pm_tail,
				 pending);    
    GNUNET_free (pending);
  }
  handle_direct_disconnect (neighbor);
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_remove (direct_neighbors, 
						       &neighbor->peer.hashPubKey,
						       neighbor));
  GNUNET_free (neighbor);
}


/**
 * Method called whenever a given peer disconnects.
 *
 * @param cls closure
 * @param peer peer identity this notification is about
 */
static void
handle_core_disconnect (void *cls, const struct GNUNET_PeerIdentity *peer)
{
  struct DirectNeighbor *neighbor;

  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "Received core peer disconnect message for peer `%s'!\n",
	      GNUNET_i2s (peer));
  /* Check for disconnect from self message */
  if (0 == memcmp (&my_identity, peer, sizeof (struct GNUNET_PeerIdentity)))
    return;
  neighbor =
      GNUNET_CONTAINER_multihashmap_get (direct_neighbors, &peer->hashPubKey);
  if (NULL == neighbor)
  {
    GNUNET_break (0);
    return;
  }
  GNUNET_break (GNUNET_YES == neighbor->connected);
  neighbor->connected = GNUNET_NO;
  if (DIRECT_NEIGHBOR_COST == neighbor->distance)
  {
    GNUNET_STATISTICS_update (stats,
			      "# peers connected (1-hop)",
			      -1, GNUNET_NO);  
  }
  cleanup_neighbor (neighbor);
  GNUNET_CONTAINER_multihashmap_iterate (direct_neighbors,
					 &refresh_routes,
                                         NULL);
}


/**
 * Multihashmap iterator for freeing routes.  Should never be called.
 *
 * @param cls NULL
 * @param key key value stored under
 * @param value the route to be freed
 *
 * @return GNUNET_YES to continue iteration, GNUNET_NO to stop
 */
static int
free_route (void *cls, const struct GNUNET_HashCode * key, void *value)
{
  struct Route *route = value;

  GNUNET_break (0);
  GNUNET_assert (GNUNET_YES ==
		 GNUNET_CONTAINER_multihashmap_remove (all_routes, key, value));
  release_route (route);
  send_disconnect_to_plugin (&route->target.peer);
  GNUNET_free (route);
  return GNUNET_YES;
}


/**
 * Multihashmap iterator for freeing direct neighbors. Should never be called.
 *
 * @param cls NULL
 * @param key key value stored under
 * @param value the direct neighbor to be freed
 *
 * @return GNUNET_YES to continue iteration, GNUNET_NO to stop
 */
static int
free_direct_neighbors (void *cls, const struct GNUNET_HashCode * key, void *value)
{
  struct DirectNeighbor *neighbor = value;

  GNUNET_break (0);
  cleanup_neighbor (neighbor);
  return GNUNET_YES;
}


/**
 * Task run during shutdown.
 *
 * @param cls unused
 * @param tc unused
 */
static void
shutdown_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
{
  unsigned int i;

  GNUNET_CORE_disconnect (core_api);
  core_api = NULL;
  GNUNET_ATS_performance_done (ats);
  ats = NULL;
  GNUNET_CONTAINER_multihashmap_iterate (direct_neighbors,
                                         &free_direct_neighbors, NULL);
  GNUNET_CONTAINER_multihashmap_iterate (all_routes,
                                         &free_route, NULL);
  GNUNET_CONTAINER_multihashmap_destroy (direct_neighbors);
  GNUNET_CONTAINER_multihashmap_destroy (all_routes);
  GNUNET_STATISTICS_destroy (stats, GNUNET_NO);
  stats = NULL;
  GNUNET_SERVER_notification_context_destroy (nc);
  nc = NULL;
  for (i=0;i<DEFAULT_FISHEYE_DEPTH - 1;i++)
    GNUNET_array_grow (consensi[i].targets,
		       consensi[i].array_length,
		       0);
}


/**
 * Notify newly connected client about an existing route.
 *
 * @param cls the 'struct GNUNET_SERVER_Client'
 * @param key peer identity
 * @param value the XXX.
 * @return GNUNET_OK (continue to iterate)
 */
static int
add_route (void *cls,
	   const struct GNUNET_HashCode *key,
	   void *value)
{
  struct GNUNET_SERVER_Client *client = cls;
  struct Route *route = value;
  struct GNUNET_DV_ConnectMessage cm;
  
  cm.header.size = htons (sizeof (cm));
  cm.header.type = htons (GNUNET_MESSAGE_TYPE_DV_CONNECT);
  cm.distance = htonl (route->target.distance);
  cm.peer = route->target.peer;

  GNUNET_SERVER_notification_context_unicast (nc, 
					      client,
					      &cm.header,
					      GNUNET_NO);
  return GNUNET_OK;
}


/**
 * Handle START-message.  This is the first message sent to us
 * by the client (can only be one!).
 *
 * @param cls closure (always NULL)
 * @param client identification of the client
 * @param message the actual message
 */
static void
handle_start (void *cls, struct GNUNET_SERVER_Client *client,
              const struct GNUNET_MessageHeader *message)
{
  GNUNET_SERVER_notification_context_add (nc, client);  
  GNUNET_SERVER_receive_done (client, GNUNET_OK);
  GNUNET_CONTAINER_multihashmap_iterate (all_routes,
					 &add_route,
					 client);
}


/**
 * Called on core init.
 *
 * @param cls unused
 * @param server legacy
 * @param identity this peer's identity
 */
static void
core_init (void *cls, struct GNUNET_CORE_Handle *server,
           const struct GNUNET_PeerIdentity *identity)
{
  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
              "I am peer: %s\n",
              GNUNET_i2s (identity));
  my_identity = *identity;
}


/**
 * Process dv requests.
 *
 * @param cls closure
 * @param server the initialized server
 * @param c configuration to use
 */
static void
run (void *cls, struct GNUNET_SERVER_Handle *server,
     const struct GNUNET_CONFIGURATION_Handle *c)
{
  static struct GNUNET_CORE_MessageHandler core_handlers[] = {
    {&handle_dv_route_message, GNUNET_MESSAGE_TYPE_DV_ROUTE, 0},
    {NULL, 0, 0}
  };
  static struct GNUNET_SERVER_MessageHandler plugin_handlers[] = {
    {&handle_start, NULL, 
     GNUNET_MESSAGE_TYPE_DV_START, 
     sizeof (struct GNUNET_MessageHeader) },
    { &handle_dv_send_message, NULL, 
      GNUNET_MESSAGE_TYPE_DV_SEND, 
      0},
    {NULL, NULL, 0, 0}
  };

  cfg = c;
  direct_neighbors = GNUNET_CONTAINER_multihashmap_create (128, GNUNET_NO);
  all_routes = GNUNET_CONTAINER_multihashmap_create (65536, GNUNET_NO);
  core_api = GNUNET_CORE_connect (cfg, NULL,
				  &core_init, 
				  &handle_core_connect,
				  &handle_core_disconnect,
				  NULL, GNUNET_NO, 
				  NULL, GNUNET_NO, 
				  core_handlers);

  if (NULL == core_api)
    return;
  ats = GNUNET_ATS_performance_init (cfg, &handle_ats_update, NULL);
  if (NULL == ats)
  {
    GNUNET_CORE_disconnect (core_api);
    return;
  }
  nc = GNUNET_SERVER_notification_context_create (server,
						  MAX_QUEUE_SIZE_PLUGIN);
  stats = GNUNET_STATISTICS_create ("dv", cfg);
  GNUNET_SERVER_add_handlers (server, plugin_handlers);
  GNUNET_SCHEDULER_add_delayed (GNUNET_TIME_UNIT_FOREVER_REL,
				&shutdown_task, NULL);
}


/**
 * The main function for the dv service.
 *
 * @param argc number of arguments from the command line
 * @param argv command line arguments
 * @return 0 ok, 1 on error
 */
int
main (int argc, char *const *argv)
{
  return (GNUNET_OK ==
          GNUNET_SERVICE_run (argc, argv, "dv", GNUNET_SERVICE_OPTION_NONE,
                              &run, NULL)) ? 0 : 1;
}

/* end of gnunet-service-dv.c */