diff options
author | Christian Grothoff <christian@grothoff.org> | 2019-04-21 11:39:29 +0200 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2019-04-21 11:39:29 +0200 |
commit | 94f367a644545eb7d4ea51902f0c7ed9e2d45193 (patch) | |
tree | 82c600f9c8f8139f6a30b0e6eefa54bcd375b83c | |
parent | 300bb8d62d412eccb1537cbdaf27b8264fa6fc19 (diff) | |
download | gnunet-94f367a644545eb7d4ea51902f0c7ed9e2d45193.tar.gz gnunet-94f367a644545eb7d4ea51902f0c7ed9e2d45193.zip |
distance field in queue is dead
-rw-r--r-- | src/transport/gnunet-service-tng.c | 10 |
1 files changed, 1 insertions, 9 deletions
diff --git a/src/transport/gnunet-service-tng.c b/src/transport/gnunet-service-tng.c index b2f0838bf..62e9c0d8e 100644 --- a/src/transport/gnunet-service-tng.c +++ b/src/transport/gnunet-service-tng.c | |||
@@ -1225,12 +1225,6 @@ struct Queue | |||
1225 | uint32_t mtu; | 1225 | uint32_t mtu; |
1226 | 1226 | ||
1227 | /** | 1227 | /** |
1228 | * Distance to the target of this queue. | ||
1229 | * FIXME: needed? DV is done differently these days... | ||
1230 | */ | ||
1231 | uint32_t distance; | ||
1232 | |||
1233 | /** | ||
1234 | * Messages pending. | 1228 | * Messages pending. |
1235 | */ | 1229 | */ |
1236 | uint32_t num_msg_pending; | 1230 | uint32_t num_msg_pending; |
@@ -4695,7 +4689,7 @@ activate_core_visible_dv_path (struct DistanceVectorHop *hop) | |||
4695 | return; /* no need to tell core, connection already up! */ | 4689 | return; /* no need to tell core, connection already up! */ |
4696 | cores_send_connect_info (&dv->target, | 4690 | cores_send_connect_info (&dv->target, |
4697 | (NULL != n) | 4691 | (NULL != n) |
4698 | ? GNUNET_BANDWDITH_value_sum (n->quota_out, | 4692 | ? GNUNET_BANDWIDTH_value_sum (n->quota_out, |
4699 | dv->quota_out) | 4693 | dv->quota_out) |
4700 | : dv->quota_out); | 4694 | : dv->quota_out); |
4701 | } | 4695 | } |
@@ -6638,8 +6632,6 @@ check_connection_quality (void *cls, | |||
6638 | do_inc = GNUNET_NO; | 6632 | do_inc = GNUNET_NO; |
6639 | for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour) | 6633 | for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour) |
6640 | { | 6634 | { |
6641 | if (0 != q->distance) | ||
6642 | continue; /* DV does not count */ | ||
6643 | ctx->num_queues++; | 6635 | ctx->num_queues++; |
6644 | if (0 == ctx->k--) | 6636 | if (0 == ctx->k--) |
6645 | ctx->q = q; | 6637 | ctx->q = q; |