diff options
author | Christian Grothoff <christian@grothoff.org> | 2021-04-26 20:25:37 +0200 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2021-04-26 20:25:37 +0200 |
commit | aa78134a557079ce570345e751e4c36c4b2ba79a (patch) | |
tree | f7bf25950513285184e2426109235337d0aef8be /src/transport/gnunet-service-tng.c | |
parent | 1f2674fe293be7c1a852fbe4a7241fbcb149078f (diff) | |
download | gnunet-aa78134a557079ce570345e751e4c36c4b2ba79a.tar.gz gnunet-aa78134a557079ce570345e751e4c36c4b2ba79a.zip |
-fix many more typos
Diffstat (limited to 'src/transport/gnunet-service-tng.c')
-rw-r--r-- | src/transport/gnunet-service-tng.c | 56 |
1 files changed, 29 insertions, 27 deletions
diff --git a/src/transport/gnunet-service-tng.c b/src/transport/gnunet-service-tng.c index cbf795eea..613477220 100644 --- a/src/transport/gnunet-service-tng.c +++ b/src/transport/gnunet-service-tng.c | |||
@@ -47,7 +47,7 @@ | |||
47 | * - When we passively learned DV (with unconfirmed freshness), we | 47 | * - When we passively learned DV (with unconfirmed freshness), we |
48 | * right now add the path to our list but with a zero path_valid_until | 48 | * right now add the path to our list but with a zero path_valid_until |
49 | * time and only use it for unconfirmed routes. However, we could consider | 49 | * time and only use it for unconfirmed routes. However, we could consider |
50 | * triggering an explicit validation mechansim ourselves, specifically routing | 50 | * triggering an explicit validation mechanism ourselves, specifically routing |
51 | * a challenge-response message over the path [ROUTING] | 51 | * a challenge-response message over the path [ROUTING] |
52 | * = if available, try to confirm unconfirmed DV paths when trying to establish | 52 | * = if available, try to confirm unconfirmed DV paths when trying to establish |
53 | * virtual link for a `struct IncomingRequest`. (i.e. if DVH is | 53 | * virtual link for a `struct IncomingRequest`. (i.e. if DVH is |
@@ -83,7 +83,7 @@ | |||
83 | 83 | ||
84 | /** | 84 | /** |
85 | * Maximum number of messages we acknowledge together in one | 85 | * Maximum number of messages we acknowledge together in one |
86 | * cummulative ACK. Larger values may save a bit of bandwidth. | 86 | * cumulative ACK. Larger values may save a bit of bandwidth. |
87 | */ | 87 | */ |
88 | #define MAX_CUMMULATIVE_ACKS 64 | 88 | #define MAX_CUMMULATIVE_ACKS 64 |
89 | 89 | ||
@@ -453,7 +453,7 @@ struct TransportReliabilityBoxMessage | |||
453 | struct TransportCummulativeAckPayloadP | 453 | struct TransportCummulativeAckPayloadP |
454 | { | 454 | { |
455 | /** | 455 | /** |
456 | * How long was the ACK delayed for generating cummulative ACKs? | 456 | * How long was the ACK delayed for generating cumulative ACKs? |
457 | * Used to calculate the correct network RTT by taking the receipt | 457 | * Used to calculate the correct network RTT by taking the receipt |
458 | * time of the ack minus the transmission time of the sender minus | 458 | * time of the ack minus the transmission time of the sender minus |
459 | * this value. | 459 | * this value. |
@@ -514,7 +514,7 @@ struct TransportFragmentBoxMessage | |||
514 | 514 | ||
515 | /** | 515 | /** |
516 | * Unique ID of this fragment (and fragment transmission!). Will | 516 | * Unique ID of this fragment (and fragment transmission!). Will |
517 | * change even if a fragement is retransmitted to make each | 517 | * change even if a fragment is retransmitted to make each |
518 | * transmission attempt unique! If a client receives a duplicate | 518 | * transmission attempt unique! If a client receives a duplicate |
519 | * fragment (same @e frag_off for same @a msg_uuid, it must send | 519 | * fragment (same @e frag_off for same @a msg_uuid, it must send |
520 | * #GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK immediately. | 520 | * #GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK immediately. |
@@ -1944,7 +1944,7 @@ struct Neighbour | |||
1944 | struct GNUNET_TIME_Absolute last_dv_learn_monotime; | 1944 | struct GNUNET_TIME_Absolute last_dv_learn_monotime; |
1945 | 1945 | ||
1946 | /** | 1946 | /** |
1947 | * Do we have the lastest value for @e last_dv_learn_monotime from | 1947 | * Do we have the latest value for @e last_dv_learn_monotime from |
1948 | * PEERSTORE yet, or are we still waiting for a reply of PEERSTORE? | 1948 | * PEERSTORE yet, or are we still waiting for a reply of PEERSTORE? |
1949 | */ | 1949 | */ |
1950 | int dv_monotime_available; | 1950 | int dv_monotime_available; |
@@ -2238,7 +2238,7 @@ struct AcknowledgementCummulator | |||
2238 | struct TransportCummulativeAckPayload ack_uuids[MAX_CUMMULATIVE_ACKS]; | 2238 | struct TransportCummulativeAckPayload ack_uuids[MAX_CUMMULATIVE_ACKS]; |
2239 | 2239 | ||
2240 | /** | 2240 | /** |
2241 | * Task scheduled either to transmit the cummulative ACK message, | 2241 | * Task scheduled either to transmit the cumulative ACK message, |
2242 | * or to clean up this data structure after extended periods of | 2242 | * or to clean up this data structure after extended periods of |
2243 | * inactivity (if @e num_acks is zero). | 2243 | * inactivity (if @e num_acks is zero). |
2244 | */ | 2244 | */ |
@@ -2657,7 +2657,7 @@ static struct GNUNET_CONTAINER_MultiPeerMap *backtalkers; | |||
2657 | 2657 | ||
2658 | /** | 2658 | /** |
2659 | * Map from PIDs to `struct AcknowledgementCummulator`s. | 2659 | * Map from PIDs to `struct AcknowledgementCummulator`s. |
2660 | * Here we track the cummulative ACKs for transmission. | 2660 | * Here we track the cumulative ACKs for transmission. |
2661 | */ | 2661 | */ |
2662 | static struct GNUNET_CONTAINER_MultiPeerMap *ack_cummulators; | 2662 | static struct GNUNET_CONTAINER_MultiPeerMap *ack_cummulators; |
2663 | 2663 | ||
@@ -2735,7 +2735,7 @@ static struct PendingAcknowledgement *pa_head; | |||
2735 | static struct PendingAcknowledgement *pa_tail; | 2735 | static struct PendingAcknowledgement *pa_tail; |
2736 | 2736 | ||
2737 | /** | 2737 | /** |
2738 | * List of incomming connections where we are trying | 2738 | * List of incoming connections where we are trying |
2739 | * to get a connection back established. Length | 2739 | * to get a connection back established. Length |
2740 | * kept in #ir_total. | 2740 | * kept in #ir_total. |
2741 | */ | 2741 | */ |
@@ -3888,10 +3888,10 @@ client_send_response (struct PendingMessage *pm) | |||
3888 | if (NULL != tc) | 3888 | if (NULL != tc) |
3889 | { | 3889 | { |
3890 | struct GNUNET_MQ_Envelope *env; | 3890 | struct GNUNET_MQ_Envelope *env; |
3891 | struct SendOkMessage *som; | 3891 | struct SendOkMessage *so_msg; |
3892 | 3892 | ||
3893 | env = GNUNET_MQ_msg (som, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_OK); | 3893 | env = GNUNET_MQ_msg (so_msg, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_OK); |
3894 | som->peer = vl->target; | 3894 | so_msg->peer = vl->target; |
3895 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, | 3895 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, |
3896 | "Confirming transmission of <%llu> to %s\n", | 3896 | "Confirming transmission of <%llu> to %s\n", |
3897 | pm->logging_uuid, | 3897 | pm->logging_uuid, |
@@ -4713,7 +4713,7 @@ route_control_message_without_fc (const struct GNUNET_PeerIdentity *target, | |||
4713 | } | 4713 | } |
4714 | if ((NULL != n) && (NULL != dv)) | 4714 | if ((NULL != n) && (NULL != dv)) |
4715 | options &= ~RMO_REDUNDANT; /* We will do one DV and one direct, that's | 4715 | options &= ~RMO_REDUNDANT; /* We will do one DV and one direct, that's |
4716 | enough for redunancy, so clear the flag. */ | 4716 | enough for redundancy, so clear the flag. */ |
4717 | rtt1 = GNUNET_TIME_UNIT_FOREVER_REL; | 4717 | rtt1 = GNUNET_TIME_UNIT_FOREVER_REL; |
4718 | rtt2 = GNUNET_TIME_UNIT_FOREVER_REL; | 4718 | rtt2 = GNUNET_TIME_UNIT_FOREVER_REL; |
4719 | if (NULL != n) | 4719 | if (NULL != n) |
@@ -4862,7 +4862,7 @@ check_vl_transmission (struct VirtualLink *vl) | |||
4862 | vl->outbound_fc_window_size) | 4862 | vl->outbound_fc_window_size) |
4863 | { | 4863 | { |
4864 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, | 4864 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, |
4865 | "Stalled transmision on VL %s due to flow control: %llu < %llu\n", | 4865 | "Stalled transmission on VL %s due to flow control: %llu < %llu\n", |
4866 | GNUNET_i2s (&vl->target), | 4866 | GNUNET_i2s (&vl->target), |
4867 | (unsigned long long) vl->outbound_fc_window_size, | 4867 | (unsigned long long) vl->outbound_fc_window_size, |
4868 | (unsigned long long) (pm->bytes_msg | 4868 | (unsigned long long) (pm->bytes_msg |
@@ -5286,7 +5286,7 @@ handle_raw_message (void *cls, const struct GNUNET_MessageHeader *mh) | |||
5286 | it. Thus logging as error for now. */ | 5286 | it. Thus logging as error for now. */ |
5287 | GNUNET_break_op (0); | 5287 | GNUNET_break_op (0); |
5288 | GNUNET_STATISTICS_update (GST_stats, | 5288 | GNUNET_STATISTICS_update (GST_stats, |
5289 | "# CORE messages droped (virtual link still down)", | 5289 | "# CORE messages dropped (virtual link still down)", |
5290 | 1, | 5290 | 1, |
5291 | GNUNET_NO); | 5291 | GNUNET_NO); |
5292 | 5292 | ||
@@ -5296,7 +5296,7 @@ handle_raw_message (void *cls, const struct GNUNET_MessageHeader *mh) | |||
5296 | if (vl->incoming_fc_window_size_ram > UINT_MAX - size) | 5296 | if (vl->incoming_fc_window_size_ram > UINT_MAX - size) |
5297 | { | 5297 | { |
5298 | GNUNET_STATISTICS_update (GST_stats, | 5298 | GNUNET_STATISTICS_update (GST_stats, |
5299 | "# CORE messages droped (FC arithmetic overflow)", | 5299 | "# CORE messages dropped (FC arithmetic overflow)", |
5300 | 1, | 5300 | 1, |
5301 | GNUNET_NO); | 5301 | GNUNET_NO); |
5302 | 5302 | ||
@@ -5306,7 +5306,7 @@ handle_raw_message (void *cls, const struct GNUNET_MessageHeader *mh) | |||
5306 | if (vl->incoming_fc_window_size_ram + size > vl->available_fc_window_size) | 5306 | if (vl->incoming_fc_window_size_ram + size > vl->available_fc_window_size) |
5307 | { | 5307 | { |
5308 | GNUNET_STATISTICS_update (GST_stats, | 5308 | GNUNET_STATISTICS_update (GST_stats, |
5309 | "# CORE messages droped (FC window overflow)", | 5309 | "# CORE messages dropped (FC window overflow)", |
5310 | 1, | 5310 | 1, |
5311 | GNUNET_NO); | 5311 | GNUNET_NO); |
5312 | finish_cmc_handling (cmc); | 5312 | finish_cmc_handling (cmc); |
@@ -5397,7 +5397,7 @@ check_fragment_box (void *cls, const struct TransportFragmentBoxMessage *fb) | |||
5397 | 5397 | ||
5398 | 5398 | ||
5399 | /** | 5399 | /** |
5400 | * Clean up an idle cummulative acknowledgement data structure. | 5400 | * Clean up an idle cumulative acknowledgement data structure. |
5401 | * | 5401 | * |
5402 | * @param cls a `struct AcknowledgementCummulator *` | 5402 | * @param cls a `struct AcknowledgementCummulator *` |
5403 | */ | 5403 | */ |
@@ -5416,7 +5416,7 @@ destroy_ack_cummulator (void *cls) | |||
5416 | 5416 | ||
5417 | 5417 | ||
5418 | /** | 5418 | /** |
5419 | * Do the transmission of a cummulative acknowledgement now. | 5419 | * Do the transmission of a cumulative acknowledgement now. |
5420 | * | 5420 | * |
5421 | * @param cls a `struct AcknowledgementCummulator *` | 5421 | * @param cls a `struct AcknowledgementCummulator *` |
5422 | */ | 5422 | */ |
@@ -5674,7 +5674,7 @@ handle_fragment_box (void *cls, const struct TransportFragmentBoxMessage *fb) | |||
5674 | } | 5674 | } |
5675 | } | 5675 | } |
5676 | 5676 | ||
5677 | /* Compute cummulative ACK */ | 5677 | /* Compute cumulative ACK */ |
5678 | cdelay = GNUNET_TIME_absolute_get_duration (rc->last_frag); | 5678 | cdelay = GNUNET_TIME_absolute_get_duration (rc->last_frag); |
5679 | cdelay = GNUNET_TIME_relative_multiply (cdelay, rc->msg_missing / fsize); | 5679 | cdelay = GNUNET_TIME_relative_multiply (cdelay, rc->msg_missing / fsize); |
5680 | if (0 == rc->msg_missing) | 5680 | if (0 == rc->msg_missing) |
@@ -5911,7 +5911,7 @@ completed_pending_message (struct PendingMessage *pm) | |||
5911 | * The @a pa was acknowledged, process the acknowledgement. | 5911 | * The @a pa was acknowledged, process the acknowledgement. |
5912 | * | 5912 | * |
5913 | * @param pa the pending acknowledgement that was satisfied | 5913 | * @param pa the pending acknowledgement that was satisfied |
5914 | * @param ack_delay artificial delay from cummulative acks created by the | 5914 | * @param ack_delay artificial delay from cumulative acks created by the |
5915 | * other peer | 5915 | * other peer |
5916 | */ | 5916 | */ |
5917 | static void | 5917 | static void |
@@ -7353,7 +7353,7 @@ handle_dv_box (void *cls, const struct TransportDVBoxMessage *dvb) | |||
7353 | path = tmp; | 7353 | path = tmp; |
7354 | } | 7354 | } |
7355 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, | 7355 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, |
7356 | "Received DVBox with remainig path %s\n", | 7356 | "Received DVBox with remaining path %s\n", |
7357 | path); | 7357 | path); |
7358 | GNUNET_free (path); | 7358 | GNUNET_free (path); |
7359 | } | 7359 | } |
@@ -7418,7 +7418,7 @@ handle_dv_box (void *cls, const struct TransportDVBoxMessage *dvb) | |||
7418 | dv_hmac (&key, &hmac, hdr, hdr_len); | 7418 | dv_hmac (&key, &hmac, hdr, hdr_len); |
7419 | if (0 != GNUNET_memcmp (&hmac, &dvb->hmac)) | 7419 | if (0 != GNUNET_memcmp (&hmac, &dvb->hmac)) |
7420 | { | 7420 | { |
7421 | /* HMAC missmatch, disard! */ | 7421 | /* HMAC mismatch, discard! */ |
7422 | GNUNET_break_op (0); | 7422 | GNUNET_break_op (0); |
7423 | finish_cmc_handling (cmc); | 7423 | finish_cmc_handling (cmc); |
7424 | return; | 7424 | return; |
@@ -7493,7 +7493,7 @@ handle_dv_box (void *cls, const struct TransportDVBoxMessage *dvb) | |||
7493 | &ppay.sender_sig, | 7493 | &ppay.sender_sig, |
7494 | &ppay.sender.public_key)) | 7494 | &ppay.sender.public_key)) |
7495 | { | 7495 | { |
7496 | /* Signature invalid, disard! */ | 7496 | /* Signature invalid, discard! */ |
7497 | GNUNET_break_op (0); | 7497 | GNUNET_break_op (0); |
7498 | finish_cmc_handling (cmc); | 7498 | finish_cmc_handling (cmc); |
7499 | return; | 7499 | return; |
@@ -8210,7 +8210,7 @@ handle_flow_control (void *cls, const struct TransportFlowControlMessage *fc) | |||
8210 | % FC_NO_CHANGE_REPLY_PROBABILITY)) | 8210 | % FC_NO_CHANGE_REPLY_PROBABILITY)) |
8211 | { | 8211 | { |
8212 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, | 8212 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, |
8213 | "Consider re-sending our FC message, as clearly the ther peer's idea of the window is not up-to-date (%llu vs %llu)\n", | 8213 | "Consider re-sending our FC message, as clearly the other peer's idea of the window is not up-to-date (%llu vs %llu)\n", |
8214 | (unsigned long long) wnd, | 8214 | (unsigned long long) wnd, |
8215 | (unsigned long long) vl->incoming_fc_window_size); | 8215 | (unsigned long long) vl->incoming_fc_window_size); |
8216 | consider_sending_fc (vl); | 8216 | consider_sending_fc (vl); |
@@ -8563,7 +8563,7 @@ reliability_box_message (struct Queue *queue, | |||
8563 | /** | 8563 | /** |
8564 | * Change the value of the `next_attempt` field of @a pm | 8564 | * Change the value of the `next_attempt` field of @a pm |
8565 | * to @a next_attempt and re-order @a pm in the transmission | 8565 | * to @a next_attempt and re-order @a pm in the transmission |
8566 | * list as required by the new timestmap. | 8566 | * list as required by the new timestamp. |
8567 | * | 8567 | * |
8568 | * @param pm a pending message to update | 8568 | * @param pm a pending message to update |
8569 | * @param next_attempt timestamp to use | 8569 | * @param next_attempt timestamp to use |
@@ -8755,7 +8755,7 @@ select_best_pending_from_link (struct PendingMessageScoreContext *sc, | |||
8755 | 10; /* increase weight, favors 'sc->best', which is low latency */ | 8755 | 10; /* increase weight, favors 'sc->best', which is low latency */ |
8756 | if (0 != queue->mtu) | 8756 | if (0 != queue->mtu) |
8757 | { | 8757 | { |
8758 | /* Grant bonus if we are bellow MTU, larger bonus the closer we will | 8758 | /* Grant bonus if we are below MTU, larger bonus the closer we will |
8759 | be to the MTU */ | 8759 | be to the MTU */ |
8760 | if (queue->mtu > sc->real_overhead + sc->best->bytes_msg) | 8760 | if (queue->mtu > sc->real_overhead + sc->best->bytes_msg) |
8761 | sc_score -= queue->mtu - (sc->real_overhead + sc->best->bytes_msg); | 8761 | sc_score -= queue->mtu - (sc->real_overhead + sc->best->bytes_msg); |
@@ -9645,7 +9645,9 @@ handle_add_queue_message (void *cls, | |||
9645 | if (NULL != queue) | 9645 | if (NULL != queue) |
9646 | { | 9646 | { |
9647 | neighbour = queue->neighbour; | 9647 | neighbour = queue->neighbour; |
9648 | } else { | 9648 | } |
9649 | else | ||
9650 | { | ||
9649 | neighbour = lookup_neighbour (&aqm->receiver); | 9651 | neighbour = lookup_neighbour (&aqm->receiver); |
9650 | if (NULL == neighbour) | 9652 | if (NULL == neighbour) |
9651 | { | 9653 | { |