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
42 struct GNUNET_PeerIdentity *pi[10];
43 struct MeshTunnelTree *tree;
46 cb (void *cls, GNUNET_PEER_Id peer_id)
48 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: CB: Disconnected %u\n", peer_id);
51 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: and it shouldn't!\n");
59 * Check if a node has all expected properties.
61 * @param peer_id Short ID of the peer to test.
62 * @param status Expected status of the peer.
63 * @param children Expected number of children of the peer.
64 * @param first_hop Short ID of the expected first hop towards the peer.
67 test_assert (GNUNET_PEER_Id peer_id, enum MeshPeerState status,
68 unsigned int children, GNUNET_PEER_Id first_hop)
70 struct MeshTunnelTreeNode *n;
71 struct MeshTunnelTreeNode *c;
76 n = tree_find_peer (tree, peer_id);
77 if (n->peer != peer_id)
79 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
80 "Retrieved peer has wrong ID! (%u, %u)\n", n->peer, peer_id);
83 if (n->status != status)
85 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
86 "Retrieved peer has wrong status! (%u, %u)\n", n->status,
90 for (c = n->children_head, i = 0; NULL != c; c = c->next, i++) ;
93 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
94 "Retrieved peer wrong has number of children! (%u, %u)\n", i,
99 GNUNET_PEER_search (path_get_first_hop (tree, peer_id)) != first_hop)
101 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Wrong first hop! (%u, %u)\n",
102 GNUNET_PEER_search (path_get_first_hop (tree, peer_id)),
106 if (pre_failed != failed)
108 struct GNUNET_PeerIdentity id;
110 GNUNET_PEER_resolve (peer_id, &id);
111 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
112 "*** Peer %s (%u) has failed %d checks! (real, expected)\n",
113 GNUNET_i2s (&id), peer_id, failed - pre_failed);
123 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Finishing...\n");
124 for (i = 0; i < 10; i++)
131 * Convert an integer int to a peer identity
133 static struct GNUNET_PeerIdentity *
136 struct GNUNET_PeerIdentity *pi;
138 pi = GNUNET_malloc (sizeof (struct GNUNET_PeerIdentity));
139 pi->hashPubKey.bits[0] = id + 1;
145 main (int argc, char *argv[])
147 struct MeshTunnelTreeNode *node;
148 struct MeshTunnelTreeNode *node2;
149 struct MeshPeerPath *path;
150 struct MeshPeerPath *path1;
155 GNUNET_log_setup ("test_mesh_api_tree",
162 for (i = 0; i < 10; i++)
165 GNUNET_break (i + 1 == GNUNET_PEER_intern (pi[i]));
166 GNUNET_log (GNUNET_ERROR_TYPE_INFO, "Peer %u: %s\n", i + 1,
167 GNUNET_h2s (&pi[i]->hashPubKey));
170 tree->me = tree->root;
178 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 1 2 3 4\n");
179 tree_add_path (tree, path, &cb, NULL);
181 path1 = tree_get_path_to_peer (tree, 4);
182 if (path->length != path1->length ||
183 memcmp (path->peers, path1->peers, path->length) != 0)
185 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Retrieved path != original\n");
188 path_destroy (path1);
189 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
190 test_assert (3, MESH_PEER_RELAY, 1, 0);
191 test_assert (2, MESH_PEER_RELAY, 1, 0);
192 test_assert (1, MESH_PEER_ROOT, 1, 0);
194 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding second path: 1 2 3\n");
196 tree_add_path (tree, path, &cb, NULL);
199 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
200 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
201 test_assert (2, MESH_PEER_RELAY, 1, 0);
202 test_assert (1, MESH_PEER_ROOT, 1, 0);
204 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding third path...\n");
207 tree_add_path (tree, path, &cb, NULL);
210 test_assert (5, MESH_PEER_SEARCHING, 0, 2);
211 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
212 test_assert (3, MESH_PEER_SEARCHING, 2, 2);
213 test_assert (2, MESH_PEER_RELAY, 1, 0);
214 test_assert (1, MESH_PEER_ROOT, 1, 0);
216 node = tree_find_peer (tree, 5);
217 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Deleting third path...\n");
218 node->status = MESH_PEER_READY;
220 node2 = tree_del_path (tree, 5, &cb, NULL);
224 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
227 if (node2->peer != 5)
229 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "Retrieved peer != original\n");
233 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
234 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
235 test_assert (2, MESH_PEER_RELAY, 1, 0);
236 test_assert (1, MESH_PEER_ROOT, 1, 0);
238 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Destroying node copy...\n");
241 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
242 "test: Adding new shorter first path...\n");
246 tree_find_peer (tree, 4)->status = MESH_PEER_READY;
247 tree_add_path (tree, path, &cb, NULL);
251 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
255 test_assert (4, MESH_PEER_SEARCHING, 0, 4);
256 test_assert (3, MESH_PEER_SEARCHING, 0, 2);
257 test_assert (2, MESH_PEER_RELAY, 1, 0);
258 test_assert (1, MESH_PEER_ROOT, 2, 0);
260 GNUNET_free (path->peers);
264 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test:\n");
265 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Testing relay trees\n");
266 for (i = 0; i < 10; i++)
268 GNUNET_break (i + 1 == GNUNET_PEER_intern (pi[i]));
277 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 1 2 3\n");
278 tree_add_path (tree, path, &cb, NULL);
280 tree_set_me (tree, 2);
282 test_assert (3, MESH_PEER_SEARCHING, 0, 3);
283 test_assert (2, MESH_PEER_RELAY, 1, 0);
284 test_assert (1, MESH_PEER_ROOT, 1, 0);
286 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: Adding same path: 1 2 3\n");
287 tree_add_path (tree, path, &cb, NULL);
289 GNUNET_free (path->peers);
295 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u tests failed\n", failed);
298 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: OK\n");