aboutsummaryrefslogtreecommitdiff
path: root/src/mesh/mesh_tunnel_tree.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/mesh/mesh_tunnel_tree.c')
-rw-r--r--src/mesh/mesh_tunnel_tree.c34
1 files changed, 27 insertions, 7 deletions
diff --git a/src/mesh/mesh_tunnel_tree.c b/src/mesh/mesh_tunnel_tree.c
index a80cbb0c0..c58260601 100644
--- a/src/mesh/mesh_tunnel_tree.c
+++ b/src/mesh/mesh_tunnel_tree.c
@@ -200,6 +200,7 @@ static void
200tree_node_debug(struct MeshTunnelTreeNode *n, uint16_t level) 200tree_node_debug(struct MeshTunnelTreeNode *n, uint16_t level)
201{ 201{
202 struct MeshTunnelTreeNode *c; 202 struct MeshTunnelTreeNode *c;
203 struct GNUNET_PeerIdentity id;;
203 uint16_t i; 204 uint16_t i;
204 205
205 for (i = 0; i < level; i++) 206 for (i = 0; i < level; i++)
@@ -213,9 +214,13 @@ tree_node_debug(struct MeshTunnelTreeNode *n, uint16_t level)
213 if (n->status == MESH_PEER_RECONNECTING) 214 if (n->status == MESH_PEER_RECONNECTING)
214 fprintf(stderr, "*"); 215 fprintf(stderr, "*");
215 216
216 fprintf(stderr, "%u [%p] ", n->peer, n); 217 GNUNET_PEER_resolve(n->peer, &id);
218 fprintf(stderr, "%s, [%u, %p] ", GNUNET_i2s (&id), n->peer, n);
217 if (NULL != n->parent) 219 if (NULL != n->parent)
218 fprintf(stderr, "(-> %u)\n", n->parent->peer); 220 {
221 GNUNET_PEER_resolve(n->parent->peer, &id);
222 fprintf(stderr, "(-> %s [%u])\n", GNUNET_i2s(&id), n->parent->peer);
223 }
219 else 224 else
220 fprintf(stderr, "(root)\n"); 225 fprintf(stderr, "(root)\n");
221 for (c = n->children_head; NULL != c; c = c->next) 226 for (c = n->children_head; NULL != c; c = c->next)
@@ -233,7 +238,17 @@ tree_node_destroy (struct MeshTunnelTreeNode *parent)
233{ 238{
234 struct MeshTunnelTreeNode *n; 239 struct MeshTunnelTreeNode *n;
235 struct MeshTunnelTreeNode *next; 240 struct MeshTunnelTreeNode *next;
241#if MESH_TREE_DEBUG
242 struct GNUNET_PeerIdentity id;
236 243
244 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
245 "tree: Destroying node %u\n",
246 parent->peer);
247 GNUNET_PEER_resolve (parent->peer, &id);
248 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
249 "tree: (%s)\n",
250 GNUNET_i2s (&id));
251#endif
237 n = parent->children_head; 252 n = parent->children_head;
238 while (NULL != n) 253 while (NULL != n)
239 { 254 {
@@ -321,11 +336,12 @@ tree_mark_peers_disconnected (struct MeshTunnelTree *tree,
321 { 336 {
322 tree_mark_peers_disconnected (tree, n, cb); 337 tree_mark_peers_disconnected (tree, n, cb);
323 } 338 }
324 if (MESH_PEER_READY == parent->status && NULL != cb) 339 if (MESH_PEER_READY == parent->status)
325 { 340 {
326 cb (parent); 341 if (NULL != cb)
342 cb (parent);
343 parent->status = MESH_PEER_RECONNECTING;
327 } 344 }
328 parent->status = MESH_PEER_RECONNECTING;
329 345
330 /* Remove and free info about first hop */ 346 /* Remove and free info about first hop */
331 GNUNET_PEER_resolve(parent->peer, &id); 347 GNUNET_PEER_resolve(parent->peer, &id);
@@ -416,8 +432,9 @@ tree_update_first_hops (struct MeshTunnelTree *tree,
416 * NULL when not found 432 * NULL when not found
417 */ 433 */
418struct MeshTunnelTreeNode * 434struct MeshTunnelTreeNode *
419tree_del_path (struct MeshTunnelTree *t, GNUNET_PEER_Id peer_id, 435tree_del_path (struct MeshTunnelTree *t,
420 MeshNodeDisconnectCB cb) 436 GNUNET_PEER_Id peer_id,
437 MeshNodeDisconnectCB cb)
421{ 438{
422 struct MeshTunnelTreeNode *parent; 439 struct MeshTunnelTreeNode *parent;
423 struct MeshTunnelTreeNode *node; 440 struct MeshTunnelTreeNode *node;
@@ -797,6 +814,9 @@ iterate_free (void *cls, const GNUNET_HashCode * key, void *value)
797void 814void
798tree_destroy (struct MeshTunnelTree *t) 815tree_destroy (struct MeshTunnelTree *t)
799{ 816{
817#if MESH_TREE_DEBUG
818 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "tree: Destroying tree\n");
819#endif
800 tree_node_destroy(t->root); 820 tree_node_destroy(t->root);
801 GNUNET_CONTAINER_multihashmap_iterate(t->first_hops, &iterate_free, NULL); 821 GNUNET_CONTAINER_multihashmap_iterate(t->first_hops, &iterate_free, NULL);
802 GNUNET_CONTAINER_multihashmap_destroy(t->first_hops); 822 GNUNET_CONTAINER_multihashmap_destroy(t->first_hops);