2 This file is part of GNUnet.
3 (C) 2011 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file mesh/test_mesh_tree_api.c
23 * @brief test mesh tree api: test of tree & path management api
24 * @author Bartlomiej Polot
28 #include "gnunet_common.h"
29 #include "gnunet_util_lib.h"
30 #include "gnunet_dht_service.h"
31 #include "gnunet_mesh_service.h"
33 #ifndef MESH_TUNNEL_TREE_C
34 #include "mesh_tunnel_tree.c"
35 #define MESH_TUNNEL_TREE_C
40 static struct GNUNET_PeerIdentity *pi[10];
41 static struct MeshTunnelTree *tree;
45 * Whole tree iterator.
47 * @param cls Closure (unused).
48 * @param peer_id Short ID of the node.
49 * @param parent_id Short ID of the parent node.
52 tree_cb (void *cls, GNUNET_PEER_Id peer_id, GNUNET_PEER_Id parent_id)
54 fprintf (stdout, "%u -> %u\n", peer_id, parent_id);;
59 * Node children iterator.
61 * @param cls Closure (unused).
62 * @param peer_idShort ID of the child.
65 cb (void *cls, GNUNET_PEER_Id peer_id)
67 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: CB: Disconnected %u\n", peer_id);
70 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: and it shouldn't!\n");
78 * Print debug information about the state of the tree.
80 * @param tree Tree to debug-print.
83 test_debug (struct MeshTunnelTree *tree)
86 tree_iterate_all (tree, &tree_cb, NULL);
91 * Check if a node has all expected properties.
93 * @param peer_id Short ID of the peer to test.
94 * @param status Expected status of the peer.
95 * @param children Expected number of children of the peer.
96 * @param first_hop Short ID of the expected first hop towards the peer.
99 test_assert (GNUNET_PEER_Id peer_id, enum MeshPeerState status,
100 unsigned int children, GNUNET_PEER_Id first_hop)
102 struct MeshTunnelTreeNode *n;
103 struct MeshTunnelTreeNode *c;
107 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Checking peer %u\n", peer_id);
109 n = tree_find_peer (tree, peer_id);
110 if (n->peer != peer_id)
112 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
113 "Retrieved peer has wrong ID! (Got %u, expected %u)\n", n->peer,
117 if (n->status != status)
119 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
120 "Retrieved peer has wrong status! (Got %u, expected %u)\n",
124 for (c = n->children_head, i = 0; NULL != c; c = c->next, i++) ;
127 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
128 "Retrieved peer wrong has number of children! (Got %u, expected %u)\n",
132 if (0 != first_hop &&
133 GNUNET_PEER_search (tree_get_first_hop (tree, peer_id)) != first_hop)
135 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
136 "Wrong first hop! (Got %u, expected %u)\n",
137 GNUNET_PEER_search (tree_get_first_hop (tree, peer_id)),
141 if (pre_failed != failed)
143 struct GNUNET_PeerIdentity id;
145 GNUNET_PEER_resolve (peer_id, &id);
146 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
147 "*** Peer %s (%u) has failed %d checks!\n", GNUNET_i2s (&id),
148 peer_id, failed - pre_failed);
154 * Clean up and free all memory.
161 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Finishing...\n");
162 for (i = 0; i < 10; i++)
169 * Convert an integer int to a peer identity
171 static struct GNUNET_PeerIdentity *
174 struct GNUNET_PeerIdentity *pi;
176 pi = GNUNET_malloc (sizeof (struct GNUNET_PeerIdentity));
177 pi->hashPubKey.bits[0] = id + 1;
183 main (int argc, char *argv[])
185 struct MeshTunnelTreeNode *node;
186 struct MeshPeerPath *path;
187 struct MeshPeerPath *path1;
192 GNUNET_log_setup ("test_mesh_api_tree",
195 for (i = 0; i < 10; i++)
198 GNUNET_break (i + 1 == GNUNET_PEER_intern (pi[i]));
199 GNUNET_log (GNUNET_ERROR_TYPE_INFO, "Peer %u: %s\n", i + 1,
200 GNUNET_h2s (&pi[i]->hashPubKey));
203 tree->me = tree->root;
211 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 1 2 3 4\n");
212 tree_add_path (tree, path, &cb, NULL);
214 path1 = tree_get_path_to_peer (tree, 4);
215 if (NULL == path1 || path->length != path1->length ||
216 memcmp (path->peers, path1->peers, path->length) != 0)
218 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Retrieved path != original\n");
221 path_destroy (path1);
222 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
223 test_assert (3, MESH_PEER_RELAY, 1, 0);
224 test_assert (2, MESH_PEER_RELAY, 1, 0);
225 test_assert (1, MESH_PEER_ROOT, 1, 0);
227 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding second path: 1 2 3\n");
229 tree_add_path (tree, path, &cb, NULL);
232 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
233 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
234 test_assert (2, MESH_PEER_RELAY, 1, 0);
235 test_assert (1, MESH_PEER_ROOT, 1, 0);
237 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding third path 1 2 3 5\n");
240 tree_add_path (tree, path, &cb, NULL);
243 test_assert (5, MESH_PEER_SEARCHING, 0, 2);
244 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
245 test_assert (3, MESH_PEER_SEARCHING, 2, 2);
246 test_assert (2, MESH_PEER_RELAY, 1, 0);
247 test_assert (1, MESH_PEER_ROOT, 1, 0);
249 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Calculating costs...\n");
250 for (i = 1; i < 5; i++)
253 if (tree_get_path_cost (tree, path) != 0)
255 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "test: length %u cost failed!\n",
262 if (tree_get_path_cost (tree, path) != 1)
264 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "test: length %u cost failed!\n", i);
268 if (tree_get_path_cost (tree, path) != 2)
270 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "test: length %u cost failed!\n", i);
274 if (tree_get_path_cost (tree, path) != 1)
276 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "test: length %u cost failed!\n", i);
279 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Deleting third path (5)\n");
280 tree_set_status (tree, 5, MESH_PEER_READY);
282 node = tree_del_path (tree, 5, &cb, NULL);
286 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
291 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Retrieved peer != original\n");
295 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
296 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
297 test_assert (2, MESH_PEER_RELAY, 1, 0);
298 test_assert (1, MESH_PEER_ROOT, 1, 0);
300 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Destroying node copy...\n");
303 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
304 "test: Adding new shorter first path...\n");
308 tree_find_peer (tree, 4)->status = MESH_PEER_READY;
309 tree_add_path (tree, path, &cb, NULL);
313 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
317 test_assert (4, MESH_PEER_SEARCHING, 0, 4);
318 test_assert (3, MESH_PEER_SEARCHING, 0, 2);
319 test_assert (2, MESH_PEER_RELAY, 1, 0);
320 test_assert (1, MESH_PEER_ROOT, 2, 0);
322 GNUNET_free (path->peers);
326 /****************************************************************************/
328 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test:\n");
329 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Testing relay trees\n");
330 for (i = 0; i < 10; i++)
332 GNUNET_break (i + 1 == GNUNET_PEER_intern (pi[i]));
341 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 2 1 3\n");
342 tree_add_path (tree, path, &cb, NULL);
345 test_assert (3, MESH_PEER_SEARCHING, 0, 3);
346 test_assert (1, MESH_PEER_RELAY, 1, 0);
347 test_assert (2, MESH_PEER_ROOT, 1, 0);
349 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding long path: 2 1 4 5 3\n");
354 tree_add_path (tree, path, &cb, NULL);
357 test_assert (3, MESH_PEER_SEARCHING, 0, 4);
358 test_assert (5, MESH_PEER_RELAY, 1, 4);
359 test_assert (4, MESH_PEER_RELAY, 1, 4);
360 test_assert (1, MESH_PEER_RELAY, 1, 0);
361 test_assert (2, MESH_PEER_ROOT, 1, 0);
363 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
364 "test: Even longer path: 2 6 1 7 8 4 5 3\n");
374 tree_add_path (tree, path, &cb, NULL);
377 test_assert (3, MESH_PEER_SEARCHING, 0, 7);
378 test_assert (5, MESH_PEER_RELAY, 1, 7);
379 test_assert (4, MESH_PEER_RELAY, 1, 7);
380 test_assert (8, MESH_PEER_RELAY, 1, 7);
381 test_assert (7, MESH_PEER_RELAY, 1, 7);
382 test_assert (1, MESH_PEER_RELAY, 1, 0);
383 test_assert (6, MESH_PEER_RELAY, 1, 0);
384 test_assert (2, MESH_PEER_ROOT, 1, 0);
386 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 2 1 3\n");
390 tree_add_path (tree, path, &cb, NULL);
393 test_assert (3, MESH_PEER_SEARCHING, 0, 3);
394 test_assert (1, MESH_PEER_RELAY, 1, 0);
395 test_assert (2, MESH_PEER_ROOT, 1, 0);
397 GNUNET_free (path->peers);
403 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u tests failed\n", failed);
406 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: OK\n");