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_path.c
23 * @brief test mesh path: test of 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_new.h"
33 #include "mesh_tunnel_tree.h"
39 struct GNUNET_PeerIdentity* pi[10];
40 struct MeshTunnelTree *tree;
43 cb (const struct MeshTunnelTreeNode *n)
45 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: CB: Disconnected %u\n", n->peer);
48 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: and it shouldn't!\n");
56 * Check if a node has all expected properties.
58 * @param peer_id Short ID of the peer to test.
59 * @param status Expected status of the peer.
60 * @param children Expected number of children of the peer.
61 * @param first_hop Short ID of the expected first hop towards the peer.
64 test_assert (GNUNET_PEER_Id peer_id,
65 enum MeshPeerState status,
66 unsigned int children,
67 GNUNET_PEER_Id first_hop)
69 struct MeshTunnelTreeNode *n;
70 struct MeshTunnelTreeNode *c;
75 n = tree_find_peer(tree->root, peer_id);
76 if (n->peer != peer_id)
78 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
79 "Retrieved peer != original (%u, %u)\n",
83 if (n->status != status)
85 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
86 "Retrieved peer has wrong status! (%u, %u)\n",
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",
99 GNUNET_PEER_search(path_get_first_hop(tree, peer_id)) != first_hop)
101 GNUNET_log(GNUNET_ERROR_TYPE_WARNING,
102 "Wrong first hop! (%u, %u)\n",
103 GNUNET_PEER_search(path_get_first_hop(tree, peer_id)),
107 if (pre_failed != failed)
109 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++)
133 * Convert an integer int to a peer identity
135 static struct GNUNET_PeerIdentity *
138 struct GNUNET_PeerIdentity *pi;
140 pi = GNUNET_malloc(sizeof(struct GNUNET_PeerIdentity));
141 pi->hashPubKey.bits[0] = id + 1;
147 main (int argc, char *argv[])
149 struct MeshTunnelTreeNode *node;
150 struct MeshTunnelTreeNode *node2;
151 struct MeshPeerPath *path;
152 struct MeshPeerPath *path1;
157 GNUNET_log_setup ("test_mesh_api_path",
164 for (i = 0; i < 10; i++)
167 GNUNET_break (i + 1 == GNUNET_PEER_intern(pi[i]));
168 GNUNET_log(GNUNET_ERROR_TYPE_INFO, "Peer %u: %s\n",
170 GNUNET_h2s(&pi[i]->hashPubKey));
172 tree = GNUNET_malloc(sizeof(struct MeshTunnelTree));
173 tree->first_hops = GNUNET_CONTAINER_multihashmap_create(32);
174 tree->root = GNUNET_malloc(sizeof(struct MeshTunnelTreeNode));
175 tree->root->peer = 1;
176 tree->me = tree->root;
184 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Adding first path: 1 2 3 4\n");
185 tree_add_path(tree, path, &cb);
187 path1 = tree_get_path_to_peer(tree, 4);
188 if (path->length != path1->length ||
189 memcmp(path->peers, path1->peers, path->length) != 0)
191 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Retrieved path != original\n");
195 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
196 test_assert (3, MESH_PEER_RELAY, 1, 0);
197 test_assert (2, MESH_PEER_RELAY, 1, 0);
198 test_assert (1, MESH_PEER_ROOT, 1, 0);
200 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Adding second path: 1 2 3\n");
202 tree_add_path(tree, path, &cb);
205 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
206 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
207 test_assert (2, MESH_PEER_RELAY, 1, 0);
208 test_assert (1, MESH_PEER_ROOT, 1, 0);
210 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Adding third path...\n");
213 tree_add_path(tree, path, &cb);
216 test_assert (5, MESH_PEER_SEARCHING, 0, 2);
217 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
218 test_assert (3, MESH_PEER_SEARCHING, 2, 2);
219 test_assert (2, MESH_PEER_RELAY, 1, 0);
220 test_assert (1, MESH_PEER_ROOT, 1, 0);
222 node = tree_find_peer(tree->root, 5);
223 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Deleting third path...\n");
224 node->status = MESH_PEER_READY;
226 node2 = tree_del_path(tree, 5, &cb);
230 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
233 if (node2->peer != 5)
235 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "Retrieved peer != original\n");
239 test_assert (4, MESH_PEER_SEARCHING, 0, 2);
240 test_assert (3, MESH_PEER_SEARCHING, 1, 2);
241 test_assert (2, MESH_PEER_RELAY, 1, 0);
242 test_assert (1, MESH_PEER_ROOT, 1, 0);
244 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Destroying node copy...\n");
247 GNUNET_log(GNUNET_ERROR_TYPE_DEBUG, "test: Adding new shorter first path...\n");
251 tree_find_peer(tree->root, 4)->status = MESH_PEER_READY;
252 tree_add_path(tree, path, cb);
256 GNUNET_log(GNUNET_ERROR_TYPE_WARNING, "%u callbacks missed!\n", cb_call);
260 test_assert (4, MESH_PEER_SEARCHING, 0, 4);
261 test_assert (3, MESH_PEER_SEARCHING, 0, 2);
262 test_assert (2, MESH_PEER_RELAY, 1, 0);
263 test_assert (1, MESH_PEER_ROOT, 2, 0);
267 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%u tests failed\n", failed);
270 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "test: OK\n");
271 GNUNET_free (path->peers);