GNUnet 0.22.2
gnunet-service-transport.c File Reference

main for gnunet-service-transport More...

#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_statistics_service.h"
#include "gnunet_peerstore_service.h"
#include "gnunet_transport_communication_service.h"
#include "gnunet_nat_service.h"
#include "gnunet_hello_uri_lib.h"
#include "gnunet_signatures.h"
#include "transport.h"
Include dependency graph for gnunet-service-transport.c:

Go to the source code of this file.

Data Structures

struct  MessageUUIDP
 Unique identifier we attach to a message. More...
 
struct  AcknowledgementUUIDP
 Unique identifier to map an acknowledgement to a transmission. More...
 
struct  TransportBackchannelEncapsulationMessage
 Outer layer of an encapsulated backchannel message. More...
 
struct  EphemeralConfirmationPS
 Body by which a peer confirms that it is using an ephemeral key. More...
 
struct  TransportDVBoxPayloadP
 Plaintext of the variable-size payload that is encrypted within a struct TransportBackchannelEncapsulationMessage More...
 
struct  TransportReliabilityBoxMessage
 Outer layer of an encapsulated unfragmented application message sent over an unreliable channel. More...
 
struct  TransportCummulativeAckPayloadP
 Acknowledgement payload. More...
 
struct  TransportReliabilityAckMessage
 Confirmation that the receiver got a GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX. More...
 
struct  TransportFragmentBoxMessage
 Outer layer of an encapsulated fragmented application message. More...
 
struct  DvInitPS
 Content signed by the initiator during DV learning. More...
 
struct  DvHopPS
 Content signed by each peer during DV learning. More...
 
struct  DVPathEntryP
 An entry describing a peer on a path in a struct TransportDVLearnMessage message. More...
 
struct  TransportDVLearnMessage
 Internal message used by transport for distance vector learning. More...
 
struct  TransportDVBoxMessage
 Outer layer of an encapsulated message send over multiple hops. More...
 
struct  TransportValidationChallengeMessage
 Message send to another peer to validate that it can indeed receive messages at a particular address. More...
 
struct  TransportValidationPS
 Message signed by a peer to confirm that it can indeed receive messages at a particular address. More...
 
struct  TransportValidationResponseMessage
 Message send to a peer to respond to a #GNUNET_MESSAGE_TYPE_ADDRESS_VALIDATION_CHALLENGE. More...
 
struct  TransportGlobalNattedAddress
 
struct  TransportFlowControlMessage
 Message for Transport-to-Transport Flow control. More...
 
struct  LearnLaunchEntry
 When did we launch this DV learning activity? More...
 
struct  TransmissionHistoryEntry
 Information we keep per GOODPUT_AGING_SLOTS about historic (or current) transmission performance. More...
 
struct  PerformanceData
 Performance data for a transmission possibility. More...
 
struct  CommunicatorMessageContext
 Context from handle_incoming_msg(). More...
 
struct  RingBufferEntry
 Entry for the ring buffer caching messages send to core, when virtual link is available. More...
 
struct  CoreSentContext
 Closure for core_env_sent_cb. More...
 
struct  ReassemblyContext
 Information we keep for a message that we are reassembling. More...
 
struct  VirtualLink
 A virtual link is another reachable peer that is known to CORE. More...
 
struct  PendingAcknowledgement
 Data structure kept when we are waiting for an acknowledgement. More...
 
struct  DistanceVectorHop
 One possible hop towards a DV target. More...
 
struct  DistanceVector
 Entry in our dv_routes table, representing a (set of) distance vector routes to a particular peer. More...
 
struct  QueueEntry
 Entry identifying transmission in one of our struct Queue which still awaits an ACK. More...
 
struct  Queue
 Handle for a queue. More...
 
struct  Neighbour
 A neighbour that at least one communicator is connected to. More...
 
struct  IncomingRequest
 Another peer attempted to talk to us, we should try to establish a connection in the other direction. More...
 
struct  PeerRequest
 Information per peer and request. More...
 
struct  PendingMessage
 List containing all messages that are yet to be send. More...
 
struct  TransportCummulativeAckPayload
 Acknowledgement payload. More...
 
struct  AcknowledgementCummulator
 Data structure in which we track acknowledgements still to be sent to the. More...
 
struct  AddressListEntry
 One of the addresses of this peer. More...
 
struct  TransportClient
 Client connected to the transport service. More...
 
struct  ValidationState
 State we keep for validation activities. More...
 
struct  Backtalker
 A Backtalker is a peer sending us backchannel messages. More...
 
struct  MonitorEvent
 Details about what to notify monitors about. More...
 
struct  DVKeyState
 Structure of the key material used to encrypt backchannel messages. More...
 
struct  AddGlobalAddressesContext
 
struct  FindByMessageUuidContext
 Closure for find_by_message_uuid. More...
 
struct  NeighbourSelectionContext
 Closure for dv_neighbour_selection and dv_neighbour_transmission. More...
 
struct  CheckKnownAddressContext
 Closure for check_known_address. More...
 
struct  CheckKnownChallengeContext
 Closure for check_known_challenge. More...
 
struct  PendingMessageScoreContext
 Context for select_best_pending_from_link(). More...
 
struct  QueueQualityContext
 Closure for check_connection_quality. More...
 
struct  TransportGlobalNattedAddressClosure
 

Macros

#define RING_BUFFER_SIZE   16
 Size of ring buffer to cache CORE and forwarded DVBox messages. More...
 
#define MAX_FC_RETRANSMIT_COUNT   1000
 Maximum number of FC retransmissions for a running retransmission task. More...
 
#define MAX_CUMMULATIVE_ACKS   64
 Maximum number of messages we acknowledge together in one cumulative ACK. More...
 
#define FC_NO_CHANGE_REPLY_PROBABILITY   8
 What is the 1:n chance that we send a Flow control response when receiving a flow control message that did not change anything for us? Basically, this is used in the case where both peers are stuck on flow control (no window changes), but one might continue sending flow control messages to the other peer as the first FC message when things stalled got lost, and then subsequently the other peer does usually not respond as nothing changed. More...
 
#define IN_PACKET_SIZE_WITHOUT_MTU   128
 What is the size we assume for a read operation in the absence of an MTU for the purpose of flow control? More...
 
#define GOODPUT_AGING_SLOTS   4
 Number of slots we keep of historic data for computation of goodput / message loss ratio. More...
 
#define DEFAULT_WINDOW_SIZE   (128 * 1024)
 How big is the flow control window size by default; limits per-neighbour RAM utilization. More...
 
#define MAX_INCOMING_REQUEST   16
 For how many incoming connections do we try to create a virtual link for (at the same time!). More...
 
#define MAX_DV_DISCOVERY_SELECTION   16
 Maximum number of peers we select for forwarding DVInit messages at the same time (excluding initiator). More...
 
#define RECV_WINDOW_SIZE   4
 Window size. More...
 
#define MIN_DV_PATH_LENGTH_FOR_INITIATOR   3
 Minimum number of hops we should forward DV learn messages even if they are NOT useful for us in hope of looping back to the initiator? More...
 
#define MAX_DV_HOPS_ALLOWED   16
 Maximum DV distance allowed ever. More...
 
#define MAX_DV_LEARN_PENDING   64
 Maximum number of DV learning activities we may have pending at the same time. More...
 
#define MAX_DV_PATHS_TO_TARGET   3
 Maximum number of DV paths we keep simultaneously to the same target. More...
 
#define DELAY_WARN_THRESHOLD    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 5)
 If a queue delays the next message by more than this number of seconds we log a warning. More...
 
#define DV_FORWARD_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 60)
 If a DVBox could not be forwarded after this number of seconds we drop it. More...
 
#define DEFAULT_ACK_WAIT_DURATION    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
 Default value for how long we wait for reliability ack. More...
 
#define DV_QUALITY_RTT_THRESHOLD    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
 We only consider queues as "quality" connections when suppressing the generation of DV initiation messages if the latency of the queue is below this threshold. More...
 
#define DV_PATH_VALIDITY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 5)
 How long do we consider a DV path valid if we see no further updates on it? Note: the value chosen here might be too low! More...
 
#define BACKCHANNEL_INACTIVITY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 5)
 How long do we cache backchannel (struct Backtalker) information after a backchannel goes inactive? More...
 
#define DV_PATH_DISCOVERY_FREQUENCY    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 4)
 How long before paths expire would we like to (re)discover DV paths? Should be below DV_PATH_VALIDITY_TIMEOUT. More...
 
#define EPHEMERAL_VALIDITY    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)
 How long are ephemeral keys valid? More...
 
#define REASSEMBLY_EXPIRATION    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 4)
 How long do we keep partially reassembled messages around before giving up? More...
 
#define FAST_VALIDATION_CHALLENGE_FREQ    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 1)
 What is the fastest rate at which we send challenges if we keep learning an address (gossip, DHT, etc.)? More...
 
#define MAX_VALIDATION_CHALLENGE_FREQ    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_DAYS, 1)
 What is the slowest rate at which we send challenges? More...
 
#define ACK_CUMMULATOR_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)
 How long until we forget about historic accumulators and thus reset the ACK counter? Should exceed the maximum time an active connection experiences without an ACK. More...
 
#define DV_LEARN_BASE_FREQUENCY   GNUNET_TIME_UNIT_MINUTES
 What is the non-randomized base frequency at which we would initiate DV learn messages? More...
 
#define DV_LEARN_QUALITY_THRESHOLD   100
 How many good connections (confirmed, bi-directional, not DV) do we need to have to suppress initiating DV learn messages? More...
 
#define MAX_ADDRESS_VALID_UNTIL    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MONTHS, 1)
 When do we forget an invalid address for sure? More...
 
#define ADDRESS_VALIDATION_LIFETIME    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)
 How long do we consider an address valid if we just checked? More...
 
#define MIN_DELAY_ADDRESS_VALIDATION   GNUNET_TIME_UNIT_MILLISECONDS
 What is the maximum frequency at which we do address validation? A random value between 0 and this value is added when scheduling the validation_task (both to ensure we do not validate too often, and to randomize a bit). More...
 
#define VALIDATION_RTT_BUFFER_FACTOR   3
 How many network RTTs before an address validation expires should we begin trying to revalidate? (Note that the RTT used here is the one that we experienced during the last validation, not necessarily the latest RTT observed). More...
 
#define COMMUNICATOR_TOTAL_QUEUE_LIMIT   512
 How many messages can we have pending for a given communicator process before we start to throttle that communicator? More...
 
#define QUEUE_LENGTH_LIMIT   32
 How many messages can we have pending for a given queue (queue to a particular peer via a communicator) process before we start to throttle that queue? More...
 
#define QUEUE_ENTRY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 5)
 
#define RTT_DIFF    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)
 Difference of the average RTT for the DistanceVector calculate by us and the target we are willing to accept for starting the burst. More...
 

Typedefs

typedef void(* DVMessageHandler) (void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
 Function to call to further operate on the now DV encapsulated message hdr, forwarding it via next_hop under respect of options. More...
 

Enumerations

enum  ClientType {
  CT_NONE = 0 , CT_CORE = 1 , CT_MONITOR = 2 , CT_COMMUNICATOR = 3 ,
  CT_APPLICATION = 4
}
 What type of client is the struct TransportClient about? More...
 
enum  RouteMessageOptions {
  RMO_NONE = 0 , RMO_DV_ALLOWED = 1 , RMO_UNCONFIRMED_ALLOWED = 2 , RMO_ANYTHING_GOES = (RMO_DV_ALLOWED | RMO_UNCONFIRMED_ALLOWED) ,
  RMO_REDUNDANT = 4
}
 Which transmission options are allowable for transmission? Interpreted bit-wise! More...
 
enum  PendingMessageType { PMT_CORE = 0 , PMT_FRAGMENT_BOX = 1 , PMT_RELIABILITY_BOX = 2 , PMT_DV_BOX = 3 }
 Types of different pending messages. More...
 

Functions

static unsigned int get_age ()
 Get an offset into the transmission history buffer for struct PerformanceData. More...
 
static void free_incoming_request (struct IncomingRequest *ir)
 Release ir data structure. More...
 
static void free_pending_acknowledgement (struct PendingAcknowledgement *pa)
 Release pa data structure. More...
 
static void free_fragment_tree (struct PendingMessage *root)
 Free fragment tree below root, excluding root itself. More...
 
static void free_pending_message (struct PendingMessage *pm)
 Release memory associated with pm and remove pm from associated data structures. More...
 
static void free_reassembly_context (struct ReassemblyContext *rc)
 Free rc. More...
 
static void reassembly_cleanup_task (void *cls)
 Task run to clean up reassembly context of a neighbour that have expired. More...
 
static int free_reassembly_cb (void *cls, uint32_t key, void *value)
 function called to free_reassembly_context(). More...
 
static void free_virtual_link (struct VirtualLink *vl)
 Free virtual link. More...
 
static void free_validation_state (struct ValidationState *vs)
 Free validation state. More...
 
static struct Neighbourlookup_neighbour (const struct GNUNET_PeerIdentity *pid)
 Lookup neighbour for peer pid. More...
 
static struct VirtualLinklookup_virtual_link (const struct GNUNET_PeerIdentity *pid)
 Lookup virtual link for peer pid. More...
 
static void free_distance_vector_hop (struct DistanceVectorHop *dvh)
 Free a dvh. More...
 
static void check_link_down (void *cls)
 Task run to check whether the hops of the cls still are validated, or if we need to core about disconnection. More...
 
static void cores_send_disconnect_info (const struct GNUNET_PeerIdentity *pid)
 Send message to CORE clients that we lost a connection. More...
 
static void free_dv_route (struct DistanceVector *dv)
 Free entry in dv_routes. More...
 
static void notify_monitor (struct TransportClient *tc, const struct GNUNET_PeerIdentity *peer, const char *address, enum GNUNET_NetworkType nt, const struct MonitorEvent *me)
 Notify monitor tc about an event. More...
 
static void notify_monitors (const struct GNUNET_PeerIdentity *peer, const char *address, enum GNUNET_NetworkType nt, const struct MonitorEvent *me)
 Send information in me about a peer's status with respect to some address to all monitors that care. More...
 
static void * client_connect_cb (void *cls, struct GNUNET_SERVICE_Client *client, struct GNUNET_MQ_Handle *mq)
 Called whenever a client connects. More...
 
static enum GNUNET_GenericReturnValue remove_global_addresses (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 
static void free_neighbour (struct Neighbour *neighbour, enum GNUNET_GenericReturnValue drop_link)
 Release memory used by neighbour. More...
 
static void core_send_connect_info (struct TransportClient *tc, const struct GNUNET_PeerIdentity *pid)
 Send message to CORE clients that we lost a connection. More...
 
static void cores_send_connect_info (const struct GNUNET_PeerIdentity *pid)
 Send message to CORE clients that we gained a connection. More...
 
static void transmit_on_queue (void *cls)
 We believe we are ready to transmit a message on a queue. More...
 
static unsigned int check_for_queue_with_higher_prio (struct Queue *queue, struct Queue *queue_head)
 Check if the communicator has another queue with higher prio ready for sending. More...
 
static void schedule_transmit_on_queue (struct GNUNET_TIME_Relative delay, struct Queue *queue, enum GNUNET_SCHEDULER_Priority p)
 Called whenever something changed that might effect when we try to do the next transmission on queue using transmit_on_queue(). More...
 
static void free_queue (struct Queue *queue)
 Free queue. More...
 
static void free_address_list_entry (struct AddressListEntry *ale)
 Free ale. More...
 
static int stop_peer_request (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Stop the peer request in value. More...
 
static void do_shutdown (void *cls)
 Function called when the service shuts down. More...
 
static void client_disconnect_cb (void *cls, struct GNUNET_SERVICE_Client *client, void *app_ctx)
 Called whenever a client is disconnected. More...
 
static int notify_client_connect_info (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Iterator telling new CORE client about all existing connections to peers. More...
 
static void finish_cmc_handling_with_continue (struct CommunicatorMessageContext *cmc, unsigned int free_cmc)
 Send ACK to communicator (if requested) and free cmc. More...
 
static enum GNUNET_GenericReturnValue resume_communicators (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 
static void handle_client_start (void *cls, const struct StartMessage *start)
 Initialize a "CORE" client. More...
 
static int check_client_send (void *cls, const struct OutboundMessage *obm)
 Client asked for transmission to a peer. More...
 
static void client_send_response (struct PendingMessage *pm)
 Send a response to the pm that we have processed a "send" request. More...
 
static unsigned int pick_random_dv_hops (const struct DistanceVector *dv, enum RouteMessageOptions options, struct DistanceVectorHop **hops_array, unsigned int hops_array_length)
 Pick hops_array_length random DV paths satisfying options. More...
 
static int check_communicator_available (void *cls, const struct GNUNET_TRANSPORT_CommunicatorAvailableMessage *cam)
 Communicator started. More...
 
static void finish_cmc_handling (struct CommunicatorMessageContext *cmc)
 
static void handle_client_recv_ok (void *cls, const struct RecvOkMessage *rom)
 Client confirms that it is done handling message(s) to a particular peer. More...
 
static void handle_communicator_available (void *cls, const struct GNUNET_TRANSPORT_CommunicatorAvailableMessage *cam)
 Communicator started. More...
 
static int check_communicator_backchannel (void *cls, const struct GNUNET_TRANSPORT_CommunicatorBackchannel *cb)
 Communicator requests backchannel transmission. More...
 
static void sign_ephemeral (struct DistanceVector *dv)
 Sign ephemeral keys in our dv are current. More...
 
static void free_queue_entry (struct QueueEntry *qe, struct TransportClient *tc)
 
static void free_timedout_queue_entry (void *cls)
 
static void queue_send_msg (struct Queue *queue, struct PendingMessage *pm, const void *payload, size_t payload_size)
 Send the message payload on queue. More...
 
static struct GNUNET_TIME_Relative route_via_neighbour (const struct Neighbour *n, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
 Pick a queue of n under constraints options and schedule transmission of hdr. More...
 
static void dv_setup_key_state_from_km (const struct GNUNET_ShortHashCode *km, const struct GNUNET_ShortHashCode *iv, struct DVKeyState *key)
 Given the key material in km and the initialization vector iv, setup the key material for the backchannel in key. More...
 
static void dv_hmac (const struct DVKeyState *key, struct GNUNET_HashCode *hmac, const void *data, size_t data_size)
 Do HMAC calculation for backchannel messages over data using key material from key. More...
 
static void dv_encrypt (struct DVKeyState *key, const void *in, void *dst, size_t in_size)
 Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst. More...
 
static enum GNUNET_GenericReturnValue dv_decrypt (struct DVKeyState *key, void *out, const void *ciph, size_t out_size)
 Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst. More...
 
static void dv_key_clean (struct DVKeyState *key)
 Clean up key material in key. More...
 
static struct GNUNET_TIME_Relative encapsulate_for_dv (struct DistanceVector *dv, unsigned int num_dvhs, struct DistanceVectorHop **dvhs, const struct GNUNET_MessageHeader *hdr, DVMessageHandler use, void *use_cls, enum RouteMessageOptions options, enum GNUNET_GenericReturnValue without_fc)
 Pick a path of dv under constraints options and schedule transmission of hdr. More...
 
static void send_dv_to_neighbour (void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
 Wrapper around route_via_neighbour() that matches the DVMessageHandler structure. More...
 
static struct GNUNET_TIME_Relative route_control_message_without_fc (struct VirtualLink *vl, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
 We need to transmit hdr to target. More...
 
static void consider_sending_fc (void *cls)
 Something changed on the virtual link with respect to flow control. More...
 
static void task_consider_sending_fc (void *cls)
 Something changed on the virtual link with respect to flow control. More...
 
static char * get_address_without_port (const char *address)
 Get the IP address without the port number. More...
 
static enum GNUNET_GenericReturnValue add_global_addresses (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 
static struct GNUNET_TIME_Relative calculate_rtt (struct DistanceVector *dv)
 
static void check_vl_transmission (struct VirtualLink *vl)
 There is a message at the head of the pending messages for vl which may be ready for transmission. More...
 
static void handle_client_send (void *cls, const struct OutboundMessage *obm)
 Client asked for transmission to a peer. More...
 
static void handle_communicator_backchannel (void *cls, const struct GNUNET_TRANSPORT_CommunicatorBackchannel *cb)
 Communicator requests backchannel transmission. More...
 
static int check_add_address (void *cls, const struct GNUNET_TRANSPORT_AddAddressMessage *aam)
 Address of our peer added. More...
 
static void store_pi (void *cls)
 Ask peerstore to store our address. More...
 
static void peerstore_store_own_cb (void *cls, int success)
 Function called when peerstore is done storing our address. More...
 
static void shc_cont (void *cls, int success)
 
static struct AddressListEntrycreate_address_entry (struct TransportClient *tc, struct GNUNET_TIME_Relative expiration, enum GNUNET_NetworkType nt, const char *address, uint32_t aid, size_t slen)
 
static void handle_add_address (void *cls, const struct GNUNET_TRANSPORT_AddAddressMessage *aam)
 Address of our peer added. More...
 
static void handle_del_address (void *cls, const struct GNUNET_TRANSPORT_DelAddressMessage *dam)
 Address of our peer deleted. More...
 
static void demultiplex_with_cmc (struct CommunicatorMessageContext *cmc)
 Given an inbound message msg from a communicator cmc, demultiplex it based on the type calling the right handler. More...
 
static void core_env_sent_cb (void *cls)
 Function called when we are done giving a message of a certain size to CORE and should thus decrement the number of bytes of RAM reserved for that peer's MQ. More...
 
static void finish_handling_raw_message (struct VirtualLink *vl, const struct GNUNET_MessageHeader *mh, struct CommunicatorMessageContext *cmc, unsigned int free_cmc)
 
static void handle_raw_message (void *cls, const struct GNUNET_MessageHeader *mh)
 Communicator gave us an unencapsulated message to pass as-is to CORE. More...
 
static int check_fragment_box (void *cls, const struct TransportFragmentBoxMessage *fb)
 Communicator gave us a fragment box. More...
 
static void destroy_ack_cummulator (void *cls)
 Clean up an idle cumulative acknowledgement data structure. More...
 
static void transmit_cummulative_ack_cb (void *cls)
 Do the transmission of a cumulative acknowledgement now. More...
 
static void cummulative_ack (const struct GNUNET_PeerIdentity *pid, const struct AcknowledgementUUIDP *ack_uuid, struct GNUNET_TIME_Absolute max_delay)
 Transmit an acknowledgement for ack_uuid to pid delaying transmission by at most ack_delay. More...
 
static int find_by_message_uuid (void *cls, uint32_t key, void *value)
 Iterator called to find a reassembly context by the message UUID in the multihashmap32. More...
 
static void handle_fragment_box (void *cls, const struct TransportFragmentBoxMessage *fb)
 Communicator gave us a fragment. More...
 
static int check_reliability_box (void *cls, const struct TransportReliabilityBoxMessage *rb)
 Communicator gave us a reliability box. More...
 
static void handle_reliability_box (void *cls, const struct TransportReliabilityBoxMessage *rb)
 Communicator gave us a reliability box. More...
 
static void update_pd_age (struct PerformanceData *pd, unsigned int age)
 Check if we have advanced to another age since the last time. More...
 
static void update_performance_data (struct PerformanceData *pd, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
 Update pd based on the latest rtt and the number of bytes that were confirmed to be successfully transmitted. More...
 
static void update_queue_performance (struct Queue *q, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
 We have successfully transmitted data via q, update metrics. More...
 
static void update_dvh_performance (struct DistanceVectorHop *dvh, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
 We have successfully transmitted data via dvh, update metrics. More...
 
static void completed_pending_message (struct PendingMessage *pm)
 We have completed transmission of pm, remove it from the transmission queues (and if it is a fragment, continue up the tree as necessary). More...
 
static void handle_acknowledged (struct PendingAcknowledgement *pa, struct GNUNET_TIME_Relative ack_delay)
 The pa was acknowledged, process the acknowledgement. More...
 
static int check_reliability_ack (void *cls, const struct TransportReliabilityAckMessage *ra)
 Communicator gave us a reliability ack. More...
 
static void handle_reliability_ack (void *cls, const struct TransportReliabilityAckMessage *ra)
 Communicator gave us a reliability ack. More...
 
static int check_backchannel_encapsulation (void *cls, const struct TransportBackchannelEncapsulationMessage *be)
 Communicator gave us a backchannel encapsulation. More...
 
static void handle_backchannel_encapsulation (void *cls, const struct TransportBackchannelEncapsulationMessage *be)
 Communicator gave us a backchannel encapsulation. More...
 
static void path_cleanup_cb (void *cls)
 Task called when we should check if any of the DV paths we have learned to a target are due for garbage collection. More...
 
static void send_msg_from_cache (struct VirtualLink *vl)
 
static void activate_core_visible_dv_path (struct DistanceVectorHop *hop)
 The hop is a validated path to the respective target peer and we should tell core about it – and schedule a job to revoke the state. More...
 
static int learn_dv_path (const struct GNUNET_PeerIdentity *path, unsigned int path_len, struct GNUNET_TIME_Relative network_latency, struct GNUNET_TIME_Absolute path_valid_until)
 We have learned a path through the network to some other peer, add it to our DV data structure (returning GNUNET_YES on success). More...
 
static int check_dv_learn (void *cls, const struct TransportDVLearnMessage *dvl)
 Communicator gave us a DV learn message. More...
 
static void forward_dv_learn (const struct GNUNET_PeerIdentity *next_hop, const struct TransportDVLearnMessage *msg, uint16_t bi_history, uint16_t nhops, const struct DVPathEntryP *hops, struct GNUNET_TIME_Absolute in_time)
 Build and forward a DV learn message to next_hop. More...
 
static int validate_dv_initiator_signature (struct GNUNET_TIME_AbsoluteNBO sender_monotonic_time, const struct GNUNET_PeerIdentity *init, const struct GNUNET_CRYPTO_ChallengeNonceP *challenge, const struct GNUNET_CRYPTO_EddsaSignature *init_sig)
 Check signature of type GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR. More...
 
static int dv_neighbour_selection (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Function called for each neighbour during handle_dv_learn. More...
 
static int dv_neighbour_transmission (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Function called for each neighbour during handle_dv_learn. More...
 
static unsigned int calculate_fork_degree (unsigned int hops_taken, unsigned int neighbour_count, unsigned int eligible_count)
 Computes the number of neighbours we should forward a DVInit message to given that it has so far taken hops_taken hops though the network and that the number of neighbours we have in total is neighbour_count, out of which eligible_count are not yet on the path. More...
 
static void neighbour_store_dvmono_cb (void *cls, int success)
 Function called when peerstore is done storing a DV monotonic time. More...
 
static struct GNUNET_TIME_Relative get_network_latency (const struct TransportDVLearnMessage *dvl)
 
static void handle_dv_learn (void *cls, const struct TransportDVLearnMessage *dvl)
 Communicator gave us a DV learn message. More...
 
static int check_dv_box (void *cls, const struct TransportDVBoxMessage *dvb)
 Communicator gave us a DV box. More...
 
static void forward_dv_box (struct Neighbour *next_hop, struct TransportDVBoxMessage *hdr, uint16_t total_hops, uint16_t num_hops, const struct GNUNET_PeerIdentity *hops, const void *enc_payload, uint16_t enc_payload_size)
 Create a DV Box message and queue it for transmission to next_hop. More...
 
static void free_backtalker (struct Backtalker *b)
 Free data structures associated with b. More...
 
static int free_backtalker_cb (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Callback to free backtalker records. More...
 
static void backtalker_timeout_cb (void *cls)
 Function called when it is time to clean up a backtalker. More...
 
static void backtalker_monotime_cb (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 Function called with the monotonic time of a backtalker by PEERSTORE. More...
 
static void backtalker_monotime_store_cb (void *cls, int success)
 Function called by PEERSTORE when the store operation of a backtalker's monotonic time is complete. More...
 
static void update_backtalker_monotime (struct Backtalker *b)
 The backtalker b monotonic time changed. More...
 
static void handle_dv_box (void *cls, const struct TransportDVBoxMessage *dvb)
 Communicator gave us a DV box. More...
 
static int check_incoming_msg (void *cls, const struct GNUNET_TRANSPORT_IncomingMessage *im)
 Client notified us about transmission from a peer. More...
 
static int check_known_address (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Test if the validation state in value matches the address from cls. More...
 
static void validation_start_cb (void *cls)
 Task run periodically to validate some address based on validation_heap. More...
 
static void update_next_challenge_time (struct ValidationState *vs, struct GNUNET_TIME_Absolute new_time)
 Set the time for next_challenge of vs to new_time. More...
 
static void start_address_validation (const struct GNUNET_PeerIdentity *pid, const char *address)
 Start address validation. More...
 
static struct Queuefind_queue (const struct GNUNET_PeerIdentity *pid, const char *address)
 Find the queue matching pid and address. More...
 
static void suggest_to_connect (const struct GNUNET_PeerIdentity *pid, const char *address)
 Signature of a function called with a communicator address of a peer pid that an application wants us to connect to. More...
 
static void hello_for_incoming_cb (void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
 
static void handle_hello_for_incoming (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 Function called by PEERSTORE for each matching record. More...
 
static void hello_for_incoming_error_cb (void *cls)
 
static void hello_for_incoming_sync_cb (void *cls)
 
static void handle_validation_challenge (void *cls, const struct TransportValidationChallengeMessage *tvc)
 Communicator gave us a transport address validation challenge. More...
 
static int check_known_challenge (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Test if the validation state in value matches the challenge from cls. More...
 
static void peerstore_store_validation_cb (void *cls, int success)
 Function called when peerstore is done storing a validated address. More...
 
static void validation_transmit_on_queue (struct Queue *q, struct ValidationState *vs)
 The queue q (which matches the peer and address in vs) is ready for queueing. More...
 
static void revalidation_start_cb (void *cls)
 
static enum GNUNET_GenericReturnValue revalidate_map_it (void *cls, const struct GNUNET_HashCode *key, void *value)
 
static void handle_validation_response (void *cls, const struct TransportValidationResponseMessage *tvr)
 Communicator gave us a transport address validation response. More...
 
static void handle_incoming_msg (void *cls, const struct GNUNET_TRANSPORT_IncomingMessage *im)
 Incoming message. More...
 
static int check_flow_control (void *cls, const struct TransportFlowControlMessage *fc)
 Communicator gave us a transport address validation response. More...
 
static void iterate_address_start_burst (void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
 
static void check_for_burst_address (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 
static void burst_timeout (void *cls)
 
static void start_burst (void *cls)
 
static void queue_burst (void *cls)
 
static void handle_flow_control (void *cls, const struct TransportFlowControlMessage *fc)
 Communicator gave us a transport address validation response. More...
 
static int check_add_queue_message (void *cls, const struct GNUNET_TRANSPORT_AddQueueMessage *aqm)
 New queue became available. More...
 
static void set_pending_message_uuid (struct PendingMessage *pm)
 If necessary, generates the UUID for a pm. More...
 
static struct PendingAcknowledgementprepare_pending_acknowledgement (struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
 Setup data structure waiting for acknowledgements. More...
 
static struct PendingMessagefragment_message (struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
 Fragment the given pm to the given mtu. More...
 
static struct PendingMessagereliability_box_message (struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
 Reliability-box the given pm. More...
 
static void reorder_root_pm (struct PendingMessage *pm, struct GNUNET_TIME_Absolute next_attempt)
 
static unsigned int check_next_attempt_tree (struct PendingMessage *pm, struct PendingMessage *root)
 
static void harmonize_flight_round (struct PendingMessage *pm)
 
static void update_pm_next_attempt (struct PendingMessage *pm, struct GNUNET_TIME_Absolute next_attempt)
 Change the value of the next_attempt field of pm to next_attempt and re-order pm in the transmission list as required by the new timestamp. More...
 
static void select_best_pending_from_link (struct PendingMessageScoreContext *sc, struct Queue *queue, struct VirtualLink *vl, struct DistanceVectorHop *dvh, size_t overhead)
 Select the best pending message from vl for transmission via queue. More...
 
static void extract_box_cb (void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
 Function to call to further operate on the now DV encapsulated message hdr, forwarding it via next_hop under respect of options. More...
 
static void handle_del_queue_message (void *cls, const struct GNUNET_TRANSPORT_DelQueueMessage *dqm)
 Queue to a peer went down. More...
 
static void handle_send_message_ack (void *cls, const struct GNUNET_TRANSPORT_SendMessageToAck *sma)
 Message was transmitted. More...
 
static void handle_burst_finished ()
 The burst finished. More...
 
static int notify_client_queues (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Iterator telling new MONITOR client about all existing queues to peers. More...
 
static void handle_monitor_start (void *cls, const struct GNUNET_TRANSPORT_MonitorStart *start)
 Initialize a monitor client. More...
 
static struct TransportClientlookup_communicator (const char *prefix)
 Find transport client providing communication service for the protocol prefix. More...
 
static int check_connection_quality (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Check whether any queue to the given neighbour is of a good "quality" and if so, increment the counter. More...
 
static void start_dv_learn (void *cls)
 Task run when we CONSIDER initiating a DV learn process. More...
 
static int check_validation_request_pending (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 A new queue has been created, check if any address validation requests have been waiting for it. More...
 
static void neighbour_dv_monotime_cb (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 Function called with the monotonic time of a DV initiator by PEERSTORE. More...
 
static void iterate_address_and_compare_cb (void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
 
static enum GNUNET_GenericReturnValue contains_address (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 
static void check_for_global_natted_error_cb (void *cls)
 
static void check_for_global_natted_sync_cb (void *cls)
 
static void check_for_global_natted (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 
static void handle_add_queue_message (void *cls, const struct GNUNET_TRANSPORT_AddQueueMessage *aqm)
 New queue became available. More...
 
static void handle_update_queue_message (void *cls, const struct GNUNET_TRANSPORT_UpdateQueueMessage *msg)
 Handle updates to queues. More...
 
static void handle_queue_create_ok (void *cls, const struct GNUNET_TRANSPORT_CreateQueueResponse *cqr)
 Communicator tells us that our request to create a queue "worked", that is setting up the queue is now in process. More...
 
static void handle_queue_create_fail (void *cls, const struct GNUNET_TRANSPORT_CreateQueueResponse *cqr)
 Communicator tells us that our request to create a queue failed. More...
 
static void handle_suggest_cancel (void *cls, const struct ExpressPreferenceMessage *msg)
 We have received a struct ExpressPreferenceMessage from an application client. More...
 
static void hello_for_client_cb (void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
 
static void handle_hello_for_client (void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
 Function called by PEERSTORE for each matching record. More...
 
static void hello_for_client_error_cb (void *cls)
 
static void hello_for_client_sync_cb (void *cls)
 
static void handle_suggest (void *cls, const struct ExpressPreferenceMessage *msg)
 We have received a struct ExpressPreferenceMessage from an application client. More...
 
static int check_request_hello_validation (void *cls, const struct RequestHelloValidationMessage *m)
 Check GNUNET_MESSAGE_TYPE_TRANSPORT_REQUEST_HELLO_VALIDATION messages. More...
 
static void handle_request_hello_validation (void *cls, const struct RequestHelloValidationMessage *m)
 A client encountered an address of another peer. More...
 
static int free_neighbour_cb (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Free neighbour entry. More...
 
static int free_dv_routes_cb (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Free DV route entry. More...
 
static int free_validation_state_cb (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Free validation state. More...
 
static int free_pending_ack_cb (void *cls, const struct GNUNET_Uuid *key, void *value)
 Free pending acknowledgement. More...
 
static int free_ack_cummulator_cb (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Free acknowledgement cummulator. More...
 
static void shutdown_task (void *cls)
 
static void run (void *cls, const struct GNUNET_CONFIGURATION_Handle *c, struct GNUNET_SERVICE_Handle *service)
 Initiate transport service. More...
 
 GNUNET_SERVICE_MAIN (GNUNET_OS_project_data_gnunet(), "transport", GNUNET_SERVICE_OPTION_SOFT_SHUTDOWN, &run, &client_connect_cb, &client_disconnect_cb, NULL, GNUNET_MQ_hd_fixed_size(suggest, GNUNET_MESSAGE_TYPE_TRANSPORT_SUGGEST, struct ExpressPreferenceMessage, NULL), GNUNET_MQ_hd_fixed_size(suggest_cancel, GNUNET_MESSAGE_TYPE_TRANSPORT_SUGGEST_CANCEL, struct ExpressPreferenceMessage, NULL), GNUNET_MQ_hd_var_size(request_hello_validation, GNUNET_MESSAGE_TYPE_TRANSPORT_REQUEST_HELLO_VALIDATION, struct RequestHelloValidationMessage, NULL), GNUNET_MQ_hd_fixed_size(client_start, GNUNET_MESSAGE_TYPE_TRANSPORT_START, struct StartMessage, NULL), GNUNET_MQ_hd_var_size(client_send, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND, struct OutboundMessage, NULL), GNUNET_MQ_hd_fixed_size(client_recv_ok, GNUNET_MESSAGE_TYPE_TRANSPORT_RECV_OK, struct RecvOkMessage, NULL), GNUNET_MQ_hd_var_size(communicator_available, GNUNET_MESSAGE_TYPE_TRANSPORT_NEW_COMMUNICATOR, struct GNUNET_TRANSPORT_CommunicatorAvailableMessage, NULL), GNUNET_MQ_hd_var_size(communicator_backchannel, GNUNET_MESSAGE_TYPE_TRANSPORT_COMMUNICATOR_BACKCHANNEL, struct GNUNET_TRANSPORT_CommunicatorBackchannel, NULL), GNUNET_MQ_hd_var_size(add_address, GNUNET_MESSAGE_TYPE_TRANSPORT_ADD_ADDRESS, struct GNUNET_TRANSPORT_AddAddressMessage, NULL), GNUNET_MQ_hd_fixed_size(del_address, GNUNET_MESSAGE_TYPE_TRANSPORT_DEL_ADDRESS, struct GNUNET_TRANSPORT_DelAddressMessage, NULL), GNUNET_MQ_hd_var_size(incoming_msg, GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG, struct GNUNET_TRANSPORT_IncomingMessage, NULL), GNUNET_MQ_hd_fixed_size(queue_create_ok, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE_OK, struct GNUNET_TRANSPORT_CreateQueueResponse, NULL), GNUNET_MQ_hd_fixed_size(queue_create_fail, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE_FAIL, struct GNUNET_TRANSPORT_CreateQueueResponse, NULL), GNUNET_MQ_hd_var_size(add_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_SETUP, struct GNUNET_TRANSPORT_AddQueueMessage, NULL), GNUNET_MQ_hd_fixed_size(update_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_UPDATE, struct GNUNET_TRANSPORT_UpdateQueueMessage, NULL), GNUNET_MQ_hd_fixed_size(del_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_TEARDOWN, struct GNUNET_TRANSPORT_DelQueueMessage, NULL), GNUNET_MQ_hd_fixed_size(send_message_ack, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG_ACK, struct GNUNET_TRANSPORT_SendMessageToAck, NULL), GNUNET_MQ_hd_fixed_size(burst_finished, GNUNET_MESSAGE_TYPE_TRANSPORT_BURST_FINISHED, struct GNUNET_TRANSPORT_BurstFinished, NULL), GNUNET_MQ_hd_fixed_size(monitor_start, GNUNET_MESSAGE_TYPE_TRANSPORT_MONITOR_START, struct GNUNET_TRANSPORT_MonitorStart, NULL), GNUNET_MQ_handler_end())
 Define "main" method using service macro. More...
 

Variables

static struct RingBufferEntryring_buffer [RING_BUFFER_SIZE]
 Ring buffer for a CORE message we did not deliver to CORE, because of missing virtual link to sender. More...
 
static unsigned int ring_buffer_head
 Head of the ring buffer. More...
 
static unsigned int is_ring_buffer_full
 Is the ring buffer filled up to RING_BUFFER_SIZE. More...
 
static struct PendingMessagering_buffer_dv [RING_BUFFER_SIZE]
 Ring buffer for a forwarded DVBox message we did not deliver to the next hop, because of missing virtual link that hop. More...
 
static unsigned int ring_buffer_dv_head
 Head of the ring buffer. More...
 
static unsigned int is_ring_buffer_dv_full
 Is the ring buffer filled up to RING_BUFFER_SIZE. More...
 
static struct TransportClientclients_head
 Head of linked list of all clients to this service. More...
 
static struct TransportClientclients_tail
 Tail of linked list of all clients to this service. More...
 
static struct GNUNET_STATISTICS_HandleGST_stats
 Statistics handle. More...
 
static const struct GNUNET_CONFIGURATION_HandleGST_cfg
 Configuration handle. More...
 
static struct GNUNET_PeerIdentity GST_my_identity
 Our public key. More...
 
struct GNUNET_HELLO_BuilderGST_my_hello
 Our HELLO. More...
 
static struct GNUNET_CRYPTO_EddsaPrivateKeyGST_my_private_key
 Our private key. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapneighbours
 Map from PIDs to struct Neighbour entries. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapbacktalkers
 Map from PIDs to struct Backtalker entries. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapack_cummulators
 Map from PIDs to struct AcknowledgementCummulators. More...
 
static struct GNUNET_CONTAINER_MultiUuidmappending_acks
 Map of pending acknowledgements, mapping struct AcknowledgementUUID to a struct PendingAcknowledgement. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapdv_routes
 Map from PIDs to struct DistanceVector entries describing known paths to the peer. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapvalidation_map
 Map from PIDs to struct ValidationState entries describing addresses we are aware of and their validity state. More...
 
static struct GNUNET_CONTAINER_MultiHashMaprevalidation_map
 Map from addresses to struct ValidationState entries describing addresses we are aware of and their validity state. More...
 
static struct GNUNET_CONTAINER_MultiPeerMaplinks
 Map from PIDs to struct VirtualLink entries describing links CORE knows to exist. More...
 
static struct GNUNET_CONTAINER_MultiShortmapdvlearn_map
 Map from challenges to struct LearnLaunchEntry values. More...
 
static struct LearnLaunchEntrylle_head = NULL
 Head of a DLL sorted by launch time. More...
 
static struct LearnLaunchEntrylle_tail = NULL
 Tail of a DLL sorted by launch time. More...
 
static struct GNUNET_CONTAINER_Heapvalidation_heap
 MIN Heap sorted by "next_challenge" to struct ValidationState entries sorting addresses we are aware of by when we should next try to (re)validate (or expire) them. More...
 
struct GNUNET_NAT_Handlenh
 Handle for connect to the NAT service. More...
 
static struct GNUNET_PEERSTORE_Handlepeerstore
 Database for peer's HELLOs. More...
 
static struct GNUNET_SCHEDULER_Taskdvlearn_task
 Task run to initiate DV learning. More...
 
static struct GNUNET_SCHEDULER_Taskvalidation_task
 Task to run address validation. More...
 
static struct IncomingRequestir_head
 List of incoming connections where we are trying to get a connection back established. More...
 
static struct IncomingRequestir_tail
 Tail of DLL starting at ir_head. More...
 
static unsigned int ir_total
 Length of the DLL starting at ir_head. More...
 
static unsigned long long logging_uuid_gen
 Generator of logging_uuid in struct PendingMessage. More...
 
static enum GNUNET_GenericReturnValue burst_running
 Is there a burst running? More...
 
static struct GNUNET_TIME_Absolute hello_mono_time
 Monotonic time we use for HELLOs generated at this time. More...
 
static int in_shutdown
 Indication if we have received a shutdown signal and are in the process of cleaning up. More...
 
static struct GNUNET_SCHEDULER_Taskburst_task
 The task to start the burst. More...
 
struct GNUNET_SCHEDULER_Taskburst_timeout_task
 
enum GNUNET_GenericReturnValue use_burst
 

Detailed Description

main for gnunet-service-transport

Author
Christian Grothoff

TODO: Implement next:

  • review retransmission logic, right now there is no smartness there! => congestion control, etc [PERFORMANCE-BASICS]

Optimizations-Statistics:

  • Track ACK losses based on ACK-counter [ROUTING]
  • Need to track total bandwidth per VirtualLink and adjust how frequently we send FC messages based on bandwidth-delay-product (and relation to the window size!). See OPTIMIZE-FC-BDP.
  • Consider more statistics in check_connection_quality() [FIXME-CONQ-STATISTICS]
  • Adapt available_fc_window_size, using larger values for high-bandwidth and high-latency links if we have the RAM [GOODPUT / utilization / stalls]
  • Set last_window_consum_limit promise properly based on latency and bandwidth of the respective connection [GOODPUT / utilization / stalls]

Optimizations-DV:

  • When forwarding DV learn messages, if a peer is reached that has a bidirectional link to the origin beyond 1st hop, do NOT forward it to peers other than the origin, as there is clearly a better path directly from the origin to whatever else we could reach.
  • When we passively learned DV (with unconfirmed freshness), we right now add the path to our list but with a zero path_valid_until time and only use it for unconfirmed routes. However, we could consider triggering an explicit validation mechanism ourselves, specifically routing a challenge-response message over the path [ROUTING] = if available, try to confirm unconfirmed DV paths when trying to establish virtual link for a struct IncomingRequest. (i.e. if DVH is unconfirmed, incoming requests cause us to try to validate a passively learned path (requires new message type!))

Optimizations-Fragmentation:

  • Fragments send over a reliable channel could do without the AcknowledgementUUIDP altogether, as they won't be acked! [BANDWIDTH] (-> have 2nd type of acknowledgment message; low priority, as we do not have an MTU-limited reliable communicator) [FIXME-FRAG-REL-UUID]
  • if messages are below MTU, consider adding ACKs and other stuff to the same transmission to avoid tiny messages (requires planning at receiver, and additional MST-style demultiplex at receiver!) [PACKET COUNT]

Optimizations-internals:

  • queue_send_msg by API design has to make a copy of the payload, and route_message on top of that requires a malloc/free. Change design to approximate "zero" copy better... [CPU]
  • could avoid copying body of message into each fragment and keep fragments as just pointers into the original message and only fully build fragments just before transmission (optimization, should reduce CPU and memory use) [CPU, MEMORY]

Definition in file gnunet-service-transport.c.

Macro Definition Documentation

◆ RING_BUFFER_SIZE

#define RING_BUFFER_SIZE   16

Size of ring buffer to cache CORE and forwarded DVBox messages.

Definition at line 88 of file gnunet-service-transport.c.

◆ MAX_FC_RETRANSMIT_COUNT

#define MAX_FC_RETRANSMIT_COUNT   1000

Maximum number of FC retransmissions for a running retransmission task.

Definition at line 93 of file gnunet-service-transport.c.

◆ MAX_CUMMULATIVE_ACKS

#define MAX_CUMMULATIVE_ACKS   64

Maximum number of messages we acknowledge together in one cumulative ACK.

Larger values may save a bit of bandwidth.

Definition at line 99 of file gnunet-service-transport.c.

◆ FC_NO_CHANGE_REPLY_PROBABILITY

#define FC_NO_CHANGE_REPLY_PROBABILITY   8

What is the 1:n chance that we send a Flow control response when receiving a flow control message that did not change anything for us? Basically, this is used in the case where both peers are stuck on flow control (no window changes), but one might continue sending flow control messages to the other peer as the first FC message when things stalled got lost, and then subsequently the other peer does usually not respond as nothing changed.

So to ensure that eventually the FC messages stop, we do send with 1/8th probability an FC message even if nothing changed. That prevents one peer being stuck in sending (useless) FC messages "forever".

Definition at line 113 of file gnunet-service-transport.c.

◆ IN_PACKET_SIZE_WITHOUT_MTU

#define IN_PACKET_SIZE_WITHOUT_MTU   128

What is the size we assume for a read operation in the absence of an MTU for the purpose of flow control?

Definition at line 119 of file gnunet-service-transport.c.

◆ GOODPUT_AGING_SLOTS

#define GOODPUT_AGING_SLOTS   4

Number of slots we keep of historic data for computation of goodput / message loss ratio.

Definition at line 125 of file gnunet-service-transport.c.

◆ DEFAULT_WINDOW_SIZE

#define DEFAULT_WINDOW_SIZE   (128 * 1024)

How big is the flow control window size by default; limits per-neighbour RAM utilization.

Definition at line 131 of file gnunet-service-transport.c.

◆ MAX_INCOMING_REQUEST

#define MAX_INCOMING_REQUEST   16

For how many incoming connections do we try to create a virtual link for (at the same time!).

This does NOT limit the number of incoming connections, just the number for which we are actively trying to find working addresses in the absence (!) of our own applications wanting the link to go up.

Definition at line 141 of file gnunet-service-transport.c.

◆ MAX_DV_DISCOVERY_SELECTION

#define MAX_DV_DISCOVERY_SELECTION   16

Maximum number of peers we select for forwarding DVInit messages at the same time (excluding initiator).

Definition at line 147 of file gnunet-service-transport.c.

◆ RECV_WINDOW_SIZE

#define RECV_WINDOW_SIZE   4

Window size.

How many messages to the same target do we pass to CORE without a RECV_OK in between? Small values limit throughput, large values will increase latency.

FIXME-OPTIMIZE: find out what good values are experimentally, maybe set adaptively (i.e. to observed available bandwidth).

Definition at line 157 of file gnunet-service-transport.c.

◆ MIN_DV_PATH_LENGTH_FOR_INITIATOR

#define MIN_DV_PATH_LENGTH_FOR_INITIATOR   3

Minimum number of hops we should forward DV learn messages even if they are NOT useful for us in hope of looping back to the initiator?

FIXME: allow initiator some control here instead?

Definition at line 166 of file gnunet-service-transport.c.

◆ MAX_DV_HOPS_ALLOWED

#define MAX_DV_HOPS_ALLOWED   16

Maximum DV distance allowed ever.

Definition at line 171 of file gnunet-service-transport.c.

◆ MAX_DV_LEARN_PENDING

#define MAX_DV_LEARN_PENDING   64

Maximum number of DV learning activities we may have pending at the same time.

Definition at line 177 of file gnunet-service-transport.c.

◆ MAX_DV_PATHS_TO_TARGET

#define MAX_DV_PATHS_TO_TARGET   3

Maximum number of DV paths we keep simultaneously to the same target.

Definition at line 182 of file gnunet-service-transport.c.

◆ DELAY_WARN_THRESHOLD

#define DELAY_WARN_THRESHOLD    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 5)

If a queue delays the next message by more than this number of seconds we log a warning.

Note: this is for testing, the value chosen here might be too aggressively low!

Definition at line 189 of file gnunet-service-transport.c.

◆ DV_FORWARD_TIMEOUT

#define DV_FORWARD_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 60)

If a DVBox could not be forwarded after this number of seconds we drop it.

Definition at line 196 of file gnunet-service-transport.c.

◆ DEFAULT_ACK_WAIT_DURATION

#define DEFAULT_ACK_WAIT_DURATION    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)

Default value for how long we wait for reliability ack.

Definition at line 202 of file gnunet-service-transport.c.

◆ DV_QUALITY_RTT_THRESHOLD

#define DV_QUALITY_RTT_THRESHOLD    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 1)

We only consider queues as "quality" connections when suppressing the generation of DV initiation messages if the latency of the queue is below this threshold.

Definition at line 210 of file gnunet-service-transport.c.

◆ DV_PATH_VALIDITY_TIMEOUT

#define DV_PATH_VALIDITY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 5)

How long do we consider a DV path valid if we see no further updates on it? Note: the value chosen here might be too low!

Definition at line 217 of file gnunet-service-transport.c.

◆ BACKCHANNEL_INACTIVITY_TIMEOUT

#define BACKCHANNEL_INACTIVITY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 5)

How long do we cache backchannel (struct Backtalker) information after a backchannel goes inactive?

Definition at line 224 of file gnunet-service-transport.c.

◆ DV_PATH_DISCOVERY_FREQUENCY

#define DV_PATH_DISCOVERY_FREQUENCY    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 4)

How long before paths expire would we like to (re)discover DV paths? Should be below DV_PATH_VALIDITY_TIMEOUT.

Definition at line 231 of file gnunet-service-transport.c.

◆ EPHEMERAL_VALIDITY

#define EPHEMERAL_VALIDITY    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)

How long are ephemeral keys valid?

Definition at line 237 of file gnunet-service-transport.c.

◆ REASSEMBLY_EXPIRATION

#define REASSEMBLY_EXPIRATION    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 4)

How long do we keep partially reassembled messages around before giving up?

Definition at line 243 of file gnunet-service-transport.c.

◆ FAST_VALIDATION_CHALLENGE_FREQ

#define FAST_VALIDATION_CHALLENGE_FREQ    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MINUTES, 1)

What is the fastest rate at which we send challenges if we keep learning an address (gossip, DHT, etc.)?

Definition at line 250 of file gnunet-service-transport.c.

◆ MAX_VALIDATION_CHALLENGE_FREQ

#define MAX_VALIDATION_CHALLENGE_FREQ    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_DAYS, 1)

What is the slowest rate at which we send challenges?

Definition at line 256 of file gnunet-service-transport.c.

◆ ACK_CUMMULATOR_TIMEOUT

#define ACK_CUMMULATOR_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)

How long until we forget about historic accumulators and thus reset the ACK counter? Should exceed the maximum time an active connection experiences without an ACK.

Definition at line 264 of file gnunet-service-transport.c.

◆ DV_LEARN_BASE_FREQUENCY

#define DV_LEARN_BASE_FREQUENCY   GNUNET_TIME_UNIT_MINUTES

What is the non-randomized base frequency at which we would initiate DV learn messages?

Definition at line 271 of file gnunet-service-transport.c.

◆ DV_LEARN_QUALITY_THRESHOLD

#define DV_LEARN_QUALITY_THRESHOLD   100

How many good connections (confirmed, bi-directional, not DV) do we need to have to suppress initiating DV learn messages?

Definition at line 277 of file gnunet-service-transport.c.

◆ MAX_ADDRESS_VALID_UNTIL

#define MAX_ADDRESS_VALID_UNTIL    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MONTHS, 1)

When do we forget an invalid address for sure?

Definition at line 282 of file gnunet-service-transport.c.

◆ ADDRESS_VALIDATION_LIFETIME

#define ADDRESS_VALIDATION_LIFETIME    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)

How long do we consider an address valid if we just checked?

Definition at line 288 of file gnunet-service-transport.c.

◆ MIN_DELAY_ADDRESS_VALIDATION

#define MIN_DELAY_ADDRESS_VALIDATION   GNUNET_TIME_UNIT_MILLISECONDS

What is the maximum frequency at which we do address validation? A random value between 0 and this value is added when scheduling the validation_task (both to ensure we do not validate too often, and to randomize a bit).

Definition at line 297 of file gnunet-service-transport.c.

◆ VALIDATION_RTT_BUFFER_FACTOR

#define VALIDATION_RTT_BUFFER_FACTOR   3

How many network RTTs before an address validation expires should we begin trying to revalidate? (Note that the RTT used here is the one that we experienced during the last validation, not necessarily the latest RTT observed).

Definition at line 305 of file gnunet-service-transport.c.

◆ COMMUNICATOR_TOTAL_QUEUE_LIMIT

#define COMMUNICATOR_TOTAL_QUEUE_LIMIT   512

How many messages can we have pending for a given communicator process before we start to throttle that communicator?

Used if a communicator might be CPU-bound and cannot handle the traffic.

Definition at line 313 of file gnunet-service-transport.c.

◆ QUEUE_LENGTH_LIMIT

#define QUEUE_LENGTH_LIMIT   32

How many messages can we have pending for a given queue (queue to a particular peer via a communicator) process before we start to throttle that queue?

Definition at line 320 of file gnunet-service-transport.c.

◆ QUEUE_ENTRY_TIMEOUT

#define QUEUE_ENTRY_TIMEOUT    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS, 5)

Definition at line 325 of file gnunet-service-transport.c.

◆ RTT_DIFF

Difference of the average RTT for the DistanceVector calculate by us and the target we are willing to accept for starting the burst.

Definition at line 332 of file gnunet-service-transport.c.

Typedef Documentation

◆ DVMessageHandler

typedef void(* DVMessageHandler) (void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)

Function to call to further operate on the now DV encapsulated message hdr, forwarding it via next_hop under respect of options.

Parameters
clsclosure
next_hopnext hop of the DV path
hdrencapsulated message, technically a struct TransportDFBoxMessage
optionsoptions of the original message

Definition at line 5134 of file gnunet-service-transport.c.

Enumeration Type Documentation

◆ ClientType

enum ClientType

What type of client is the struct TransportClient about?

Enumerator
CT_NONE 

We do not know yet (client is fresh).

CT_CORE 

Is the CORE service, we need to forward traffic to it.

CT_MONITOR 

It is a monitor, forward monitor data.

CT_COMMUNICATOR 

It is a communicator, use for communication.

CT_APPLICATION 

"Application" telling us where to connect (i.e.

TOPOLOGY, DHT or CADET).

Definition at line 1022 of file gnunet-service-transport.c.

1023{
1027 CT_NONE = 0,
1028
1032 CT_CORE = 1,
1033
1037 CT_MONITOR = 2,
1038
1042 CT_COMMUNICATOR = 3,
1043
1047 CT_APPLICATION = 4
1048};
@ CT_APPLICATION
"Application" telling us where to connect (i.e.
@ CT_MONITOR
It is a monitor, forward monitor data.
@ CT_NONE
We do not know yet (client is fresh).
@ CT_CORE
Is the CORE service, we need to forward traffic to it.
@ CT_COMMUNICATOR
It is a communicator, use for communication.

◆ RouteMessageOptions

Which transmission options are allowable for transmission? Interpreted bit-wise!

Enumerator
RMO_NONE 

Only confirmed, non-DV direct neighbours.

RMO_DV_ALLOWED 

We are allowed to use DV routing for this hdr.

RMO_UNCONFIRMED_ALLOWED 

We are allowed to use unconfirmed queues or DV routes for this message.

RMO_ANYTHING_GOES 

Reliable and unreliable, DV and non-DV are all acceptable.

RMO_REDUNDANT 

If we have multiple choices, it is OK to send this message over multiple channels at the same time to improve loss tolerance.

(We do at most 2 transmissions.)

Definition at line 1055 of file gnunet-service-transport.c.

1056{
1060 RMO_NONE = 0,
1061
1065 RMO_DV_ALLOWED = 1,
1066
1071
1076
1082 RMO_REDUNDANT = 4
1083};
@ RMO_UNCONFIRMED_ALLOWED
We are allowed to use unconfirmed queues or DV routes for this message.
@ RMO_DV_ALLOWED
We are allowed to use DV routing for this hdr.
@ RMO_REDUNDANT
If we have multiple choices, it is OK to send this message over multiple channels at the same time to...
@ RMO_NONE
Only confirmed, non-DV direct neighbours.
@ RMO_ANYTHING_GOES
Reliable and unreliable, DV and non-DV are all acceptable.

◆ PendingMessageType

Types of different pending messages.

Enumerator
PMT_CORE 

Ordinary message received from the CORE service.

PMT_FRAGMENT_BOX 

Fragment box.

PMT_RELIABILITY_BOX 

Reliability box.

PMT_DV_BOX 

Pending message created during forward_dv_box().

Definition at line 2205 of file gnunet-service-transport.c.

2206{
2210 PMT_CORE = 0,
2211
2215 PMT_FRAGMENT_BOX = 1,
2216
2221
2225 PMT_DV_BOX = 3
2226};
@ PMT_FRAGMENT_BOX
Fragment box.
@ PMT_DV_BOX
Pending message created during forward_dv_box().
@ PMT_CORE
Ordinary message received from the CORE service.
@ PMT_RELIABILITY_BOX
Reliability box.

Function Documentation

◆ get_age()

static unsigned int get_age ( )
static

Get an offset into the transmission history buffer for struct PerformanceData.

Note that the caller must perform the required modulo GOODPUT_AGING_SLOTS operation before indexing into the array!

An 'age' lasts 15 minute slots.

Returns
current age of the world

Definition at line 3081 of file gnunet-service-transport.c.

3082{
3083 struct GNUNET_TIME_Absolute now;
3084
3085 now = GNUNET_TIME_absolute_get ();
3086 return now.abs_value_us / GNUNET_TIME_UNIT_MINUTES.rel_value_us / 15;
3087}
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:111
#define GNUNET_TIME_UNIT_MINUTES
One minute.
Time for absolute times used by GNUnet, in microseconds.

References GNUNET_TIME_Absolute::abs_value_us, GNUNET_TIME_absolute_get(), and GNUNET_TIME_UNIT_MINUTES.

Referenced by update_performance_data().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_incoming_request()

static void free_incoming_request ( struct IncomingRequest ir)
static

Release ir data structure.

Parameters
irdata structure to release

Definition at line 3096 of file gnunet-service-transport.c.

3097{
3099 GNUNET_assert (ir_total > 0);
3100 ir_total--;
3101 if (NULL != ir->nc)
3103 ir->nc = NULL;
3104 GNUNET_free (ir);
3105}
static struct IncomingRequest * ir_tail
Tail of DLL starting at ir_head.
static unsigned int ir_total
Length of the DLL starting at ir_head.
static struct IncomingRequest * ir_head
List of incoming connections where we are trying to get a connection back established.
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_free(ptr)
Wrapper around free.
void GNUNET_PEERSTORE_monitor_stop(struct GNUNET_PEERSTORE_Monitor *zm)
Stop monitoring.
struct GNUNET_PEERSTORE_Monitor * nc
Notify context for new HELLOs.

References GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_free, GNUNET_PEERSTORE_monitor_stop(), ir_head, ir_tail, ir_total, and IncomingRequest::nc.

Referenced by do_shutdown(), and handle_validation_challenge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_pending_acknowledgement()

static void free_pending_acknowledgement ( struct PendingAcknowledgement pa)
static

Release pa data structure.

Parameters
padata structure to release

Definition at line 3114 of file gnunet-service-transport.c.

3115{
3116 struct Queue *q = pa->queue;
3117 struct PendingMessage *pm = pa->pm;
3118 struct DistanceVectorHop *dvh = pa->dvh;
3119
3121 "free_pending_acknowledgement\n");
3122 if (NULL != q)
3123 {
3124 GNUNET_CONTAINER_MDLL_remove (queue, q->pa_head, q->pa_tail, pa);
3125 pa->queue = NULL;
3126 }
3127 if (NULL != pm)
3128 {
3130 "remove pa from message\n");
3132 "remove pa from message %" PRIu64 "\n",
3133 pm->logging_uuid);
3135 "remove pa from message %u\n",
3136 pm->pmt);
3138 "remove pa from message %s\n",
3140 GNUNET_CONTAINER_MDLL_remove (pm, pm->pa_head, pm->pa_tail, pa);
3141 pa->pm = NULL;
3142 }
3143 if (NULL != dvh)
3144 {
3145 GNUNET_CONTAINER_MDLL_remove (dvh, dvh->pa_head, dvh->pa_tail, pa);
3146 pa->queue = NULL;
3147 }
3150 &pa->ack_uuid.value,
3151 pa));
3152 GNUNET_free (pa);
3153}
static struct GNUNET_REVOCATION_Query * q
Handle for revocation query.
static struct GNUNET_CONTAINER_MultiUuidmap * pending_acks
Map of pending acknowledgements, mapping struct AcknowledgementUUID to a struct PendingAcknowledgemen...
static struct GNUNET_TRANSPORT_PluginMonitor * pm
Handle if we are monitoring plugin session activity.
static void queue(const char *hostname)
Add hostname to the list of requests to be made.
#define GNUNET_CONTAINER_MDLL_remove(mdll, head, tail, element)
Remove an element from a MDLL.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multiuuidmap_remove(struct GNUNET_CONTAINER_MultiUuidmap *map, const struct GNUNET_Uuid *key, const void *value)
Remove the given key-value pair from the map.
#define GNUNET_log(kind,...)
@ GNUNET_YES
const char * GNUNET_uuid2s(const struct GNUNET_Uuid *uuid)
Convert a UUID to a string (for printing debug messages).
@ GNUNET_ERROR_TYPE_DEBUG
struct GNUNET_Uuid value
The UUID value.
One possible hop towards a DV target.
struct PendingAcknowledgement * pa_head
Head of DLL of PAs that used our path.
struct PendingAcknowledgement * pa_tail
Tail of DLL of PAs that used our path.
struct AcknowledgementUUIDP ack_uuid
Unique identifier for this transmission operation.
struct PendingMessage * pm
Message that was transmitted, may be NULL if the message was ACKed via another channel.
struct Queue * queue
Queue used for transmission, NULL if the queue has been destroyed (which may happen before we get an ...
struct DistanceVectorHop * dvh
Distance vector path chosen for this transmission, NULL if transmission was to a direct neighbour OR ...
List containing all messages that are yet to be send.
Handle for a queue.

References PendingAcknowledgement::ack_uuid, PendingAcknowledgement::dvh, GNUNET_assert, GNUNET_CONTAINER_MDLL_remove, GNUNET_CONTAINER_multiuuidmap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_uuid2s(), GNUNET_YES, DistanceVectorHop::pa_head, DistanceVectorHop::pa_tail, pending_acks, PendingAcknowledgement::pm, pm, q, queue(), PendingAcknowledgement::queue, and AcknowledgementUUIDP::value.

Referenced by free_pending_ack_cb(), and handle_acknowledged().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_fragment_tree()

static void free_fragment_tree ( struct PendingMessage root)
static

Free fragment tree below root, excluding root itself.

FIXME: this does NOT seem to have the intended semantics based on how this is called. Seems we generally DO expect root to be free'ed itself as well!

Parameters
rootroot of the tree to free

Definition at line 3165 of file gnunet-service-transport.c.

3166{
3167 struct PendingMessage *frag;
3168
3169 while (NULL != (frag = root->head_frag))
3170 {
3171 struct PendingAcknowledgement *pa;
3172
3173 free_fragment_tree (frag);
3174 while (NULL != (pa = frag->pa_head))
3175 {
3176 GNUNET_CONTAINER_MDLL_remove (pm, frag->pa_head, frag->pa_tail, pa);
3177 pa->pm = NULL;
3178 }
3179 GNUNET_CONTAINER_MDLL_remove (frag, root->head_frag, root->tail_frag, frag);
3180 if (NULL != frag->qe)
3181 {
3182 GNUNET_assert (frag == frag->qe->pm);
3183 frag->qe->pm = NULL;
3184 }
3186 "Free frag %p\n",
3187 frag);
3188 GNUNET_free (frag);
3189 }
3190}
static void free_fragment_tree(struct PendingMessage *root)
Free fragment tree below root, excluding root itself.
Data structure kept when we are waiting for an acknowledgement.
struct PendingMessage * tail_frag
Tail of a MDLL of fragments created for this core message.
struct QueueEntry * qe
Set to non-NULL value if this message is currently being given to a communicator and we are awaiting ...
struct PendingMessage * head_frag
Head of a MDLL of fragments created for this core message.
struct PendingAcknowledgement * pa_tail
Tail of DLL of PAs for this pending message.
struct PendingAcknowledgement * pa_head
Head of DLL of PAs for this pending message.
struct PendingMessage * pm
Pending message this entry is for, or NULL for none.

References free_fragment_tree(), GNUNET_assert, GNUNET_CONTAINER_MDLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, PendingMessage::head_frag, PendingMessage::pa_head, PendingMessage::pa_tail, PendingAcknowledgement::pm, QueueEntry::pm, pm, PendingMessage::qe, and PendingMessage::tail_frag.

Referenced by free_fragment_tree(), and free_pending_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_pending_message()

static void free_pending_message ( struct PendingMessage pm)
static

Release memory associated with pm and remove pm from associated data structures.

pm must be a top-level pending message and not a fragment in the tree. The entire tree is freed (if applicable).

Parameters
pmthe pending message to free

Definition at line 3201 of file gnunet-service-transport.c.

3202{
3203 struct TransportClient *tc = pm->client;
3204 struct VirtualLink *vl = pm->vl;
3205 struct PendingAcknowledgement *pa;
3206
3208 "Freeing pm %p\n",
3209 pm);
3210 if (NULL != tc)
3211 {
3213 tc->details.core.pending_msg_head,
3214 tc->details.core.pending_msg_tail,
3215 pm);
3216 }
3217 if ((NULL != vl) && (NULL == pm->frag_parent))
3218 {
3220 "Removing pm %" PRIu64 "\n",
3221 pm->logging_uuid);
3223 vl->pending_msg_head,
3224 vl->pending_msg_tail,
3225 pm);
3226 }
3227 else if (NULL != pm->frag_parent && PMT_DV_BOX != pm->pmt)
3228 {
3229 struct PendingMessage *root = pm->frag_parent;
3230
3231 while (NULL != root->frag_parent && PMT_DV_BOX != root->pmt)
3232 root = root->frag_parent;
3233
3234 root->frag_count--;
3235 }
3236 while (NULL != (pa = pm->pa_head))
3237 {
3238 if (NULL == pa)
3240 "free pending pa null\n");
3241 if (NULL == pm->pa_tail)
3243 "free pending pa_tail null\n");
3244 if (NULL == pa->prev_pa)
3246 "free pending pa prev null\n");
3247 if (NULL == pa->next_pa)
3249 "free pending pa next null\n");
3250 GNUNET_CONTAINER_MDLL_remove (pm, pm->pa_head, pm->pa_tail, pa);
3251 pa->pm = NULL;
3252 }
3253
3255 if (NULL != pm->qe)
3256 {
3257 GNUNET_assert (pm == pm->qe->pm);
3258 pm->qe->pm = NULL;
3259 }
3260 if (NULL != pm->bpm)
3261 {
3262 free_fragment_tree (pm->bpm);
3263 if (NULL != pm->bpm->qe)
3264 {
3265 struct QueueEntry *qe = pm->bpm->qe;
3266
3267 qe->pm = NULL;
3268 }
3269 GNUNET_free (pm->bpm);
3270 }
3271
3272 GNUNET_free (pm);
3274 "Freeing pm done\n");
3275}
static struct GNUNET_DATASTORE_QueueEntry * qe
Current operation.
static struct GNUNET_SCHEDULER_TaskContext tc
Task context of the current task.
Definition: scheduler.c:431
struct PendingAcknowledgement * next_pa
Pointers for the DLL of all pending acknowledgements.
struct PendingAcknowledgement * prev_pa
Pointers for the DLL of all pending acknowledgements.
struct PendingMessage * frag_parent
Our parent in the fragmentation tree.
enum PendingMessageType pmt
Type of the pending message.
uint16_t frag_count
How many fragments do we have?
Entry identifying transmission in one of our struct Queue which still awaits an ACK.
Client connected to the transport service.

References PendingMessage::frag_count, PendingMessage::frag_parent, free_fragment_tree(), GNUNET_assert, GNUNET_CONTAINER_MDLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, PendingAcknowledgement::next_pa, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, PendingAcknowledgement::pm, pm, PendingMessage::pmt, PMT_DV_BOX, PendingAcknowledgement::prev_pa, qe, and tc.

Referenced by client_send_response(), completed_pending_message(), free_virtual_link(), and transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_reassembly_context()

static void free_reassembly_context ( struct ReassemblyContext rc)
static

Free rc.

Parameters
rcdata structure to free

Definition at line 3284 of file gnunet-service-transport.c.

3285{
3286 struct VirtualLink *vl = rc->virtual_link;
3287
3291 rc->msg_uuid.uuid,
3292 rc));
3293 GNUNET_free (rc);
3294}
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multihashmap32_remove(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, const void *value)
Remove the given key-value pair from the map.
void * GNUNET_CONTAINER_heap_remove_node(struct GNUNET_CONTAINER_HeapNode *node)
Removes a node from the heap.
@ GNUNET_OK
uint64_t uuid
Unique value, generated by incrementing the message_uuid_ctr of struct Neighbour.
struct GNUNET_CONTAINER_HeapNode * hn
Entry in the reassembly heap (sorted by expiration).
struct MessageUUIDP msg_uuid
Original message ID for of the message that all the fragments belong to.
struct VirtualLink * virtual_link
Which neighbour is this context for?

References GNUNET_assert, GNUNET_CONTAINER_heap_remove_node(), GNUNET_CONTAINER_multihashmap32_remove(), GNUNET_free, GNUNET_OK, ReassemblyContext::hn, ReassemblyContext::msg_uuid, VirtualLink::reassembly_map, MessageUUIDP::uuid, and ReassemblyContext::virtual_link.

Referenced by free_reassembly_cb(), handle_fragment_box(), and reassembly_cleanup_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reassembly_cleanup_task()

static void reassembly_cleanup_task ( void *  cls)
static

Task run to clean up reassembly context of a neighbour that have expired.

Parameters
clsa struct Neighbour

Definition at line 3303 of file gnunet-service-transport.c.

3304{
3305 struct VirtualLink *vl = cls;
3306 struct ReassemblyContext *rc;
3307
3308 vl->reassembly_timeout_task = NULL;
3309 while (NULL != (rc = GNUNET_CONTAINER_heap_peek (vl->reassembly_heap)))
3310 {
3312 .rel_value_us)
3313 {
3315 continue;
3316 }
3321 vl);
3322 return;
3323 }
3324}
static void reassembly_cleanup_task(void *cls)
Task run to clean up reassembly context of a neighbour that have expired.
static void free_reassembly_context(struct ReassemblyContext *rc)
Free rc.
void * GNUNET_CONTAINER_heap_peek(const struct GNUNET_CONTAINER_Heap *heap)
Get element stored at the root of heap.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_at(struct GNUNET_TIME_Absolute at, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run at the specified time.
Definition: scheduler.c:1254
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_remaining(struct GNUNET_TIME_Absolute future)
Given a timestamp in the future, how much time remains until then?
Definition: time.c:406
uint64_t rel_value_us
The actual value.
Information we keep for a message that we are reassembling.
struct GNUNET_TIME_Absolute reassembly_timeout
At what time will we give up reassembly of this message?

References free_reassembly_context(), GNUNET_assert, GNUNET_CONTAINER_heap_peek(), GNUNET_SCHEDULER_add_at(), GNUNET_TIME_absolute_get_remaining(), reassembly_cleanup_task(), VirtualLink::reassembly_heap, ReassemblyContext::reassembly_timeout, VirtualLink::reassembly_timeout_task, and GNUNET_TIME_Relative::rel_value_us.

Referenced by handle_fragment_box(), and reassembly_cleanup_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_reassembly_cb()

static int free_reassembly_cb ( void *  cls,
uint32_t  key,
void *  value 
)
static

function called to free_reassembly_context().

Parameters
clsNULL
keyunused
valuea struct ReassemblyContext to free
Returns
GNUNET_OK (continue iteration)

Definition at line 3336 of file gnunet-service-transport.c.

3337{
3338 struct ReassemblyContext *rc = value;
3339
3340 (void) cls;
3341 (void) key;
3343 return GNUNET_OK;
3344}
struct GNUNET_HashCode key
The key used in the DHT.
static char * value
Value of the record to add/remove.

References free_reassembly_context(), GNUNET_OK, key, and value.

Referenced by free_virtual_link().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_virtual_link()

static void free_virtual_link ( struct VirtualLink vl)
static

Free virtual link.

Parameters
vllink data to free

Definition at line 3353 of file gnunet-service-transport.c.

3354{
3355 struct PendingMessage *pm;
3356 struct CoreSentContext *csc;
3357
3359 "free virtual link %p\n",
3360 vl);
3361
3362 if (NULL != vl->reassembly_map)
3363 {
3366 NULL);
3368 vl->reassembly_map = NULL;
3370 vl->reassembly_heap = NULL;
3371 }
3372 if (NULL != vl->reassembly_timeout_task)
3373 {
3376 }
3377 while (NULL != (pm = vl->pending_msg_head))
3381 if (NULL != vl->visibility_task)
3382 {
3384 vl->visibility_task = NULL;
3385 }
3386 if (NULL != vl->fc_retransmit_task)
3387 {
3389 vl->fc_retransmit_task = NULL;
3390 }
3391 while (NULL != (csc = vl->csc_head))
3392 {
3394 GNUNET_assert (vl == csc->vl);
3395 csc->vl = NULL;
3396 }
3397 GNUNET_break (NULL == vl->n);
3398 GNUNET_break (NULL == vl->dv);
3399 GNUNET_free (vl);
3400}
static void free_pending_message(struct PendingMessage *pm)
Release memory associated with pm and remove pm from associated data structures.
static int free_reassembly_cb(void *cls, uint32_t key, void *value)
function called to free_reassembly_context().
static struct GNUNET_CONTAINER_MultiPeerMap * links
Map from PIDs to struct VirtualLink entries describing links CORE knows to exist.
void GNUNET_CONTAINER_multihashmap32_destroy(struct GNUNET_CONTAINER_MultiHashMap32 *map)
Destroy a 32-bit key hash map.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MultiHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multipeermap_remove(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, const void *value)
Remove the given key-value pair from the map.
void GNUNET_CONTAINER_heap_destroy(struct GNUNET_CONTAINER_Heap *heap)
Destroys the heap.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:980
Closure for core_env_sent_cb.
struct VirtualLink * vl
Virtual link this is about.

References VirtualLink::csc_head, VirtualLink::csc_tail, VirtualLink::dv, VirtualLink::fc_retransmit_task, free_pending_message(), free_reassembly_cb(), GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_heap_destroy(), GNUNET_CONTAINER_multihashmap32_destroy(), GNUNET_CONTAINER_multihashmap32_iterate(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_SCHEDULER_cancel(), GNUNET_YES, links, VirtualLink::n, VirtualLink::pending_msg_head, pm, VirtualLink::reassembly_heap, VirtualLink::reassembly_map, VirtualLink::reassembly_timeout_task, VirtualLink::target, VirtualLink::visibility_task, and CoreSentContext::vl.

Referenced by check_link_down(), free_dv_route(), and free_neighbour().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_validation_state()

static void free_validation_state ( struct ValidationState vs)
static

Free validation state.

Parameters
vsvalidation state to free

Definition at line 3409 of file gnunet-service-transport.c.

3410{
3411 if (NULL != vs->revalidation_task)
3412 {
3413 GNUNET_SCHEDULER_cancel (vs->revalidation_task);
3414 vs->revalidation_task = NULL;
3415 }
3416 /*memcpy (&hkey,
3417 &hc,
3418 sizeof (hkey));*/
3420 "Remove key %s for address %s map size %u contains %u during freeing state\n",
3421 GNUNET_h2s (&vs->hc),
3422 vs->address,
3425 &vs->hc));
3428 GNUNET_YES ==
3431 vs->hn = NULL;
3432 if (NULL != vs->sc)
3433 {
3435 "store cancel\n");
3437 vs->sc = NULL;
3438 }
3439 GNUNET_free (vs->address);
3440 GNUNET_free (vs);
3441}
static struct GNUNET_CONTAINER_MultiHashMap * revalidation_map
Map from addresses to struct ValidationState entries describing addresses we are aware of and their v...
static struct GNUNET_CONTAINER_MultiPeerMap * validation_map
Map from PIDs to struct ValidationState entries describing addresses we are aware of and their validi...
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multihashmap_contains(const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
Check if the map contains any value under the given key (including values that are NULL).
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multihashmap_remove(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, const void *value)
Remove the given key-value pair from the map.
unsigned int GNUNET_CONTAINER_multihashmap_size(const struct GNUNET_CONTAINER_MultiHashMap *map)
Get the number of key-value pairs in the map.
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
void GNUNET_PEERSTORE_store_cancel(struct GNUNET_PEERSTORE_StoreContext *sc)
Cancel a store request.
struct GNUNET_PeerIdentity pid
For which peer is address to be validated (or possibly valid)? Serves as key in the validation_map.

References GNUNET_assert, GNUNET_CONTAINER_heap_remove_node(), GNUNET_CONTAINER_multihashmap_contains(), GNUNET_CONTAINER_multihashmap_remove(), GNUNET_CONTAINER_multihashmap_size(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_log, GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, ValidationState::pid, revalidation_map, and validation_map.

Referenced by free_validation_state_cb(), and validation_start_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ lookup_neighbour()

static struct Neighbour * lookup_neighbour ( const struct GNUNET_PeerIdentity pid)
static

Lookup neighbour for peer pid.

Parameters
pidneighbour to look for
Returns
NULL if we do not have this peer as a neighbour

Definition at line 3451 of file gnunet-service-transport.c.

3452{
3454}
static struct GNUNET_CONTAINER_MultiPeerMap * neighbours
Map from PIDs to struct Neighbour entries.
static struct GNUNET_PeerIdentity pid
Identity of the peer we transmit to / connect to.
void * GNUNET_CONTAINER_multipeermap_get(const struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key)
Given a key find a value in the map matching the key.

References GNUNET_CONTAINER_multipeermap_get(), neighbours, and pid.

Referenced by find_queue(), forward_dv_learn(), handle_add_queue_message(), handle_communicator_backchannel(), handle_dv_box(), handle_dv_learn(), handle_validation_challenge(), learn_dv_path(), route_control_message_without_fc(), and transmit_cummulative_ack_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ lookup_virtual_link()

static struct VirtualLink * lookup_virtual_link ( const struct GNUNET_PeerIdentity pid)
static

Lookup virtual link for peer pid.

Parameters
pidvirtual link to look for
Returns
NULL if we do not have this peer as a virtual link

Definition at line 3464 of file gnunet-service-transport.c.

3465{
3467}

References GNUNET_CONTAINER_multipeermap_get(), links, and pid.

Referenced by activate_core_visible_dv_path(), check_vl_transmission(), forward_dv_learn(), free_queue(), handle_client_recv_ok(), handle_client_send(), handle_communicator_backchannel(), handle_flow_control(), handle_fragment_box(), handle_raw_message(), handle_validation_challenge(), handle_validation_response(), and transmit_cummulative_ack_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_distance_vector_hop()

static void free_distance_vector_hop ( struct DistanceVectorHop dvh)
static

Free a dvh.

Callers MAY want to check if this was the last path to the target, and if so call free_dv_route to also free the associated DV entry in dv_routes (if not, the associated scheduler job should eventually take care of it).

Parameters
dvhhop to free

Definition at line 3513 of file gnunet-service-transport.c.

3514{
3515 struct Neighbour *n = dvh->next_hop;
3516 struct DistanceVector *dv = dvh->dv;
3517 struct PendingAcknowledgement *pa;
3518
3519 while (NULL != (pa = dvh->pa_head))
3520 {
3522 pa->dvh = NULL;
3523 }
3524 GNUNET_CONTAINER_MDLL_remove (neighbour, n->dv_head, n->dv_tail, dvh);
3526 GNUNET_free (dvh);
3527}
struct Neighbour * next_hop
What would be the next hop to target?
struct DistanceVector * dv
Distance vector entry this hop belongs with.
Entry in our dv_routes table, representing a (set of) distance vector routes to a particular peer.
struct DistanceVectorHop * dv_head
Known paths to target.
struct DistanceVectorHop * dv_tail
Known paths to target.
A neighbour that at least one communicator is connected to.
struct DistanceVectorHop * dv_tail
Tail of MDLL of DV hops that have this neighbour as next hop.
struct DistanceVectorHop * dv_head
Head of MDLL of DV hops that have this neighbour as next hop.

References DistanceVectorHop::dv, DistanceVector::dv_head, Neighbour::dv_head, DistanceVector::dv_tail, Neighbour::dv_tail, PendingAcknowledgement::dvh, GNUNET_CONTAINER_MDLL_remove, GNUNET_free, DistanceVectorHop::next_hop, DistanceVectorHop::pa_head, and DistanceVectorHop::pa_tail.

Referenced by free_dv_route(), free_neighbour(), and path_cleanup_cb().

Here is the caller graph for this function:

◆ check_link_down()

static void check_link_down ( void *  cls)
static

Task run to check whether the hops of the cls still are validated, or if we need to core about disconnection.

Parameters
clsa struct VirtualLink

Definition at line 3955 of file gnunet-service-transport.c.

3956{
3957 struct VirtualLink *vl = cls;
3958 struct DistanceVector *dv = vl->dv;
3959 struct Neighbour *n = vl->n;
3960 struct GNUNET_TIME_Absolute dvh_timeout;
3961 struct GNUNET_TIME_Absolute q_timeout;
3962
3964 "Checking if link is down\n");
3965 vl->visibility_task = NULL;
3966 dvh_timeout = GNUNET_TIME_UNIT_ZERO_ABS;
3967 if (NULL != dv)
3968 {
3969 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
3970 pos = pos->next_dv)
3971 dvh_timeout = GNUNET_TIME_absolute_max (dvh_timeout,
3972 pos->path_valid_until);
3973 if (0 == GNUNET_TIME_absolute_get_remaining (dvh_timeout).rel_value_us)
3974 {
3975 vl->dv->vl = NULL;
3976 vl->dv = NULL;
3977 }
3978 }
3979 q_timeout = GNUNET_TIME_UNIT_ZERO_ABS;
3980 for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour)
3981 q_timeout = GNUNET_TIME_absolute_max (q_timeout, q->validated_until);
3982 if (0 == GNUNET_TIME_absolute_get_remaining (q_timeout).rel_value_us)
3983 {
3984 vl->n->vl = NULL;
3985 vl->n = NULL;
3986 }
3987 if ((NULL == vl->n) && (NULL == vl->dv))
3988 {
3990 free_virtual_link (vl);
3991 return;
3992 }
3993 vl->visibility_task =
3994 GNUNET_SCHEDULER_add_at (GNUNET_TIME_absolute_max (q_timeout, dvh_timeout),
3996 vl);
3997}
static void cores_send_disconnect_info(const struct GNUNET_PeerIdentity *pid)
Send message to CORE clients that we lost a connection.
static void free_virtual_link(struct VirtualLink *vl)
Free virtual link.
static void check_link_down(void *cls)
Task run to check whether the hops of the cls still are validated, or if we need to core about discon...
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_max(struct GNUNET_TIME_Absolute t1, struct GNUNET_TIME_Absolute t2)
Return the maximum of two absolute time values.
Definition: time.c:368
#define GNUNET_TIME_UNIT_ZERO_ABS
Absolute time zero.
struct DistanceVectorHop * next_dv
Kept in a MDLL, sorted by timeout.
struct VirtualLink * vl
Do we have a confirmed working queue and are thus visible to CORE? If so, this is the virtual link,...
struct VirtualLink * vl
Do we have a confirmed working queue and are thus visible to CORE? If so, this is the virtual link,...
struct Queue * queue_head
Head of DLL of queues to this peer.

References check_link_down(), cores_send_disconnect_info(), VirtualLink::dv, DistanceVector::dv_head, free_virtual_link(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_SCHEDULER_add_at(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_max(), GNUNET_TIME_UNIT_ZERO_ABS, VirtualLink::n, DistanceVectorHop::next_dv, q, Neighbour::queue_head, VirtualLink::target, VirtualLink::visibility_task, DistanceVector::vl, and Neighbour::vl.

Referenced by activate_core_visible_dv_path(), check_link_down(), free_dv_route(), free_neighbour(), free_queue(), and handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ cores_send_disconnect_info()

static void cores_send_disconnect_info ( const struct GNUNET_PeerIdentity pid)
static

Send message to CORE clients that we lost a connection.

Parameters
pidpeer the connection was for

Definition at line 3546 of file gnunet-service-transport.c.

3547{
3549 "Informing CORE clients about disconnect from %s\n",
3550 GNUNET_i2s (pid));
3551 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3552 {
3553 struct GNUNET_MQ_Envelope *env;
3554 struct DisconnectInfoMessage *dim;
3555
3556 if (CT_CORE != tc->type)
3557 continue;
3559 dim->peer = *pid;
3560 GNUNET_MQ_send (tc->mq, env);
3561 }
3562}
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
static struct TransportClient * clients_head
Head of linked list of all clients to this service.
uint32_t dim
Definition: gnunet_pq_lib.h:3
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
void GNUNET_MQ_send(struct GNUNET_MQ_Handle *mq, struct GNUNET_MQ_Envelope *ev)
Send a message with the given message queue.
Definition: mq.c:305
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:76
#define GNUNET_MESSAGE_TYPE_TRANSPORT_DISCONNECT
Message from TRANSPORT notifying about a client that disconnected from us.
Message from the transport service to the library informing about disconnects.
Definition: transport.h:120

References clients_head, CT_CORE, dim, env, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_DISCONNECT, GNUNET_MQ_msg, GNUNET_MQ_send(), pid, and tc.

Referenced by check_link_down(), free_dv_route(), and free_neighbour().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_dv_route()

static void free_dv_route ( struct DistanceVector dv)
static

Free entry in dv_routes.

First frees all hops to the target, and if there are no entries left, frees dv as well.

Parameters
dvroute to free

Definition at line 3572 of file gnunet-service-transport.c.

3573{
3574 struct DistanceVectorHop *dvh;
3575
3576 while (NULL != (dvh = dv->dv_head))
3578 if (NULL == dv->dv_head)
3579 {
3580 struct VirtualLink *vl;
3581
3583 GNUNET_YES ==
3585 if (NULL != (vl = dv->vl))
3586 {
3587 GNUNET_assert (dv == vl->dv);
3588 vl->dv = NULL;
3589 if (NULL == vl->n)
3590 {
3592 free_virtual_link (vl);
3593 }
3594 else
3595 {
3598 }
3599 dv->vl = NULL;
3600 }
3601
3602 if (NULL != dv->timeout_task)
3603 {
3605 dv->timeout_task = NULL;
3606 }
3607 GNUNET_free (dv->km);
3608 GNUNET_free (dv);
3609 }
3610}
static void free_distance_vector_hop(struct DistanceVectorHop *dvh)
Free a dvh.
static struct GNUNET_CONTAINER_MultiPeerMap * dv_routes
Map from PIDs to struct DistanceVector entries describing known paths to the peer.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_now(GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run as soon as possible.
Definition: scheduler.c:1304
struct GNUNET_ShortHashCode * km
Master secret for the setup of the Key material for the backchannel.
struct GNUNET_PeerIdentity target
To which peer is this a route?
struct GNUNET_SCHEDULER_Task * timeout_task
Task scheduled to purge expired paths from dv_head MDLL.

References check_link_down(), cores_send_disconnect_info(), VirtualLink::dv, DistanceVectorHop::dv, DistanceVector::dv_head, dv_routes, free_distance_vector_hop(), free_virtual_link(), GNUNET_assert, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_free, GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, DistanceVector::km, VirtualLink::n, DistanceVector::target, DistanceVector::timeout_task, VirtualLink::visibility_task, and DistanceVector::vl.

Referenced by free_dv_routes_cb(), free_neighbour(), and path_cleanup_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ notify_monitor()

static void notify_monitor ( struct TransportClient tc,
const struct GNUNET_PeerIdentity peer,
const char *  address,
enum GNUNET_NetworkType  nt,
const struct MonitorEvent me 
)
static

Notify monitor tc about an event.

That tc cares about the event has already been checked.

Send tc information in me about a peer's status with respect to some address to all monitors that care.

Parameters
tcmonitor to inform
peerpeer the information is about
addressaddress the information is about
ntnetwork type associated with address
medetailed information to transmit

Definition at line 3627 of file gnunet-service-transport.c.

3632{
3633 struct GNUNET_MQ_Envelope *env;
3635 size_t addr_len = strlen (address) + 1;
3636
3638 addr_len,
3640 md->nt = htonl ((uint32_t) nt);
3641 md->peer = *peer;
3642 md->last_validation = GNUNET_TIME_absolute_hton (me->last_validation);
3643 md->valid_until = GNUNET_TIME_absolute_hton (me->valid_until);
3644 md->next_validation = GNUNET_TIME_absolute_hton (me->next_validation);
3645 md->rtt = GNUNET_TIME_relative_hton (me->rtt);
3646 md->cs = htonl ((uint32_t) me->cs);
3647 md->num_msg_pending = htonl (me->num_msg_pending);
3648 md->num_bytes_pending = htonl (me->num_bytes_pending);
3649 memcpy (&md[1], address, addr_len);
3650 GNUNET_MQ_send (tc->mq, env);
3651}
static char * address
GNS address for this phone.
static GNUNET_NETWORK_STRUCT_END struct GNUNET_PeerIdentity me
Our own peer identity.
static struct GNUNET_NAT_AUTO_Test * nt
Handle to a NAT test operation.
#define GNUNET_MQ_msg_extra(mvar, esize, type)
Allocate an envelope, with extra space allocated after the space needed by the message struct.
Definition: gnunet_mq_lib.h:61
#define GNUNET_MESSAGE_TYPE_TRANSPORT_MONITOR_DATA
Message sent to indicate to a monitor about events.
struct GNUNET_TIME_RelativeNBO GNUNET_TIME_relative_hton(struct GNUNET_TIME_Relative a)
Convert relative time to network byte order.
Definition: time.c:620
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition: time.c:640
uint32_t num_msg_pending
Messages pending (in NBO).
Definition: transport.h:766
struct GNUNET_PeerIdentity peer
Target identifier.
Definition: transport.h:744
struct GNUNET_TIME_AbsoluteNBO valid_until
Definition: transport.h:750
struct GNUNET_TIME_AbsoluteNBO last_validation
Definition: transport.h:749
uint32_t num_bytes_pending
Bytes pending (in NBO).
Definition: transport.h:771
struct GNUNET_TIME_AbsoluteNBO next_validation
Definition: transport.h:751
uint32_t nt
Network type (an enum GNUNET_NetworkType in NBO).
Definition: transport.h:739
struct GNUNET_TIME_RelativeNBO rtt
Current round-trip time estimate.
Definition: transport.h:756
uint32_t cs
Connection status (in NBO).
Definition: transport.h:761

References address, GNUNET_TRANSPORT_MonitorData::cs, env, GNUNET_MESSAGE_TYPE_TRANSPORT_MONITOR_DATA, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_relative_hton(), GNUNET_TRANSPORT_MonitorData::last_validation, me, GNUNET_TRANSPORT_MonitorData::next_validation, nt, GNUNET_TRANSPORT_MonitorData::nt, GNUNET_TRANSPORT_MonitorData::num_bytes_pending, GNUNET_TRANSPORT_MonitorData::num_msg_pending, GNUNET_TRANSPORT_MonitorData::peer, GNUNET_TRANSPORT_MonitorData::rtt, tc, and GNUNET_TRANSPORT_MonitorData::valid_until.

Referenced by notify_client_queues(), and notify_monitors().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ notify_monitors()

static void notify_monitors ( const struct GNUNET_PeerIdentity peer,
const char *  address,
enum GNUNET_NetworkType  nt,
const struct MonitorEvent me 
)
static

Send information in me about a peer's status with respect to some address to all monitors that care.

Parameters
peerpeer the information is about
addressaddress the information is about
ntnetwork type associated with address
medetailed information to transmit

Definition at line 3664 of file gnunet-service-transport.c.

3668{
3669 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3670 {
3671 if (CT_MONITOR != tc->type)
3672 continue;
3673 if (tc->details.monitor.one_shot)
3674 continue;
3675 if ((GNUNET_NO == GNUNET_is_zero (&tc->details.monitor.peer)) &&
3676 (0 != GNUNET_memcmp (&tc->details.monitor.peer, peer)))
3677 continue;
3678 notify_monitor (tc, peer, address, nt, me);
3679 }
3680}
static void notify_monitor(struct TransportClient *tc, const struct GNUNET_PeerIdentity *peer, const char *address, enum GNUNET_NetworkType nt, const struct MonitorEvent *me)
Notify monitor tc about an event.
#define GNUNET_is_zero(a)
Check that memory in a is all zeros.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
@ GNUNET_NO

References address, clients_head, CT_MONITOR, GNUNET_is_zero, GNUNET_memcmp, GNUNET_NO, me, notify_monitor(), nt, GNUNET_TRANSPORT_MonitorData::peer, and tc.

Referenced by free_queue(), and handle_add_queue_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ client_connect_cb()

static void * client_connect_cb ( void *  cls,
struct GNUNET_SERVICE_Client client,
struct GNUNET_MQ_Handle mq 
)
static

Called whenever a client connects.

Allocates our data structures associated with that client.

Parameters
clsclosure, NULL
clientidentification of the client
mqmessage queue for the client
Returns
our struct TransportClient

Definition at line 3693 of file gnunet-service-transport.c.

3696{
3697 struct TransportClient *tc;
3698
3699 (void) cls;
3700 tc = GNUNET_new (struct TransportClient);
3701 tc->client = client;
3702 tc->mq = mq;
3705 "Client %p of type %u connected\n",
3706 tc,
3707 tc->type);
3708 return tc;
3709}
struct GNUNET_MQ_Handle * mq
Definition: 003.c:5
static struct TransportClient * clients_tail
Tail of linked list of all clients to this service.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
#define GNUNET_new(type)
Allocate a struct or union of the given type.
struct GNUNET_SERVICE_Client * client
Handle to the client.

References TransportClient::client, clients_head, clients_tail, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_new, mq, and tc.

◆ remove_global_addresses()

static enum GNUNET_GenericReturnValue remove_global_addresses ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Definition at line 3713 of file gnunet-service-transport.c.

3716{
3717 struct TransportGlobalNattedAddress *tgna = value;
3718 (void) cls;
3719
3720 GNUNET_free (tgna);
3721
3722 return GNUNET_OK;
3723}

References GNUNET_free, GNUNET_OK, and value.

Referenced by free_neighbour().

Here is the caller graph for this function:

◆ free_neighbour()

static void free_neighbour ( struct Neighbour neighbour,
enum GNUNET_GenericReturnValue  drop_link 
)
static

Release memory used by neighbour.

Parameters
neighbourneighbour entry to free
drop_linkflag to decide whether to drop its virtual link

Definition at line 3733 of file gnunet-service-transport.c.

3735{
3736 struct DistanceVectorHop *dvh;
3737 struct VirtualLink *vl;
3738
3739 GNUNET_assert (NULL == neighbour->queue_head);
3742 &neighbour->pid,
3743 neighbour));
3745 "Freeing neighbour\n");
3748 NULL);
3750 while (NULL != (dvh = neighbour->dv_head))
3751 {
3752 struct DistanceVector *dv = dvh->dv;
3753
3755 if (NULL == dv->dv_head)
3756 free_dv_route (dv);
3757 }
3758 if (NULL != neighbour->get)
3759 {
3761 neighbour->get = NULL;
3762 }
3763 if (NULL != neighbour->sc)
3764 {
3766 "store cancel\n");
3767 GNUNET_PEERSTORE_store_cancel (neighbour->sc);
3768 neighbour->sc = NULL;
3769 }
3770 if (NULL != (vl = neighbour->vl))
3771 {
3772 GNUNET_assert (neighbour == vl->n);
3773 vl->n = NULL;
3774 if ((GNUNET_YES == drop_link) || (NULL == vl->dv))
3775 {
3778 }
3779 else
3780 {
3783 }
3784 neighbour->vl = NULL;
3785 }
3786 GNUNET_free (neighbour);
3787}
static enum GNUNET_GenericReturnValue remove_global_addresses(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
static void free_dv_route(struct DistanceVector *dv)
Free entry in dv_routes.
void GNUNET_CONTAINER_multipeermap_destroy(struct GNUNET_CONTAINER_MultiPeerMap *map)
Destroy a hash map.
int GNUNET_CONTAINER_multipeermap_iterate(struct GNUNET_CONTAINER_MultiPeerMap *map, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map.
void GNUNET_PEERSTORE_iteration_stop(struct GNUNET_PEERSTORE_IterateContext *ic)
Cancel an iteration.
struct GNUNET_CONTAINER_MultiPeerMap * natted_addresses
Map of struct TransportGlobalNattedAddress for this neighbour.
struct GNUNET_PEERSTORE_StoreContext * sc
Handle to a PEERSTORE store operation to store this pid's last_dv_learn_monotime.
struct GNUNET_PeerIdentity pid
Which peer is this about?
struct GNUNET_PEERSTORE_IterateContext * get
Handle for an operation to fetch last_dv_learn_monotime information from the PEERSTORE,...

References check_link_down(), cores_send_disconnect_info(), VirtualLink::dv, DistanceVectorHop::dv, DistanceVector::dv_head, Neighbour::dv_head, free_distance_vector_hop(), free_dv_route(), free_virtual_link(), Neighbour::get, GNUNET_assert, GNUNET_CONTAINER_multipeermap_destroy(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_PEERSTORE_iteration_stop(), GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, VirtualLink::n, Neighbour::natted_addresses, neighbours, Neighbour::pid, Neighbour::queue_head, remove_global_addresses(), Neighbour::sc, VirtualLink::target, VirtualLink::visibility_task, DistanceVector::vl, and Neighbour::vl.

Referenced by free_neighbour_cb(), and free_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ core_send_connect_info()

static void core_send_connect_info ( struct TransportClient tc,
const struct GNUNET_PeerIdentity pid 
)
static

Send message to CORE clients that we lost a connection.

Parameters
tcclient to inform (must be CORE client)
pidpeer the connection is for

Definition at line 3797 of file gnunet-service-transport.c.

3799{
3800 struct GNUNET_MQ_Envelope *env;
3801 struct ConnectInfoMessage *cim;
3802
3803 GNUNET_assert (CT_CORE == tc->type);
3805 cim->id = *pid;
3806 GNUNET_MQ_send (tc->mq, env);
3807}
#define GNUNET_MESSAGE_TYPE_TRANSPORT_CONNECT
Message from TRANSPORT notifying about a client that connected to us.
Message from the transport service to the library informing about neighbors.
Definition: transport.h:88
struct GNUNET_PeerIdentity id
Identity of the new neighbour.
Definition: transport.h:111

References CT_CORE, env, GNUNET_assert, GNUNET_MESSAGE_TYPE_TRANSPORT_CONNECT, GNUNET_MQ_msg, GNUNET_MQ_send(), ConnectInfoMessage::id, pid, and tc.

Referenced by cores_send_connect_info(), and notify_client_connect_info().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ cores_send_connect_info()

static void cores_send_connect_info ( const struct GNUNET_PeerIdentity pid)
static

Send message to CORE clients that we gained a connection.

Parameters
pidpeer the queue was for

Definition at line 3816 of file gnunet-service-transport.c.

3817{
3819 "Informing CORE clients about connection to %s\n",
3820 GNUNET_i2s (pid));
3821 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3822 {
3823 if (CT_CORE != tc->type)
3824 continue;
3826 }
3827}
static void core_send_connect_info(struct TransportClient *tc, const struct GNUNET_PeerIdentity *pid)
Send message to CORE clients that we lost a connection.

References clients_head, core_send_connect_info(), CT_CORE, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, pid, and tc.

Referenced by activate_core_visible_dv_path(), and handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ transmit_on_queue()

static void transmit_on_queue ( void *  cls)
static

We believe we are ready to transmit a message on a queue.

We believe we are ready to transmit a struct PendingMessage on a queue, the big question is which one! We need to see if there is one pending that is allowed by flow control and congestion control and (ideally) matches our queue's performance profile.

Gives the message to the communicator for transmission (updating the tracker, and re-scheduling itself if applicable).

Parameters
clsthe struct Queue to process transmissions for

If such a message is found, we give the message to the communicator for transmission (updating the tracker, and re-scheduling ourselves if applicable).

If no such message is found, the queue's idle field must be set to GNUNET_YES.

Parameters
clsthe struct Queue to process transmissions for

Definition at line 10993 of file gnunet-service-transport.c.

10994{
10995 struct Queue *queue = cls;
10996 struct Neighbour *n = queue->neighbour;
10998 struct PendingMessage *pm;
10999
11000 queue->transmit_task = NULL;
11001 if (NULL == n->vl)
11002 {
11004 "Virtual link `%s' is down, cannot have PM for queue `%s'\n",
11005 GNUNET_i2s (&n->pid),
11006 queue->address);
11007 queue->idle = GNUNET_YES;
11008 return;
11009 }
11010 memset (&sc, 0, sizeof(sc));
11011 select_best_pending_from_link (&sc, queue, n->vl, NULL, 0);
11012 if (NULL == sc.best)
11013 {
11014 /* Also look at DVH that have the n as first hop! */
11015 for (struct DistanceVectorHop *dvh = n->dv_head; NULL != dvh;
11016 dvh = dvh->next_neighbour)
11017 {
11019 queue,
11020 dvh->dv->vl,
11021 dvh,
11022 sizeof(struct GNUNET_PeerIdentity)
11023 * (1 + dvh->distance)
11024 + sizeof(struct TransportDVBoxMessage)
11025 + sizeof(struct TransportDVBoxPayloadP));
11026 }
11027 }
11028 if (NULL == sc.best)
11029 {
11030 /* no message pending, nothing to do here! */
11032 "No pending messages, queue `%s' to %s now idle\n",
11033 queue->address,
11034 GNUNET_i2s (&n->pid));
11035 if (GNUNET_YES == sc.to_early)
11036 schedule_transmit_on_queue (sc.to_early_retry_delay,
11037 queue,
11039 queue->idle = GNUNET_YES;
11040 return;
11041 }
11042 /* There is a message pending, we are certainly not idle */
11043 queue->idle = GNUNET_NO;
11044
11045 /* Given selection in `sc`, do transmission */
11046 pm = sc.best;
11048 "Selected message <%" PRIu64 ">\n",
11049 pm->logging_uuid);
11050 if (NULL != sc.dvh)
11051 {
11053 "Is this %u a DV box?\n",
11054 pm->pmt);
11055 GNUNET_assert (PMT_DV_BOX != pm->pmt);
11056 if ((NULL != sc.best->bpm) && (sc.best->bpm->used_dvh != sc.dvh))
11057 {
11059 "Discard old box, because we have a new DV path.\n");
11060 free_pending_message (sc.best->bpm);
11061 sc.best->bpm = NULL;
11062 }
11063
11064 if (NULL == sc.best->bpm)
11065 {
11067 "encapsulate_for_dv 2\n");
11068 encapsulate_for_dv (sc.dvh->dv,
11069 1,
11070 &sc.dvh,
11071 (const struct GNUNET_MessageHeader *) &sc.best[1],
11073 &sc,
11074 RMO_NONE,
11075 GNUNET_NO);
11076 GNUNET_assert (NULL != sc.best->bpm);
11078 "%lu %lu %lu %lu %u\n",
11079 sizeof(struct GNUNET_PeerIdentity),
11080 sizeof(struct TransportDVBoxMessage),
11081 sizeof(struct TransportDVBoxPayloadP),
11082 sizeof(struct TransportFragmentBoxMessage),
11083 ((const struct GNUNET_MessageHeader *) &sc.best[1])->size);
11084 sc.best->bpm->used_dvh = sc.dvh;
11085 }
11086 pm = sc.best->bpm;
11087 }
11088 if (GNUNET_YES == sc.frag)
11089 {
11090 pm = fragment_message (queue, sc.dvh, pm);
11091 if (NULL == pm)
11092 {
11094 "Fragmentation failed queue %s to %s for <%" PRIu64
11095 ">, trying again\n",
11096 queue->address,
11097 GNUNET_i2s (&n->pid),
11098 sc.best->logging_uuid);
11100 queue,
11102 return;
11103 }
11104 }
11105 else if (GNUNET_YES == sc.relb)
11106 {
11108 if (NULL == pm)
11109 {
11110 /* Reliability boxing failed, try next message... */
11111 GNUNET_log (
11113 "Reliability boxing failed queue %s to %s for <%" PRIu64
11114 ">, trying again\n",
11115 queue->address,
11116 GNUNET_i2s (&n->pid),
11117 sc.best->logging_uuid);
11119 queue,
11121 return;
11122 }
11123 }
11124
11125 /* Pass 'pm' for transission to the communicator */
11126 GNUNET_log (
11128 "Passing message <%" PRIu64
11129 "> to queue %s for peer %s (considered %u others)\n",
11130 pm->logging_uuid,
11131 queue->address,
11132 GNUNET_i2s (&n->pid),
11133 sc.consideration_counter);
11134
11135 /* Flow control: increment amount of traffic sent; if we are routing
11136 via DV (and thus the ultimate target of the pending message is for
11137 a different virtual link than the one of the queue), then we need
11138 to use up not only the window of the direct link but also the
11139 flow control window for the DV link! */
11140 pm->vl->outbound_fc_window_size_used += pm->bytes_msg;
11141
11142 if (pm->vl != queue->neighbour->vl)
11143 {
11144 /* If the virtual link of the queue differs, this better be distance
11145 vector routing! */
11146 GNUNET_assert (NULL != sc.dvh);
11147 /* If we do distance vector routing, we better not do this for a
11148 message that was itself DV-routed */
11149 GNUNET_assert (PMT_DV_BOX != sc.best->pmt);
11150 /* We use the size of the unboxed message here, to avoid counting
11151 the DV-Box header which is eaten up on the way by intermediaries */
11152 queue->neighbour->vl->outbound_fc_window_size_used += sc.best->bytes_msg;
11153 }
11154 else
11155 {
11156 GNUNET_assert (NULL == sc.dvh);
11157 }
11158
11159 queue_send_msg (queue, pm, &pm[1], pm->bytes_msg);
11160
11161 /* Check if this transmission somehow conclusively finished handing 'pm'
11162 even without any explicit ACKs */
11163 if ((PMT_CORE == pm->pmt) ||
11164 (GNUNET_TRANSPORT_CC_RELIABLE == queue->tc->details.communicator.cc))
11165 {
11167 }
11168 else
11169 {
11170 struct GNUNET_TIME_Relative wait_duration;
11171 unsigned int wait_multiplier;
11172
11173 if (PMT_FRAGMENT_BOX == pm->pmt)
11174 {
11175 struct PendingMessage *root;
11176
11177 root = pm->frag_parent;
11178 while (NULL != root->frag_parent && PMT_DV_BOX != root->pmt)
11179 root = root->frag_parent;
11180
11181 wait_multiplier = (unsigned int) ceil ((double) root->bytes_msg
11182 / ((double) root->frag_off
11183 / (double) root->frag_count))
11184 * 4;
11185 }
11186 else
11187 {
11188 // No fragments, we use 4 RTT before retransmitting.
11189 wait_multiplier = 4;
11190 }
11191
11192 // Depending on how much pending message the VirtualLink is queueing, we wait longer.
11193 // wait_multiplier = wait_multiplier * pm->vl->pending_msg_num;
11194
11196 "Wait multiplier %u\n",
11197 wait_multiplier);
11198
11199 /* Message not finished, waiting for acknowledgement.
11200 Update time by which we might retransmit 's' based on queue
11201 characteristics (i.e. RTT); it takes one RTT for the message to
11202 arrive and the ACK to come back in the best case; but the other
11203 side is allowed to delay ACKs by 2 RTTs, so we use 4 RTT before
11204 retransmitting.
11205
11206 OPTIMIZE: Note that in the future this heuristic should likely
11207 be improved further (measure RTT stability, consider message
11208 urgency and size when delaying ACKs, etc.) */
11209
11210 if (GNUNET_TIME_UNIT_FOREVER_REL.rel_value_us !=
11211 queue->pd.aged_rtt.rel_value_us)
11212 wait_duration = queue->pd.aged_rtt;
11213 else
11214 {
11215 wait_duration = DEFAULT_ACK_WAIT_DURATION;
11216 wait_multiplier = 4;
11217 }
11218 {
11221 wait_duration, wait_multiplier));
11223 wait_duration, wait_multiplier);
11225 "Waiting %s for ACK until %s\n",
11230 GNUNET_TIME_relative_multiply (wait_duration,
11231 wait_multiplier))
11232 );
11233 }
11234 }
11235 /* finally, re-schedule queue transmission task itself */
11237 queue,
11239}
static struct GNUNET_FS_SearchContext * sc
Definition: gnunet-search.c:87
static void completed_pending_message(struct PendingMessage *pm)
We have completed transmission of pm, remove it from the transmission queues (and if it is a fragment...
static struct PendingMessage * fragment_message(struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
Fragment the given pm to the given mtu.
static void extract_box_cb(void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
Function to call to further operate on the now DV encapsulated message hdr, forwarding it via next_ho...
static void select_best_pending_from_link(struct PendingMessageScoreContext *sc, struct Queue *queue, struct VirtualLink *vl, struct DistanceVectorHop *dvh, size_t overhead)
Select the best pending message from vl for transmission via queue.
static void schedule_transmit_on_queue(struct GNUNET_TIME_Relative delay, struct Queue *queue, enum GNUNET_SCHEDULER_Priority p)
Called whenever something changed that might effect when we try to do the next transmission on queue ...
#define DEFAULT_ACK_WAIT_DURATION
Default value for how long we wait for reliability ack.
static struct PendingMessage * reliability_box_message(struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
Reliability-box the given pm.
static struct GNUNET_TIME_Relative encapsulate_for_dv(struct DistanceVector *dv, unsigned int num_dvhs, struct DistanceVectorHop **dvhs, const struct GNUNET_MessageHeader *hdr, DVMessageHandler use, void *use_cls, enum RouteMessageOptions options, enum GNUNET_GenericReturnValue without_fc)
Pick a path of dv under constraints options and schedule transmission of hdr.
static void queue_send_msg(struct Queue *queue, struct PendingMessage *pm, const void *payload, size_t payload_size)
Send the message payload on queue.
static void update_pm_next_attempt(struct PendingMessage *pm, struct GNUNET_TIME_Absolute next_attempt)
Change the value of the next_attempt field of pm to next_attempt and re-order pm in the transmission ...
@ GNUNET_TRANSPORT_CC_RELIABLE
Transmission is reliabile (with ACKs), e.g.
@ GNUNET_SCHEDULER_PRIORITY_DEFAULT
Run with the default priority (normal P2P operations).
#define GNUNET_TIME_UNIT_FOREVER_REL
Constant used to specify "forever".
const char * GNUNET_STRINGS_relative_time_to_string(struct GNUNET_TIME_Relative delta, int do_round)
Give relative time in human-readable fancy format.
Definition: strings.c:579
struct GNUNET_TIME_Absolute GNUNET_TIME_relative_to_absolute(struct GNUNET_TIME_Relative rel)
Convert relative time to an absolute time in the future.
Definition: time.c:316
struct GNUNET_TIME_Relative GNUNET_TIME_relative_multiply(struct GNUNET_TIME_Relative rel, unsigned long long factor)
Multiply relative time by a given factor.
Definition: time.c:486
#define GNUNET_TIME_UNIT_ZERO
Relative time zero.
const char * GNUNET_STRINGS_absolute_time_to_string(struct GNUNET_TIME_Absolute t)
Like asctime, except for GNUnet time.
Definition: strings.c:640
struct DistanceVectorHop * next_neighbour
Kept in a MDLL.
Header for all communications.
The identity of the host (wraps the signing key of the peer).
Time for relative time used by GNUnet, in microseconds.
Context for select_best_pending_from_link().
uint16_t bytes_msg
Size of the original message.
uint16_t frag_off
Offset at which we should generate the next fragment.
Outer layer of an encapsulated message send over multiple hops.
Plaintext of the variable-size payload that is encrypted within a struct TransportBackchannelEncapsul...
Outer layer of an encapsulated fragmented application message.

References PendingMessage::bytes_msg, completed_pending_message(), DEFAULT_ACK_WAIT_DURATION, Neighbour::dv_head, encapsulate_for_dv(), extract_box_cb(), PendingMessage::frag_count, PendingMessage::frag_off, PendingMessage::frag_parent, fragment_message(), free_pending_message(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_STRINGS_absolute_time_to_string(), GNUNET_STRINGS_relative_time_to_string(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_ZERO, GNUNET_TRANSPORT_CC_RELIABLE, GNUNET_YES, consensus-simulation::int, DistanceVectorHop::next_neighbour, Neighbour::pid, pm, PendingMessage::pmt, PMT_CORE, PMT_DV_BOX, PMT_FRAGMENT_BOX, queue(), queue_send_msg(), reliability_box_message(), RMO_NONE, sc, schedule_transmit_on_queue(), select_best_pending_from_link(), update_pm_next_attempt(), and Neighbour::vl.

Referenced by schedule_transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_for_queue_with_higher_prio()

static unsigned int check_for_queue_with_higher_prio ( struct Queue queue,
struct Queue queue_head 
)
static

Check if the communicator has another queue with higher prio ready for sending.

Definition at line 3845 of file gnunet-service-transport.c.

3846{
3847 for (struct Queue *s = queue_head; NULL != s;
3848 s = s->next_client)
3849 {
3850 if (s->tc->details.communicator.address_prefix !=
3851 queue->tc->details.communicator.address_prefix)
3852 {
3854 "queue address %s qid %u compare with queue: address %s qid %u\n",
3855 queue->address,
3856 queue->qid,
3857 s->address,
3858 s->qid);
3859 if ((s->priority > queue->priority) && (0 < s->q_capacity) &&
3860 (QUEUE_LENGTH_LIMIT > s->queue_length) )
3861 return GNUNET_YES;
3863 "Lower prio\n");
3864 }
3865 }
3866 return GNUNET_NO;
3867}
static struct Queue * queue_head
Head of queue of messages to transmit.
#define QUEUE_LENGTH_LIMIT
How many messages can we have pending for a given queue (queue to a particular peer via a communicato...
struct Queue * next_client
Kept in a MDLL.

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_YES, Queue::next_client, queue(), queue_head, and QUEUE_LENGTH_LIMIT.

Referenced by schedule_transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ schedule_transmit_on_queue()

static void schedule_transmit_on_queue ( struct GNUNET_TIME_Relative  delay,
struct Queue queue,
enum GNUNET_SCHEDULER_Priority  p 
)
static

Called whenever something changed that might effect when we try to do the next transmission on queue using transmit_on_queue().

Parameters
queuethe queue to do scheduling for
ptask priority to use, if queue is scheduled

Definition at line 3878 of file gnunet-service-transport.c.

3881{
3883
3884 if (queue->validated_until.abs_value_us < now.abs_value_us)
3885 return;
3887 queue->tc->details.communicator.
3888 queue_head))
3889 return;
3890
3891 if (queue->tc->details.communicator.total_queue_length >=
3893 {
3895 "Transmission on queue %s (QID %u) throttled due to communicator queue limit\n",
3896 queue->address,
3897 queue->qid);
3899 GST_stats,
3900 "# Transmission throttled due to communicator queue limit",
3901 1,
3902 GNUNET_NO);
3903 queue->idle = GNUNET_NO;
3904 return;
3905 }
3906 if (queue->queue_length >= QUEUE_LENGTH_LIMIT)
3907 {
3909 "Transmission on queue %s (QID %u) throttled due to communicator queue length limit\n",
3910 queue->address,
3911 queue->qid);
3913 "# Transmission throttled due to queue queue limit",
3914 1,
3915 GNUNET_NO);
3916 queue->idle = GNUNET_NO;
3917 return;
3918 }
3919 if (0 == queue->q_capacity)
3920 {
3922 "Transmission on queue %s (QID %u) throttled due to communicator message has capacity %"
3923 PRIu64 ".\n",
3924 queue->address,
3925 queue->qid,
3926 queue->q_capacity);
3928 "# Transmission throttled due to message queue capacity",
3929 1,
3930 GNUNET_NO);
3931 queue->idle = GNUNET_NO;
3932 return;
3933 }
3934 /* queue might indeed be ready, schedule it */
3935 if (NULL != queue->transmit_task)
3936 GNUNET_SCHEDULER_cancel (queue->transmit_task);
3937 queue->transmit_task =
3939 queue);
3941 "Considering transmission on queue `%s' QID %llu to %s\n",
3942 queue->address,
3943 (unsigned long long) queue->qid,
3944 GNUNET_i2s (&queue->neighbour->pid));
3945}
static unsigned int check_for_queue_with_higher_prio(struct Queue *queue, struct Queue *queue_head)
Check if the communicator has another queue with higher prio ready for sending.
#define COMMUNICATOR_TOTAL_QUEUE_LIMIT
How many messages can we have pending for a given communicator process before we start to throttle th...
static void transmit_on_queue(void *cls)
We believe we are ready to transmit a message on a queue.
static struct GNUNET_STATISTICS_Handle * GST_stats
Statistics handle.
static struct GNUNET_OS_Process * p
Helper process we started.
Definition: gnunet-uri.c:38
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed_with_priority(struct GNUNET_TIME_Relative delay, enum GNUNET_SCHEDULER_Priority priority, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1207
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
uint64_t abs_value_us
The actual value.

References GNUNET_TIME_Absolute::abs_value_us, check_for_queue_with_higher_prio(), COMMUNICATOR_TOTAL_QUEUE_LIMIT, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_add_delayed_with_priority(), GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GST_stats, p, queue(), queue_head, QUEUE_LENGTH_LIMIT, and transmit_on_queue().

Referenced by check_vl_transmission(), free_queue(), free_queue_entry(), handle_update_queue_message(), and transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_queue()

static void free_queue ( struct Queue queue)
static

Free queue.

Parameters
queuethe queue to free

Definition at line 4006 of file gnunet-service-transport.c.

4007{
4008 struct Neighbour *neighbour = queue->neighbour;
4009 struct TransportClient *tc = queue->tc;
4010 struct MonitorEvent me = { .cs = GNUNET_TRANSPORT_CS_DOWN,
4012 struct QueueEntry *qe;
4013 int maxxed;
4014 struct PendingAcknowledgement *pa;
4015 struct VirtualLink *vl;
4016
4018 "Cleaning up queue %u\n", queue->qid);
4019 if (NULL != queue->mo)
4020 {
4022 queue->mo = NULL;
4023 }
4024 if (NULL != queue->transmit_task)
4025 {
4026 GNUNET_SCHEDULER_cancel (queue->transmit_task);
4027 queue->transmit_task = NULL;
4028 }
4029 while (NULL != (pa = queue->pa_head))
4030 {
4031 GNUNET_CONTAINER_MDLL_remove (queue, queue->pa_head, queue->pa_tail, pa);
4032 pa->queue = NULL;
4033 }
4034
4036 neighbour->queue_head,
4037 neighbour->queue_tail,
4038 queue);
4040 tc->details.communicator.queue_head,
4041 tc->details.communicator.queue_tail,
4042 queue);
4044 tc->details.communicator.total_queue_length);
4046 "Cleaning up queue with length %u\n",
4047 queue->queue_length);
4048 while (NULL != (qe = queue->queue_head))
4049 {
4050 GNUNET_CONTAINER_DLL_remove (queue->queue_head, queue->queue_tail, qe);
4051 queue->queue_length--;
4052 tc->details.communicator.total_queue_length--;
4053 if (NULL != qe->pm)
4054 {
4055 GNUNET_assert (qe == qe->pm->qe);
4056 qe->pm->qe = NULL;
4057 }
4058 GNUNET_free (qe);
4059 }
4060 GNUNET_assert (0 == queue->queue_length);
4061 if ((maxxed) && (COMMUNICATOR_TOTAL_QUEUE_LIMIT >
4062 tc->details.communicator.total_queue_length))
4063 {
4064 /* Communicator dropped below threshold, resume all _other_ queues */
4066 GST_stats,
4067 "# Transmission throttled due to communicator queue limit",
4068 -1,
4069 GNUNET_NO);
4070 for (struct Queue *s = tc->details.communicator.queue_head; NULL != s;
4071 s = s->next_client)
4073 s,
4075 }
4076 notify_monitors (&neighbour->pid, queue->address, queue->nt, &me);
4078
4079 vl = lookup_virtual_link (&neighbour->pid);
4080 if ((NULL != vl) && (neighbour == vl->n))
4081 {
4083 check_link_down (vl);
4084 }
4085 if (NULL == neighbour->queue_head)
4086 {
4087 free_neighbour (neighbour, GNUNET_NO);
4088 }
4089}
static void free_neighbour(struct Neighbour *neighbour, enum GNUNET_GenericReturnValue drop_link)
Release memory used by neighbour.
static void notify_monitors(const struct GNUNET_PeerIdentity *peer, const char *address, enum GNUNET_NetworkType nt, const struct MonitorEvent *me)
Send information in me about a peer's status with respect to some address to all monitors that care.
static struct VirtualLink * lookup_virtual_link(const struct GNUNET_PeerIdentity *pid)
Lookup virtual link for peer pid.
@ GNUNET_TRANSPORT_CS_DOWN
Connection is down.
Details about what to notify monitors about.
struct Queue * queue_tail
Tail of DLL of queues to this peer.

References check_link_down(), COMMUNICATOR_TOTAL_QUEUE_LIMIT, free_neighbour(), GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_MDLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_NO, GNUNET_PEERSTORE_monitor_stop(), GNUNET_SCHEDULER_cancel(), GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_STATISTICS_update(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_ZERO, GNUNET_TRANSPORT_CS_DOWN, GST_stats, lookup_virtual_link(), me, VirtualLink::n, notify_monitors(), Neighbour::pid, qe, queue(), PendingAcknowledgement::queue, Neighbour::queue_head, Neighbour::queue_tail, schedule_transmit_on_queue(), tc, and VirtualLink::visibility_task.

Referenced by client_disconnect_cb(), and handle_del_queue_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_address_list_entry()

static void free_address_list_entry ( struct AddressListEntry ale)
static

Free ale.

Parameters
aleaddress list entry to free

Definition at line 4098 of file gnunet-service-transport.c.

4099{
4100 struct TransportClient *tc = ale->tc;
4101
4102 GNUNET_CONTAINER_DLL_remove (tc->details.communicator.addr_head,
4103 tc->details.communicator.addr_tail,
4104 ale);
4105 if (NULL != ale->sc)
4106 {
4108 "store cancel\n");
4110 ale->sc = NULL;
4111 }
4112 if (NULL != ale->st)
4113 {
4115 ale->st = NULL;
4116 }
4117 if (NULL != ale->signed_address)
4119 GNUNET_free (ale);
4120}
struct TransportClient * tc
Which communicator provides this address?
void * signed_address
Signed address.
struct GNUNET_SCHEDULER_Task * st
Task to periodically do st operation.
struct GNUNET_PEERSTORE_StoreContext * sc
Current context for storing this address in the peerstore.

References GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_cancel(), AddressListEntry::sc, AddressListEntry::signed_address, AddressListEntry::st, tc, and AddressListEntry::tc.

Referenced by client_disconnect_cb(), and handle_del_address().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ stop_peer_request()

static int stop_peer_request ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Stop the peer request in value.

Parameters
clsa struct TransportClient that no longer makes the request
pidthe peer's identity
valuea struct PeerRequest
Returns
GNUNET_YES (always)

Definition at line 4132 of file gnunet-service-transport.c.

4135{
4136 struct TransportClient *tc = cls;
4137 struct PeerRequest *pr = value;
4138
4139 if (NULL != pr->nc)
4141 pr->nc = NULL;
4143 GNUNET_YES ==
4144 GNUNET_CONTAINER_multipeermap_remove (tc->details.application.requests,
4145 pid,
4146 pr));
4147 GNUNET_free (pr);
4148
4149 return GNUNET_OK;
4150}
Information per peer and request.
struct GSF_PendingRequest * pr
Handle to generic request (generic: from peer or local client).

References GNUNET_assert, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_free, GNUNET_OK, GNUNET_PEERSTORE_monitor_stop(), GNUNET_YES, pid, PeerRequest::pr, tc, and value.

Referenced by client_disconnect_cb(), and handle_suggest_cancel().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ do_shutdown()

static void do_shutdown ( void *  cls)
static

Function called when the service shuts down.

Unloads our plugins and cancels pending validations.

Parameters
clsclosure, unused

Definition at line 12878 of file gnunet-service-transport.c.

12879{
12880 struct LearnLaunchEntry *lle;
12881 (void) cls;
12882
12884 "shutdown logic\n");
12887 &free_neighbour_cb, NULL);
12888 if (NULL != validation_task)
12889 {
12891 validation_task = NULL;
12892 }
12893 if (NULL != dvlearn_task)
12894 {
12896 dvlearn_task = NULL;
12897 }
12898 if (NULL != GST_stats)
12899 {
12901 GST_stats = NULL;
12902 }
12903 if (NULL != GST_my_hello)
12904 {
12906 GST_my_hello = NULL;
12907 }
12908 if (NULL != GST_my_private_key)
12909 {
12911 GST_my_private_key = NULL;
12912 }
12915 NULL);
12917 ack_cummulators = NULL;
12920 NULL);
12922 pending_acks = NULL;
12925 neighbours = NULL;
12928 links = NULL;
12931 NULL);
12933 backtalkers = NULL;
12936 NULL);
12938 validation_map = NULL;
12940 revalidation_map = NULL;
12941 while (NULL != ir_head)
12943 GNUNET_assert (0 == ir_total);
12944 while (NULL != (lle = lle_head))
12945 {
12947 GNUNET_free (lle);
12948 }
12949 if (NULL != peerstore)
12950 {
12952 "Disconnecting from PEERSTORE service\n");
12954 peerstore = NULL;
12955 }
12957 dvlearn_map = NULL;
12959 validation_heap = NULL;
12962 dv_routes = NULL;
12964}
static struct GNUNET_SCHEDULER_Task * dvlearn_task
Task run to initiate DV learning.
static struct LearnLaunchEntry * lle_tail
Tail of a DLL sorted by launch time.
static struct GNUNET_CONTAINER_Heap * validation_heap
MIN Heap sorted by "next_challenge" to struct ValidationState entries sorting addresses we are aware ...
static struct LearnLaunchEntry * lle_head
Head of a DLL sorted by launch time.
static int free_pending_ack_cb(void *cls, const struct GNUNET_Uuid *key, void *value)
Free pending acknowledgement.
struct GNUNET_NAT_Handle * nh
Handle for connect to the NAT service.
static struct GNUNET_SCHEDULER_Task * validation_task
Task to run address validation.
static struct GNUNET_CRYPTO_EddsaPrivateKey * GST_my_private_key
Our private key.
static struct GNUNET_PEERSTORE_Handle * peerstore
Database for peer's HELLOs.
static int free_validation_state_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Free validation state.
static int free_neighbour_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Free neighbour entry.
struct GNUNET_HELLO_Builder * GST_my_hello
Our HELLO.
static struct GNUNET_CONTAINER_MultiShortmap * dvlearn_map
Map from challenges to struct LearnLaunchEntry values.
static struct GNUNET_CONTAINER_MultiPeerMap * backtalkers
Map from PIDs to struct Backtalker entries.
static int free_backtalker_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Callback to free backtalker records.
static struct GNUNET_CONTAINER_MultiPeerMap * ack_cummulators
Map from PIDs to struct AcknowledgementCummulators.
static int free_dv_routes_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Free DV route entry.
static int free_ack_cummulator_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Free acknowledgement cummulator.
static void free_incoming_request(struct IncomingRequest *ir)
Release ir data structure.
void GNUNET_CONTAINER_multihashmap_destroy(struct GNUNET_CONTAINER_MultiHashMap *map)
Destroy a hash map.
void GNUNET_CONTAINER_multiuuidmap_destroy(struct GNUNET_CONTAINER_MultiUuidmap *map)
Destroy a hash map.
void GNUNET_CONTAINER_multishortmap_destroy(struct GNUNET_CONTAINER_MultiShortmap *map)
Destroy a hash map.
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multiuuidmap_iterate(struct GNUNET_CONTAINER_MultiUuidmap *map, GNUNET_CONTAINER_MultiUuidmapIteratorCallback it, void *it_cls)
Iterate over all entries in the map.
void GNUNET_HELLO_builder_free(struct GNUNET_HELLO_Builder *builder)
Release resources of a builder.
Definition: hello-uri.c:453
void GNUNET_NAT_unregister(struct GNUNET_NAT_Handle *nh)
Stop port redirection and public IP address detection for the given handle.
Definition: nat_api.c:703
void GNUNET_PEERSTORE_disconnect(struct GNUNET_PEERSTORE_Handle *h)
Disconnect from the PEERSTORE service.
void GNUNET_SCHEDULER_shutdown(void)
Request the shutdown of a scheduler.
Definition: scheduler.c:567
void GNUNET_STATISTICS_destroy(struct GNUNET_STATISTICS_Handle *h, int sync_first)
Destroy a handle (free all state associated with it).
When did we launch this DV learning activity?

References ack_cummulators, backtalkers, dv_routes, dvlearn_map, dvlearn_task, free_ack_cummulator_cb(), free_backtalker_cb(), free_dv_routes_cb(), free_incoming_request(), free_neighbour_cb(), free_pending_ack_cb(), free_validation_state_cb(), GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_heap_destroy(), GNUNET_CONTAINER_multihashmap_destroy(), GNUNET_CONTAINER_multipeermap_destroy(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_CONTAINER_multishortmap_destroy(), GNUNET_CONTAINER_multiuuidmap_destroy(), GNUNET_CONTAINER_multiuuidmap_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_HELLO_builder_free(), GNUNET_log, GNUNET_NAT_unregister(), GNUNET_NO, GNUNET_PEERSTORE_disconnect(), GNUNET_SCHEDULER_cancel(), GNUNET_SCHEDULER_shutdown(), GNUNET_STATISTICS_destroy(), GST_my_hello, GST_my_private_key, GST_stats, ir_head, ir_total, links, lle_head, lle_tail, neighbours, nh, peerstore, pending_acks, revalidation_map, validation_heap, validation_map, and validation_task.

Referenced by client_disconnect_cb(), and shutdown_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ client_disconnect_cb()

static void client_disconnect_cb ( void *  cls,
struct GNUNET_SERVICE_Client client,
void *  app_ctx 
)
static

Called whenever a client is disconnected.

Frees our resources associated with that client.

Parameters
clsclosure, NULL
clientidentification of the client
app_ctxour struct TransportClient

Definition at line 4165 of file gnunet-service-transport.c.

4168{
4169 struct TransportClient *tc = app_ctx;
4170
4171 (void) cls;
4172 (void) client;
4174 switch (tc->type)
4175 {
4176 case CT_NONE:
4178 "Unknown Client %p disconnected, cleaning up.\n",
4179 tc);
4180 break;
4181
4182 case CT_CORE: {
4183 struct PendingMessage *pm;
4185 "CORE Client %p disconnected, cleaning up.\n",
4186 tc);
4187
4188
4189 while (NULL != (pm = tc->details.core.pending_msg_head))
4190 {
4192 tc->details.core.pending_msg_head,
4193 tc->details.core.pending_msg_tail,
4194 pm);
4195 pm->client = NULL;
4196 }
4197 }
4198 break;
4199
4200 case CT_MONITOR:
4202 "MONITOR Client %p disconnected, cleaning up.\n",
4203 tc);
4204
4205 break;
4206
4207 case CT_COMMUNICATOR: {
4208 struct Queue *q;
4209 struct AddressListEntry *ale;
4210
4212 "COMMUNICATOR Client %p disconnected, cleaning up.\n",
4213 tc);
4214
4215 if (NULL != tc->details.communicator.free_queue_entry_task)
4217 tc->details.communicator.free_queue_entry_task);
4218 while (NULL != (q = tc->details.communicator.queue_head))
4219 free_queue (q);
4220 while (NULL != (ale = tc->details.communicator.addr_head))
4222 GNUNET_free (tc->details.communicator.address_prefix);
4223 }
4224 break;
4225
4226 case CT_APPLICATION:
4228 "APPLICATION Client %p disconnected, cleaning up.\n",
4229 tc);
4230
4231 GNUNET_CONTAINER_multipeermap_iterate (tc->details.application.requests,
4233 tc);
4234 GNUNET_CONTAINER_multipeermap_destroy (tc->details.application.requests);
4235 break;
4236 }
4237 GNUNET_free (tc);
4238 if ((GNUNET_YES == in_shutdown) && (NULL == clients_head))
4239 {
4241 "Our last client disconnected\n");
4242 do_shutdown (cls);
4243 }
4244}
static void free_queue(struct Queue *queue)
Free queue.
static int stop_peer_request(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Stop the peer request in value.
static int in_shutdown
Indication if we have received a shutdown signal and are in the process of cleaning up.
static void do_shutdown(void *cls)
Function called when the service shuts down.
static void free_address_list_entry(struct AddressListEntry *ale)
Free ale.
@ GNUNET_ERROR_TYPE_ERROR
One of the addresses of this peer.
struct TransportClient * client
Client that issued the transmission request, if pmt is PMT_CORE.

References PendingMessage::client, TransportClient::client, clients_head, clients_tail, CT_APPLICATION, CT_COMMUNICATOR, CT_CORE, CT_MONITOR, CT_NONE, do_shutdown(), free_address_list_entry(), free_queue(), GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_MDLL_remove, GNUNET_CONTAINER_multipeermap_destroy(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_ERROR, GNUNET_free, GNUNET_log, GNUNET_SCHEDULER_cancel(), GNUNET_YES, in_shutdown, pm, q, stop_peer_request(), and tc.

Here is the call graph for this function:

◆ notify_client_connect_info()

static int notify_client_connect_info ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Iterator telling new CORE client about all existing connections to peers.

Parameters
clsthe new struct TransportClient
pida connected peer
valuethe struct Neighbour with more information
Returns
GNUNET_OK (continue to iterate)

Definition at line 4257 of file gnunet-service-transport.c.

4260{
4261 struct TransportClient *tc = cls;
4262 struct VirtualLink *vl = value;
4263
4264 if ((NULL == vl) || (GNUNET_NO == vl->confirmed))
4265 return GNUNET_OK;
4266
4268 "Telling new CORE client about existing connection to %s\n",
4269 GNUNET_i2s (pid));
4271 return GNUNET_OK;
4272}

References VirtualLink::confirmed, core_send_connect_info(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_OK, pid, tc, and value.

Referenced by handle_client_start().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ finish_cmc_handling_with_continue()

static void finish_cmc_handling_with_continue ( struct CommunicatorMessageContext cmc,
unsigned int  free_cmc 
)
static

Send ACK to communicator (if requested) and free cmc.

Parameters
cmccontext for which we are done handling the message

Definition at line 4526 of file gnunet-service-transport.c.

4529{
4530 if (0 != ntohl (cmc->im.fc_on))
4531 {
4532 /* send ACK when done to communicator for flow control! */
4533 struct GNUNET_MQ_Envelope *env;
4535
4537 "Acknowledge message with flow control id %" PRIu64 "\n",
4538 cmc->im.fc_id);
4540 ack->reserved = htonl (0);
4541 ack->fc_id = cmc->im.fc_id;
4542 ack->sender = cmc->im.neighbour_sender;
4543 GNUNET_MQ_send (cmc->tc->mq, env);
4544 }
4545
4547
4548 if (GNUNET_YES == free_cmc)
4549 {
4550 GNUNET_free (cmc);
4551 }
4552}
#define GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG_ACK
transport acknowledges processing an incoming message
void GNUNET_SERVICE_client_continue(struct GNUNET_SERVICE_Client *c)
Continue receiving further messages from the given client.
Definition: service.c:2389
struct GNUNET_TRANSPORT_IncomingMessage im
Additional information for flow control and about the sender.
struct TransportClient * tc
Which communicator provided us with the message.
Transport informs us about being done with an incoming message.
Definition: transport.h:374
struct GNUNET_PeerIdentity sender
Sender identifier of the original message.
Definition: transport.h:393
uint64_t fc_id
Which message is being ACKed?
Definition: transport.h:388
uint32_t reserved
Reserved (0)
Definition: transport.h:383
struct GNUNET_PeerIdentity neighbour_sender
Direct neighbour sender identifier.
Definition: transport.h:363
uint32_t fc_on
Do we use flow control or not?
Definition: transport.h:342
uint64_t fc_id
64-bit number to identify the matching ACK.
Definition: transport.h:347
struct GNUNET_MQ_Handle * mq
Message queue to the client.

References TransportClient::client, env, GNUNET_TRANSPORT_IncomingMessage::fc_id, GNUNET_TRANSPORT_IncomingMessageAck::fc_id, GNUNET_TRANSPORT_IncomingMessage::fc_on, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG_ACK, GNUNET_MQ_msg, GNUNET_MQ_send(), GNUNET_SERVICE_client_continue(), GNUNET_YES, CommunicatorMessageContext::im, TransportClient::mq, GNUNET_TRANSPORT_IncomingMessage::neighbour_sender, GNUNET_TRANSPORT_IncomingMessageAck::reserved, GNUNET_TRANSPORT_IncomingMessageAck::sender, and CommunicatorMessageContext::tc.

Referenced by finish_cmc_handling(), finish_handling_raw_message(), handle_client_recv_ok(), handle_raw_message(), and resume_communicators().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ resume_communicators()

static enum GNUNET_GenericReturnValue resume_communicators ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Definition at line 4286 of file gnunet-service-transport.c.

4289{
4290 struct VirtualLink *vl = value;
4291 struct CommunicatorMessageContext *cmc;
4292
4293 /* resume communicators */
4294 while (NULL != (cmc = vl->cmc_tail))
4295 {
4297 if (GNUNET_NO == cmc->continue_send)
4299 }
4300 return GNUNET_OK;
4301}
static void finish_cmc_handling_with_continue(struct CommunicatorMessageContext *cmc, unsigned int free_cmc)
Send ACK to communicator (if requested) and free cmc.
Context from handle_incoming_msg().
unsigned int continue_send
Did we already call GNUNET_SERVICE_client_continue and send ACK to communicator?

References VirtualLink::cmc_head, VirtualLink::cmc_tail, CommunicatorMessageContext::continue_send, finish_cmc_handling_with_continue(), GNUNET_CONTAINER_DLL_remove, GNUNET_NO, GNUNET_OK, GNUNET_YES, and value.

Referenced by handle_client_start().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_client_start()

static void handle_client_start ( void *  cls,
const struct StartMessage start 
)
static

Initialize a "CORE" client.

We got a start message from this client, so add it to the list of clients for broadcasting of inbound messages.

Parameters
clsthe client
startthe start message that was sent

Definition at line 4313 of file gnunet-service-transport.c.

4314{
4315 struct TransportClient *tc = cls;
4316 uint32_t options;
4317
4318 options = ntohl (start->options);
4319 if ((0 != (1 & options)) &&
4320 (0 != GNUNET_memcmp (&start->self, &GST_my_identity)))
4321 {
4322 /* client thinks this is a different peer, reject */
4323 GNUNET_break (0);
4325 return;
4326 }
4327 if (CT_NONE != tc->type)
4328 {
4329 GNUNET_break (0);
4331 return;
4332 }
4333 tc->type = CT_CORE;
4335 "New CORE client with PID %s registered\n",
4336 GNUNET_i2s (&start->self));
4339 tc);
4342 NULL);
4344}
struct GNUNET_GETOPT_CommandLineOption options[]
Definition: 002.c:5
static int start
Set if we are to start default services (including ARM).
Definition: gnunet-arm.c:38
static struct GNUNET_PeerIdentity GST_my_identity
Our public key.
static enum GNUNET_GenericReturnValue resume_communicators(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
static int notify_client_connect_info(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Iterator telling new CORE client about all existing connections to peers.
void GNUNET_SERVICE_client_drop(struct GNUNET_SERVICE_Client *c)
Ask the server to disconnect from the given client.
Definition: service.c:2418

References CT_CORE, CT_NONE, GNUNET_break, GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GST_my_identity, links, notify_client_connect_info(), options, resume_communicators(), start, and tc.

Here is the call graph for this function:

◆ check_client_send()

static int check_client_send ( void *  cls,
const struct OutboundMessage obm 
)
static

Client asked for transmission to a peer.

Process the request.

Parameters
clsthe client
obmthe send message that was sent

Definition at line 4354 of file gnunet-service-transport.c.

4355{
4356 struct TransportClient *tc = cls;
4357 uint16_t size;
4358 const struct GNUNET_MessageHeader *obmm;
4359
4360 if (CT_CORE != tc->type)
4361 {
4362 GNUNET_break (0);
4363 return GNUNET_SYSERR;
4364 }
4365 size = ntohs (obm->header.size) - sizeof(struct OutboundMessage);
4366 if (size < sizeof(struct GNUNET_MessageHeader))
4367 {
4368 GNUNET_break (0);
4369 return GNUNET_SYSERR;
4370 }
4371 obmm = (const struct GNUNET_MessageHeader *) &obm[1];
4372 if (size != ntohs (obmm->size))
4373 {
4374 GNUNET_break (0);
4375 return GNUNET_SYSERR;
4376 }
4377 return GNUNET_OK;
4378}
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format.
@ GNUNET_SYSERR
static unsigned int size
Size of the "table".
Definition: peer.c:68
Message used to notify the transport service about a message to be transmitted to another peer.
Definition: transport.h:229
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_SEND.
Definition: transport.h:233

References CT_CORE, GNUNET_break, GNUNET_OK, GNUNET_SYSERR, OutboundMessage::header, GNUNET_MessageHeader::size, size, and tc.

◆ client_send_response()

static void client_send_response ( struct PendingMessage pm)
static

Send a response to the pm that we have processed a "send" request.

Sends a confirmation to the "core" client responsible for the original request and free's pm.

Parameters
pmhandle to the original pending message

Definition at line 4389 of file gnunet-service-transport.c.

4390{
4391 struct TransportClient *tc = pm->client;
4392 struct VirtualLink *vl = pm->vl;
4393
4395 "client send response\n");
4396 if (NULL != tc)
4397 {
4398 struct GNUNET_MQ_Envelope *env;
4399 struct SendOkMessage *so_msg;
4400
4402 so_msg->peer = vl->target;
4404 "Confirming transmission of <%" PRIu64 "> to %s\n",
4405 pm->logging_uuid,
4406 GNUNET_i2s (&vl->target));
4407 GNUNET_MQ_send (tc->mq, env);
4408 }
4410}
#define GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_OK
Confirmation from TRANSPORT that message for transmission has been queued (and that the next message ...
Message used to notify the transport API that it can send another message to the transport service.
Definition: transport.h:161
struct GNUNET_PeerIdentity peer
Which peer can send more now?
Definition: transport.h:195

References env, free_pending_message(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_OK, GNUNET_MQ_msg, GNUNET_MQ_send(), SendOkMessage::peer, pm, VirtualLink::target, and tc.

Referenced by completed_pending_message(), and reliability_box_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ pick_random_dv_hops()

static unsigned int pick_random_dv_hops ( const struct DistanceVector dv,
enum RouteMessageOptions  options,
struct DistanceVectorHop **  hops_array,
unsigned int  hops_array_length 
)
static

Pick hops_array_length random DV paths satisfying options.

Parameters
dvdata structure to pick paths from
optionsconstraints to satisfy
[out]hops_arrayset to the result
hops_array_lengthlength of the hops_array
Returns
number of entries set in hops_array

Definition at line 4423 of file gnunet-service-transport.c.

4427{
4428 uint64_t choices[hops_array_length];
4429 uint64_t num_dv;
4430 unsigned int dv_count;
4431
4432 /* Pick random vectors, but weighted by distance, giving more weight
4433 to shorter vectors */
4434 num_dv = 0;
4435 dv_count = 0;
4436 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
4437 pos = pos->next_dv)
4438 {
4439 if ((0 == (options & RMO_UNCONFIRMED_ALLOWED)) &&
4440 (GNUNET_TIME_absolute_get_remaining (pos->path_valid_until)
4441 .rel_value_us == 0))
4442 continue; /* pos unconfirmed and confirmed required */
4443 num_dv += MAX_DV_HOPS_ALLOWED - pos->distance;
4444 dv_count++;
4445 }
4446 if (0 == dv_count)
4447 return 0;
4448 if (dv_count <= hops_array_length)
4449 {
4450 dv_count = 0;
4451 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
4452 pos = pos->next_dv)
4453 hops_array[dv_count++] = pos;
4454 return dv_count;
4455 }
4456 for (unsigned int i = 0; i < hops_array_length; i++)
4457 {
4458 int ok = GNUNET_NO;
4459 while (GNUNET_NO == ok)
4460 {
4461 choices[i] =
4463 ok = GNUNET_YES;
4464 for (unsigned int j = 0; j < i; j++)
4465 if (choices[i] == choices[j])
4466 {
4467 ok = GNUNET_NO;
4468 break;
4469 }
4470 }
4471 }
4472 dv_count = 0;
4473 num_dv = 0;
4474 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
4475 pos = pos->next_dv)
4476 {
4477 uint32_t delta = MAX_DV_HOPS_ALLOWED - pos->distance;
4478
4479 if ((0 == (options & RMO_UNCONFIRMED_ALLOWED)) &&
4480 (GNUNET_TIME_absolute_get_remaining (pos->path_valid_until)
4481 .rel_value_us == 0))
4482 continue; /* pos unconfirmed and confirmed required */
4483 for (unsigned int i = 0; i < hops_array_length; i++)
4484 if ((num_dv <= choices[i]) && (num_dv + delta > choices[i]))
4485 hops_array[dv_count++] = pos;
4486 num_dv += delta;
4487 }
4488 return dv_count;
4489}
#define MAX_DV_HOPS_ALLOWED
Maximum DV distance allowed ever.
uint64_t GNUNET_CRYPTO_random_u64(enum GNUNET_CRYPTO_Quality mode, uint64_t max)
Generate a random unsigned 64-bit value.
@ GNUNET_CRYPTO_QUALITY_WEAK
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
static struct GNUNET_TIME_Relative delta
Definition: speedup.c:36

References warningfilter::choices, delta, DistanceVector::dv_head, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u64(), GNUNET_NO, GNUNET_TIME_absolute_get_remaining(), GNUNET_YES, MAX_DV_HOPS_ALLOWED, DistanceVectorHop::next_dv, options, GNUNET_TIME_Relative::rel_value_us, and RMO_UNCONFIRMED_ALLOWED.

Referenced by route_control_message_without_fc().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_communicator_available()

static int check_communicator_available ( void *  cls,
const struct GNUNET_TRANSPORT_CommunicatorAvailableMessage cam 
)
static

Communicator started.

Test message is well-formed.

Parameters
clsthe client
camthe send message that was sent

Definition at line 4499 of file gnunet-service-transport.c.

4502{
4503 struct TransportClient *tc = cls;
4504 uint16_t size;
4505
4506 if (CT_NONE != tc->type)
4507 {
4508 GNUNET_break (0);
4509 return GNUNET_SYSERR;
4510 }
4511 tc->type = CT_COMMUNICATOR;
4512 size = ntohs (cam->header.size) - sizeof(*cam);
4513 if (0 == size)
4514 return GNUNET_OK; /* receive-only communicator */
4516 return GNUNET_OK;
4517}
#define GNUNET_MQ_check_zero_termination(m)
Insert code for a "check_" function that verifies that a given variable-length message received over ...
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_NEW_COMMUNICATOR.
Definition: transport.h:267

References CT_COMMUNICATOR, CT_NONE, GNUNET_break, GNUNET_MQ_check_zero_termination, GNUNET_OK, GNUNET_SYSERR, GNUNET_TRANSPORT_CommunicatorAvailableMessage::header, GNUNET_MessageHeader::size, size, and tc.

◆ finish_cmc_handling()

static void finish_cmc_handling ( struct CommunicatorMessageContext cmc)
static

Definition at line 4556 of file gnunet-service-transport.c.

References finish_cmc_handling_with_continue(), and GNUNET_YES.

Referenced by backtalker_monotime_cb(), free_backtalker(), handle_backchannel_encapsulation(), handle_dv_box(), handle_dv_learn(), handle_flow_control(), handle_fragment_box(), handle_raw_message(), handle_reliability_ack(), handle_validation_challenge(), and handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_client_recv_ok()

static void handle_client_recv_ok ( void *  cls,
const struct RecvOkMessage rom 
)
static

Client confirms that it is done handling message(s) to a particular peer.

We may now provide more messages to CORE for this peer.

Notifies the respective queues that more messages can now be received.

Parameters
clsthe client
romthe message that was sent

Definition at line 4572 of file gnunet-service-transport.c.

4573{
4574 struct TransportClient *tc = cls;
4575 struct VirtualLink *vl;
4576 uint32_t delta;
4577 struct CommunicatorMessageContext *cmc;
4578
4579 if (CT_CORE != tc->type)
4580 {
4581 GNUNET_break (0);
4583 return;
4584 }
4585 vl = lookup_virtual_link (&rom->peer);
4586 if ((NULL == vl) || (GNUNET_NO == vl->confirmed))
4587 {
4589 "# RECV_OK dropped: virtual link unknown",
4590 1,
4591 GNUNET_NO);
4593 return;
4594 }
4595 delta = ntohl (rom->increase_window_delta);
4596 vl->core_recv_window += delta;
4598 "CORE ack receiving message, increased CORE recv window to %d\n",
4599 vl->core_recv_window);
4601 if (vl->core_recv_window <= 0)
4602 return;
4603 /* resume communicators */
4604 while (NULL != (cmc = vl->cmc_tail))
4605 {
4607 if (GNUNET_NO == cmc->continue_send)
4609 }
4610}
struct GNUNET_PeerIdentity peer
Which peer can CORE handle more from now?
Definition: transport.h:220
uint32_t increase_window_delta
Number of messages by which to increase the window, greater or equal to one.
Definition: transport.h:215

References VirtualLink::cmc_head, VirtualLink::cmc_tail, VirtualLink::confirmed, CommunicatorMessageContext::continue_send, VirtualLink::core_recv_window, CT_CORE, delta, finish_cmc_handling_with_continue(), GNUNET_break, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_STATISTICS_update(), GNUNET_YES, GST_stats, RecvOkMessage::increase_window_delta, lookup_virtual_link(), RecvOkMessage::peer, and tc.

Here is the call graph for this function:

◆ handle_communicator_available()

static void handle_communicator_available ( void *  cls,
const struct GNUNET_TRANSPORT_CommunicatorAvailableMessage cam 
)
static

Communicator started.

Process the request.

Parameters
clsthe client
camthe send message that was sent

Definition at line 4620 of file gnunet-service-transport.c.

4623{
4624 struct TransportClient *tc = cls;
4625 uint16_t size;
4626
4627 size = ntohs (cam->header.size) - sizeof(*cam);
4628 if (0 == size)
4629 {
4631 "Receive-only communicator connected\n");
4632 return; /* receive-only communicator */
4633 }
4634 tc->details.communicator.address_prefix =
4635 GNUNET_strdup ((const char *) &cam[1]);
4636 tc->details.communicator.cc = ntohl (cam->cc);
4637 tc->details.communicator.can_burst = ntohl (cam->can_burst);
4639 "Communicator for peer %s with prefix '%s' connected %s\n",
4641 tc->details.communicator.address_prefix,
4642 tc->details.communicator.can_burst ? "can burst" :
4643 "can not burst");
4645}
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
uint32_t cc
NBO encoding of enum GNUNET_TRANSPORT_CommunicatorCharacteristics
Definition: transport.h:272
uint32_t can_burst
The communicator can do burst msgs.
Definition: transport.h:277

References GNUNET_TRANSPORT_CommunicatorAvailableMessage::can_burst, GNUNET_TRANSPORT_CommunicatorAvailableMessage::cc, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_SERVICE_client_continue(), GNUNET_strdup, GST_my_identity, GNUNET_TRANSPORT_CommunicatorAvailableMessage::header, GNUNET_MessageHeader::size, size, and tc.

Here is the call graph for this function:

◆ check_communicator_backchannel()

static int check_communicator_backchannel ( void *  cls,
const struct GNUNET_TRANSPORT_CommunicatorBackchannel cb 
)
static

Communicator requests backchannel transmission.

Check the request.

Parameters
clsthe client
cbthe send message that was sent
Returns
GNUNET_OK if message is well-formed

Definition at line 4656 of file gnunet-service-transport.c.

4659{
4660 const struct GNUNET_MessageHeader *inbox;
4661 const char *is;
4662 uint16_t msize;
4663 uint16_t isize;
4664
4665 (void) cls;
4666 msize = ntohs (cb->header.size) - sizeof(*cb);
4667 inbox = (const struct GNUNET_MessageHeader *) &cb[1];
4668 isize = ntohs (inbox->size);
4669 if (isize >= msize)
4670 {
4671 GNUNET_break (0);
4672 return GNUNET_SYSERR;
4673 }
4674 is = (const char *) inbox;
4675 is += isize;
4676 msize -= isize;
4677 GNUNET_assert (0 < msize);
4678 if ('\0' != is[msize - 1])
4679 {
4680 GNUNET_break (0);
4681 return GNUNET_SYSERR;
4682 }
4683 return GNUNET_OK;
4684}
static struct GNUNET_TESTING_Interpreter * is
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_COMMUNICATOR_BACKCHANNEL.
Definition: transport.h:630

References GNUNET_assert, GNUNET_break, GNUNET_OK, GNUNET_SYSERR, GNUNET_TRANSPORT_CommunicatorBackchannel::header, is, and GNUNET_MessageHeader::size.

◆ sign_ephemeral()

static void sign_ephemeral ( struct DistanceVector dv)
static

Sign ephemeral keys in our dv are current.

Parameters
[in,out]dvvirtual link to update ephemeral for

Definition at line 4693 of file gnunet-service-transport.c.

4694{
4695 struct EphemeralConfirmationPS ec;
4696
4698 dv->ephemeral_validity =
4700 ec.purpose.purpose = htonl (GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL);
4701 ec.target = dv->target;
4702 ec.ephemeral_key = dv->ephemeral_key;
4703 ec.sender_monotonic_time = GNUNET_TIME_absolute_hton (dv->monotime);
4704 ec.purpose.size = htonl (sizeof(ec));
4706 &ec,
4707 &dv->sender_sig);
4708}
#define EPHEMERAL_VALIDITY
How long are ephemeral keys valid?
static const struct GNUNET_CONFIGURATION_Handle * GST_cfg
Configuration handle.
#define GNUNET_CRYPTO_eddsa_sign(priv, ps, sig)
EdDSA sign a given block.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_add(struct GNUNET_TIME_Absolute start, struct GNUNET_TIME_Relative duration)
Add a given relative duration to the given start time.
Definition: time.c:452
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get_monotonic(const struct GNUNET_CONFIGURATION_Handle *cfg)
Obtain the current time and make sure it is monotonically increasing.
Definition: time.c:864
#define GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL
Signature by a peer affirming that the given ephemeral key is currently in use by that peer's transpo...
struct GNUNET_TIME_Absolute monotime
What time was sender_sig created.
struct GNUNET_CRYPTO_EddsaSignature sender_sig
Signature affirming ephemeral_key of type GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL.
struct GNUNET_CRYPTO_HpkeEncapsulation ephemeral_key
Our ephemeral key.
struct GNUNET_TIME_Absolute ephemeral_validity
How long is sender_sig valid.
Body by which a peer confirms that it is using an ephemeral key.

References EphemeralConfirmationPS::ephemeral_key, DistanceVector::ephemeral_key, EPHEMERAL_VALIDITY, DistanceVector::ephemeral_validity, GNUNET_CRYPTO_eddsa_sign, GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_hton(), GST_cfg, GST_my_private_key, DistanceVector::monotime, GNUNET_CRYPTO_EccSignaturePurpose::purpose, EphemeralConfirmationPS::purpose, EphemeralConfirmationPS::sender_monotonic_time, DistanceVector::sender_sig, GNUNET_CRYPTO_EccSignaturePurpose::size, EphemeralConfirmationPS::target, and DistanceVector::target.

Referenced by encapsulate_for_dv().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_queue_entry()

static void free_queue_entry ( struct QueueEntry qe,
struct TransportClient tc 
)
static

Definition at line 11282 of file gnunet-service-transport.c.

11284{
11285 struct PendingMessage *pm;
11286
11287 GNUNET_CONTAINER_DLL_remove (qe->queue->queue_head,
11288 qe->queue->queue_tail,
11289 qe);
11290 qe->queue->queue_length--;
11291 tc->details.communicator.total_queue_length--;
11293 "Received ACK on queue %s (QID %u) to peer %s (new length: %u/%u)\n",
11294 qe->queue->address,
11295 qe->queue->qid,
11296 GNUNET_i2s (&qe->queue->neighbour->pid),
11297 qe->queue->queue_length,
11298 tc->details.communicator.total_queue_length);
11299
11300 /* if applicable, resume transmissions that waited on ACK */
11302 tc->details.communicator.total_queue_length)
11303 {
11304 /* Communicator dropped below threshold, resume all queues
11305 incident with this client! */
11307 GST_stats,
11308 "# Transmission throttled due to communicator queue limit",
11309 -1,
11310 GNUNET_NO);
11311 for (struct Queue *queue = tc->details.communicator.queue_head;
11312 NULL != queue;
11313 queue = queue->next_client)
11314 {
11316 queue,
11318 }
11319 }
11320 else if (QUEUE_LENGTH_LIMIT - 1 == qe->queue->queue_length)
11321 {
11322 /* queue dropped below threshold; only resume this one queue */
11324 "# Transmission throttled due to queue queue limit",
11325 -1,
11326 GNUNET_NO);
11328 qe->queue,
11330 }
11331 else if (1 == qe->queue->q_capacity)
11332 {
11333 // TODO I guess this will never happen, because the communicator triggers this by updating its queue length itself.
11335 "Transmission rescheduled due to communicator message queue with qid %u has capacity %"
11336 PRIu64 ".\n",
11337 qe->queue->qid,
11338 qe->queue->q_capacity);
11339 /* message queue has capacity; only resume this one queue */
11340 /* queue dropped below threshold; only resume this one queue */
11342 "# Transmission throttled due to message queue capacity",
11343 -1,
11344 GNUNET_NO);
11346 qe->queue,
11348 }
11349
11350 if (NULL != (pm = qe->pm))
11351 {
11352 struct VirtualLink *vl;
11353
11354 // GNUNET_assert (qe == pm->qe);
11355 pm->qe = NULL;
11356 /* If waiting for this communicator may have blocked transmission
11357 of pm on other queues for this neighbour, force schedule
11358 transmit on queue for queues of the neighbour */
11359 if (NULL == pm->frag_parent)
11360 {
11361 vl = pm->vl;
11362 if ((NULL != vl) &&
11363 (NULL != vl->pending_msg_head) &&
11364 (vl->pending_msg_head == pm))
11366 }
11367 }
11368 GNUNET_free (qe);
11369}
static void check_vl_transmission(struct VirtualLink *vl)
There is a message at the head of the pending messages for vl which may be ready for transmission.

References check_vl_transmission(), COMMUNICATOR_TOTAL_QUEUE_LIMIT, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_STATISTICS_update(), GNUNET_TIME_UNIT_ZERO, GST_stats, VirtualLink::pending_msg_head, pm, qe, queue(), QUEUE_LENGTH_LIMIT, schedule_transmit_on_queue(), and tc.

Referenced by free_timedout_queue_entry(), and handle_send_message_ack().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_timedout_queue_entry()

static void free_timedout_queue_entry ( void *  cls)
static

Definition at line 4717 of file gnunet-service-transport.c.

4718{
4719 struct TransportClient *tc = cls;
4721
4723 "freeing timedout queue entries\n");
4724
4725 tc->details.communicator.free_queue_entry_task = NULL;
4726 for (struct Queue *queue = tc->details.communicator.queue_head; NULL != queue;
4727 queue = queue->next_client)
4728 {
4729 struct QueueEntry *qep = queue->queue_head;
4730
4732 "checking QID %u for timedout queue entries\n",
4733 queue->qid);
4734 while (NULL != qep)
4735 {
4736 struct QueueEntry *pos = qep;
4738 pos->creation_timestamp, now);
4739 qep = qep->next;
4740
4742 "diff to now %s \n",
4745 {
4747 "Freeing timed out QueueEntry with MID %" PRIu64
4748 " and QID %u\n",
4749 pos->mid,
4750 queue->qid);
4751 free_queue_entry (pos, tc);
4752 }
4753 }
4754 }
4755}
#define QUEUE_ENTRY_TIMEOUT
static void free_queue_entry(struct QueueEntry *qe, struct TransportClient *tc)
const char * GNUNET_TIME_relative2s(struct GNUNET_TIME_Relative delta, bool do_round)
Give relative time in human-readable fancy format.
Definition: time.c:264
#define GNUNET_TIME_relative_cmp(t1, op, t2)
Compare two relative times.
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_difference(struct GNUNET_TIME_Absolute start, struct GNUNET_TIME_Absolute end)
Compute the time difference between the given start and end times.
Definition: time.c:423
struct QueueEntry * next
Kept as a DLL.
struct GNUNET_TIME_Absolute creation_timestamp
Timestamp this QueueEntry was created.
uint64_t mid
Message ID used for this message with the queue used for transmission.

References QueueEntry::creation_timestamp, free_queue_entry(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_difference(), GNUNET_TIME_relative2s(), GNUNET_TIME_relative_cmp, QueueEntry::mid, QueueEntry::next, queue(), QUEUE_ENTRY_TIMEOUT, and tc.

Referenced by queue_send_msg().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ queue_send_msg()

static void queue_send_msg ( struct Queue queue,
struct PendingMessage pm,
const void *  payload,
size_t  payload_size 
)
static

Send the message payload on queue.

Parameters
queuethe queue to use for transmission
pmpending message to update once transmission is done, may be NULL!
payloadthe payload to send (encapsulated in a GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG).
payload_sizenumber of bytes in payload

Definition at line 4768 of file gnunet-service-transport.c.

4772{
4773 struct Neighbour *n = queue->neighbour;
4775 struct GNUNET_MQ_Envelope *env;
4776 struct PendingAcknowledgement *pa;
4777
4778 GNUNET_log (
4780 "Queueing %u bytes of payload for transmission <%" PRIu64
4781 "> on queue %llu to %s\n",
4782 (unsigned int) payload_size,
4783 (NULL == pm) ? 0 : pm->logging_uuid,
4784 (unsigned long long) queue->qid,
4785 GNUNET_i2s (&queue->neighbour->pid));
4786 env = GNUNET_MQ_msg_extra (smt,
4787 payload_size,
4789 smt->qid = htonl (queue->qid);
4790 smt->mid = GNUNET_htonll (queue->mid_gen);
4791 smt->receiver = n->pid;
4792 memcpy (&smt[1], payload, payload_size);
4793 {
4794 /* Pass the env to the communicator of queue for transmission. */
4795 struct QueueEntry *qe;
4796
4797 qe = GNUNET_new (struct QueueEntry);
4798 qe->creation_timestamp = GNUNET_TIME_absolute_get ();
4799 qe->mid = queue->mid_gen;
4801 "Create QueueEntry with MID %" PRIu64
4802 " and QID %u and prefix %s\n",
4803 qe->mid,
4804 queue->qid,
4805 queue->tc->details.communicator.address_prefix);
4806 queue->mid_gen++;
4807 qe->queue = queue;
4808 if (NULL != pm)
4809 {
4810 qe->pm = pm;
4811 // TODO Why do we have a retransmission. When we know, make decision if we still want this.
4812 // GNUNET_assert (NULL == pm->qe);
4813 if (NULL != pm->qe)
4814 {
4816 "Retransmitting message <%" PRIu64
4817 "> remove pm from qe with MID: %llu \n",
4818 pm->logging_uuid,
4819 (unsigned long long) pm->qe->mid);
4820 pm->qe->pm = NULL;
4821 }
4822 pm->qe = qe;
4823 }
4824 GNUNET_assert (CT_COMMUNICATOR == queue->tc->type);
4825 if (0 == queue->q_capacity)
4826 {
4827 // Messages without FC or fragments can get here.
4828 if (NULL != pm)
4829 {
4831 "Message %" PRIu64
4832 " (pm type %u) was not send because queue has no capacity.\n",
4833 pm->logging_uuid,
4834 pm->pmt);
4835 pm->qe = NULL;
4836 }
4837 GNUNET_free (env);
4838 GNUNET_free (qe);
4839 return;
4840 }
4841 GNUNET_CONTAINER_DLL_insert (queue->queue_head, queue->queue_tail, qe);
4842 queue->queue_length++;
4843 queue->tc->details.communicator.total_queue_length++;
4844 if (GNUNET_NO == queue->unlimited_length)
4845 queue->q_capacity--;
4847 "Queue %s with qid %u has capacity %" PRIu64 "\n",
4848 queue->address,
4849 queue->qid,
4850 queue->q_capacity);
4852 queue->tc->details.communicator.total_queue_length)
4853 queue->idle = GNUNET_NO;
4854 if (QUEUE_LENGTH_LIMIT == queue->queue_length)
4855 queue->idle = GNUNET_NO;
4856 if (0 == queue->q_capacity)
4857 queue->idle = GNUNET_NO;
4858
4859 if (GNUNET_NO == queue->idle)
4860 {
4861 struct TransportClient *tc = queue->tc;
4862
4863 if (NULL == tc->details.communicator.free_queue_entry_task)
4864 tc->details.communicator.free_queue_entry_task =
4866 &
4868 tc);
4869 }
4870 if (NULL != pm && NULL != (pa = pm->pa_head))
4871 {
4872 while (pm != pa->pm)
4873 pa = pa->next_pa;
4874 pa->num_send++;
4875 }
4876 // GNUNET_CONTAINER_multiuuidmap_get (pending_acks, &ack[i].ack_uuid.value);
4878 "Sending message MID %" PRIu64
4879 " of type %u (%u) and size %lu with MQ %p queue %s (QID %u) pending %"
4880 PRIu64 "\n",
4881 GNUNET_ntohll (smt->mid),
4882 ntohs (((const struct GNUNET_MessageHeader *) payload)->type),
4883 ntohs (smt->header.size),
4884 (unsigned long) payload_size,
4885 queue->tc->mq,
4886 queue->address,
4887 queue->qid,
4888 (NULL == pm) ? 0 : pm->logging_uuid);
4889 GNUNET_MQ_send (queue->tc->mq, env);
4890 }
4891}
static uint32_t type
Type string converted to DNS type value.
static unsigned long long payload
How much data are we currently storing in the database?
static void free_timedout_queue_entry(void *cls)
uint64_t GNUNET_ntohll(uint64_t n)
Convert unsigned 64-bit integer to host byte order.
Definition: common_endian.c:54
uint64_t GNUNET_htonll(uint64_t n)
Convert unsigned 64-bit integer to network byte order.
Definition: common_endian.c:37
#define GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG
transport tells communicator it wants to transmit
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed(struct GNUNET_TIME_Relative delay, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1277
#define GNUNET_TIME_UNIT_SECONDS
One second.
Inform communicator about transport's desire to send a message.
Definition: transport.h:563
uint32_t qid
Which queue should we use?
Definition: transport.h:572
uint64_t mid
Message ID, used for flow control.
Definition: transport.h:577
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG.
Definition: transport.h:567
struct GNUNET_PeerIdentity receiver
Receiver identifier.
Definition: transport.h:582
unsigned int num_send
How often the PendingMessage was send via the Queue of this PendingAcknowledgement.

References COMMUNICATOR_TOTAL_QUEUE_LIMIT, CT_COMMUNICATOR, env, free_timedout_queue_entry(), GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_htonll(), GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_new, GNUNET_NO, GNUNET_ntohll(), GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_absolute_get(), GNUNET_TIME_UNIT_SECONDS, GNUNET_TRANSPORT_SendMessageTo::header, GNUNET_TRANSPORT_SendMessageTo::mid, PendingAcknowledgement::next_pa, PendingAcknowledgement::num_send, payload, Neighbour::pid, PendingAcknowledgement::pm, pm, qe, GNUNET_TRANSPORT_SendMessageTo::qid, queue(), QUEUE_LENGTH_LIMIT, GNUNET_TRANSPORT_SendMessageTo::receiver, GNUNET_MessageHeader::size, tc, and type.

Referenced by route_via_neighbour(), start_dv_learn(), transmit_on_queue(), and validation_transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ route_via_neighbour()

static struct GNUNET_TIME_Relative route_via_neighbour ( const struct Neighbour n,
const struct GNUNET_MessageHeader hdr,
enum RouteMessageOptions  options 
)
static

Pick a queue of n under constraints options and schedule transmission of hdr.

Parameters
nneighbour to send to
hdrmessage to send as payload
optionswhether queues must be confirmed or not, and whether we may pick multiple (2) queues
Returns
expected RTT for transmission, GNUNET_TIME_UNIT_FOREVER_REL if sending failed

Definition at line 4905 of file gnunet-service-transport.c.

4908{
4909 struct GNUNET_TIME_Absolute now;
4910 unsigned int candidates;
4911 unsigned int sel1;
4912 unsigned int sel2;
4913 struct GNUNET_TIME_Relative rtt;
4914
4915 /* Pick one or two 'random' queues from n (under constraints of options) */
4916 now = GNUNET_TIME_absolute_get ();
4917 /* FIXME-OPTIMIZE: give queues 'weights' and pick proportional to
4918 weight in the future; weight could be assigned by observed
4919 bandwidth (note: not sure if we should do this for this type
4920 of control traffic though). */
4921 candidates = 0;
4922 for (struct Queue *pos = n->queue_head; NULL != pos;
4923 pos = pos->next_neighbour)
4924 {
4925 if ((0 != (options & RMO_UNCONFIRMED_ALLOWED)) ||
4926 (pos->validated_until.abs_value_us > now.abs_value_us))
4927 candidates++;
4928 }
4929 if (0 == candidates)
4930 {
4931 /* This can happen rarely if the last confirmed queue timed
4932 out just as we were beginning to process this message. */
4934 "Could not route message of type %u to %s: no valid queue\n",
4935 ntohs (hdr->type),
4936 GNUNET_i2s (&n->pid));
4938 "# route selection failed (all no valid queue)",
4939 1,
4940 GNUNET_NO);
4942 }
4943
4946 if (0 == (options & RMO_REDUNDANT))
4947 sel2 = candidates; /* picks none! */
4948 else
4950 candidates = 0;
4951 for (struct Queue *pos = n->queue_head; NULL != pos;
4952 pos = pos->next_neighbour)
4953 {
4954 if ((0 != (options & RMO_UNCONFIRMED_ALLOWED)) ||
4955 (pos->validated_until.abs_value_us > now.abs_value_us))
4956 {
4957 if ((sel1 == candidates) || (sel2 == candidates))
4958 {
4960 "Routing message of type %u to %s using %s (#%u)\n",
4961 ntohs (hdr->type),
4962 GNUNET_i2s (&n->pid),
4963 pos->address,
4964 (sel1 == candidates) ? 1 : 2);
4965 rtt = GNUNET_TIME_relative_min (rtt, pos->pd.aged_rtt);
4966 queue_send_msg (pos, NULL, hdr, ntohs (hdr->size));
4967 }
4968 candidates++;
4969 }
4970 }
4971 return rtt;
4972}
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
uint16_t type
The type of the message (GNUNET_MESSAGE_TYPE_XXXX), in big-endian format.
@ GNUNET_ERROR_TYPE_INFO
struct GNUNET_TIME_Relative GNUNET_TIME_relative_min(struct GNUNET_TIME_Relative t1, struct GNUNET_TIME_Relative t2)
Return the minimum of two relative time values.
Definition: time.c:344
struct Queue * next_neighbour
Kept in a MDLL.

References GNUNET_TIME_Absolute::abs_value_us, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GNUNET_TIME_relative_min(), GNUNET_TIME_UNIT_FOREVER_REL, GST_stats, options, queue_send_msg(), RMO_REDUNDANT, RMO_UNCONFIRMED_ALLOWED, GNUNET_MessageHeader::size, and GNUNET_MessageHeader::type.

Referenced by forward_dv_box(), forward_dv_learn(), handle_communicator_backchannel(), handle_validation_challenge(), route_control_message_without_fc(), send_dv_to_neighbour(), and transmit_cummulative_ack_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ dv_setup_key_state_from_km()

static void dv_setup_key_state_from_km ( const struct GNUNET_ShortHashCode km,
const struct GNUNET_ShortHashCode iv,
struct DVKeyState key 
)
static

Given the key material in km and the initialization vector iv, setup the key material for the backchannel in key.

Parameters
kmraw master secret
ivinitialization vector
[out]keysymmetric cipher and HMAC state to generate

Definition at line 5017 of file gnunet-service-transport.c.

5020{
5021 /* must match what we defive from decapsulated key */
5023 GNUNET_CRYPTO_hkdf_expand (&key->material,
5024 sizeof(key->material),
5025 km,
5026 "gnunet-transport-dv-key",
5027 strlen ("gnunet-transport-dv-key")
5028 ,
5029 km,
5030 sizeof(*km),
5031 iv,
5032 sizeof(*iv),
5033 NULL));
5035 "Deriving backchannel key based on KM %s and IV %s\n",
5036 GNUNET_sh2s (km),
5037 GNUNET_sh2s (iv));
5038 GNUNET_assert (0 == gcry_cipher_open (&key->cipher,
5039 GCRY_CIPHER_AES256 /* low level: go for speed */
5040 ,
5041 GCRY_CIPHER_MODE_CTR,
5042 0 /* flags */));
5043 GNUNET_assert (0 == gcry_cipher_setkey (key->cipher,
5044 &key->material.aes_key,
5045 sizeof(key->material.aes_key)));
5046 gcry_cipher_setctr (key->cipher,
5047 &key->material.aes_ctr,
5048 sizeof(key->material.aes_ctr));
5049}
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_hkdf_expand(void *result, size_t out_len, const struct GNUNET_ShortHashCode *prk,...)
HKDF-Expand using SHA256.
Definition: crypto_hkdf.c:156
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).

References GNUNET_assert, GNUNET_CRYPTO_hkdf_expand(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_sh2s(), GNUNET_YES, and key.

Referenced by encapsulate_for_dv(), and handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ dv_hmac()

static void dv_hmac ( const struct DVKeyState key,
struct GNUNET_HashCode hmac,
const void *  data,
size_t  data_size 
)
static

Do HMAC calculation for backchannel messages over data using key material from key.

Parameters
keykey material (from DH)
[out]hmacset to the HMAC
datadata to perform HMAC calculation over
data_sizenumber of bytes in data

Definition at line 5062 of file gnunet-service-transport.c.

5066{
5067 GNUNET_CRYPTO_hmac (&key->material.hmac_key, data, data_size, hmac);
5068}
static char * data
The data to insert into the dht.
static size_t data_size
Number of bytes in data.
void GNUNET_CRYPTO_hmac(const struct GNUNET_CRYPTO_AuthKey *key, const void *plaintext, size_t plaintext_len, struct GNUNET_HashCode *hmac)
Calculate HMAC of a message (RFC 2104)
Definition: crypto_hash.c:327

References data, data_size, GNUNET_CRYPTO_hmac(), and key.

Referenced by encapsulate_for_dv(), and handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ dv_encrypt()

static void dv_encrypt ( struct DVKeyState key,
const void *  in,
void *  dst,
size_t  in_size 
)
static

Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst.

Parameters
[in,out]keykey material to use
dstwhere to write the result
ininput data to encrypt (plaintext)
in_sizenumber of bytes of input in in and available at dst

Definition at line 5081 of file gnunet-service-transport.c.

5082{
5083 GNUNET_assert (0 ==
5084 gcry_cipher_encrypt (key->cipher, dst, in_size, in, in_size));
5085}

References GNUNET_assert, and key.

Referenced by encapsulate_for_dv().

Here is the caller graph for this function:

◆ dv_decrypt()

static enum GNUNET_GenericReturnValue dv_decrypt ( struct DVKeyState key,
void *  out,
const void *  ciph,
size_t  out_size 
)
static

Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst.

Parameters
[in,out]keykey material to use
ciphcipher text to decrypt
[out]outoutput data to generate (plaintext)
out_sizenumber of bytes of input in ciph and available in out
Returns
GNUNET_OK on success

Definition at line 5099 of file gnunet-service-transport.c.

5103{
5104 return (0 ==
5105 gcry_cipher_decrypt (key->cipher,
5106 out, out_size,
5107 ciph, out_size)) ? GNUNET_OK : GNUNET_SYSERR;
5108}

References GNUNET_OK, GNUNET_SYSERR, and key.

Referenced by handle_dv_box().

Here is the caller graph for this function:

◆ dv_key_clean()

static void dv_key_clean ( struct DVKeyState key)
static

Clean up key material in key.

Parameters
keykey material to clean up (memory must not be free'd!)

Definition at line 5117 of file gnunet-service-transport.c.

5118{
5119 gcry_cipher_close (key->cipher);
5120 GNUNET_CRYPTO_zero_keys (&key->material, sizeof(key->material));
5121}
void GNUNET_CRYPTO_zero_keys(void *buffer, size_t length)
Zero out buffer, securely against compiler optimizations.

References GNUNET_CRYPTO_zero_keys(), and key.

Referenced by encapsulate_for_dv(), and handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ encapsulate_for_dv()

static struct GNUNET_TIME_Relative encapsulate_for_dv ( struct DistanceVector dv,
unsigned int  num_dvhs,
struct DistanceVectorHop **  dvhs,
const struct GNUNET_MessageHeader hdr,
DVMessageHandler  use,
void *  use_cls,
enum RouteMessageOptions  options,
enum GNUNET_GenericReturnValue  without_fc 
)
static

Pick a path of dv under constraints options and schedule transmission of hdr.

Parameters
targetneighbour to ultimately send to
num_dvhslength of the dvhs array
dvhsarray of hops to send the message to
hdrmessage to send as payload
usefunction to call with the encapsulated message
use_clsclosure for use
optionswhether path must be confirmed or not, to be passed to use
without_fcshall this TransportDVBoxMessage be forwarded without flow control.
Returns
expected RTT for transmission, GNUNET_TIME_UNIT_FOREVER_REL if sending failed

Definition at line 5154 of file gnunet-service-transport.c.

5162{
5163 struct TransportDVBoxMessage box_hdr;
5164 struct TransportDVBoxPayloadP payload_hdr;
5165 uint16_t enc_body_size = ntohs (hdr->size);
5166 char enc[sizeof(struct TransportDVBoxPayloadP) + enc_body_size] GNUNET_ALIGN;
5167 struct DVKeyState *key;
5168 struct GNUNET_TIME_Relative rtt;
5169 struct GNUNET_ShortHashCode km;
5170
5171 key = GNUNET_new (struct DVKeyState);
5172 /* Encrypt payload */
5173 box_hdr.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX);
5174 box_hdr.total_hops = htons (0);
5175 box_hdr.without_fc = htons (without_fc);
5176 // update_ephemeral (dv);
5177 if (0 ==
5179 {
5181 &dv->ephemeral_key,
5182 &km);
5183 dv->km = GNUNET_new (struct GNUNET_ShortHashCode);
5184 GNUNET_memcpy (dv->km, &km, sizeof(struct GNUNET_ShortHashCode));
5185 sign_ephemeral (dv);
5186 }
5187 box_hdr.ephemeral_key = dv->ephemeral_key;
5188 payload_hdr.sender_sig = dv->sender_sig;
5189
5191 &box_hdr.iv,
5192 sizeof(box_hdr.iv));
5193 // We are creating this key, so this must work.
5194 // FIXME: Possibly also add return values here. We are processing
5195 // Input from other peers...
5196 dv_setup_key_state_from_km (dv->km, &box_hdr.iv, key);
5197 payload_hdr.sender = GST_my_identity;
5198 payload_hdr.monotonic_time = GNUNET_TIME_absolute_hton (dv->monotime);
5199 dv_encrypt (key, &payload_hdr, enc, sizeof(payload_hdr));
5200 dv_encrypt (key,
5201 hdr,
5202 &enc[sizeof(struct TransportDVBoxPayloadP)],
5203 enc_body_size);
5204 dv_hmac (key, &box_hdr.hmac, enc, sizeof(enc));
5205 dv_key_clean (key);
5207 /* For each selected path, take the pre-computed header and body
5208 and add the path in the middle of the message; then send it. */
5209 for (unsigned int i = 0; i < num_dvhs; i++)
5210 {
5211 struct DistanceVectorHop *dvh = dvhs[i];
5212 unsigned int num_hops = dvh->distance + 1;
5213 char buf[sizeof(struct TransportDVBoxMessage)
5214 + sizeof(struct GNUNET_PeerIdentity) * num_hops
5215 + sizeof(struct TransportDVBoxPayloadP)
5216 + enc_body_size] GNUNET_ALIGN;
5217 struct GNUNET_PeerIdentity *dhops;
5218
5219 box_hdr.header.size = htons (sizeof(buf));
5220 box_hdr.orig_size = htons (sizeof(buf));
5221 box_hdr.num_hops = htons (num_hops);
5222 memcpy (buf, &box_hdr, sizeof(box_hdr));
5223 dhops = (struct GNUNET_PeerIdentity *) &buf[sizeof(box_hdr)];
5224 memcpy (dhops,
5225 dvh->path,
5226 dvh->distance * sizeof(struct GNUNET_PeerIdentity));
5227 dhops[dvh->distance] = dv->target;
5228 if (GNUNET_EXTRA_LOGGING > 0)
5229 {
5230 char *path;
5231
5233 for (unsigned int j = 0; j < num_hops; j++)
5234 {
5235 char *tmp;
5236
5237 GNUNET_asprintf (&tmp, "%s-%s", path, GNUNET_i2s (&dhops[j]));
5238 GNUNET_free (path);
5239 path = tmp;
5240 }
5242 "Routing message of type %u to %s using DV (#%u/%u) via %s\n",
5243 ntohs (hdr->type),
5244 GNUNET_i2s (&dv->target),
5245 i + 1,
5246 num_dvhs,
5247 path);
5248 GNUNET_free (path);
5249 }
5250 rtt = GNUNET_TIME_relative_min (rtt, dvh->pd.aged_rtt);
5251 memcpy (&dhops[num_hops], enc, sizeof(enc));
5252 use (use_cls,
5253 dvh->next_hop,
5254 (const struct GNUNET_MessageHeader *) buf,
5255 options);
5256 GNUNET_free (key);
5257 }
5258 return rtt;
5259}
static OpusEncoder * enc
OPUS encoder.
static void dv_key_clean(struct DVKeyState *key)
Clean up key material in key.
static void sign_ephemeral(struct DistanceVector *dv)
Sign ephemeral keys in our dv are current.
static void dv_hmac(const struct DVKeyState *key, struct GNUNET_HashCode *hmac, const void *data, size_t data_size)
Do HMAC calculation for backchannel messages over data using key material from key.
static void dv_setup_key_state_from_km(const struct GNUNET_ShortHashCode *km, const struct GNUNET_ShortHashCode *iv, struct DVKeyState *key)
Given the key material in km and the initialization vector iv, setup the key material for the backcha...
static void dv_encrypt(struct DVKeyState *key, const void *in, void *dst, size_t in_size)
Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst.
void GNUNET_CRYPTO_random_block(enum GNUNET_CRYPTO_Quality mode, void *buffer, size_t length)
Fill block with a random values.
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_eddsa_kem_encaps(const struct GNUNET_CRYPTO_EddsaPublicKey *pub, struct GNUNET_CRYPTO_HpkeEncapsulation *c, struct GNUNET_ShortHashCode *prk)
Encapsulate key material for a EdDSA public key.
Definition: crypto_hpke.c:312
@ GNUNET_CRYPTO_QUALITY_NONCE
Randomness for IVs etc.
#define GNUNET_ALIGN
gcc-ism to force alignment; we use this to align char-arrays that may then be cast to 'struct's.
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
#define GNUNET_EXTRA_LOGGING
define GNUNET_EXTRA_LOGGING if using this header outside the GNUnet source tree where gnunet_config....
int int GNUNET_asprintf(char **buf, const char *format,...) __attribute__((format(printf
Like asprintf, just portable.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX
Source-routed transport message based DV information gathered.
Structure of the key material used to encrypt backchannel messages.
struct PerformanceData pd
Performance data for this transmission possibility.
unsigned int distance
Number of hops in total to the target (excluding next_hop and target itself).
const struct GNUNET_PeerIdentity * path
Array of distance hops to the target, excluding next_hop.
struct GNUNET_CRYPTO_EddsaPublicKey public_key
A 256-bit hashcode.
struct GNUNET_TIME_Relative aged_rtt
Weighted average for the RTT.
uint16_t num_hops
Number of hops this messages includes.

References PerformanceData::aged_rtt, DistanceVectorHop::distance, dv_encrypt(), dv_hmac(), dv_key_clean(), dv_setup_key_state_from_km(), enc, TransportDVBoxMessage::ephemeral_key, GNUNET_ALIGN, GNUNET_asprintf(), GNUNET_CRYPTO_eddsa_kem_encaps(), GNUNET_CRYPTO_QUALITY_NONCE, GNUNET_CRYPTO_random_block(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_EXTRA_LOGGING, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX, GNUNET_new, GNUNET_strdup, GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_relative_min(), GNUNET_TIME_UNIT_FOREVER_REL, GST_my_identity, TransportDVBoxMessage::header, TransportDVBoxMessage::hmac, TransportDVBoxMessage::iv, key, TransportDVBoxPayloadP::monotonic_time, DistanceVectorHop::next_hop, TransportDVBoxMessage::num_hops, options, TransportDVBoxMessage::orig_size, DistanceVectorHop::path, DistanceVectorHop::pd, GNUNET_TIME_Relative::rel_value_us, TransportDVBoxPayloadP::sender, TransportDVBoxPayloadP::sender_sig, sign_ephemeral(), GNUNET_MessageHeader::size, TransportDVBoxMessage::total_hops, GNUNET_MessageHeader::type, and TransportDVBoxMessage::without_fc.

Referenced by route_control_message_without_fc(), and transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_dv_to_neighbour()

static void send_dv_to_neighbour ( void *  cls,
struct Neighbour next_hop,
const struct GNUNET_MessageHeader hdr,
enum RouteMessageOptions  options 
)
static

Wrapper around route_via_neighbour() that matches the DVMessageHandler structure.

Parameters
clsunused
next_hopwhere to send next
hdrheader of the message to send
optionsmessage options for queue selection

Definition at line 5272 of file gnunet-service-transport.c.

5276{
5277 (void) cls;
5278 (void) route_via_neighbour (next_hop, hdr, RMO_UNCONFIRMED_ALLOWED);
5279}
static struct GNUNET_TIME_Relative route_via_neighbour(const struct Neighbour *n, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
Pick a queue of n under constraints options and schedule transmission of hdr.

References RMO_UNCONFIRMED_ALLOWED, and route_via_neighbour().

Referenced by route_control_message_without_fc().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ route_control_message_without_fc()

static struct GNUNET_TIME_Relative route_control_message_without_fc ( struct VirtualLink vl,
const struct GNUNET_MessageHeader hdr,
enum RouteMessageOptions  options 
)
static

We need to transmit hdr to target.

If necessary, this may involve DV routing. This function routes without applying flow control or congestion control and should only be used for control traffic.

Parameters
targetpeer to receive hdr
hdrheader of the message to route and GNUNET_free()
optionswhich transmission channels are allowed
Returns
expected RTT for transmission, GNUNET_TIME_UNIT_FOREVER_REL if sending failed

Definition at line 5294 of file gnunet-service-transport.c.

5298{
5299 // struct VirtualLink *vl;
5300 struct Neighbour *n;
5301 struct DistanceVector *dv;
5302 struct GNUNET_TIME_Relative rtt1;
5303 struct GNUNET_TIME_Relative rtt2;
5304 const struct GNUNET_PeerIdentity *target = &vl->target;
5305
5307 "Trying to route message of type %u to %s without fc\n",
5308 ntohs (hdr->type),
5309 GNUNET_i2s (target));
5310
5311 // TODO Do this elsewhere. vl should be given as parameter to method.
5312 // vl = lookup_virtual_link (target);
5313 GNUNET_assert (NULL != vl && GNUNET_YES == vl->confirmed);
5314 if (NULL == vl)
5316 n = vl->n;
5317 dv = (0 != (options & RMO_DV_ALLOWED)) ? vl->dv : NULL;
5318 if (0 == (options & RMO_UNCONFIRMED_ALLOWED))
5319 {
5320 /* if confirmed is required, and we do not have anything
5321 confirmed, drop respective options */
5322 if (NULL == n)
5323 n = lookup_neighbour (target);
5324 if ((NULL == dv) && (0 != (options & RMO_DV_ALLOWED)))
5326 }
5327 if ((NULL == n) && (NULL == dv))
5328 {
5330 "Cannot route message of type %u to %s: no route\n",
5331 ntohs (hdr->type),
5332 GNUNET_i2s (target));
5334 "# Messages dropped in routing: no acceptable method",
5335 1,
5336 GNUNET_NO);
5338 }
5340 "Routing message of type %u to %s with options %X\n",
5341 ntohs (hdr->type),
5342 GNUNET_i2s (target),
5343 (unsigned int) options);
5344 /* If both dv and n are possible and we must choose:
5345 flip a coin for the choice between the two; for now 50/50 */
5346 if ((NULL != n) && (NULL != dv) && (0 == (options & RMO_REDUNDANT)))
5347 {
5349 n = NULL;
5350 else
5351 dv = NULL;
5352 }
5353 if ((NULL != n) && (NULL != dv))
5354 options &= ~RMO_REDUNDANT; /* We will do one DV and one direct, that's
5355 enough for redundancy, so clear the flag. */
5358 if (NULL != n)
5359 {
5361 "Try to route message of type %u to %s without fc via neighbour\n",
5362 ntohs (hdr->type),
5363 GNUNET_i2s (target));
5364 rtt1 = route_via_neighbour (n, hdr, options);
5365 }
5366 if (NULL != dv)
5367 {
5368 struct DistanceVectorHop *hops[2];
5369 unsigned int res;
5370
5372 options,
5373 hops,
5374 (0 == (options & RMO_REDUNDANT)) ? 1 : 2);
5375 if (0 == res)
5376 {
5378 "Failed to route message, could not determine DV path\n");
5379 return rtt1;
5380 }
5382 "encapsulate_for_dv 1\n");
5383 rtt2 = encapsulate_for_dv (dv,
5384 res,
5385 hops,
5386 hdr,
5388 NULL,
5390 GNUNET_YES);
5391 }
5392 return GNUNET_TIME_relative_min (rtt1, rtt2);
5393}
static char * res
Currently read line or NULL on EOF.
static void send_dv_to_neighbour(void *cls, struct Neighbour *next_hop, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
Wrapper around route_via_neighbour() that matches the DVMessageHandler structure.
static unsigned int pick_random_dv_hops(const struct DistanceVector *dv, enum RouteMessageOptions options, struct DistanceVectorHop **hops_array, unsigned int hops_array_length)
Pick hops_array_length random DV paths satisfying options.
static struct Neighbour * lookup_neighbour(const struct GNUNET_PeerIdentity *pid)
Lookup neighbour for peer pid.

References DistanceVectorHop::dv, dv_routes, encapsulate_for_dv(), GNUNET_assert, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_TIME_relative_min(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_YES, GST_stats, lookup_neighbour(), options, pick_random_dv_hops(), res, RMO_DV_ALLOWED, RMO_REDUNDANT, RMO_UNCONFIRMED_ALLOWED, route_via_neighbour(), send_dv_to_neighbour(), and GNUNET_MessageHeader::type.

Referenced by consider_sending_fc(), forward_dv_learn(), handle_communicator_backchannel(), handle_validation_challenge(), and transmit_cummulative_ack_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ consider_sending_fc()

static void consider_sending_fc ( void *  cls)
static

Something changed on the virtual link with respect to flow control.

Consider retransmitting the FC window size.

Parameters
clsa struct VirtualLink to work with

Definition at line 5459 of file gnunet-service-transport.c.

5460{
5461 struct VirtualLink *vl = cls;
5462 struct GNUNET_TIME_Absolute monotime;
5463 struct TransportFlowControlMessage *fc;
5465 struct GNUNET_TIME_Relative rtt;
5466 struct GNUNET_TIME_Relative rtt_average;
5467 struct Neighbour *n = vl->n;
5468
5469 if (NULL != n && 0 < n->number_of_addresses)
5470 {
5471 size_t addresses_size =
5472 n->number_of_addresses * sizeof (struct TransportGlobalNattedAddress) + n
5473 ->size_of_global_addresses;
5474 char *tgnas = GNUNET_malloc (addresses_size);
5476 ctx.off = 0;
5477 ctx.tgnas = tgnas;
5478
5479 fc = GNUNET_malloc (sizeof (struct TransportFlowControlMessage)
5480 + addresses_size);
5481 fc->header.size = htons (sizeof(struct TransportFlowControlMessage)
5482 + addresses_size);
5487 &ctx);
5488 GNUNET_memcpy (&fc[1], tgnas, addresses_size);
5490 }
5491 else
5492 {
5493 fc = GNUNET_malloc (sizeof (struct TransportFlowControlMessage));
5494 fc->header.size = htons (sizeof(struct TransportFlowControlMessage));
5495 }
5496
5498 /* OPTIMIZE-FC-BDP: decide sane criteria on when to do this, instead of doing
5499 it always! */
5500 /* For example, we should probably ONLY do this if a bit more than
5501 an RTT has passed, or if the window changed "significantly" since
5502 then. See vl->last_fc_rtt! NOTE: to do this properly, we also
5503 need an estimate for the bandwidth-delay-product for the entire
5504 VL, as that determines "significantly". We have the delay, but
5505 the bandwidth statistics need to be added for the VL!*/(void) duration;
5506
5507 if (NULL != vl->dv)
5508 rtt_average = calculate_rtt (vl->dv);
5509 else
5510 rtt_average = GNUNET_TIME_UNIT_FOREVER_REL;
5511 fc->rtt = GNUNET_TIME_relative_hton (rtt_average);
5513 "Sending FC seq %u to %s with new window %llu %lu %u\n",
5514 (unsigned int) vl->fc_seq_gen,
5515 GNUNET_i2s (&vl->target),
5516 (unsigned long long) vl->incoming_fc_window_size,
5517 (unsigned long) rtt_average.rel_value_us,
5518 vl->sync_ready);
5520 vl->last_fc_transmission = monotime;
5521 fc->sync_ready = vl->sync_ready;
5523 fc->seq = htonl (vl->fc_seq_gen++);
5529 fc->sender_time = GNUNET_TIME_absolute_hton (monotime);
5531 if (GNUNET_TIME_UNIT_FOREVER_REL.rel_value_us == rtt.rel_value_us)
5532 {
5535 "FC retransmission to %s failed, will retry in %s\n",
5536 GNUNET_i2s (&vl->target),
5539 }
5540 else
5541 {
5542 /* OPTIMIZE-FC-BDP: rtt is not ideal, we can do better! */
5543 vl->last_fc_rtt = rtt;
5544 }
5545 if (NULL != vl->fc_retransmit_task)
5548 {
5550 vl->fc_retransmit_count = 0;
5551 }
5552 vl->fc_retransmit_task =
5554 vl->fc_retransmit_count++;
5555 GNUNET_free (fc);
5556}
static struct GNUNET_FS_Handle * ctx
#define MAX_FC_RETRANSMIT_COUNT
Maximum number of FC retransmissions for a running retransmission task.
static void task_consider_sending_fc(void *cls)
Something changed on the virtual link with respect to flow control.
static struct GNUNET_TIME_Relative calculate_rtt(struct DistanceVector *dv)
static enum GNUNET_GenericReturnValue add_global_addresses(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
static struct GNUNET_TIME_Relative route_control_message_without_fc(struct VirtualLink *vl, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
We need to transmit hdr to target.
static struct GNUNET_TIME_Relative duration
Option '-d': duration of the mapping.
Definition: gnunet-vpn.c:90
#define GNUNET_malloc(size)
Wrapper around malloc.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL
Transport signalling incoming backchannel message to a communicator.
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_duration(struct GNUNET_TIME_Absolute whence)
Get the duration of an operation as the difference of the current time and the given start time "henc...
Definition: time.c:438
size_t size_of_global_addresses
Size of all global natted addresses for this neighbour.
unsigned int number_of_addresses
Number of global natted addresses for this neighbour.
Message for Transport-to-Transport Flow control.
uint64_t outbound_window_size
Latest flow control window size we learned from the other peer, in bytes, in NBO.
unsigned int number_of_addresses
Number of TransportGlobalNattedAddress following the struct.
size_t size_of_addresses
Size of all the addresses attached to all TransportGlobalNattedAddress.
uint64_t inbound_window_size
Flow control window size in bytes, in NBO.
struct GNUNET_TIME_AbsoluteNBO sender_time
Timestamp of the sender.
uint32_t seq
Sequence number of the flow control message.
uint64_t outbound_sent
How many bytes has the sender sent that count for flow control at this time.
struct GNUNET_TIME_RelativeNBO rtt
Average RTT for the DistanceVector of the VirtualLink we tell the target.
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL.
unsigned int sync_ready
We tell the target, if we are ready to start the burst.

References add_global_addresses(), calculate_rtt(), ctx, duration, VirtualLink::dv, VirtualLink::fc_retransmit_count, VirtualLink::fc_retransmit_task, VirtualLink::fc_seq_gen, GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_htonll(), GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL, GNUNET_SCHEDULER_add_delayed(), GNUNET_SCHEDULER_cancel(), GNUNET_STRINGS_relative_time_to_string(), GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_relative_hton(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_MINUTES, GNUNET_TIME_UNIT_SECONDS, GNUNET_TIME_UNIT_ZERO, GNUNET_YES, GST_cfg, TransportFlowControlMessage::header, TransportFlowControlMessage::inbound_window_size, VirtualLink::incoming_fc_window_size, VirtualLink::incoming_fc_window_size_loss, VirtualLink::incoming_fc_window_size_used, VirtualLink::last_fc_rtt, VirtualLink::last_fc_transmission, MAX_FC_RETRANSMIT_COUNT, VirtualLink::n, TransportFlowControlMessage::number_of_addresses, Neighbour::number_of_addresses, VirtualLink::outbound_fc_window_size, VirtualLink::outbound_fc_window_size_used, TransportFlowControlMessage::outbound_sent, TransportFlowControlMessage::outbound_window_size, GNUNET_TIME_Relative::rel_value_us, RMO_DV_ALLOWED, route_control_message_without_fc(), TransportFlowControlMessage::rtt, TransportFlowControlMessage::sender_time, TransportFlowControlMessage::seq, GNUNET_MessageHeader::size, TransportFlowControlMessage::size_of_addresses, TransportFlowControlMessage::sync_ready, VirtualLink::sync_ready, VirtualLink::target, task_consider_sending_fc(), AddGlobalAddressesContext::tgnas, GNUNET_MessageHeader::type, and Neighbour::vl.

Referenced by activate_core_visible_dv_path(), check_vl_transmission(), core_env_sent_cb(), handle_flow_control(), handle_validation_response(), and task_consider_sending_fc().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ task_consider_sending_fc()

static void task_consider_sending_fc ( void *  cls)
static

Something changed on the virtual link with respect to flow control.

Consider retransmitting the FC window size.

Parameters
clsa struct VirtualLink to work with

Definition at line 5406 of file gnunet-service-transport.c.

5407{
5408 struct VirtualLink *vl = cls;
5409 vl->fc_retransmit_task = NULL;
5410 consider_sending_fc (cls);
5411}
static void consider_sending_fc(void *cls)
Something changed on the virtual link with respect to flow control.

References consider_sending_fc(), and VirtualLink::fc_retransmit_task.

Referenced by consider_sending_fc().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_address_without_port()

static char * get_address_without_port ( const char *  address)
static

Get the IP address without the port number.

Parameters
addressThe string contains a communicator prefix, IP address and port like this 'tcp-92.68.150.1:55452'.
Returns
String with IP address only.

Definition at line 11901 of file gnunet-service-transport.c.

11902{
11903 const char *colon;
11904 char *colon_rest;
11905 size_t colon_rest_length;
11906 char *address_without_port;
11907
11908 colon = strchr (address,':');
11909 colon_rest = GNUNET_strndup (address, colon - address);
11910 colon_rest_length = strlen (colon_rest);
11911 address_without_port = GNUNET_strndup (&colon_rest[4], colon_rest_length - 4);
11912 GNUNET_free (colon_rest);
11913
11914 return address_without_port;
11915}
#define GNUNET_strndup(a, length)
Wrapper around GNUNET_xstrndup_.

References address, GNUNET_free, and GNUNET_strndup.

Referenced by check_for_global_natted(), check_validation_request_pending(), create_address_entry(), handle_add_queue_message(), iterate_address_and_compare_cb(), and iterate_address_start_burst().

Here is the caller graph for this function:

◆ add_global_addresses()

static enum GNUNET_GenericReturnValue add_global_addresses ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Definition at line 5426 of file gnunet-service-transport.c.

5429{
5430 struct AddGlobalAddressesContext *ctx = cls;
5431 struct TransportGlobalNattedAddress *tgna = value;
5432 char *addr = (char *) &tgna[1];
5433
5435 "sending address %s length %u\n",
5436 addr,
5437 ntohl (tgna->address_length));
5438 GNUNET_memcpy (&(ctx->tgnas[ctx->off]), tgna, sizeof (struct
5440 + ntohl (tgna->address_length));
5441 ctx->off += sizeof(struct TransportGlobalNattedAddress) + ntohl (tgna->
5443
5444 return GNUNET_OK;
5445}
unsigned int address_length
Length of the address following the struct in NBO.

References TransportGlobalNattedAddress::address_length, ctx, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_memcpy, GNUNET_OK, and value.

Referenced by consider_sending_fc().

Here is the caller graph for this function:

◆ calculate_rtt()

static struct GNUNET_TIME_Relative calculate_rtt ( struct DistanceVector dv)
static

Definition at line 9784 of file gnunet-service-transport.c.

9785{
9787 unsigned int n_hops = 0;
9788
9790 "calculate_rtt\n");
9791 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
9792 pos = pos->next_dv)
9793 {
9795 "calculate_rtt %lu\n",
9796 (unsigned long) pos->pd.aged_rtt.rel_value_us);
9797 n_hops++;
9799 aged_rtt, pos
9800 ->distance
9801 + 2), ret);
9802 }
9803
9804 GNUNET_assert (0 != n_hops);
9805
9806 return ret;
9807}
static int ret
Final status code.
Definition: gnunet-arm.c:93
struct GNUNET_TIME_Relative GNUNET_TIME_relative_add(struct GNUNET_TIME_Relative a1, struct GNUNET_TIME_Relative a2)
Add relative times together.
Definition: time.c:587

References GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_TIME_relative_add(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_UNIT_ZERO, and ret.

Referenced by consider_sending_fc(), and handle_flow_control().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_vl_transmission()

static void check_vl_transmission ( struct VirtualLink vl)
static

There is a message at the head of the pending messages for vl which may be ready for transmission.

Check if a queue is ready to take it.

This function must (1) check for flow control to ensure that we can right now send to vl, (2) check that the pending message in the queue is actually eligible, (3) determine if any applicable queue (direct neighbour or DVH path) is ready to accept messages, and (4) prioritize based on the preferences associated with the pending message.

So yeah, easy.

Parameters
vlvirtual link where we should check for transmission

Definition at line 5576 of file gnunet-service-transport.c.

5577{
5578 struct Neighbour *n = vl->n;
5579 struct DistanceVector *dv = vl->dv;
5580 struct GNUNET_TIME_Absolute now;
5581 struct VirtualLink *vl_next_hop;
5582 int elig;
5583
5585 "check_vl_transmission to target %s\n",
5586 GNUNET_i2s (&vl->target));
5587 /* Check that we have an eligible pending message!
5588 (cheaper than having #transmit_on_queue() find out!) */
5589 elig = GNUNET_NO;
5590 for (struct PendingMessage *pm = vl->pending_msg_head; NULL != pm;
5591 pm = pm->next_vl)
5592 {
5594 "check_vl_transmission loop\n");
5595 if (NULL != pm->qe)
5596 continue; /* not eligible, is in a queue! */
5597 if (pm->bytes_msg + vl->outbound_fc_window_size_used >
5599 {
5601 "Stalled message %" PRIu64
5602 " transmission on VL %s due to flow control: %llu < %llu\n",
5603 pm->logging_uuid,
5604 GNUNET_i2s (&vl->target),
5605 (unsigned long long) vl->outbound_fc_window_size,
5606 (unsigned long long) (pm->bytes_msg
5609 return; /* We have a message, but flow control says "nope" */
5610 }
5612 "Target window on VL %s not stalled. Scheduling transmission on queue\n",
5613 GNUNET_i2s (&vl->target));
5614 /* Notify queues at direct neighbours that we are interested */
5615 now = GNUNET_TIME_absolute_get ();
5616 if (NULL != n)
5617 {
5618 for (struct Queue *queue = n->queue_head; NULL != queue;
5619 queue = queue->next_neighbour)
5620 {
5621 if ((GNUNET_YES == queue->idle) &&
5622 (queue->validated_until.abs_value_us > now.abs_value_us))
5623 {
5625 "Direct neighbour %s not stalled\n",
5626 GNUNET_i2s (&n->pid));
5628 queue,
5630 elig = GNUNET_YES;
5631 }
5632 else
5634 "Neighbour Queue QID: %u (%u) busy or invalid\n",
5635 queue->qid,
5636 queue->idle);
5637 }
5638 }
5639 /* Notify queues via DV that we are interested */
5640 if (NULL != dv)
5641 {
5642 /* Do DV with lower scheduler priority, which effectively means that
5643 IF a neighbour exists and is available, we prefer it. */
5644 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
5645 pos = pos->next_dv)
5646 {
5647 struct Neighbour *nh_iter = pos->next_hop;
5648
5649
5650 if (pos->path_valid_until.abs_value_us <= now.abs_value_us)
5651 continue; /* skip this one: path not validated */
5652 else
5653 {
5654 vl_next_hop = lookup_virtual_link (&nh_iter->pid);
5655 GNUNET_assert (NULL != vl_next_hop);
5656 if (pm->bytes_msg + vl_next_hop->outbound_fc_window_size_used >
5657 vl_next_hop->outbound_fc_window_size)
5658 {
5660 "Stalled message %" PRIu64
5661 " transmission on next hop %s due to flow control: %llu < %llu\n",
5662 pm->logging_uuid,
5663 GNUNET_i2s (&vl_next_hop->target),
5664 (unsigned long
5665 long) vl_next_hop->outbound_fc_window_size,
5666 (unsigned long long) (pm->bytes_msg
5667 + vl_next_hop->
5668 outbound_fc_window_size_used));
5669 consider_sending_fc (vl_next_hop);
5670 continue; /* We have a message, but flow control says "nope" for the first hop of this path */
5671 }
5672 for (struct Queue *queue = nh_iter->queue_head; NULL != queue;
5673 queue = queue->next_neighbour)
5674 if ((GNUNET_YES == queue->idle) &&
5675 (queue->validated_until.abs_value_us > now.abs_value_us))
5676 {
5678 "Next hop neighbour %s not stalled\n",
5679 GNUNET_i2s (&nh_iter->pid));
5681 queue,
5683 elig = GNUNET_YES;
5684 }
5685 else
5687 "DV Queue QID: %u (%u) busy or invalid\n",
5688 queue->qid,
5689 queue->idle);
5690 }
5691 }
5692 }
5693 if (GNUNET_YES == elig)
5695 "Eligible message %" PRIu64 " of size %u to %s: %llu/%llu\n",
5696 pm->logging_uuid,
5697 pm->bytes_msg,
5698 GNUNET_i2s (&vl->target),
5699 (unsigned long long) vl->outbound_fc_window_size,
5700 (unsigned long long) (pm->bytes_msg
5702 break;
5703 }
5704}
@ GNUNET_SCHEDULER_PRIORITY_BACKGROUND
Run as background job (higher than idle, lower than default).

References GNUNET_TIME_Absolute::abs_value_us, consider_sending_fc(), VirtualLink::dv, DistanceVector::dv_head, GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_PRIORITY_BACKGROUND, GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_TIME_absolute_get(), GNUNET_TIME_UNIT_ZERO, GNUNET_YES, lookup_virtual_link(), VirtualLink::n, DistanceVectorHop::next_dv, VirtualLink::outbound_fc_window_size, VirtualLink::outbound_fc_window_size_used, VirtualLink::pending_msg_head, Neighbour::pid, pm, queue(), Neighbour::queue_head, schedule_transmit_on_queue(), VirtualLink::target, DistanceVector::vl, and Neighbour::vl.

Referenced by forward_dv_box(), free_queue_entry(), handle_client_send(), handle_flow_control(), and send_msg_from_cache().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_client_send()

static void handle_client_send ( void *  cls,
const struct OutboundMessage obm 
)
static

Client asked for transmission to a peer.

Process the request.

Parameters
clsthe client
obmthe send message that was sent

Definition at line 5714 of file gnunet-service-transport.c.

5715{
5716 struct TransportClient *tc = cls;
5717 struct PendingMessage *pm;
5718 const struct GNUNET_MessageHeader *obmm;
5719 uint32_t bytes_msg;
5720 struct VirtualLink *vl;
5722
5723 GNUNET_assert (CT_CORE == tc->type);
5724 obmm = (const struct GNUNET_MessageHeader *) &obm[1];
5725 bytes_msg = ntohs (obmm->size);
5726 pp = ntohl (obm->priority);
5727 vl = lookup_virtual_link (&obm->peer);
5728 if ((NULL == vl) || (GNUNET_NO == vl->confirmed))
5729 {
5731 "Don't have %s as a neighbour (anymore).\n",
5732 GNUNET_i2s (&obm->peer));
5733 /* Failure: don't have this peer as a neighbour (anymore).
5734 Might have gone down asynchronously, so this is NOT
5735 a protocol violation by CORE. Still count the event,
5736 as this should be rare. */
5739 "# messages dropped (neighbour unknown)",
5740 1,
5741 GNUNET_NO);
5742 return;
5743 }
5744
5745 pm = GNUNET_malloc (sizeof(struct PendingMessage) + bytes_msg);
5747 "1 created pm %p storing vl %p\n",
5748 pm,
5749 vl);
5750 pm->logging_uuid = logging_uuid_gen++;
5751 pm->prefs = pp;
5752 pm->client = tc;
5753 pm->vl = vl;
5754 pm->bytes_msg = bytes_msg;
5755 memcpy (&pm[1], obmm, bytes_msg);
5757 "Sending message of type %u with %u bytes as <%" PRIu64
5758 "> to %s\n",
5759 ntohs (obmm->type),
5760 bytes_msg,
5761 pm->logging_uuid,
5762 GNUNET_i2s (&obm->peer));
5764 tc->details.core.pending_msg_head,
5765 tc->details.core.pending_msg_tail,
5766 pm);
5768 vl->pending_msg_head,
5769 vl->pending_msg_tail,
5770 pm);
5773}
static unsigned long long logging_uuid_gen
Generator of logging_uuid in struct PendingMessage.
#define GNUNET_CONTAINER_MDLL_insert(mdll, head, tail, element)
Insert an element at the head of a MDLL.
GNUNET_MQ_PriorityPreferences
Per envelope preferences and priorities.
uint32_t priority
An enum GNUNET_MQ_PriorityPreferences in NBO.
Definition: transport.h:238
struct GNUNET_PeerIdentity peer
Which peer should receive the message?
Definition: transport.h:252

References check_vl_transmission(), VirtualLink::confirmed, CT_CORE, GNUNET_assert, GNUNET_CONTAINER_MDLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_NO, GNUNET_SERVICE_client_continue(), GNUNET_STATISTICS_update(), GST_stats, logging_uuid_gen, lookup_virtual_link(), OutboundMessage::peer, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, pm, OutboundMessage::priority, GNUNET_MessageHeader::size, tc, and GNUNET_MessageHeader::type.

Here is the call graph for this function:

◆ handle_communicator_backchannel()

static void handle_communicator_backchannel ( void *  cls,
const struct GNUNET_TRANSPORT_CommunicatorBackchannel cb 
)
static

Communicator requests backchannel transmission.

Process the request. Just repacks it into our struct TransportBackchannelEncapsulationMessage * (which for now has exactly the same format, only a different message type) and passes it on for routing.

Parameters
clsthe client
cbthe send message that was sent

Definition at line 5786 of file gnunet-service-transport.c.

5789{
5790 struct Neighbour *n;
5791 struct VirtualLink *vl;
5792 struct TransportClient *tc = cls;
5793 const struct GNUNET_MessageHeader *inbox =
5794 (const struct GNUNET_MessageHeader *) &cb[1];
5795 uint16_t isize = ntohs (inbox->size);
5796 const char *is = ((const char *) &cb[1]) + isize;
5797 size_t slen = strlen (is) + 1;
5798 char
5799 mbuf[slen + isize
5800 + sizeof(struct
5804
5805 /* 0-termination of 'is' was checked already in
5806 #check_communicator_backchannel() */
5808 "Preparing backchannel transmission to %s:%s of type %u and size %u\n",
5809 GNUNET_i2s (&cb->pid),
5810 is,
5811 ntohs (inbox->type),
5812 ntohs (inbox->size));
5813 /* encapsulate and encrypt message */
5814 be->header.type =
5816 be->header.size = htons (sizeof(mbuf));
5817 memcpy (&be[1], inbox, isize);
5818 memcpy (&mbuf[sizeof(struct TransportBackchannelEncapsulationMessage)
5819 + isize],
5820 is,
5821 strlen (is) + 1);
5822 // route_control_message_without_fc (&cb->pid, &be->header, RMO_DV_ALLOWED);
5823 vl = lookup_virtual_link (&cb->pid);
5824 if ((NULL != vl) && (GNUNET_YES == vl->confirmed))
5825 {
5827 }
5828 else
5829 {
5830 /* Use route via neighbour */
5831 n = lookup_neighbour (&cb->pid);
5832 if (NULL != n)
5834 n,
5835 &be->header,
5836 RMO_NONE);
5837 }
5839}
#define GNUNET_MESSAGE_TYPE_TRANSPORT_BACKCHANNEL_ENCAPSULATION
Message type used between transport services when they internally forward communicator backchannel me...
struct GNUNET_PeerIdentity pid
Target peer.
Definition: transport.h:640
Outer layer of an encapsulated backchannel message.
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_BACKCHANNEL_ENCAPSULATION.

References VirtualLink::confirmed, GNUNET_ALIGN, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_BACKCHANNEL_ENCAPSULATION, GNUNET_SERVICE_client_continue(), GNUNET_YES, TransportBackchannelEncapsulationMessage::header, is, lookup_neighbour(), lookup_virtual_link(), GNUNET_TRANSPORT_CommunicatorBackchannel::pid, RMO_DV_ALLOWED, RMO_NONE, route_control_message_without_fc(), route_via_neighbour(), GNUNET_MessageHeader::size, tc, and GNUNET_MessageHeader::type.

Here is the call graph for this function:

◆ check_add_address()

static int check_add_address ( void *  cls,
const struct GNUNET_TRANSPORT_AddAddressMessage aam 
)
static

Address of our peer added.

Test message is well-formed.

Parameters
clsthe client
aamthe send message that was sent
Returns
GNUNET_OK if message is well-formed

Definition at line 5850 of file gnunet-service-transport.c.

5852{
5853 struct TransportClient *tc = cls;
5854
5855 if (CT_COMMUNICATOR != tc->type)
5856 {
5857 GNUNET_break (0);
5858 return GNUNET_SYSERR;
5859 }
5861 return GNUNET_OK;
5862}

References CT_COMMUNICATOR, GNUNET_break, GNUNET_MQ_check_zero_termination, GNUNET_OK, GNUNET_SYSERR, and tc.

◆ store_pi()

static void store_pi ( void *  cls)
static

Ask peerstore to store our address.

Parameters
clsan struct AddressListEntry *

Definition at line 5939 of file gnunet-service-transport.c.

5940{
5941 struct AddressListEntry *ale = cls;
5942 struct GNUNET_MQ_Envelope *env;
5943 const struct GNUNET_MessageHeader *msg;
5944 const char *dash;
5945 char *address_uri;
5947 unsigned int add_success;
5948
5949 dash = strchr (ale->address, '-');
5950 GNUNET_assert (NULL != dash);
5951 dash++;
5952 GNUNET_asprintf (&address_uri,
5953 "%s://%s",
5954 prefix,
5955 dash);
5957 ale->st = NULL;
5959 "Storing our address `%s' in peerstore until %s!\n",
5960 ale->address,
5963 address_uri);
5964 if (GNUNET_OK != add_success)
5965 {
5967 "Storing our address `%s' %s\n",
5968 address_uri,
5969 GNUNET_NO == add_success ? "not done" : "failed");
5970 GNUNET_free (address_uri);
5971 return;
5972 }
5973 else
5974 {
5975
5977 "Storing our address `%s'\n",
5978 address_uri);
5979 }
5980 // FIXME hello_mono_time used here?? What about expiration in ale?
5982 ale->nt,
5985 &ale->signed_address,
5986 &ale->signed_address_len);
5987 GNUNET_free (address_uri);
5993 "store_pi 1\n");
5995 msg,
5996 shc_cont,
5997 ale);
5998 GNUNET_free (env);
5999}
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
static int prefix
If printing the value of PREFIX has been requested.
Definition: gnunet-config.c:65
static void shc_cont(void *cls, int success)
static struct GNUNET_TIME_Absolute hello_mono_time
Monotonic time we use for HELLOs generated at this time.
void GNUNET_HELLO_sign_address(const char *address, enum GNUNET_NetworkType nt, struct GNUNET_TIME_Absolute mono_time, const struct GNUNET_CRYPTO_EddsaPrivateKey *private_key, void **result, size_t *result_size)
Build address record by signing raw information with private key.
Definition: hello-uri.c:1310
enum GNUNET_GenericReturnValue GNUNET_HELLO_builder_add_address(struct GNUNET_HELLO_Builder *builder, const char *address)
Add individual address to the builder.
Definition: hello-uri.c:646
char * GNUNET_HELLO_address_to_prefix(const char *address)
Given an address as a string, extract the prefix that identifies the communicator offering transmissi...
Definition: hello-uri.c:1288
struct GNUNET_MQ_Envelope * GNUNET_HELLO_builder_to_env(const struct GNUNET_HELLO_Builder *builder, const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, struct GNUNET_TIME_Relative expiration_time)
Generate envelope with GNUnet HELLO message (including peer ID) from a builder.
Definition: hello-uri.c:1168
@ GNUNET_ERROR_TYPE_WARNING
const struct GNUNET_MessageHeader * GNUNET_MQ_env_get_msg(const struct GNUNET_MQ_Envelope *env)
Obtain message contained in envelope.
Definition: mq.c:896
struct GNUNET_PEERSTORE_StoreHelloContext * GNUNET_PEERSTORE_hello_add(struct GNUNET_PEERSTORE_Handle *h, const struct GNUNET_MessageHeader *msg, GNUNET_PEERSTORE_Continuation cont, void *cont_cls)
Add hello to peerstore.
size_t signed_address_len
Signed address length.
enum GNUNET_NetworkType nt
Network type offered by this address.
struct GNUNET_PEERSTORE_StoreHelloContext * shc
Store hello handle.
const char * address
The actual address.

References AddressListEntry::address, env, GNUNET_asprintf(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_HELLO_address_to_prefix(), GNUNET_HELLO_builder_add_address(), GNUNET_HELLO_builder_to_env(), GNUNET_HELLO_sign_address(), GNUNET_log, GNUNET_MQ_env_get_msg(), GNUNET_NO, GNUNET_OK, GNUNET_PEERSTORE_hello_add(), GNUNET_STRINGS_absolute_time_to_string(), GNUNET_TIME_UNIT_ZERO, GST_my_hello, GST_my_private_key, hello_mono_time, msg, AddressListEntry::nt, peerstore, prefix, AddressListEntry::shc, shc_cont(), AddressListEntry::signed_address, AddressListEntry::signed_address_len, and AddressListEntry::st.

Referenced by create_address_entry(), peerstore_store_own_cb(), and shc_cont().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ peerstore_store_own_cb()

static void peerstore_store_own_cb ( void *  cls,
int  success 
)
static

Function called when peerstore is done storing our address.

Parameters
clsa struct AddressListEntry
successGNUNET_YES if peerstore was successful

Definition at line 5881 of file gnunet-service-transport.c.

5882{
5883 struct AddressListEntry *ale = cls;
5884
5885 ale->sc = NULL;
5886 if (GNUNET_YES != success)
5888 "Failed to store our own address `%s' in peerstore!\n",
5889 ale->address);
5890 else
5892 "Successfully stored our own address `%s' in peerstore!\n",
5893 ale->address);
5894 /* refresh period is 1/4 of expiration time, that should be plenty
5895 without being excessive. */
5896 ale->st =
5898 4ULL),
5899 &store_pi,
5900 ale);
5901}
static void store_pi(void *cls)
Ask peerstore to store our address.
struct GNUNET_TIME_Relative GNUNET_TIME_relative_divide(struct GNUNET_TIME_Relative rel, unsigned long long factor)
Divide relative time by a given factor.
Definition: time.c:552
struct GNUNET_TIME_Relative expiration
What is a typical lifetime the communicator expects this address to have? (Always from now....

References AddressListEntry::address, AddressListEntry::expiration, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_ERROR, GNUNET_log, GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_relative_divide(), GNUNET_YES, AddressListEntry::sc, AddressListEntry::st, and store_pi().

Referenced by shc_cont().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ shc_cont()

static void shc_cont ( void *  cls,
int  success 
)
static

Definition at line 5905 of file gnunet-service-transport.c.

5906{
5907 struct AddressListEntry *ale = cls;
5909
5912 "transport",
5915 ale->signed_address,
5916 ale->signed_address_len,
5917 expiration,
5920 ale);
5921 if (NULL == ale->sc)
5922 {
5924 "Failed to store our address `%s' with peerstore\n",
5925 ale->address);
5927 &store_pi,
5928 ale);
5929 }
5930}
static struct GNUNET_TIME_Relative expiration
User supplied expiration value.
static void peerstore_store_own_cb(void *cls, int success)
Function called when peerstore is done storing our address.
struct GNUNET_PEERSTORE_StoreContext * GNUNET_PEERSTORE_store(struct GNUNET_PEERSTORE_Handle *h, const char *sub_system, const struct GNUNET_PeerIdentity *peer, const char *key, const void *value, size_t size, struct GNUNET_TIME_Absolute expiry, enum GNUNET_PEERSTORE_StoreOption options, GNUNET_PEERSTORE_Continuation cont, void *cont_cls)
Store a new entry in the PEERSTORE.
#define GNUNET_PEERSTORE_TRANSPORT_HELLO_KEY
Key used for storing HELLOs in the peerstore.
@ GNUNET_PEERSTORE_STOREOPTION_MULTIPLE
Possibly store multiple values under given key.

References AddressListEntry::address, expiration, AddressListEntry::expiration, GNUNET_ERROR_TYPE_WARNING, GNUNET_log, GNUNET_PEERSTORE_store(), GNUNET_PEERSTORE_STOREOPTION_MULTIPLE, GNUNET_PEERSTORE_TRANSPORT_HELLO_KEY, GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_SECONDS, GST_my_identity, peerstore, peerstore_store_own_cb(), AddressListEntry::sc, AddressListEntry::signed_address, AddressListEntry::signed_address_len, AddressListEntry::st, and store_pi().

Referenced by store_pi().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ create_address_entry()

static struct AddressListEntry * create_address_entry ( struct TransportClient tc,
struct GNUNET_TIME_Relative  expiration,
enum GNUNET_NetworkType  nt,
const char *  address,
uint32_t  aid,
size_t  slen 
)
static

Definition at line 6003 of file gnunet-service-transport.c.

6009{
6010 struct AddressListEntry *ale;
6011 char *address_without_port;
6012
6013 ale = GNUNET_malloc (sizeof(struct AddressListEntry) + slen);
6014 ale->tc = tc;
6015 ale->address = (const char *) &ale[1];
6016 ale->expiration = expiration;
6017 ale->aid = aid;
6018 ale->nt = nt;
6019 memcpy (&ale[1], address, slen);
6020 address_without_port = get_address_without_port (ale->address);
6022 "Is this %s a local address (%s)\n",
6023 address_without_port,
6024 ale->address);
6025 if (0 != strcmp ("127.0.0.1", address_without_port))
6026 ale->st = GNUNET_SCHEDULER_add_now (&store_pi, ale);
6027 GNUNET_free (address_without_port);
6028
6029 return ale;
6030}
static char * get_address_without_port(const char *address)
Get the IP address without the port number.
uint32_t aid
Address identifier used by the communicator.

References address, AddressListEntry::address, AddressListEntry::aid, expiration, AddressListEntry::expiration, get_address_without_port(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_malloc, GNUNET_SCHEDULER_add_now(), nt, AddressListEntry::nt, AddressListEntry::st, store_pi(), tc, and AddressListEntry::tc.

Referenced by handle_add_address().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_add_address()

static void handle_add_address ( void *  cls,
const struct GNUNET_TRANSPORT_AddAddressMessage aam 
)
static

Address of our peer added.

Process the request.

Parameters
clsthe client
aamthe send message that was sent

Definition at line 6040 of file gnunet-service-transport.c.

6042{
6043 struct TransportClient *tc = cls;
6044 struct AddressListEntry *ale;
6045 size_t slen;
6046 char *address;
6047
6048 /* 0-termination of &aam[1] was checked in #check_add_address */
6050 "Communicator added address `%s'!\n",
6051 (const char *) &aam[1]);
6052 slen = ntohs (aam->header.size) - sizeof(*aam);
6053 address = GNUNET_malloc (slen);
6054 memcpy (address, &aam[1], slen);
6055 ale = create_address_entry (tc,
6057 ntohl (aam->nt),
6058 address,
6059 aam->aid,
6060 slen);
6061 GNUNET_CONTAINER_DLL_insert (tc->details.communicator.addr_head,
6062 tc->details.communicator.addr_tail,
6063 ale);
6066}
static struct AddressListEntry * create_address_entry(struct TransportClient *tc, struct GNUNET_TIME_Relative expiration, enum GNUNET_NetworkType nt, const char *address, uint32_t aid, size_t slen)
struct GNUNET_TIME_Relative GNUNET_TIME_relative_ntoh(struct GNUNET_TIME_RelativeNBO a)
Convert relative time from network byte order.
Definition: time.c:630
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_ADD_ADDRESS.
Definition: transport.h:291
struct GNUNET_TIME_RelativeNBO expiration
When does the address expire?
Definition: transport.h:301
uint32_t nt
An enum GNUNET_NetworkType in NBO.
Definition: transport.h:306
uint32_t aid
Address identifier (used during deletion).
Definition: transport.h:296

References address, GNUNET_TRANSPORT_AddAddressMessage::aid, create_address_entry(), GNUNET_TRANSPORT_AddAddressMessage::expiration, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_malloc, GNUNET_SERVICE_client_continue(), GNUNET_TIME_relative_ntoh(), GNUNET_TRANSPORT_AddAddressMessage::header, GNUNET_TRANSPORT_AddAddressMessage::nt, GNUNET_MessageHeader::size, and tc.

Here is the call graph for this function:

◆ handle_del_address()

static void handle_del_address ( void *  cls,
const struct GNUNET_TRANSPORT_DelAddressMessage dam 
)
static

Address of our peer deleted.

Process the request.

Parameters
clsthe client
damthe send message that was sent

Definition at line 6076 of file gnunet-service-transport.c.

6078{
6079 struct TransportClient *tc = cls;
6080 struct AddressListEntry *alen;
6081
6082 if (CT_COMMUNICATOR != tc->type)
6083 {
6084 GNUNET_break (0);
6086 return;
6087 }
6088 for (struct AddressListEntry *ale = tc->details.communicator.addr_head;
6089 NULL != ale;
6090 ale = alen)
6091 {
6092 alen = ale->next;
6093 if (dam->aid != ale->aid)
6094 continue;
6095 GNUNET_assert (ale->tc == tc);
6097 "Communicator deleted address `%s'!\n",
6098 ale->address);
6101 return;
6102 }
6104 "Communicator removed address we did not even have.\n");
6106 // GNUNET_SERVICE_client_drop (tc->client);
6107}
struct AddressListEntry * next
Kept in a DLL.
uint32_t aid
Address identifier.
Definition: transport.h:325

References GNUNET_TRANSPORT_DelAddressMessage::aid, CT_COMMUNICATOR, free_address_list_entry(), GNUNET_assert, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_log, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), AddressListEntry::next, and tc.

Here is the call graph for this function:

◆ demultiplex_with_cmc()

static void demultiplex_with_cmc ( struct CommunicatorMessageContext cmc)
static

Given an inbound message msg from a communicator cmc, demultiplex it based on the type calling the right handler.

Parameters
cmccontext for demultiplexing
msgmessage to demultiplex

Definition at line 10175 of file gnunet-service-transport.c.

10176{
10178 { GNUNET_MQ_hd_var_size (fragment_box,
10181 cmc),
10182 GNUNET_MQ_hd_var_size (reliability_box,
10185 cmc),
10186 GNUNET_MQ_hd_var_size (reliability_ack,
10189 cmc),
10190 GNUNET_MQ_hd_var_size (backchannel_encapsulation,
10193 cmc),
10194 GNUNET_MQ_hd_var_size (dv_learn,
10197 cmc),
10198 GNUNET_MQ_hd_var_size (dv_box,
10200 struct TransportDVBoxMessage,
10201 cmc),
10202 GNUNET_MQ_hd_var_size (flow_control,
10205 cmc),
10207 validation_challenge,
10210 cmc),
10212 validation_response,
10215 cmc),
10217 int ret;
10218 const struct GNUNET_MessageHeader *msg = cmc->mh;
10219
10221 "Handling message of type %u with %u bytes\n",
10222 (unsigned int) ntohs (msg->type),
10223 (unsigned int) ntohs (msg->size));
10225 if (GNUNET_SYSERR == ret)
10226 {
10227 GNUNET_break (0);
10229 GNUNET_free (cmc);
10230 return;
10231 }
10232 if (GNUNET_NO == ret)
10233 {
10234 /* unencapsulated 'raw' message */
10235 handle_raw_message (cmc, msg);
10236 }
10237}
struct GNUNET_MQ_MessageHandlers handlers[]
Definition: 003.c:1
static void handle_raw_message(void *cls, const struct GNUNET_MessageHeader *mh)
Communicator gave us an unencapsulated message to pass as-is to CORE.
#define GNUNET_MQ_handler_end()
End-marker for the handlers array.
#define GNUNET_MQ_hd_var_size(name, code, str, ctx)
enum GNUNET_GenericReturnValue GNUNET_MQ_handle_message(const struct GNUNET_MQ_MessageHandler *handlers, const struct GNUNET_MessageHeader *mh)
Call the message message handler that was registered for the type of the given message in the given h...
Definition: mq.c:205
#define GNUNET_MQ_hd_fixed_size(name, code, str, ctx)
#define GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_CHALLENGE
P2P message: transport requests confirmation that an address works.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_FRAGMENT
Type of a fragment of a CORE message created by transport to adjust message length to a queue's MTU.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX
Wrapper around non-fragmented CORE message used to measure RTT and ensure reliability.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN
Message sent for topology discovery at transport level.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_RESPONSE
P2P message: transport proves that an address worked.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK
Confirmation for a GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX.
const struct GNUNET_MessageHeader * mh
The message to demultiplex.
Message handler for a specific message type.
Internal message used by transport for distance vector learning.
Confirmation that the receiver got a GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX.
Outer layer of an encapsulated unfragmented application message sent over an unreliable channel.
Message send to another peer to validate that it can indeed receive messages at a particular address.
Message send to a peer to respond to a #GNUNET_MESSAGE_TYPE_ADDRESS_VALIDATION_CHALLENGE.

References TransportClient::client, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_CHALLENGE, GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_RESPONSE, GNUNET_MESSAGE_TYPE_TRANSPORT_BACKCHANNEL_ENCAPSULATION, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN, GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL, GNUNET_MESSAGE_TYPE_TRANSPORT_FRAGMENT, GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK, GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX, GNUNET_MQ_handle_message(), GNUNET_MQ_handler_end, GNUNET_MQ_hd_fixed_size, GNUNET_MQ_hd_var_size, GNUNET_NO, GNUNET_SERVICE_client_drop(), GNUNET_SYSERR, handle_raw_message(), handlers, CommunicatorMessageContext::mh, msg, ret, GNUNET_MessageHeader::size, CommunicatorMessageContext::tc, and GNUNET_MessageHeader::type.

Referenced by backtalker_monotime_cb(), handle_dv_box(), handle_fragment_box(), handle_incoming_msg(), and handle_reliability_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ core_env_sent_cb()

static void core_env_sent_cb ( void *  cls)
static

Function called when we are done giving a message of a certain size to CORE and should thus decrement the number of bytes of RAM reserved for that peer's MQ.

Parameters
clsa struct CoreSentContext

Definition at line 6129 of file gnunet-service-transport.c.

6130{
6131 struct CoreSentContext *ctx = cls;
6132 struct VirtualLink *vl = ctx->vl;
6133
6134 if (NULL == vl)
6135 {
6136 /* lost the link in the meantime, ignore */
6137 GNUNET_free (ctx);
6138 return;
6139 }
6142 vl->incoming_fc_window_size_ram -= ctx->size;
6143 vl->incoming_fc_window_size_used += ctx->isize;
6145 GNUNET_free (ctx);
6146}

References consider_sending_fc(), VirtualLink::csc_head, VirtualLink::csc_tail, ctx, GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_free, VirtualLink::incoming_fc_window_size_ram, and VirtualLink::incoming_fc_window_size_used.

Referenced by finish_handling_raw_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ finish_handling_raw_message()

static void finish_handling_raw_message ( struct VirtualLink vl,
const struct GNUNET_MessageHeader mh,
struct CommunicatorMessageContext cmc,
unsigned int  free_cmc 
)
static

Definition at line 6150 of file gnunet-service-transport.c.

6154{
6155 uint16_t size = ntohs (mh->size);
6156 int have_core;
6157
6158 if (vl->incoming_fc_window_size_ram > UINT_MAX - size)
6159 {
6161 "# CORE messages dropped (FC arithmetic overflow)",
6162 1,
6163 GNUNET_NO);
6165 "CORE messages of type %u with %u bytes dropped (FC arithmetic overflow)\n",
6166 (unsigned int) ntohs (mh->type),
6167 (unsigned int) ntohs (mh->size));
6168 if (GNUNET_YES == free_cmc)
6170 return;
6171 }
6173 {
6175 "# CORE messages dropped (FC window overflow)",
6176 1,
6177 GNUNET_NO);
6179 "CORE messages of type %u with %u bytes dropped (FC window overflow)\n",
6180 (unsigned int) ntohs (mh->type),
6181 (unsigned int) ntohs (mh->size));
6182 if (GNUNET_YES == free_cmc)
6184 return;
6185 }
6186
6187 /* Forward to all CORE clients */
6188 have_core = GNUNET_NO;
6189 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
6190 {
6191 struct GNUNET_MQ_Envelope *env;
6192 struct InboundMessage *im;
6193 struct CoreSentContext *ctx;
6194
6195 if (CT_CORE != tc->type)
6196 continue;
6199 ctx = GNUNET_new (struct CoreSentContext);
6200 ctx->vl = vl;
6201 ctx->size = size;
6202 ctx->isize = (GNUNET_NO == have_core) ? size : 0;
6203 have_core = GNUNET_YES;
6206 im->peer = cmc->im.sender;
6207 memcpy (&im[1], mh, size);
6208 GNUNET_MQ_send (tc->mq, env);
6210 }
6211 if (GNUNET_NO == have_core)
6212 {
6214 "Dropped message to CORE: no CORE client connected!\n");
6215 /* Nevertheless, count window as used, as it is from the
6216 perspective of the other peer! */
6218 /* TODO-M1 */
6220 "Dropped message of type %u with %u bytes to CORE: no CORE client connected!\n",
6221 (unsigned int) ntohs (mh->type),
6222 (unsigned int) ntohs (mh->size));
6223 if (GNUNET_YES == free_cmc)
6225 return;
6226 }
6228 "Delivered message from %s of type %u to CORE recv window %d\n",
6229 GNUNET_i2s (&cmc->im.sender),
6230 ntohs (mh->type),
6232 if (vl->core_recv_window > 0)
6233 {
6234 if (GNUNET_YES == free_cmc)
6236 return;
6237 }
6238 /* Wait with calling #finish_cmc_handling(cmc) until the message
6239 was processed by CORE MQs (for CORE flow control)! */
6240 if (GNUNET_YES == free_cmc)
6242}
static struct GNUNET_CADET_Handle * mh
Cadet handle.
Definition: gnunet-cadet.c:92
static void core_env_sent_cb(void *cls)
Function called when we are done giving a message of a certain size to CORE and should thus decrement...
void GNUNET_MQ_notify_sent(struct GNUNET_MQ_Envelope *ev, GNUNET_SCHEDULER_TaskCallback cb, void *cb_cls)
Call a callback once the envelope has been sent, that is, sending it can not be canceled anymore.
Definition: mq.c:655
#define GNUNET_MESSAGE_TYPE_TRANSPORT_RECV
Message from TRANSPORT notifying about a message that was received.
struct GNUNET_PeerIdentity sender
Sender identifier.
Definition: transport.h:358
Message used to notify the transport API about a message received from the network.
Definition: transport.h:143
struct GNUNET_PeerIdentity peer
Which peer sent the message?
Definition: transport.h:152

References VirtualLink::available_fc_window_size, clients_head, VirtualLink::cmc_head, VirtualLink::cmc_tail, core_env_sent_cb(), VirtualLink::core_recv_window, VirtualLink::csc_head, VirtualLink::csc_tail, CT_CORE, ctx, env, finish_cmc_handling_with_continue(), GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_RECV, GNUNET_MQ_msg_extra, GNUNET_MQ_notify_sent(), GNUNET_MQ_send(), GNUNET_new, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_YES, GST_stats, CommunicatorMessageContext::im, VirtualLink::incoming_fc_window_size_ram, VirtualLink::incoming_fc_window_size_used, mh, InboundMessage::peer, GNUNET_TRANSPORT_IncomingMessage::sender, size, tc, and CoreSentContext::vl.

Referenced by handle_raw_message(), and send_msg_from_cache().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_raw_message()

static void handle_raw_message ( void *  cls,
const struct GNUNET_MessageHeader mh 
)
static

Communicator gave us an unencapsulated message to pass as-is to CORE.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
mhthe message that was received

Definition at line 6254 of file gnunet-service-transport.c.

6255{
6256 struct CommunicatorMessageContext *cmc = cls;
6257 // struct CommunicatorMessageContext *cmc_copy =
6258 // GNUNET_new (struct CommunicatorMessageContext);
6259 struct GNUNET_MessageHeader *mh_copy;
6260 struct RingBufferEntry *rbe;
6261 struct VirtualLink *vl;
6262 uint16_t size = ntohs (mh->size);
6263
6265 "Handling raw message of type %u with %u bytes\n",
6266 (unsigned int) ntohs (mh->type),
6267 (unsigned int) ntohs (mh->size));
6268
6269 if ((size > UINT16_MAX - sizeof(struct InboundMessage)) ||
6270 (size < sizeof(struct GNUNET_MessageHeader)))
6271 {
6272 struct GNUNET_SERVICE_Client *client = cmc->tc->client;
6273
6274 GNUNET_break (0);
6275 finish_cmc_handling (cmc);
6277 return;
6278 }
6279 vl = lookup_virtual_link (&cmc->im.sender);
6280 if ((NULL == vl) || (GNUNET_NO == vl->confirmed))
6281 {
6282 /* FIXME: sender is giving us messages for CORE but we don't have
6283 the link up yet! I *suspect* this can happen right now (i.e.
6284 sender has verified us, but we didn't verify sender), but if
6285 we pass this on, CORE would be confused (link down, messages
6286 arrive). We should investigate more if this happens often,
6287 or in a persistent manner, and possibly do "something" about
6288 it. Thus logging as error for now. */
6289
6290 mh_copy = GNUNET_malloc (size);
6291 rbe = GNUNET_new (struct RingBufferEntry);
6292 rbe->cmc = cmc;
6293 /*cmc_copy->tc = cmc->tc;
6294 cmc_copy->im = cmc->im;*/
6295 GNUNET_memcpy (mh_copy, mh, size);
6296
6297 rbe->mh = mh_copy;
6298
6300 {
6301 struct RingBufferEntry *rbe_old = ring_buffer[ring_buffer_head];
6302 GNUNET_free (rbe_old->cmc);
6303 GNUNET_free (rbe_old->mh);
6304 GNUNET_free (rbe_old);
6305 }
6306 ring_buffer[ring_buffer_head] = rbe;// cmc_copy;
6307 // cmc_copy->mh = (const struct GNUNET_MessageHeader *) mh_copy;
6308 cmc->mh = (const struct GNUNET_MessageHeader *) mh_copy;
6310 "Storing message for %s and type %u (%u) in ring buffer head %u is full %u\n",
6311 GNUNET_i2s (&cmc->im.sender),
6312 (unsigned int) ntohs (mh->type),
6313 (unsigned int) ntohs (mh_copy->type),
6317 {
6318 ring_buffer_head = 0;
6320 }
6321 else
6323
6325 "%u items stored in ring buffer\n",
6328
6329 /*GNUNET_break_op (0);
6330 GNUNET_STATISTICS_update (GST_stats,
6331 "# CORE messages dropped (virtual link still down)",
6332 1,
6333 GNUNET_NO);
6334
6335 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
6336 "CORE messages of type %u with %u bytes dropped (virtual link still down)\n",
6337 (unsigned int) ntohs (mh->type),
6338 (unsigned int) ntohs (mh->size));
6339 finish_cmc_handling (cmc);*/
6342 // GNUNET_free (cmc);
6343 return;
6344 }
6346}
static unsigned int is_ring_buffer_full
Is the ring buffer filled up to RING_BUFFER_SIZE.
static void finish_cmc_handling(struct CommunicatorMessageContext *cmc)
static void finish_handling_raw_message(struct VirtualLink *vl, const struct GNUNET_MessageHeader *mh, struct CommunicatorMessageContext *cmc, unsigned int free_cmc)
#define RING_BUFFER_SIZE
Size of ring buffer to cache CORE and forwarded DVBox messages.
static unsigned int ring_buffer_head
Head of the ring buffer.
static struct RingBufferEntry * ring_buffer[RING_BUFFER_SIZE]
Ring buffer for a CORE message we did not deliver to CORE, because of missing virtual link to sender.
Handle to a client that is connected to a service.
Definition: service.c:249
Entry for the ring buffer caching messages send to core, when virtual link is available.
struct CommunicatorMessageContext * cmc
Communicator context for this ring buffer entry.
struct GNUNET_MessageHeader * mh
The message in this entry.

References TransportClient::client, RingBufferEntry::cmc, VirtualLink::confirmed, CommunicatorMessageContext::continue_send, finish_cmc_handling(), finish_cmc_handling_with_continue(), finish_handling_raw_message(), GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_memcpy, GNUNET_new, GNUNET_NO, GNUNET_SERVICE_client_drop(), GNUNET_YES, CommunicatorMessageContext::im, is_ring_buffer_full, lookup_virtual_link(), mh, CommunicatorMessageContext::mh, RingBufferEntry::mh, ring_buffer, ring_buffer_head, RING_BUFFER_SIZE, GNUNET_TRANSPORT_IncomingMessage::sender, size, CommunicatorMessageContext::tc, and GNUNET_MessageHeader::type.

Referenced by demultiplex_with_cmc().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_fragment_box()

static int check_fragment_box ( void *  cls,
const struct TransportFragmentBoxMessage fb 
)
static

Communicator gave us a fragment box.

Check the message.

Parameters
clsa struct CommunicatorMessageContext
fbthe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 6357 of file gnunet-service-transport.c.

6358{
6359 uint16_t size = ntohs (fb->header.size);
6360 uint16_t bsize = size - sizeof(*fb);
6361
6362 (void) cls;
6363 if (0 == bsize)
6364 {
6365 GNUNET_break_op (0);
6366 return GNUNET_SYSERR;
6367 }
6368 if (bsize + ntohs (fb->frag_off) > ntohs (fb->msg_size))
6369 {
6370 GNUNET_break_op (0);
6371 return GNUNET_SYSERR;
6372 }
6373 if (ntohs (fb->frag_off) >= ntohs (fb->msg_size))
6374 {
6375 GNUNET_break_op (0);
6376 return GNUNET_SYSERR;
6377 }
6378 return GNUNET_YES;
6379}
static unsigned int bsize
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_FRAGMENT.

References bsize, TransportFragmentBoxMessage::frag_off, GNUNET_break_op, GNUNET_SYSERR, GNUNET_YES, TransportFragmentBoxMessage::header, TransportFragmentBoxMessage::msg_size, GNUNET_MessageHeader::size, and size.

◆ destroy_ack_cummulator()

static void destroy_ack_cummulator ( void *  cls)
static

Clean up an idle cumulative acknowledgement data structure.

Parameters
clsa struct AcknowledgementCummulator *

Definition at line 6388 of file gnunet-service-transport.c.

6389{
6390 struct AcknowledgementCummulator *ac = cls;
6391
6392 ac->task = NULL;
6393 GNUNET_assert (0 == ac->num_acks);
6395 GNUNET_YES ==
6397 GNUNET_free (ac);
6398}
Data structure in which we track acknowledgements still to be sent to the.
struct GNUNET_SCHEDULER_Task * task
Task scheduled either to transmit the cumulative ACK message, or to clean up this data structure afte...
struct GNUNET_PeerIdentity target
Target peer for which we are accumulating ACKs here.
unsigned int num_acks
Number of entries used in ack_uuids.

References ack_cummulators, GNUNET_assert, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_free, GNUNET_YES, AcknowledgementCummulator::num_acks, AcknowledgementCummulator::target, and AcknowledgementCummulator::task.

Referenced by transmit_cummulative_ack_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ transmit_cummulative_ack_cb()

static void transmit_cummulative_ack_cb ( void *  cls)
static

Do the transmission of a cumulative acknowledgement now.

Parameters
clsa struct AcknowledgementCummulator *

Definition at line 6407 of file gnunet-service-transport.c.

6408{
6409 struct Neighbour *n;
6410 struct VirtualLink *vl;
6411 struct AcknowledgementCummulator *ac = cls;
6412 char buf[sizeof(struct TransportReliabilityAckMessage)
6413 + ac->num_acks
6415 struct TransportReliabilityAckMessage *ack =
6416 (struct TransportReliabilityAckMessage *) buf;
6418
6419 ac->task = NULL;
6421 "Sending ACK with %u components to %s\n",
6422 ac->num_acks,
6423 GNUNET_i2s (&ac->target));
6424 GNUNET_assert (0 < ac->num_acks);
6426 ack->header.size =
6427 htons (sizeof(*ack)
6428 + ac->num_acks * sizeof(struct TransportCummulativeAckPayloadP));
6429 ack->ack_counter = htonl (ac->ack_counter += ac->num_acks);
6430 ap = (struct TransportCummulativeAckPayloadP *) &ack[1];
6431 for (unsigned int i = 0; i < ac->num_acks; i++)
6432 {
6433 ap[i].ack_uuid = ac->ack_uuids[i].ack_uuid;
6436 }
6437 /*route_control_message_without_fc (
6438 &ac->target,
6439 &ack->header,
6440 RMO_DV_ALLOWED);*/
6441 vl = lookup_virtual_link (&ac->target);
6442 if ((NULL != vl) && (GNUNET_YES == vl->confirmed))
6443 {
6445 vl,
6446 &ack->header,
6448 }
6449 else
6450 {
6451 /* Use route via neighbour */
6452 n = lookup_neighbour (&ac->target);
6453 if (NULL != n)
6455 n,
6456 &ack->header,
6457 RMO_NONE);
6458 }
6459 ac->num_acks = 0;
6462 ac);
6463}
#define ACK_CUMMULATOR_TIMEOUT
How long until we forget about historic accumulators and thus reset the ACK counter?...
static void destroy_ack_cummulator(void *cls)
Clean up an idle cumulative acknowledgement data structure.
struct TransportCummulativeAckPayload ack_uuids[64]
ACK data being accumulated.
uint32_t ack_counter
Counter to produce the ack_counter in the struct TransportReliabilityAckMessage.
struct GNUNET_TIME_RelativeNBO ack_delay
How long was the ACK delayed for generating cumulative ACKs? Used to calculate the correct network RT...
struct AcknowledgementUUIDP ack_uuid
UUID of a message being acknowledged.
struct GNUNET_TIME_Absolute receive_time
When did we receive the message we are ACKing? Used to calculate the delay we introduced by cummulati...
struct AcknowledgementUUIDP ack_uuid
UUID of a message being acknowledged.
uint32_t ack_counter
Counter of ACKs transmitted by the sender to us.
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK.

References TransportReliabilityAckMessage::ack_counter, AcknowledgementCummulator::ack_counter, ACK_CUMMULATOR_TIMEOUT, TransportCummulativeAckPayloadP::ack_delay, TransportCummulativeAckPayloadP::ack_uuid, TransportCummulativeAckPayload::ack_uuid, AcknowledgementCummulator::ack_uuids, VirtualLink::confirmed, destroy_ack_cummulator(), GNUNET_ALIGN, GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_ACK, GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_relative_hton(), GNUNET_YES, TransportReliabilityAckMessage::header, lookup_neighbour(), lookup_virtual_link(), AcknowledgementCummulator::num_acks, TransportCummulativeAckPayload::receive_time, RMO_DV_ALLOWED, RMO_NONE, route_control_message_without_fc(), route_via_neighbour(), GNUNET_MessageHeader::size, AcknowledgementCummulator::target, AcknowledgementCummulator::task, and GNUNET_MessageHeader::type.

Referenced by cummulative_ack().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ cummulative_ack()

static void cummulative_ack ( const struct GNUNET_PeerIdentity pid,
const struct AcknowledgementUUIDP ack_uuid,
struct GNUNET_TIME_Absolute  max_delay 
)
static

Transmit an acknowledgement for ack_uuid to pid delaying transmission by at most ack_delay.

Parameters
pidtarget peer
ack_uuidUUID to ack
max_delayhow long can the ACK wait

Definition at line 6475 of file gnunet-service-transport.c.

6478{
6479 struct AcknowledgementCummulator *ac;
6480
6482 "Scheduling ACK %s for transmission to %s\n",
6483 GNUNET_uuid2s (&ack_uuid->value),
6484 GNUNET_i2s (pid));
6486 if (NULL == ac)
6487 {
6489 ac->target = *pid;
6490 ac->min_transmission_time = max_delay;
6494 &ac->target,
6495 ac,
6497 }
6498 else
6499 {
6500 if (MAX_CUMMULATIVE_ACKS == ac->num_acks)
6501 {
6502 /* must run immediately, ack buffer full! */
6504 }
6508 }
6511 ac->ack_uuids[ac->num_acks].ack_uuid = *ack_uuid;
6512 ac->num_acks++;
6515 ac);
6516}
#define MAX_CUMMULATIVE_ACKS
Maximum number of messages we acknowledge together in one cumulative ACK.
static void transmit_cummulative_ack_cb(void *cls)
Do the transmission of a cumulative acknowledgement now.
int GNUNET_CONTAINER_multipeermap_put(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
@ GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_min(struct GNUNET_TIME_Absolute t1, struct GNUNET_TIME_Absolute t2)
Return the minimum of two absolute time values.
Definition: time.c:360
struct GNUNET_TIME_Absolute min_transmission_time
When is task run (only used if num_acks is non-zero)?

References ack_cummulators, TransportCummulativeAckPayload::ack_uuid, AcknowledgementCummulator::ack_uuids, GNUNET_assert, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_cancel(), GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_min(), GNUNET_uuid2s(), GNUNET_YES, MAX_CUMMULATIVE_ACKS, AcknowledgementCummulator::min_transmission_time, AcknowledgementCummulator::num_acks, pid, TransportCummulativeAckPayload::receive_time, AcknowledgementCummulator::target, AcknowledgementCummulator::task, transmit_cummulative_ack_cb(), and AcknowledgementUUIDP::value.

Referenced by handle_fragment_box(), and handle_reliability_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ find_by_message_uuid()

static int find_by_message_uuid ( void *  cls,
uint32_t  key,
void *  value 
)
static

Iterator called to find a reassembly context by the message UUID in the multihashmap32.

Parameters
clsa struct FindByMessageUuidContext
keya key (unused)
valuea struct ReassemblyContext
Returns
GNUNET_YES if not found, GNUNET_NO if found

Definition at line 6546 of file gnunet-service-transport.c.

6547{
6548 struct FindByMessageUuidContext *fc = cls;
6549 struct ReassemblyContext *rc = value;
6550
6551 (void) key;
6552 if (0 == GNUNET_memcmp (&fc->message_uuid, &rc->msg_uuid))
6553 {
6554 fc->rc = rc;
6555 return GNUNET_NO;
6556 }
6557 return GNUNET_YES;
6558}
Closure for find_by_message_uuid.
struct ReassemblyContext * rc
Set to the reassembly context if found.
struct MessageUUIDP message_uuid
UUID to look for.

References GNUNET_memcmp, GNUNET_NO, GNUNET_YES, key, FindByMessageUuidContext::message_uuid, ReassemblyContext::msg_uuid, FindByMessageUuidContext::rc, and value.

Referenced by handle_fragment_box().

Here is the caller graph for this function:

◆ handle_fragment_box()

static void handle_fragment_box ( void *  cls,
const struct TransportFragmentBoxMessage fb 
)
static

Communicator gave us a fragment.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
fbthe message that was received

Definition at line 6569 of file gnunet-service-transport.c.

6570{
6571 struct CommunicatorMessageContext *cmc = cls;
6572 struct VirtualLink *vl;
6573 struct ReassemblyContext *rc;
6574 const struct GNUNET_MessageHeader *msg;
6575 uint16_t msize;
6576 uint16_t fsize;
6577 uint16_t frag_off;
6578 char *target;
6579 struct GNUNET_TIME_Relative cdelay;
6580 struct FindByMessageUuidContext fc;
6581
6582 vl = lookup_virtual_link (&cmc->im.sender);
6583 if ((NULL == vl) || (GNUNET_NO == vl->confirmed))
6584 {
6585 struct GNUNET_SERVICE_Client *client = cmc->tc->client;
6586
6588 "No virtual link for %s to handle fragment\n",
6589 GNUNET_i2s (&cmc->im.sender));
6590 GNUNET_break (0);
6591 finish_cmc_handling (cmc);
6593 return;
6594 }
6595 if (NULL == vl->reassembly_map)
6596 {
6598 vl->reassembly_heap =
6603 vl);
6604 }
6605 msize = ntohs (fb->msg_size);
6606 fc.message_uuid = fb->msg_uuid;
6607 fc.rc = NULL;
6609 fb->msg_uuid.uuid,
6611 &fc);
6612 fsize = ntohs (fb->header.size) - sizeof(*fb);
6613 if (NULL == (rc = fc.rc))
6614 {
6615 rc = GNUNET_malloc (sizeof(*rc) + msize /* reassembly payload buffer */
6616 + (msize + 7) / 8 * sizeof(uint8_t) /* bitfield */);
6617 rc->msg_uuid = fb->msg_uuid;
6618 rc->virtual_link = vl;
6619 rc->msg_size = msize;
6620 rc->reassembly_timeout =
6624 rc,
6628 vl->reassembly_map,
6629 rc->msg_uuid.uuid,
6630 rc,
6632 target = (char *) &rc[1];
6633 rc->bitfield = (uint8_t *) (target + rc->msg_size);
6634 if (fsize != rc->msg_size)
6635 rc->msg_missing = rc->msg_size;
6636 else
6637 rc->msg_missing = 0;
6639 "Received fragment with size %u at offset %u/%u %u bytes missing from %s for NEW message %"
6640 PRIu64 "\n",
6641 fsize,
6642 ntohs (fb->frag_off),
6643 msize,
6644 rc->msg_missing,
6645 GNUNET_i2s (&cmc->im.sender),
6646 fb->msg_uuid.uuid);
6647 }
6648 else
6649 {
6650 target = (char *) &rc[1];
6652 "Received fragment at offset %u/%u from %s for message %u\n",
6653 ntohs (fb->frag_off),
6654 msize,
6655 GNUNET_i2s (&cmc->im.sender),
6656 (unsigned int) fb->msg_uuid.uuid);
6657 }
6658 if (msize != rc->msg_size)
6659 {
6660 GNUNET_break (0);
6661 finish_cmc_handling (cmc);
6662 return;
6663 }
6664
6665 /* reassemble */
6666 if (0 == fsize)
6667 {
6668 GNUNET_break (0);
6669 finish_cmc_handling (cmc);
6670 return;
6671 }
6672 frag_off = ntohs (fb->frag_off);
6673 if (frag_off + fsize > msize)
6674 {
6675 /* Fragment (plus fragment size) exceeds message size! */
6676 GNUNET_break_op (0);
6677 finish_cmc_handling (cmc);
6678 return;
6679 }
6680 memcpy (&target[frag_off], &fb[1], fsize);
6681 /* update bitfield and msg_missing */
6682 for (unsigned int i = frag_off; i < frag_off + fsize; i++)
6683 {
6684 if (0 == (rc->bitfield[i / 8] & (1 << (i % 8))))
6685 {
6686 rc->bitfield[i / 8] |= (1 << (i % 8));
6687 rc->msg_missing--;
6688 }
6689 }
6690
6691 /* Compute cumulative ACK */
6693 cdelay = GNUNET_TIME_relative_multiply (cdelay, rc->msg_missing / fsize);
6694 if (0 == rc->msg_missing)
6695 cdelay = GNUNET_TIME_UNIT_ZERO;
6696 cummulative_ack (&cmc->im.sender,
6697 &fb->ack_uuid,
6700 /* is reassembly complete? */
6701 if (0 != rc->msg_missing)
6702 {
6703 finish_cmc_handling (cmc);
6704 return;
6705 }
6706 /* reassembly is complete, verify result */
6707 msg = (const struct GNUNET_MessageHeader *) &rc[1];
6708 if (ntohs (msg->size) != rc->msg_size)
6709 {
6710 GNUNET_break (0);
6712 finish_cmc_handling (cmc);
6713 return;
6714 }
6715 /* successful reassembly */
6717 "Fragment reassembly complete for message %u\n",
6718 (unsigned int) fb->msg_uuid.uuid);
6719 /* FIXME: check that the resulting msg is NOT a
6720 DV Box or Reliability Box, as that is NOT allowed! */
6721 cmc->mh = msg;
6723 /* FIXME-OPTIMIZE: really free here? Might be bad if fragments are still
6724 en-route and we forget that we finished this reassembly immediately!
6725 -> keep around until timeout?
6726 -> shorten timeout based on ACK? */
6728}
static void cummulative_ack(const struct GNUNET_PeerIdentity *pid, const struct AcknowledgementUUIDP *ack_uuid, struct GNUNET_TIME_Absolute max_delay)
Transmit an acknowledgement for ack_uuid to pid delaying transmission by at most ack_delay.
static int find_by_message_uuid(void *cls, uint32_t key, void *value)
Iterator called to find a reassembly context by the message UUID in the multihashmap32.
#define REASSEMBLY_EXPIRATION
How long do we keep partially reassembled messages around before giving up?
static void demultiplex_with_cmc(struct CommunicatorMessageContext *cmc)
Given an inbound message msg from a communicator cmc, demultiplex it based on the type calling the ri...
int GNUNET_CONTAINER_multihashmap32_get_multiple(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, GNUNET_CONTAINER_MultiHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map that match a particular key.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multihashmap32_put(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
struct GNUNET_CONTAINER_MultiHashMap32 * GNUNET_CONTAINER_multihashmap32_create(unsigned int len)
Create a 32-bit key multi hash map.
@ GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE
Allow multiple values with the same key.
struct GNUNET_CONTAINER_HeapNode * GNUNET_CONTAINER_heap_insert(struct GNUNET_CONTAINER_Heap *heap, void *element, GNUNET_CONTAINER_HeapCostType cost)
Inserts a new element into the heap.
struct GNUNET_CONTAINER_Heap * GNUNET_CONTAINER_heap_create(enum GNUNET_CONTAINER_HeapOrder order)
Create a new heap.
@ GNUNET_CONTAINER_HEAP_ORDER_MIN
Heap with the minimum cost at the root.
struct GNUNET_TIME_Absolute last_frag
Time we received the last fragment.
uint8_t * bitfield
Bitfield with msg_size bits representing the positions where we have received fragments.
uint16_t msg_size
How big is the message we are reassembling in total?
uint16_t msg_missing
How many bytes of the message are still missing? Defragmentation is complete when msg_missing == 0.
uint16_t frag_off
Offset of this fragment in the overall message.
struct MessageUUIDP msg_uuid
Original message ID for of the message that all the fragments belong to.
struct AcknowledgementUUIDP ack_uuid
Unique ID of this fragment (and fragment transmission!).
uint16_t msg_size
Total size of the message that is being fragmented.

References GNUNET_TIME_Absolute::abs_value_us, TransportFragmentBoxMessage::ack_uuid, ReassemblyContext::bitfield, TransportClient::client, VirtualLink::confirmed, cummulative_ack(), demultiplex_with_cmc(), find_by_message_uuid(), finish_cmc_handling(), TransportFragmentBoxMessage::frag_off, free_reassembly_context(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CONTAINER_heap_create(), GNUNET_CONTAINER_heap_insert(), GNUNET_CONTAINER_HEAP_ORDER_MIN, GNUNET_CONTAINER_multihashmap32_create(), GNUNET_CONTAINER_multihashmap32_get_multiple(), GNUNET_CONTAINER_multihashmap32_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_delayed(), GNUNET_SERVICE_client_drop(), GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_ZERO, TransportFragmentBoxMessage::header, ReassemblyContext::hn, CommunicatorMessageContext::im, ReassemblyContext::last_frag, lookup_virtual_link(), FindByMessageUuidContext::message_uuid, CommunicatorMessageContext::mh, msg, ReassemblyContext::msg_missing, TransportFragmentBoxMessage::msg_size, ReassemblyContext::msg_size, TransportFragmentBoxMessage::msg_uuid, ReassemblyContext::msg_uuid, FindByMessageUuidContext::rc, reassembly_cleanup_task(), REASSEMBLY_EXPIRATION, VirtualLink::reassembly_heap, VirtualLink::reassembly_map, ReassemblyContext::reassembly_timeout, VirtualLink::reassembly_timeout_task, GNUNET_TRANSPORT_IncomingMessage::sender, GNUNET_MessageHeader::size, CommunicatorMessageContext::tc, MessageUUIDP::uuid, and ReassemblyContext::virtual_link.

Here is the call graph for this function:

◆ check_reliability_box()

static int check_reliability_box ( void *  cls,
const struct TransportReliabilityBoxMessage rb 
)
static

Communicator gave us a reliability box.

Check the message.

Parameters
clsa struct CommunicatorMessageContext
rbthe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 6739 of file gnunet-service-transport.c.

6741{
6742 const struct GNUNET_MessageHeader *box = (const struct
6743 GNUNET_MessageHeader *) &rb[1];
6744 (void) cls;
6745
6747 "check_send_msg with size %u: inner msg type %u and size %u (%lu %lu)\n",
6748 ntohs (rb->header.size),
6749 ntohs (box->type),
6750 ntohs (box->size),
6751 sizeof (struct TransportReliabilityBoxMessage),
6752 sizeof (struct GNUNET_MessageHeader));
6754 return GNUNET_YES;
6755}
#define GNUNET_MQ_check_boxed_message(m)
Insert code for a "check_" function that verifies that a given variable-length message received over ...
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX.

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_MQ_check_boxed_message, GNUNET_YES, TransportReliabilityBoxMessage::header, GNUNET_MessageHeader::size, and GNUNET_MessageHeader::type.

◆ handle_reliability_box()

static void handle_reliability_box ( void *  cls,
const struct TransportReliabilityBoxMessage rb 
)
static

Communicator gave us a reliability box.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
rbthe message that was received

Definition at line 6766 of file gnunet-service-transport.c.

6768{
6769 struct CommunicatorMessageContext *cmc = cls;
6770 const struct GNUNET_MessageHeader *inbox =
6771 (const struct GNUNET_MessageHeader *) &rb[1];
6772 struct GNUNET_TIME_Relative rtt;
6773
6775 "Received reliability box from %s with UUID %s of type %u\n",
6776 GNUNET_i2s (&cmc->im.sender),
6778 (unsigned int) ntohs (inbox->type));
6779 rtt = GNUNET_TIME_UNIT_SECONDS; /* FIXME: should base this on "RTT", but we
6780 do not really have an RTT for the
6781 * incoming* queue (should we have
6782 the sender add it to the rb message?) */
6784 &cmc->im.sender,
6785 &rb->ack_uuid,
6786 (0 == ntohl (rb->ack_countdown))
6789 GNUNET_TIME_relative_divide (rtt, 8 /* FIXME: magic constant */)));
6790 /* continue with inner message */
6791 /* FIXME: check that inbox is NOT a DV Box, fragment or another
6792 reliability box (not allowed!) */
6793 cmc->mh = inbox;
6795}
uint32_t ack_countdown
Number of messages still to be sent before a commulative ACK is requested.
struct AcknowledgementUUIDP ack_uuid
Unique ID of the message used for signalling receipt of messages sent over possibly unreliable channe...

References TransportReliabilityBoxMessage::ack_countdown, TransportReliabilityBoxMessage::ack_uuid, cummulative_ack(), demultiplex_with_cmc(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_TIME_relative_divide(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_SECONDS, GNUNET_TIME_UNIT_ZERO_ABS, GNUNET_uuid2s(), CommunicatorMessageContext::im, CommunicatorMessageContext::mh, GNUNET_TRANSPORT_IncomingMessage::sender, GNUNET_MessageHeader::type, and AcknowledgementUUIDP::value.

Here is the call graph for this function:

◆ update_pd_age()

static void update_pd_age ( struct PerformanceData pd,
unsigned int  age 
)
static

Check if we have advanced to another age since the last time.

If so, purge ancient statistics (more than GOODPUT_AGING_SLOTS before the current age)

Parameters
[in,out]pddata to update
agecurrent age

Definition at line 6807 of file gnunet-service-transport.c.

6808{
6809 unsigned int sage;
6810
6811 if (age == pd->last_age)
6812 return; /* nothing to do */
6813 sage = GNUNET_MAX (pd->last_age, age - 2 * GOODPUT_AGING_SLOTS);
6814 for (unsigned int i = sage; i <= age - GOODPUT_AGING_SLOTS; i++)
6815 {
6816 struct TransmissionHistoryEntry *the = &pd->the[i % GOODPUT_AGING_SLOTS];
6817
6818 the->bytes_sent = 0;
6819 the->bytes_received = 0;
6820 }
6821 pd->last_age = age;
6822}
#define GOODPUT_AGING_SLOTS
Number of slots we keep of historic data for computation of goodput / message loss ratio.
#define GNUNET_MAX(a, b)
struct TransmissionHistoryEntry the[4]
Historic performance data, using a ring buffer of::GOODPUT_AGING_SLOTS entries.
unsigned int last_age
What was the last age when we wrote to the? Used to clear old entries when the age advances.
Information we keep per GOODPUT_AGING_SLOTS about historic (or current) transmission performance.
uint64_t bytes_received
Number of bytes received and acknowledged by the other peer in the interval.
uint64_t bytes_sent
Number of bytes actually sent in the interval.

References TransmissionHistoryEntry::bytes_received, TransmissionHistoryEntry::bytes_sent, GNUNET_MAX, GOODPUT_AGING_SLOTS, PerformanceData::last_age, and PerformanceData::the.

Referenced by update_performance_data().

Here is the caller graph for this function:

◆ update_performance_data()

static void update_performance_data ( struct PerformanceData pd,
struct GNUNET_TIME_Relative  rtt,
uint16_t  bytes_transmitted_ok 
)
static

Update pd based on the latest rtt and the number of bytes that were confirmed to be successfully transmitted.

Parameters
[in,out]pddata to update
rttlatest round-trip time
bytes_transmitted_oknumber of bytes receiver confirmed as received

Definition at line 6834 of file gnunet-service-transport.c.

6837{
6838 uint64_t nval = rtt.rel_value_us;
6839 uint64_t oval = pd->aged_rtt.rel_value_us;
6840 unsigned int age = get_age ();
6841 struct TransmissionHistoryEntry *the = &pd->the[age % GOODPUT_AGING_SLOTS];
6842
6843 if (oval == GNUNET_TIME_UNIT_FOREVER_REL.rel_value_us)
6844 pd->aged_rtt = rtt;
6845 else
6846 pd->aged_rtt.rel_value_us = (nval + 7 * oval) / 8;
6847 update_pd_age (pd, age);
6848 the->bytes_received += bytes_transmitted_ok;
6849}
static unsigned int get_age()
Get an offset into the transmission history buffer for struct PerformanceData.
static void update_pd_age(struct PerformanceData *pd, unsigned int age)
Check if we have advanced to another age since the last time.

References PerformanceData::aged_rtt, TransmissionHistoryEntry::bytes_received, get_age(), GNUNET_TIME_UNIT_FOREVER_REL, GOODPUT_AGING_SLOTS, GNUNET_TIME_Relative::rel_value_us, PerformanceData::the, and update_pd_age().

Referenced by update_dvh_performance(), and update_queue_performance().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_queue_performance()

static void update_queue_performance ( struct Queue q,
struct GNUNET_TIME_Relative  rtt,
uint16_t  bytes_transmitted_ok 
)
static

We have successfully transmitted data via q, update metrics.

Parameters
qqueue to update
rttround trip time observed
bytes_transmitted_oknumber of bytes successfully transmitted

Definition at line 6860 of file gnunet-service-transport.c.

6863{
6864 update_performance_data (&q->pd, rtt, bytes_transmitted_ok);
6865}
static void update_performance_data(struct PerformanceData *pd, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
Update pd based on the latest rtt and the number of bytes that were confirmed to be successfully tran...

References q, and update_performance_data().

Referenced by handle_acknowledged().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_dvh_performance()

static void update_dvh_performance ( struct DistanceVectorHop dvh,
struct GNUNET_TIME_Relative  rtt,
uint16_t  bytes_transmitted_ok 
)
static

We have successfully transmitted data via dvh, update metrics.

Parameters
dvhdistance vector path data to update
rttround trip time observed
bytes_transmitted_oknumber of bytes successfully transmitted

Definition at line 6876 of file gnunet-service-transport.c.

6879{
6880 update_performance_data (&dvh->pd, rtt, bytes_transmitted_ok);
6881}

References DistanceVectorHop::pd, and update_performance_data().

Referenced by handle_acknowledged().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ completed_pending_message()

static void completed_pending_message ( struct PendingMessage pm)
static

We have completed transmission of pm, remove it from the transmission queues (and if it is a fragment, continue up the tree as necessary).

Parameters
pmpending message that was transmitted

Definition at line 6892 of file gnunet-service-transport.c.

6893{
6894 struct PendingMessage *pos;
6895
6897 "Complete transmission of message %" PRIu64 " %u\n",
6898 pm->logging_uuid,
6899 pm->pmt);
6900 switch (pm->pmt)
6901 {
6902 case PMT_CORE:
6904 /* Full message sent, we are done */
6906 return;
6907
6908 case PMT_FRAGMENT_BOX:
6909 /* Fragment sent over reliable channel */
6910 pos = pm->frag_parent;
6914 "pos frag_off %lu pos bytes_msg %lu pmt %u parent %u\n",
6915 (unsigned long) pos->frag_off,
6916 (unsigned long) pos->bytes_msg,
6917 pos->pmt,
6918 NULL == pos->frag_parent ? 1 : 0);
6919 /* check if subtree is done */
6920 while ((NULL == pos->head_frag) && (pos->frag_off == (pos->bytes_msg
6921 - sizeof(struct
6923 &&
6924 (NULL != pos->frag_parent))
6925 {
6926 pm = pos;
6927 pos = pm->frag_parent;
6928 if ((NULL == pos) && (PMT_DV_BOX == pm->pmt))
6929 {
6931 return;
6932 }
6933 else if (PMT_DV_BOX == pm->pmt)
6934 {
6936 return;
6937 }
6940 }
6941
6942 /* Was this the last applicable fragment? */
6943 if ((NULL == pos->head_frag) && (NULL == pos->frag_parent || PMT_DV_BOX ==
6944 pos->pmt) &&
6945 (pos->frag_off == pos->bytes_msg))
6947 return;
6948
6949 case PMT_DV_BOX:
6951 "Completed transmission of message %" PRIu64 " (DV Box)\n",
6952 pm->logging_uuid);
6953 if (NULL != pm->frag_parent)
6954 {
6955 pos = pm->frag_parent;
6957 pos->bpm = NULL;
6959 }
6960 else
6962 return;
6963 }
6964}
static void client_send_response(struct PendingMessage *pm)
Send a response to the pm that we have processed a "send" request.
struct PendingMessage * bpm
This message, reliability or DV-boxed.

References PendingMessage::bpm, PendingMessage::bytes_msg, client_send_response(), PendingMessage::frag_off, PendingMessage::frag_parent, free_pending_message(), GNUNET_CONTAINER_MDLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, PendingMessage::head_frag, pm, PendingMessage::pmt, PMT_CORE, PMT_DV_BOX, PMT_FRAGMENT_BOX, PMT_RELIABILITY_BOX, and PendingMessage::tail_frag.

Referenced by handle_acknowledged(), and transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_acknowledged()

static void handle_acknowledged ( struct PendingAcknowledgement pa,
struct GNUNET_TIME_Relative  ack_delay 
)
static

The pa was acknowledged, process the acknowledgement.

Parameters
pathe pending acknowledgement that was satisfied
ack_delayartificial delay from cumulative acks created by the other peer

Definition at line 6975 of file gnunet-service-transport.c.

6977{
6978 struct GNUNET_TIME_Relative delay;
6979
6981 delay = GNUNET_TIME_relative_subtract (delay, ack_delay);
6982 if (NULL != pa->queue && 1 == pa->num_send)
6984 if (NULL != pa->dvh && 1 == pa->num_send)
6985 update_dvh_performance (pa->dvh, delay, pa->message_size);
6986 if (NULL != pa->pm)
6989}
static void update_dvh_performance(struct DistanceVectorHop *dvh, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
We have successfully transmitted data via dvh, update metrics.
static void free_pending_acknowledgement(struct PendingAcknowledgement *pa)
Release pa data structure.
static void update_queue_performance(struct Queue *q, struct GNUNET_TIME_Relative rtt, uint16_t bytes_transmitted_ok)
We have successfully transmitted data via q, update metrics.
struct GNUNET_TIME_Relative GNUNET_TIME_relative_subtract(struct GNUNET_TIME_Relative a1, struct GNUNET_TIME_Relative a2)
Subtract relative timestamp from the other.
Definition: time.c:605
struct GNUNET_TIME_Absolute transmission_time
Time of the transmission, for RTT calculation.
uint16_t message_size
Number of bytes of the original message (to calculate bandwidth).

References completed_pending_message(), PendingAcknowledgement::dvh, free_pending_acknowledgement(), GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_relative_subtract(), PendingAcknowledgement::message_size, PendingAcknowledgement::num_send, PendingAcknowledgement::pm, PendingAcknowledgement::queue, PendingAcknowledgement::transmission_time, update_dvh_performance(), and update_queue_performance().

Referenced by handle_reliability_ack().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_reliability_ack()

static int check_reliability_ack ( void *  cls,
const struct TransportReliabilityAckMessage ra 
)
static

Communicator gave us a reliability ack.

Check it is well-formed.

Parameters
clsa struct CommunicatorMessageContext (unused)
rathe message that was received
Returns
#GNUNET_Ok if ra is well-formed

Definition at line 7000 of file gnunet-service-transport.c.

7002{
7003 unsigned int n_acks;
7004
7005 (void) cls;
7006 n_acks = (ntohs (ra->header.size) - sizeof(*ra))
7007 / sizeof(struct TransportCummulativeAckPayloadP);
7008 if (0 == n_acks)
7009 {
7010 GNUNET_break_op (0);
7011 return GNUNET_SYSERR;
7012 }
7013 if ((ntohs (ra->header.size) - sizeof(*ra)) !=
7014 n_acks * sizeof(struct TransportCummulativeAckPayloadP))
7015 {
7016 GNUNET_break_op (0);
7017 return GNUNET_SYSERR;
7018 }
7019 return GNUNET_OK;
7020}

References GNUNET_break_op, GNUNET_OK, GNUNET_SYSERR, TransportReliabilityAckMessage::header, and GNUNET_MessageHeader::size.

◆ handle_reliability_ack()

static void handle_reliability_ack ( void *  cls,
const struct TransportReliabilityAckMessage ra 
)
static

Communicator gave us a reliability ack.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
rathe message that was received

Definition at line 7031 of file gnunet-service-transport.c.

7033{
7034 struct CommunicatorMessageContext *cmc = cls;
7035 const struct TransportCummulativeAckPayloadP *ack;
7036 unsigned int n_acks;
7037 uint32_t ack_counter;
7038
7039 n_acks = (ntohs (ra->header.size) - sizeof(*ra))
7040 / sizeof(struct TransportCummulativeAckPayloadP);
7041 ack = (const struct TransportCummulativeAckPayloadP *) &ra[1];
7042 for (unsigned int i = 0; i < n_acks; i++)
7043 {
7044 struct PendingAcknowledgement *pa =
7046 if (NULL == pa)
7047 {
7049 "Received ACK from %s with UUID %s which is unknown to us!\n",
7050 GNUNET_i2s (&cmc->im.sender),
7051 GNUNET_uuid2s (&ack[i].ack_uuid.value));
7053 GST_stats,
7054 "# FRAGMENT_ACKS dropped, no matching pending message",
7055 1,
7056 GNUNET_NO);
7057 continue;
7058 }
7060 "Received ACK from %s with UUID %s\n",
7061 GNUNET_i2s (&cmc->im.sender),
7062 GNUNET_uuid2s (&ack[i].ack_uuid.value));
7063 handle_acknowledged (pa, GNUNET_TIME_relative_ntoh (ack[i].ack_delay));
7064 }
7065
7066 ack_counter = htonl (ra->ack_counter);
7067 (void) ack_counter; /* silence compiler warning for now */
7068 // FIXME-OPTIMIZE: track ACK losses based on ack_counter somewhere!
7069 // (DV and/or Neighbour?)
7070 finish_cmc_handling (cmc);
7071}
static void handle_acknowledged(struct PendingAcknowledgement *pa, struct GNUNET_TIME_Relative ack_delay)
The pa was acknowledged, process the acknowledgement.
void * GNUNET_CONTAINER_multiuuidmap_get(const struct GNUNET_CONTAINER_MultiUuidmap *map, const struct GNUNET_Uuid *key)
Given a key find a value in the map matching the key.

References TransportReliabilityAckMessage::ack_counter, PendingAcknowledgement::ack_uuid, finish_cmc_handling(), GNUNET_CONTAINER_multiuuidmap_get(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_TIME_relative_ntoh(), GNUNET_uuid2s(), GST_stats, handle_acknowledged(), TransportReliabilityAckMessage::header, CommunicatorMessageContext::im, pending_acks, GNUNET_TRANSPORT_IncomingMessage::sender, GNUNET_MessageHeader::size, and AcknowledgementUUIDP::value.

Here is the call graph for this function:

◆ check_backchannel_encapsulation()

static int check_backchannel_encapsulation ( void *  cls,
const struct TransportBackchannelEncapsulationMessage be 
)
static

Communicator gave us a backchannel encapsulation.

Check the message.

Parameters
clsa struct CommunicatorMessageContext
bethe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 7082 of file gnunet-service-transport.c.

7085{
7086 uint16_t size = ntohs (be->header.size) - sizeof(*be);
7087 const struct GNUNET_MessageHeader *inbox =
7088 (const struct GNUNET_MessageHeader *) &be[1];
7089 const char *is;
7090 uint16_t isize;
7091
7092 (void) cls;
7093 if (ntohs (inbox->size) >= size)
7094 {
7095 GNUNET_break_op (0);
7096 return GNUNET_SYSERR;
7097 }
7098 isize = ntohs (inbox->size);
7099 is = ((const char *) inbox) + isize;
7100 size -= isize;
7101 if ('\0' != is[size - 1])
7102 {
7103 GNUNET_break_op (0);
7104 return GNUNET_SYSERR;
7105 }
7106 return GNUNET_YES;
7107}

References GNUNET_break_op, GNUNET_SYSERR, GNUNET_YES, TransportBackchannelEncapsulationMessage::header, is, GNUNET_MessageHeader::size, and size.

◆ handle_backchannel_encapsulation()

static void handle_backchannel_encapsulation ( void *  cls,
const struct TransportBackchannelEncapsulationMessage be 
)
static

Communicator gave us a backchannel encapsulation.

Process the request. (We are the destination of the backchannel here.)

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
bethe message that was received

Definition at line 7119 of file gnunet-service-transport.c.

7122{
7123 struct CommunicatorMessageContext *cmc = cls;
7125 struct GNUNET_MQ_Envelope *env;
7126 struct TransportClient *tc;
7127 const struct GNUNET_MessageHeader *inbox =
7128 (const struct GNUNET_MessageHeader *) &be[1];
7129 uint16_t isize = ntohs (inbox->size);
7130 const char *target_communicator = ((const char *) inbox) + isize;
7131 char *sender;
7132 char *self;
7133
7134 GNUNET_asprintf (&sender,
7135 "%s",
7136 GNUNET_i2s (&cmc->im.sender));
7137 GNUNET_asprintf (&self,
7138 "%s",
7140
7141 /* Find client providing this communicator */
7142 for (tc = clients_head; NULL != tc; tc = tc->next)
7143 if ((CT_COMMUNICATOR == tc->type) &&
7144 (0 ==
7145 strcmp (tc->details.communicator.address_prefix, target_communicator)))
7146 break;
7147 if (NULL == tc)
7148 {
7149 char *stastr;
7150
7152 &stastr,
7153 "# Backchannel message dropped: target communicator `%s' unknown",
7154 target_communicator);
7156 GNUNET_free (stastr);
7157 finish_cmc_handling (cmc);
7158 return;
7159 }
7160 /* Finally, deliver backchannel message to communicator */
7162 "Delivering backchannel message from %s to %s of type %u to %s\n",
7163 sender,
7164 self,
7165 ntohs (inbox->type),
7166 target_communicator);
7168 cbi,
7169 isize,
7171 cbi->pid = cmc->im.sender;
7172 memcpy (&cbi[1], inbox, isize);
7173 GNUNET_MQ_send (tc->mq, env);
7174 finish_cmc_handling (cmc);
7175}
#define GNUNET_MESSAGE_TYPE_TRANSPORT_COMMUNICATOR_BACKCHANNEL_INCOMING
Transport signalling incoming backchannel message to a communicator.
Message from transport to communicator passing along a backchannel message from the given peer pid.
Definition: transport.h:655
struct GNUNET_PeerIdentity pid
Origin peer.
Definition: transport.h:670

References clients_head, CT_COMMUNICATOR, env, finish_cmc_handling(), GNUNET_asprintf(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_COMMUNICATOR_BACKCHANNEL_INCOMING, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_NO, GNUNET_STATISTICS_update(), GST_my_identity, GST_stats, CommunicatorMessageContext::im, GNUNET_TRANSPORT_CommunicatorBackchannelIncoming::pid, GNUNET_TRANSPORT_IncomingMessage::sender, GNUNET_MessageHeader::size, tc, and GNUNET_MessageHeader::type.

Here is the call graph for this function:

◆ path_cleanup_cb()

static void path_cleanup_cb ( void *  cls)
static

Task called when we should check if any of the DV paths we have learned to a target are due for garbage collection.

Collects stale paths, and possibly frees the entire DV entry if no paths are left. Otherwise re-schedules itself.

Parameters
clsa struct DistanceVector

Definition at line 7188 of file gnunet-service-transport.c.

7189{
7190 struct DistanceVector *dv = cls;
7191 struct DistanceVectorHop *pos;
7192
7193 dv->timeout_task = NULL;
7194 while (NULL != (pos = dv->dv_head))
7195 {
7196 GNUNET_assert (dv == pos->dv);
7198 break;
7200 }
7201 if (NULL == pos)
7202 {
7203 free_dv_route (dv);
7204 return;
7205 }
7206 dv->timeout_task =
7208}
static void path_cleanup_cb(void *cls)
Task called when we should check if any of the DV paths we have learned to a target are due for garba...
struct GNUNET_TIME_Absolute timeout
At what time do we forget about this path unless we see it again while learning?

References DistanceVectorHop::dv, DistanceVector::dv_head, free_distance_vector_hop(), free_dv_route(), GNUNET_assert, GNUNET_SCHEDULER_add_at(), GNUNET_TIME_absolute_get_remaining(), path_cleanup_cb(), GNUNET_TIME_Relative::rel_value_us, DistanceVectorHop::timeout, and DistanceVector::timeout_task.

Referenced by learn_dv_path(), and path_cleanup_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_msg_from_cache()

static void send_msg_from_cache ( struct VirtualLink vl)
static

Definition at line 7212 of file gnunet-service-transport.c.

7213{
7214
7215 const struct GNUNET_PeerIdentity target = vl->target;
7216
7217
7219 {
7220 struct RingBufferEntry *ring_buffer_copy[RING_BUFFER_SIZE];
7221 unsigned int tail = GNUNET_YES == is_ring_buffer_full ? ring_buffer_head :
7222 0;
7223 unsigned int head = GNUNET_YES == is_ring_buffer_full ? RING_BUFFER_SIZE :
7226 struct CommunicatorMessageContext *cmc;
7227 struct RingBufferEntry *rbe;
7228 struct GNUNET_MessageHeader *mh;
7229
7231 "Sending from ring buffer, which has %u items\n",
7232 head);
7233
7234 ring_buffer_head = 0;
7235 for (unsigned int i = 0; i < head; i++)
7236 {
7237 rbe = ring_buffer[(i + tail) % RING_BUFFER_SIZE];
7238 cmc = rbe->cmc;
7239 mh = rbe->mh;
7240
7241 im = cmc->im;
7242 // mh = cmc->mh;
7244 "Sending message of type %u to ring buffer target %s using vl target %s index %u\n",
7245 mh->type,
7246 GNUNET_i2s (&im.sender),
7247 GNUNET_i2s2 (&target),
7248 (i + tail) % RING_BUFFER_SIZE);
7249 if (0 == GNUNET_memcmp (&target, &im.sender))
7250 {
7252 "Finish handling message of type %u and size %u\n",
7253 (unsigned int) ntohs (mh->type),
7254 (unsigned int) ntohs (mh->size));
7256 GNUNET_free (mh);
7257 GNUNET_free (rbe->cmc);
7258 GNUNET_free (rbe);
7259 }
7260 else
7261 {
7262 ring_buffer_copy[ring_buffer_head] = rbe;
7264 }
7265 }
7266
7269 {
7271 }
7272
7273 for (unsigned int i = 0; i < ring_buffer_head; i++)
7274 {
7275 ring_buffer[i] = ring_buffer_copy[i];
7277 "ring_buffer_copy[i]->mh->type for i %u %u\n",
7278 i,
7279 ring_buffer_copy[i]->mh->type);
7281 "ring_buffer[i]->mh->type for i %u %u\n",
7282 i,
7283 ring_buffer[i]->mh->type);
7284 }
7285
7287 "%u items still in ring buffer\n",
7289 }
7290
7292 {
7293 struct PendingMessage *ring_buffer_dv_copy[RING_BUFFER_SIZE];
7294 struct PendingMessage *pm;
7295 unsigned int tail = GNUNET_YES == is_ring_buffer_dv_full ?
7297 0;
7298 unsigned int head = GNUNET_YES == is_ring_buffer_dv_full ?
7301
7303 "Sending from ring buffer dv, which has %u items\n",
7304 head);
7305
7307 for (unsigned int i = 0; i < head; i++)
7308 {
7309 pm = ring_buffer_dv[(i + tail) % RING_BUFFER_SIZE];
7310
7312 "Sending to ring buffer target %s using vl target %s\n",
7313 GNUNET_i2s (&pm->target),
7314 GNUNET_i2s2 (&target));
7315 if (0 == GNUNET_memcmp (&target, &pm->target))
7316 {
7318 "Adding PendingMessage to vl, checking transmission.\n");
7319 pm->vl = vl;
7323 pm);
7324
7326 }
7327 else
7328 {
7329 ring_buffer_dv_copy[ring_buffer_dv_head] = pm;
7331 }
7332 }
7333
7335 {
7337 }
7338
7339 for (unsigned int i = 0; i < ring_buffer_dv_head; i++)
7340 ring_buffer_dv[i] = ring_buffer_dv_copy[i];
7341
7343 "%u items still in ring buffer dv.\n",
7345
7346 }
7347}
static unsigned int ring_buffer_dv_head
Head of the ring buffer.
static struct PendingMessage * ring_buffer_dv[RING_BUFFER_SIZE]
Ring buffer for a forwarded DVBox message we did not deliver to the next hop, because of missing virt...
static unsigned int is_ring_buffer_dv_full
Is the ring buffer filled up to RING_BUFFER_SIZE.
const char * GNUNET_i2s2(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
Inform transport about an incoming message.
Definition: transport.h:333
struct VirtualLink * vl
Target of the request (always the ultimate destination!).
struct GNUNET_PeerIdentity target
In case of a not validated neighbour, we store the target peer.

References check_vl_transmission(), RingBufferEntry::cmc, finish_handling_raw_message(), GNUNET_CONTAINER_MDLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_i2s2(), GNUNET_log, GNUNET_memcmp, GNUNET_NO, GNUNET_YES, is_ring_buffer_dv_full, is_ring_buffer_full, mh, RingBufferEntry::mh, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, pm, ring_buffer, ring_buffer_dv, ring_buffer_dv_head, ring_buffer_head, RING_BUFFER_SIZE, GNUNET_TRANSPORT_IncomingMessage::sender, VirtualLink::target, PendingMessage::target, and PendingMessage::vl.

Referenced by activate_core_visible_dv_path(), and handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ activate_core_visible_dv_path()

static void activate_core_visible_dv_path ( struct DistanceVectorHop hop)
static

The hop is a validated path to the respective target peer and we should tell core about it – and schedule a job to revoke the state.

Parameters
hopa path to some peer that is the reason for activation

Definition at line 7358 of file gnunet-service-transport.c.

7359{
7360 struct DistanceVector *dv = hop->dv;
7361 struct VirtualLink *vl;
7362
7363 vl = lookup_virtual_link (&dv->target);
7364 if (NULL == vl)
7365 {
7366
7367 vl = GNUNET_new (struct VirtualLink);
7369 "Creating new virtual link %p to %s using DV!\n",
7370 vl,
7371 GNUNET_i2s (&dv->target));
7372 vl->burst_addr = NULL;
7373 vl->confirmed = GNUNET_YES;
7374 vl->message_uuid_ctr =
7376 vl->target = dv->target;
7382 links,
7383 &vl->target,
7384 vl,
7386 vl->dv = dv;
7387 dv->vl = vl;
7388 vl->visibility_task =
7391 /* We lacked a confirmed connection to the target
7392 before, so tell CORE about it (finally!) */
7395 }
7396 else
7397 {
7398 /* Link was already up, remember dv is also now available and we are done */
7399 vl->dv = dv;
7400 dv->vl = vl;
7401 if (GNUNET_NO == vl->confirmed)
7402 {
7403 vl->confirmed = GNUNET_YES;
7404 vl->visibility_task =
7407 /* We lacked a confirmed connection to the target
7408 before, so tell CORE about it (finally!) */
7411 }
7412 else
7414 "Virtual link to %s could now also use DV!\n",
7415 GNUNET_i2s (&dv->target));
7416 }
7417}
static void cores_send_connect_info(const struct GNUNET_PeerIdentity *pid)
Send message to CORE clients that we gained a connection.
#define RECV_WINDOW_SIZE
Window size.
static void send_msg_from_cache(struct VirtualLink *vl)
#define DEFAULT_WINDOW_SIZE
How big is the flow control window size by default; limits per-neighbour RAM utilization.
struct GNUNET_TIME_Absolute path_valid_until
For how long is the validation of this path considered valid? Set to ZERO if the path is learned by s...

References VirtualLink::available_fc_window_size, VirtualLink::burst_addr, check_link_down(), VirtualLink::confirmed, consider_sending_fc(), VirtualLink::core_recv_window, cores_send_connect_info(), DEFAULT_WINDOW_SIZE, VirtualLink::dv, DistanceVectorHop::dv, GNUNET_break, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u64(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_NO, GNUNET_SCHEDULER_add_at(), GNUNET_YES, VirtualLink::incoming_fc_window_size, links, lookup_virtual_link(), VirtualLink::message_uuid_ctr, DistanceVectorHop::path_valid_until, RECV_WINDOW_SIZE, send_msg_from_cache(), VirtualLink::target, DistanceVector::target, VirtualLink::visibility_task, and DistanceVector::vl.

Referenced by learn_dv_path().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ learn_dv_path()

static int learn_dv_path ( const struct GNUNET_PeerIdentity path,
unsigned int  path_len,
struct GNUNET_TIME_Relative  network_latency,
struct GNUNET_TIME_Absolute  path_valid_until 
)
static

We have learned a path through the network to some other peer, add it to our DV data structure (returning GNUNET_YES on success).

We do not add paths if we have a sufficient number of shorter paths to this target already (returning GNUNET_NO).

We also do not add problematic paths, like those where we lack the first hop in our neighbour list (i.e. due to a topology change) or where some non-first hop is in our neighbour list (returning GNUNET_SYSERR).

Parameters
paththe path we learned, path[0] should be us, and then path contains a valid path from us to path[path_len-1] path[1] should be a direct neighbour (we should check!)
path_lennumber of entries on the path, at least three!
network_latencyhow long does the message take from us to path[path_len-1]? set to "forever" if unknown
path_valid_untilhow long is this path considered validated? Maybe be zero.
Returns
GNUNET_YES on success, GNUNET_NO if we have better path(s) to the target GNUNET_SYSERR if the path is useless and/or invalid (i.e. path[1] not a direct neighbour or path[i+1] is a direct neighbour for i>0)

Definition at line 7446 of file gnunet-service-transport.c.

7450{
7451 struct DistanceVectorHop *hop;
7452 struct DistanceVector *dv;
7453 struct Neighbour *next_hop;
7454 unsigned int shorter_distance;
7455
7456 if (path_len < 3)
7457 {
7458 /* what a boring path! not allowed! */
7459 GNUNET_break (0);
7460 return GNUNET_SYSERR;
7461 }
7462 GNUNET_assert (0 == GNUNET_memcmp (&GST_my_identity, &path[0]));
7463 next_hop = lookup_neighbour (&path[1]);
7464 if (NULL == next_hop)
7465 {
7466 /* next hop must be a neighbour, otherwise this whole thing is useless! */
7467 GNUNET_break (0);
7468 return GNUNET_SYSERR;
7469 }
7470 for (unsigned int i = 2; i < path_len; i++)
7471 {
7472 struct Neighbour *n = lookup_neighbour (&path[i]);
7473 struct GNUNET_TIME_Absolute q_timeout;
7474
7475 if (NULL != n)
7476 {
7477 q_timeout = GNUNET_TIME_UNIT_ZERO_ABS;
7478 for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour)
7479 q_timeout = GNUNET_TIME_absolute_max (q_timeout, q->validated_until);
7481 "remaining %lu to %s\n",
7482 (unsigned long) GNUNET_TIME_absolute_get_remaining (q_timeout)
7483 .rel_value_us,
7484 GNUNET_i2s (&n->pid));
7485 if (0 != GNUNET_TIME_absolute_get_remaining (q_timeout).rel_value_us)
7486 {
7487 /* Useless path: we have a direct active connection to some hop
7488 in the middle of the path, so this one is not even
7489 terribly useful for redundancy */
7491 "Path of %u hops useless: directly link to hop %u (%s)\n",
7492 path_len,
7493 i,
7494 GNUNET_i2s (&path[i]));
7496 "# Useless DV path ignored: hop is neighbour",
7497 1,
7498 GNUNET_NO);
7499 return GNUNET_SYSERR;
7500 }
7501 }
7502 }
7503 dv = GNUNET_CONTAINER_multipeermap_get (dv_routes, &path[path_len - 1]);
7504 if (NULL == dv)
7505 {
7506 dv = GNUNET_new (struct DistanceVector);
7507 dv->target = path[path_len - 1];
7510 dv);
7513 dv_routes,
7514 &dv->target,
7515 dv,
7517 }
7518 /* Check if we have this path already! */
7519 shorter_distance = 0;
7520 for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
7521 pos = pos->next_dv)
7522 {
7523 if (pos->distance < path_len - 3)
7524 shorter_distance++;
7525 /* Note that the distances in 'pos' excludes us (path[0]),
7526 the next_hop (path[1]) and the target so we need to subtract three
7527 and check next_hop explicitly */
7528 if ((pos->distance == path_len - 3) && (pos->next_hop == next_hop))
7529 {
7530 int match = GNUNET_YES;
7531
7532 for (unsigned int i = 0; i < pos->distance; i++)
7533 {
7534 if (0 != GNUNET_memcmp (&pos->path[i], &path[i + 2]))
7535 {
7536 match = GNUNET_NO;
7537 break;
7538 }
7539 }
7540 if (GNUNET_YES == match)
7541 {
7542 struct GNUNET_TIME_Relative last_timeout;
7543
7544 /* Re-discovered known path, update timeout */
7546 "# Known DV path refreshed",
7547 1,
7548 GNUNET_NO);
7549 last_timeout = GNUNET_TIME_absolute_get_remaining (pos->timeout);
7550 pos->timeout =
7552 pos->path_valid_until =
7553 GNUNET_TIME_absolute_max (pos->path_valid_until, path_valid_until);
7554 GNUNET_CONTAINER_MDLL_remove (dv, dv->dv_head, dv->dv_tail, pos);
7555 GNUNET_CONTAINER_MDLL_insert (dv, dv->dv_head, dv->dv_tail, pos);
7556 if (0 <
7559 if (last_timeout.rel_value_us <
7562 .rel_value_us)
7563 {
7564 /* Some peer send DV learn messages too often, we are learning
7565 the same path faster than it would be useful; do not forward! */
7567 "Rediscovered path too quickly, not forwarding further\n")
7568 ;
7569 return GNUNET_NO;
7570 }
7572 "Refreshed known path to %s valid until %s, forwarding further\n",
7573 GNUNET_i2s (&dv->target),
7575 pos->path_valid_until));
7576 return GNUNET_YES;
7577 }
7578 }
7579 }
7580 /* Count how many shorter paths we have (incl. direct
7581 neighbours) before simply giving up on this one! */
7582 if (shorter_distance >= MAX_DV_PATHS_TO_TARGET)
7583 {
7584 /* We have a shorter path already! */
7586 "Have many shorter DV paths %s, not forwarding further\n",
7587 GNUNET_i2s (&dv->target));
7588 return GNUNET_NO;
7589 }
7590 /* create new DV path entry */
7592 "Discovered new DV path to %s valid until %s\n",
7593 GNUNET_i2s (&dv->target),
7594 GNUNET_STRINGS_absolute_time_to_string (path_valid_until));
7595 hop = GNUNET_malloc (sizeof(struct DistanceVectorHop)
7596 + sizeof(struct GNUNET_PeerIdentity) * (path_len - 3));
7597 hop->next_hop = next_hop;
7598 hop->dv = dv;
7599 hop->path = (const struct GNUNET_PeerIdentity *) &hop[1];
7600 memcpy (&hop[1],
7601 &path[2],
7602 sizeof(struct GNUNET_PeerIdentity) * (path_len - 3));
7604 hop->path_valid_until = path_valid_until;
7605 hop->distance = path_len - 3;
7606 hop->pd.aged_rtt = network_latency;
7607 GNUNET_CONTAINER_MDLL_insert (dv, dv->dv_head, dv->dv_tail, hop);
7609 next_hop->dv_head,
7610 next_hop->dv_tail,
7611 hop);
7612 if (0 < GNUNET_TIME_absolute_get_remaining (path_valid_until).rel_value_us)
7614 return GNUNET_YES;
7615}
#define DV_PATH_DISCOVERY_FREQUENCY
How long before paths expire would we like to (re)discover DV paths? Should be below DV_PATH_VALIDITY...
#define MAX_DV_PATHS_TO_TARGET
Maximum number of DV paths we keep simultaneously to the same target.
#define DV_PATH_VALIDITY_TIMEOUT
How long do we consider a DV path valid if we see no further updates on it? Note: the value chosen he...
static void activate_core_visible_dv_path(struct DistanceVectorHop *hop)
The hop is a validated path to the respective target peer and we should tell core about it – and sche...

References activate_core_visible_dv_path(), PerformanceData::aged_rtt, DistanceVectorHop::distance, DistanceVectorHop::dv, DistanceVector::dv_head, Neighbour::dv_head, DV_PATH_DISCOVERY_FREQUENCY, DV_PATH_VALIDITY_TIMEOUT, dv_routes, DistanceVector::dv_tail, Neighbour::dv_tail, GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_MDLL_insert, GNUNET_CONTAINER_MDLL_remove, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_memcmp, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_delayed(), GNUNET_STATISTICS_update(), GNUNET_STRINGS_absolute_time_to_string(), GNUNET_SYSERR, GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_max(), GNUNET_TIME_relative_subtract(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_ZERO_ABS, GNUNET_YES, GST_my_identity, GST_stats, lookup_neighbour(), MAX_DV_PATHS_TO_TARGET, DistanceVectorHop::next_dv, DistanceVectorHop::next_hop, DistanceVectorHop::path, path_cleanup_cb(), DistanceVectorHop::path_valid_until, DistanceVectorHop::pd, Neighbour::pid, q, Neighbour::queue_head, GNUNET_TIME_Relative::rel_value_us, DistanceVector::target, DistanceVectorHop::timeout, and DistanceVector::timeout_task.

Referenced by handle_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_dv_learn()

static int check_dv_learn ( void *  cls,
const struct TransportDVLearnMessage dvl 
)
static

Communicator gave us a DV learn message.

Check the message.

Parameters
clsa struct CommunicatorMessageContext
dvlthe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 7626 of file gnunet-service-transport.c.

7627{
7628 uint16_t size = ntohs (dvl->header.size);
7629 uint16_t num_hops = ntohs (dvl->num_hops);
7630 const struct DVPathEntryP *hops = (const struct DVPathEntryP *) &dvl[1];
7631
7632 (void) cls;
7633 if (size != sizeof(*dvl) + num_hops * sizeof(struct DVPathEntryP))
7634 {
7635 GNUNET_break_op (0);
7636 return GNUNET_SYSERR;
7637 }
7638 if (num_hops > MAX_DV_HOPS_ALLOWED)
7639 {
7640 GNUNET_break_op (0);
7641 return GNUNET_SYSERR;
7642 }
7643 for (unsigned int i = 0; i < num_hops; i++)
7644 {
7645 if (0 == GNUNET_memcmp (&dvl->initiator, &hops[i].hop))
7646 {
7647 GNUNET_break_op (0);
7648 return GNUNET_SYSERR;
7649 }
7650 if (0 == GNUNET_memcmp (&GST_my_identity, &hops[i].hop))
7651 {
7652 GNUNET_break_op (0);
7653 return GNUNET_SYSERR;
7654 }
7655 }
7656 return GNUNET_YES;
7657}
An entry describing a peer on a path in a struct TransportDVLearnMessage message.
struct GNUNET_PeerIdentity initiator
Identity of the peer that started this learning activity.
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN.
uint16_t num_hops
Number of hops this messages has travelled, in NBO.

References GNUNET_break_op, GNUNET_memcmp, GNUNET_SYSERR, GNUNET_YES, GST_my_identity, TransportDVLearnMessage::header, DVPathEntryP::hop, TransportDVLearnMessage::initiator, MAX_DV_HOPS_ALLOWED, TransportDVLearnMessage::num_hops, GNUNET_MessageHeader::size, and size.

◆ forward_dv_learn()

static void forward_dv_learn ( const struct GNUNET_PeerIdentity next_hop,
const struct TransportDVLearnMessage msg,
uint16_t  bi_history,
uint16_t  nhops,
const struct DVPathEntryP hops,
struct GNUNET_TIME_Absolute  in_time 
)
static

Build and forward a DV learn message to next_hop.

Parameters
next_hoppeer to send the message to
msgmessage received
bi_historybitmask specifying hops on path that were bidirectional
nhopslength of the hops array
hopspath the message traversed so far
in_timewhen did we receive the message, used to calculate network delay

Definition at line 7672 of file gnunet-service-transport.c.

7678{
7679 struct Neighbour *n;
7680 struct VirtualLink *vl;
7681 struct DVPathEntryP *dhops;
7682 char buf[sizeof(struct TransportDVLearnMessage)
7683 + (nhops + 1) * sizeof(struct DVPathEntryP)] GNUNET_ALIGN;
7684 struct TransportDVLearnMessage *fwd = (struct TransportDVLearnMessage *) buf;
7685 struct GNUNET_TIME_Relative nnd;
7686
7687 /* compute message for forwarding */
7689 "Forwarding DV learn message originating from %s to %s\n",
7690 GNUNET_i2s (&msg->initiator),
7691 GNUNET_i2s2 (next_hop));
7694 fwd->header.size = htons (sizeof(struct TransportDVLearnMessage)
7695 + (nhops + 1) * sizeof(struct DVPathEntryP));
7696 fwd->num_hops = htons (nhops + 1);
7697 fwd->bidirectional = htons (bi_history);
7700 msg->non_network_delay));
7702 fwd->init_sig = msg->init_sig;
7703 fwd->initiator = msg->initiator;
7704 fwd->challenge = msg->challenge;
7705 fwd->monotonic_time = msg->monotonic_time;
7706 dhops = (struct DVPathEntryP *) &fwd[1];
7707 GNUNET_memcpy (dhops, hops, sizeof(struct DVPathEntryP) * nhops);
7708 dhops[nhops].hop = GST_my_identity;
7709 {
7710 struct DvHopPS dhp = {
7712 .purpose.size = htonl (sizeof(dhp)),
7713 .pred = (0 == nhops) ? msg->initiator : dhops[nhops - 1].hop,
7714 .succ = *next_hop,
7715 .challenge = msg->challenge
7716 };
7718 &dhp,
7719 &dhops[nhops].hop_sig);
7720 }
7721 /*route_control_message_without_fc (next_hop,
7722 &fwd->header,
7723 RMO_UNCONFIRMED_ALLOWED);*/
7724 vl = lookup_virtual_link (next_hop);
7725 if ((NULL != vl) && (GNUNET_YES == vl->confirmed))
7726 {
7728 &fwd->header,
7730 }
7731 else
7732 {
7733 /* Use route via neighbour */
7734 n = lookup_neighbour (next_hop);
7735 if (NULL != n)
7737 n,
7738 &fwd->header,
7740 }
7741}
#define GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_HOP
Signature by a peer affirming that it is on a DV path.
struct GNUNET_PeerIdentity hop
Identity of a peer on the path.
Content signed by each peer during DV learning.
struct GNUNET_CRYPTO_EccSignaturePurpose purpose
Purpose is GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_HOP.
uint32_t purpose
What does this signature vouch for? This must contain a GNUNET_SIGNATURE_PURPOSE_XXX constant (from g...
struct GNUNET_CRYPTO_ChallengeNonceP challenge
Challenge value used by the initiator to re-identify the path.
struct GNUNET_TIME_RelativeNBO non_network_delay
Peers receiving this message and delaying forwarding to other peers for any reason should increment t...
struct GNUNET_TIME_AbsoluteNBO monotonic_time
Time at the initiator when generating the signature.
struct GNUNET_CRYPTO_EddsaSignature init_sig
Signature of this hop over the path, of purpose GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR.
uint16_t bidirectional
Bitmask of the last 16 hops indicating whether they are confirmed available (without DV) in both dire...

References TransportDVLearnMessage::bidirectional, TransportDVLearnMessage::challenge, VirtualLink::confirmed, GNUNET_ALIGN, GNUNET_assert, GNUNET_CRYPTO_eddsa_sign, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_i2s2(), GNUNET_log, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN, GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_HOP, GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_relative_add(), GNUNET_TIME_relative_hton(), GNUNET_TIME_relative_ntoh(), GNUNET_YES, GST_my_identity, GST_my_private_key, TransportDVLearnMessage::header, DVPathEntryP::hop, TransportDVLearnMessage::init_sig, TransportDVLearnMessage::initiator, lookup_neighbour(), lookup_virtual_link(), MAX_DV_HOPS_ALLOWED, TransportDVLearnMessage::monotonic_time, msg, TransportDVLearnMessage::non_network_delay, TransportDVLearnMessage::num_hops, GNUNET_CRYPTO_EccSignaturePurpose::purpose, DvHopPS::purpose, RMO_UNCONFIRMED_ALLOWED, route_control_message_without_fc(), route_via_neighbour(), GNUNET_MessageHeader::size, and GNUNET_MessageHeader::type.

Referenced by dv_neighbour_transmission(), and handle_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ validate_dv_initiator_signature()

static int validate_dv_initiator_signature ( struct GNUNET_TIME_AbsoluteNBO  sender_monotonic_time,
const struct GNUNET_PeerIdentity init,
const struct GNUNET_CRYPTO_ChallengeNonceP challenge,
const struct GNUNET_CRYPTO_EddsaSignature init_sig 
)
static

Check signature of type GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR.

Parameters
sender_monotonic_timemonotonic time of the initiator
initthe signer
challengethe challenge that was signed
init_sigsignature presumably by init
Returns
GNUNET_OK if the signature is valid

Definition at line 7754 of file gnunet-service-transport.c.

7759{
7760 struct DvInitPS ip = { .purpose.purpose = htonl (
7762 .purpose.size = htonl (sizeof(ip)),
7763 .monotonic_time = sender_monotonic_time,
7764 .challenge = *challenge };
7765
7766 if (
7767 GNUNET_OK !=
7769 &ip,
7770 init_sig,
7771 &init->public_key))
7772 {
7773 GNUNET_break_op (0);
7774 return GNUNET_SYSERR;
7775 }
7776 return GNUNET_OK;
7777}
static char * init
Set to the name of a service to start.
Definition: gnunet-arm.c:73
#define GNUNET_CRYPTO_eddsa_verify(purp, ps, sig, pub)
Verify EdDSA signature.
#define GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR
Signature by a peer affirming that it originated the DV path.
Content signed by the initiator during DV learning.
struct GNUNET_CRYPTO_EccSignaturePurpose purpose
Purpose is GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR.
struct GNUNET_CRYPTO_ChallengeNonceP challenge
Challenge value used by the initiator to re-identify the path.

References DvInitPS::challenge, GNUNET_break_op, GNUNET_CRYPTO_eddsa_verify, GNUNET_OK, GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR, GNUNET_SYSERR, init, GNUNET_CRYPTO_EccSignaturePurpose::purpose, and DvInitPS::purpose.

Referenced by handle_dv_learn().

Here is the caller graph for this function:

◆ dv_neighbour_selection()

static int dv_neighbour_selection ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Function called for each neighbour during handle_dv_learn.

Parameters
clsa struct NeighbourSelectionContext *
pididentity of the peer
valuea struct Neighbour
Returns
GNUNET_YES (always)

Definition at line 7836 of file gnunet-service-transport.c.

7839{
7840 struct NeighbourSelectionContext *nsc = cls;
7841
7842 (void) value;
7843 if (0 == GNUNET_memcmp (pid, &nsc->dvl->initiator))
7844 return GNUNET_YES; /* skip initiator */
7845 for (unsigned int i = 0; i < nsc->nhops; i++)
7846 if (0 == GNUNET_memcmp (pid, &nsc->hops[i].hop))
7847 return GNUNET_YES;
7848 /* skip peers on path */
7849 nsc->num_eligible++;
7850 return GNUNET_YES;
7851}
Closure for dv_neighbour_selection and dv_neighbour_transmission.
const struct TransportDVLearnMessage * dvl
Original message we received.
const struct DVPathEntryP * hops
The hops taken.
unsigned int num_eligible
Number of peers eligible for selection.
uint16_t nhops
Number of hops in hops.

References NeighbourSelectionContext::dvl, GNUNET_memcmp, GNUNET_YES, DVPathEntryP::hop, NeighbourSelectionContext::hops, TransportDVLearnMessage::initiator, NeighbourSelectionContext::nhops, NeighbourSelectionContext::num_eligible, pid, and value.

Referenced by handle_dv_learn().

Here is the caller graph for this function:

◆ dv_neighbour_transmission()

static int dv_neighbour_transmission ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Function called for each neighbour during handle_dv_learn.

We call forward_dv_learn() on the neighbour(s) selected during dv_neighbour_selection().

Parameters
clsa struct NeighbourSelectionContext *
pididentity of the peer
valuea struct Neighbour
Returns
GNUNET_YES (always)

Definition at line 7865 of file gnunet-service-transport.c.

7868{
7869 struct NeighbourSelectionContext *nsc = cls;
7870
7872 "transmission %s\n",
7873 GNUNET_i2s (pid));
7874 (void) value;
7875 if (0 == GNUNET_memcmp (pid, &nsc->dvl->initiator))
7876 return GNUNET_YES; /* skip initiator */
7877 for (unsigned int i = 0; i < nsc->nhops; i++)
7878 if (0 == GNUNET_memcmp (pid, &nsc->hops[i].hop))
7879 return GNUNET_YES;
7880 /* skip peers on path */
7881 for (unsigned int i = 0; i < nsc->num_selections; i++)
7882 {
7883 if (nsc->selections[i] == nsc->num_eligible)
7884 {
7886 nsc->dvl,
7887 nsc->bi_history,
7888 nsc->nhops,
7889 nsc->hops,
7890 nsc->in_time);
7891 break;
7892 }
7893 }
7894 nsc->num_eligible++;
7895 return GNUNET_YES;
7896}
static void forward_dv_learn(const struct GNUNET_PeerIdentity *next_hop, const struct TransportDVLearnMessage *msg, uint16_t bi_history, uint16_t nhops, const struct DVPathEntryP *hops, struct GNUNET_TIME_Absolute in_time)
Build and forward a DV learn message to next_hop.
struct GNUNET_TIME_Absolute in_time
Time we received the message.
uint16_t bi_history
Bitmap of bidirectional connections encountered.
unsigned int num_selections
Number of peers that were selected for forwarding.
uint32_t selections[MAX_DV_DISCOVERY_SELECTION]
Offsets of the selected peers.

References NeighbourSelectionContext::bi_history, NeighbourSelectionContext::dvl, forward_dv_learn(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_YES, DVPathEntryP::hop, NeighbourSelectionContext::hops, NeighbourSelectionContext::in_time, TransportDVLearnMessage::initiator, NeighbourSelectionContext::nhops, NeighbourSelectionContext::num_eligible, NeighbourSelectionContext::num_selections, pid, NeighbourSelectionContext::selections, and value.

Referenced by handle_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ calculate_fork_degree()

static unsigned int calculate_fork_degree ( unsigned int  hops_taken,
unsigned int  neighbour_count,
unsigned int  eligible_count 
)
static

Computes the number of neighbours we should forward a DVInit message to given that it has so far taken hops_taken hops though the network and that the number of neighbours we have in total is neighbour_count, out of which eligible_count are not yet on the path.

NOTE: technically we might want to include NSE in the formula to get a better grip on the overall network size. However, for now using NSE here would create a dependency issue in the build system. => Left for later, hardcoded to 50 for now.

The goal of the formula is that we want to reach a total of LOG(NSE) peers via DV (target_total). We want the reach to be spread out over various distances to the origin, with a bias towards shorter distances.

We make the strong assumption that the network topology looks "similar" at other hops, in particular the neighbour_count should be comparable at other hops.

If the local neighbourhood is densely connected, we expect that eligible_count is close to neighbour_count minus hops_taken as a lot of the path is already known. In that case, we should forward to few(er) peers to try to find a path out of the neighbourhood. OTOH, if eligible_count is close to neighbour_count, we should forward to many peers as we are either still close to the origin (i.e. hops_taken is small) or because we managed to get beyond a local cluster. We express this as the boost_factor using the square of the fraction of eligible neighbours (so if only 50% are eligible, we boost by 1/4, but if 99% are eligible, the 'boost' will be almost 1).

Second, the more hops we have taken, the larger the problem of an exponential traffic explosion gets. So we take the target_total, and compute our degree such that at each distance d 2^{-d} peers are selected (corrected by the boost_factor).

Parameters
hops_takennumber of hops DVInit has travelled so far
neighbour_countnumber of neighbours we have in total
eligible_countnumber of neighbours we could in theory forward to

Definition at line 7943 of file gnunet-service-transport.c.

7946{
7947 double target_total = 50.0; /* FIXME: use LOG(NSE)? */
7948 double eligible_ratio =
7949 ((double) eligible_count) / ((double) neighbour_count);
7950 double boost_factor = eligible_ratio * eligible_ratio;
7951 unsigned int rnd;
7952 double left;
7953
7954 if (hops_taken >= 64)
7955 {
7956 GNUNET_break (0);
7957 return 0; /* precaution given bitshift below */
7958 }
7959 for (unsigned int i = 1; i < hops_taken; i++)
7960 {
7961 /* For each hop, subtract the expected number of targets
7962 reached at distance d (so what remains divided by 2^d) */
7963 target_total -= (target_total * boost_factor / (1LLU << i));
7964 }
7965 rnd =
7966 (unsigned int) floor (target_total * boost_factor / (1LLU << hops_taken));
7967 /* round up or down probabilistically depending on how close we were
7968 when floor()ing to rnd */
7969 left = target_total - (double) rnd;
7970 if (UINT32_MAX * left >
7972 rnd++; /* round up */
7974 "Forwarding DV learn message of %u hops %u(/%u/%u) times\n",
7975 hops_taken,
7976 rnd,
7977 eligible_count,
7978 neighbour_count);
7979 return rnd;
7980}

References GNUNET_break, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u64(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, and consensus-simulation::int.

Referenced by handle_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ neighbour_store_dvmono_cb()

static void neighbour_store_dvmono_cb ( void *  cls,
int  success 
)
static

Function called when peerstore is done storing a DV monotonic time.

Parameters
clsa struct Neighbour
successGNUNET_YES if peerstore was successful

Definition at line 7990 of file gnunet-service-transport.c.

7991{
7992 struct Neighbour *n = cls;
7993
7994 n->sc = NULL;
7995 if (GNUNET_YES != success)
7997 "Failed to store other peer's monotonic time in peerstore!\n");
7998}

References GNUNET_ERROR_TYPE_ERROR, GNUNET_log, GNUNET_YES, and Neighbour::sc.

Referenced by handle_dv_learn().

Here is the caller graph for this function:

◆ get_network_latency()

static struct GNUNET_TIME_Relative get_network_latency ( const struct TransportDVLearnMessage dvl)
static

Definition at line 8002 of file gnunet-service-transport.c.

8003{
8004 struct GNUNET_TIME_Relative host_latency_sum;
8005 struct GNUNET_TIME_Relative latency;
8006 struct GNUNET_TIME_Relative network_latency;
8007 uint16_t nhops = ntohs (dvl->num_hops);;
8008
8009 /* We initiated this, learn the forward path! */
8010 host_latency_sum = GNUNET_TIME_relative_ntoh (dvl->non_network_delay);
8011
8012 // Need also something to lookup initiation time
8013 // to compute RTT! -> add RTT argument here?
8015 dvl->monotonic_time));
8016 GNUNET_assert (latency.rel_value_us >= host_latency_sum.rel_value_us);
8017 // latency = GNUNET_TIME_UNIT_FOREVER_REL; // FIXME: initialize properly
8018 // (based on dvl->challenge, we can identify time of origin!)
8019
8020 network_latency = GNUNET_TIME_relative_subtract (latency, host_latency_sum);
8021 /* assumption: latency on all links is the same */
8022 network_latency = GNUNET_TIME_relative_divide (network_latency, nhops);
8023
8024 return network_latency;
8025}
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_ntoh(struct GNUNET_TIME_AbsoluteNBO a)
Convert absolute time from network byte order.
Definition: time.c:741

References GNUNET_assert, GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_absolute_ntoh(), GNUNET_TIME_relative_divide(), GNUNET_TIME_relative_ntoh(), GNUNET_TIME_relative_subtract(), and GNUNET_TIME_Relative::rel_value_us.

Referenced by handle_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_dv_learn()

static void handle_dv_learn ( void *  cls,
const struct TransportDVLearnMessage dvl 
)
static

Communicator gave us a DV learn message.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
dvlthe message that was received

Definition at line 8036 of file gnunet-service-transport.c.

8037{
8038 struct CommunicatorMessageContext *cmc = cls;
8040 int bi_hop;
8041 uint16_t nhops;
8042 uint16_t bi_history;
8043 const struct DVPathEntryP *hops;
8044 int do_fwd;
8045 int did_initiator;
8046 struct GNUNET_TIME_Absolute in_time;
8047 struct Neighbour *n;
8048
8049 nhops = ntohs (dvl->num_hops); /* 0 = sender is initiator */
8050 bi_history = ntohs (dvl->bidirectional);
8051 hops = (const struct DVPathEntryP *) &dvl[1];
8052 if (0 == nhops)
8053 {
8054 /* sanity check */
8055 if (0 != GNUNET_memcmp (&dvl->initiator, &cmc->im.sender))
8056 {
8057 GNUNET_break (0);
8058 finish_cmc_handling (cmc);
8059 return;
8060 }
8061 }
8062 else
8063 {
8065 "handle dv learn message last hop %s\n",
8066 GNUNET_i2s (&hops[nhops - 1].hop));
8067 /* sanity check */
8068 if (0 != GNUNET_memcmp (&hops[nhops - 1].hop, &cmc->im.sender))
8069 {
8070 GNUNET_break (0);
8071 finish_cmc_handling (cmc);
8072 return;
8073 }
8074 }
8075
8077 cc = cmc->tc->details.communicator.cc;
8078 bi_hop = (GNUNET_TRANSPORT_CC_RELIABLE ==
8079 cc); // FIXME: add bi-directional flag to cc?
8080 in_time = GNUNET_TIME_absolute_get ();
8081
8082 /* continue communicator here, everything else can happen asynchronous! */
8083 finish_cmc_handling (cmc);
8084
8085 n = lookup_neighbour (&dvl->initiator);
8086 if (NULL != n)
8087 {
8088 if ((n->dv_monotime_available == GNUNET_YES) &&
8091 {
8093 "DV learn from %s discarded due to time travel",
8094 GNUNET_i2s (&dvl->initiator));
8096 "# DV learn discarded due to time travel",
8097 1,
8098 GNUNET_NO);
8099 return;
8100 }
8102 &dvl->initiator,
8103 &dvl->challenge,
8104 &dvl->init_sig))
8105 {
8107 "DV learn signature from %s invalid\n",
8108 GNUNET_i2s (&dvl->initiator));
8109 GNUNET_break_op (0);
8110 return;
8111 }
8114 {
8115 if (NULL != n->sc)
8116 {
8118 "store cancel\n");
8120 }
8121 n->sc =
8123 "transport",
8124 &dvl->initiator,
8126 &dvl->monotonic_time,
8127 sizeof(dvl->monotonic_time),
8131 n);
8132 }
8133 }
8134 /* OPTIMIZE-FIXME: asynchronously (!) verify signatures!,
8135 If signature verification load too high, implement random drop strategy */
8136 for (unsigned int i = 0; i < nhops; i++)
8137 {
8138 struct DvHopPS dhp = { .purpose.purpose =
8140 .purpose.size = htonl (sizeof(dhp)),
8141 .pred = (0 == i) ? dvl->initiator : hops[i - 1].hop,
8142 .succ = (nhops == i + 1) ? GST_my_identity
8143 : hops[i + 1].hop,
8144 .challenge = dvl->challenge };
8145
8146 if (GNUNET_OK !=
8148 &dhp,
8149 &hops[i].hop_sig,
8150 &hops[i].hop.public_key))
8151 {
8153 "DV learn from %s signature of hop %u invalid\n",
8154 GNUNET_i2s (&dvl->initiator),
8155 i);
8157 "signature of hop %s invalid\n",
8158 GNUNET_i2s (&hops[i].hop));
8160 "pred %s\n",
8161 GNUNET_i2s (&dhp.pred));
8163 "succ %s\n",
8164 GNUNET_i2s (&dhp.succ));
8166 "hash %s\n",
8167 GNUNET_sh2s (&dhp.challenge.value));
8168 GNUNET_break_op (0);
8169 return;
8170 }
8171 }
8172 if (GNUNET_EXTRA_LOGGING > 0)
8173 {
8174 char *path;
8175
8176 path = GNUNET_strdup (GNUNET_i2s (&dvl->initiator));
8177 for (unsigned int i = 0; i < nhops; i++)
8178 {
8179 char *tmp;
8180
8181 GNUNET_asprintf (&tmp,
8182 "%s%s%s",
8183 path,
8184 (bi_history & (1 << (nhops - i))) ? "<->" : "-->",
8185 GNUNET_i2s (&hops[i].hop));
8186 GNUNET_free (path);
8187 path = tmp;
8188 }
8190 "Received DVInit via %s%s%s\n",
8191 path,
8192 bi_hop ? "<->" : "-->",
8194 GNUNET_free (path);
8195 }
8196 do_fwd = GNUNET_YES;
8197 if (0 == GNUNET_memcmp (&GST_my_identity, &dvl->initiator))
8198 {
8199 struct GNUNET_PeerIdentity path[nhops + 1];
8200 struct GNUNET_TIME_Relative network_latency;
8201
8202 /* We initiated this, learn the forward path! */
8203 path[0] = GST_my_identity;
8204 path[1] = hops[0].hop;
8205
8206 network_latency = get_network_latency (dvl);
8207
8208 for (unsigned int i = 2; i <= nhops; i++)
8209 {
8210 struct GNUNET_TIME_Relative ilat;
8211
8212 /* assumption: linear latency increase per hop */
8213 ilat = GNUNET_TIME_relative_multiply (network_latency, i);
8214 path[i] = hops[i - 1].hop;
8216 "Learned path with %u hops to %s with latency %s\n",
8217 i,
8218 GNUNET_i2s (&path[i]),
8220 learn_dv_path (path,
8221 i + 1,
8222 ilat,
8225 }
8226 /* as we initiated, do not forward again (would be circular!) */
8227 do_fwd = GNUNET_NO;
8228 return;
8229 }
8230 if (bi_hop)
8231 {
8232 /* last hop was bi-directional, we could learn something here! */
8233 struct GNUNET_PeerIdentity path[nhops + 2];
8234 struct GNUNET_TIME_Relative ilat;
8235 struct GNUNET_TIME_Relative network_latency;
8236
8237 path[0] = GST_my_identity;
8238 path[1] = hops[nhops - 1].hop; /* direct neighbour == predecessor! */
8239 for (unsigned int i = 0; i < nhops; i++)
8240 {
8241 int iret;
8242
8243 if (0 == (bi_history & (1 << i)))
8244 break; /* i-th hop not bi-directional, stop learning! */
8245 if (i == nhops - 1)
8246 {
8247 path[i + 2] = dvl->initiator;
8248 }
8249 else
8250 {
8251 path[i + 2] = hops[nhops - i - 2].hop;
8252 }
8253
8255 "Learned inverse path with %u hops to %s\n",
8256 i + 2,
8257 GNUNET_i2s (&path[i + 2]));
8258 network_latency = get_network_latency (dvl);
8259 ilat = GNUNET_TIME_relative_multiply (network_latency, i + 2);
8260 iret = learn_dv_path (path,
8261 i + 3,
8262 ilat,
8265 if (GNUNET_SYSERR == iret)
8266 {
8267 /* path invalid or too long to be interesting for US, thus should also
8268 not be interesting to our neighbours, cut path when forwarding to
8269 'i' hops, except of course for the one that goes back to the
8270 initiator */
8272 "# DV learn not forwarded due invalidity of path",
8273 1,
8274 GNUNET_NO);
8275 do_fwd = GNUNET_NO;
8276 break;
8277 }
8278 if ((GNUNET_NO == iret) && (nhops == i + 1))
8279 {
8280 /* we have better paths, and this is the longest target,
8281 so there cannot be anything interesting later */
8283 "# DV learn not forwarded, got better paths",
8284 1,
8285 GNUNET_NO);
8286 do_fwd = GNUNET_NO;
8287 break;
8288 }
8289 }
8290 }
8291 if (MAX_DV_HOPS_ALLOWED == nhops)
8292 {
8293 /* At limit, we're out of here! */
8294 return;
8295 }
8296
8297 /* Forward to initiator, if path non-trivial and possible */
8298 bi_history = (bi_history << 1) | (bi_hop ? 1 : 0);
8299 did_initiator = GNUNET_NO;
8300 if ((1 <= nhops) &&
8301 (GNUNET_YES ==
8303 {
8304 /* send back to origin! */
8306 "Sending DVL back to initiator %s\n",
8307 GNUNET_i2s (&dvl->initiator));
8308 forward_dv_learn (&dvl->initiator, dvl, bi_history, nhops, hops, in_time);
8309 did_initiator = GNUNET_YES;
8310 }
8311 /* We forward under two conditions: either we still learned something
8312 ourselves (do_fwd), or the path was darn short and thus the initiator is
8313 likely to still be very interested in this (and we did NOT already
8314 send it back to the initiator) */
8315 if ((do_fwd) || ((nhops < MIN_DV_PATH_LENGTH_FOR_INITIATOR) &&
8316 (GNUNET_NO == did_initiator)))
8317 {
8318 /* Pick random neighbours that are not yet on the path */
8319 struct NeighbourSelectionContext nsc;
8320 unsigned int n_cnt;
8321
8323 nsc.nhops = nhops;
8324 nsc.dvl = dvl;
8325 nsc.bi_history = bi_history;
8326 nsc.hops = hops;
8327 nsc.in_time = in_time;
8328 nsc.num_eligible = 0;
8331 &nsc);
8332 if (0 == nsc.num_eligible)
8333 return; /* done here, cannot forward to anyone else */
8334 nsc.num_selections = calculate_fork_degree (nhops, n_cnt, nsc.num_eligible);
8335 nsc.num_selections =
8336 GNUNET_MIN (MAX_DV_DISCOVERY_SELECTION, nsc.num_selections);
8338 "Forwarding DVL to %u other peers\n",
8339 nsc.num_selections);
8340 for (unsigned int i = 0; i < nsc.num_selections; i++)
8341 nsc.selections[i] =
8342 (nsc.num_selections == n_cnt)
8343 ? i /* all were selected, avoid collisions by chance */
8345 nsc.num_eligible = 0;
8348 &nsc);
8349 }
8350}
static int dv_neighbour_transmission(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Function called for each neighbour during handle_dv_learn.
static unsigned int calculate_fork_degree(unsigned int hops_taken, unsigned int neighbour_count, unsigned int eligible_count)
Computes the number of neighbours we should forward a DVInit message to given that it has so far take...
#define MAX_DV_DISCOVERY_SELECTION
Maximum number of peers we select for forwarding DVInit messages at the same time (excluding initiato...
static int dv_neighbour_selection(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Function called for each neighbour during handle_dv_learn.
static struct GNUNET_TIME_Relative get_network_latency(const struct TransportDVLearnMessage *dvl)
#define ADDRESS_VALIDATION_LIFETIME
How long do we consider an address valid if we just checked?
static int learn_dv_path(const struct GNUNET_PeerIdentity *path, unsigned int path_len, struct GNUNET_TIME_Relative network_latency, struct GNUNET_TIME_Absolute path_valid_until)
We have learned a path through the network to some other peer, add it to our DV data structure (retur...
static void neighbour_store_dvmono_cb(void *cls, int success)
Function called when peerstore is done storing a DV monotonic time.
#define MIN_DV_PATH_LENGTH_FOR_INITIATOR
Minimum number of hops we should forward DV learn messages even if they are NOT useful for us in hope...
static int validate_dv_initiator_signature(struct GNUNET_TIME_AbsoluteNBO sender_monotonic_time, const struct GNUNET_PeerIdentity *init, const struct GNUNET_CRYPTO_ChallengeNonceP *challenge, const struct GNUNET_CRYPTO_EddsaSignature *init_sig)
Check signature of type GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR.
GNUNET_TRANSPORT_CommunicatorCharacteristics
What characteristics does this communicator have?
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multipeermap_contains(const struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key)
Check if the map contains any value under the given key (including values that are NULL).
#define GNUNET_MIN(a, b)
#define GNUNET_PEERSTORE_TRANSPORT_DVLEARN_MONOTIME
Key used to store sender's monotonic time from DV learn messages.
@ GNUNET_PEERSTORE_STOREOPTION_REPLACE
Delete any previous values for the given key before storing the given value.
#define GNUNET_TIME_UNIT_FOREVER_ABS
Constant used to specify "forever".
struct GNUNET_PeerIdentity pred
Identity of the previous peer on the path.
struct GNUNET_CRYPTO_ChallengeNonceP challenge
Challenge value used by the initiator to re-identify the path.
struct GNUNET_PeerIdentity succ
Identity of the next peer on the path.
struct GNUNET_ShortHashCode value
The value of the nonce.
struct GNUNET_TIME_Absolute last_dv_learn_monotime
Latest DVLearn monotonic time seen from this peer.
int dv_monotime_available
Do we have the latest value for last_dv_learn_monotime from PEERSTORE yet, or are we still waiting fo...
enum GNUNET_TRANSPORT_CommunicatorCharacteristics cc
Characteristics of this communicator.
enum ClientType type
What type of client is this?
union TransportClient::@60 details
struct TransportClient::@60::@63 communicator
Information for type CT_COMMUNICATOR.

References GNUNET_TIME_Absolute::abs_value_us, ADDRESS_VALIDATION_LIFETIME, NeighbourSelectionContext::bi_history, TransportDVLearnMessage::bidirectional, calculate_fork_degree(), TransportClient::cc, DvHopPS::challenge, TransportDVLearnMessage::challenge, TransportClient::communicator, CT_COMMUNICATOR, TransportClient::details, Neighbour::dv_monotime_available, dv_neighbour_selection(), dv_neighbour_transmission(), NeighbourSelectionContext::dvl, finish_cmc_handling(), forward_dv_learn(), get_network_latency(), GNUNET_asprintf(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CONTAINER_multipeermap_contains(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_CRYPTO_eddsa_verify, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_EXTRA_LOGGING, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_MIN, GNUNET_NO, GNUNET_OK, GNUNET_PEERSTORE_store(), GNUNET_PEERSTORE_store_cancel(), GNUNET_PEERSTORE_STOREOPTION_REPLACE, GNUNET_PEERSTORE_TRANSPORT_DVLEARN_MONOTIME, GNUNET_sh2s(), GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_HOP, GNUNET_STATISTICS_update(), GNUNET_strdup, GNUNET_STRINGS_relative_time_to_string(), GNUNET_SYSERR, GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_ntoh(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_FOREVER_ABS, GNUNET_TRANSPORT_CC_RELIABLE, GNUNET_YES, GST_my_identity, GST_stats, DVPathEntryP::hop, NeighbourSelectionContext::hops, CommunicatorMessageContext::im, NeighbourSelectionContext::in_time, TransportDVLearnMessage::init_sig, TransportDVLearnMessage::initiator, Neighbour::last_dv_learn_monotime, learn_dv_path(), lookup_neighbour(), MAX_DV_DISCOVERY_SELECTION, MAX_DV_HOPS_ALLOWED, MIN_DV_PATH_LENGTH_FOR_INITIATOR, TransportDVLearnMessage::monotonic_time, neighbour_store_dvmono_cb(), neighbours, NeighbourSelectionContext::nhops, NeighbourSelectionContext::num_eligible, TransportDVLearnMessage::num_hops, NeighbourSelectionContext::num_selections, peerstore, DvHopPS::pred, GNUNET_CRYPTO_EccSignaturePurpose::purpose, DvHopPS::purpose, Neighbour::sc, NeighbourSelectionContext::selections, GNUNET_TRANSPORT_IncomingMessage::sender, DvHopPS::succ, CommunicatorMessageContext::tc, TransportClient::type, validate_dv_initiator_signature(), and GNUNET_CRYPTO_ChallengeNonceP::value.

Here is the call graph for this function:

◆ check_dv_box()

static int check_dv_box ( void *  cls,
const struct TransportDVBoxMessage dvb 
)
static

Communicator gave us a DV box.

Check the message.

Parameters
clsa struct CommunicatorMessageContext
dvbthe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 8361 of file gnunet-service-transport.c.

8362{
8363 uint16_t size = ntohs (dvb->header.size);
8364 uint16_t num_hops = ntohs (dvb->num_hops);
8365 const struct GNUNET_PeerIdentity *hops =
8366 (const struct GNUNET_PeerIdentity *) &dvb[1];
8367
8368 (void) cls;
8369 if (size < sizeof(*dvb) + num_hops * sizeof(struct GNUNET_PeerIdentity)
8370 + sizeof(struct GNUNET_MessageHeader))
8371 {
8372 GNUNET_break_op (0);
8373 return GNUNET_SYSERR;
8374 }
8375 /* This peer must not be on the path */
8376 for (unsigned int i = 0; i < num_hops; i++)
8377 if (0 == GNUNET_memcmp (&hops[i], &GST_my_identity))
8378 {
8379 GNUNET_break_op (0);
8380 return GNUNET_SYSERR;
8381 }
8382 return GNUNET_YES;
8383}
struct GNUNET_MessageHeader header
Type is GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX.

References GNUNET_break_op, GNUNET_memcmp, GNUNET_SYSERR, GNUNET_YES, GST_my_identity, TransportDVBoxMessage::header, TransportDVBoxMessage::num_hops, GNUNET_MessageHeader::size, and size.

◆ forward_dv_box()

static void forward_dv_box ( struct Neighbour next_hop,
struct TransportDVBoxMessage hdr,
uint16_t  total_hops,
uint16_t  num_hops,
const struct GNUNET_PeerIdentity hops,
const void *  enc_payload,
uint16_t  enc_payload_size 
)
static

Create a DV Box message and queue it for transmission to next_hop.

Parameters
next_hoppeer to receive the message next
total_hopshow many hops did the message take so far
num_hopslength of the hops array
originorigin of the message
hopsnext peer(s) to the destination, including destination
payloadpayload of the box
payload_sizenumber of bytes in payload

Definition at line 8399 of file gnunet-service-transport.c.

8406{
8407 struct VirtualLink *vl = next_hop->vl;
8408 struct PendingMessage *pm;
8409 size_t msg_size = sizeof(struct TransportDVBoxMessage)
8410 + num_hops * sizeof(struct GNUNET_PeerIdentity)
8411 + enc_payload_size;
8412 char *buf;
8413 char msg_buf[msg_size] GNUNET_ALIGN;
8414 struct GNUNET_PeerIdentity *dhops;
8415
8416 hdr->num_hops = htons (num_hops);
8417 hdr->total_hops = htons (total_hops);
8418 hdr->header.size = htons (msg_size);
8419 memcpy (msg_buf, hdr, sizeof(*hdr));
8420 dhops = (struct GNUNET_PeerIdentity *) &msg_buf[sizeof(struct
8422 ;
8423 memcpy (dhops, hops, num_hops * sizeof(struct GNUNET_PeerIdentity));
8424 memcpy (&dhops[num_hops], enc_payload, enc_payload_size);
8425
8426 if (GNUNET_YES == ntohs (hdr->without_fc))
8427 {
8429 "Forwarding control message (payload size %u) in DV Box to next hop %s (%u/%u) \n",
8430 enc_payload_size,
8431 GNUNET_i2s (&next_hop->pid),
8432 (unsigned int) num_hops,
8433 (unsigned int) total_hops);
8434 route_via_neighbour (next_hop, (const struct
8435 GNUNET_MessageHeader *) msg_buf,
8437 }
8438 else
8439 {
8440 pm = GNUNET_malloc (sizeof(struct PendingMessage) + msg_size);
8442 "2 created pm %p storing vl %p \n",
8443 pm,
8444 vl);
8445 pm->pmt = PMT_DV_BOX;
8446 pm->vl = vl;
8447 pm->target = next_hop->pid;
8449 pm->logging_uuid = logging_uuid_gen++;
8451 pm->bytes_msg = msg_size;
8452 buf = (char *) &pm[1];
8453 memcpy (buf, msg_buf, msg_size);
8454
8456 "Created pending message %" PRIu64
8457 " for DV Box with next hop %s (%u/%u)\n",
8458 pm->logging_uuid,
8459 GNUNET_i2s (&next_hop->pid),
8460 (unsigned int) num_hops,
8461 (unsigned int) total_hops);
8462
8463 if ((NULL != vl) && (GNUNET_YES == vl->confirmed))
8464 {
8466 vl->pending_msg_head,
8467 vl->pending_msg_tail,
8468 pm);
8469
8471 }
8472 else
8473 {
8475 "The virtual link is not ready for forwarding a DV Box with payload, storing PendingMessage in ring buffer.\n");
8476
8478 {
8480
8481 GNUNET_free (pm_old);
8482 }
8485 {
8488 }
8489 else
8491
8493 "%u items stored in DV ring buffer\n",
8496 }
8497 }
8498}
#define DV_FORWARD_TIMEOUT
If a DVBox could not be forwarded after this number of seconds we drop it.
@ GNUNET_MQ_PRIO_BACKGROUND
Lowest priority, i.e.
unsigned int without_fc
Flag if the payload is a control message.
uint16_t total_hops
Number of total hops this messages travelled.

References check_vl_transmission(), VirtualLink::confirmed, DV_FORWARD_TIMEOUT, GNUNET_ALIGN, GNUNET_CONTAINER_MDLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_MQ_PRIO_BACKGROUND, GNUNET_TIME_relative_to_absolute(), GNUNET_YES, TransportDVBoxMessage::header, is_ring_buffer_dv_full, logging_uuid_gen, TransportDVBoxMessage::num_hops, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, Neighbour::pid, pm, PMT_DV_BOX, ring_buffer_dv, ring_buffer_dv_head, RING_BUFFER_SIZE, RMO_ANYTHING_GOES, route_via_neighbour(), GNUNET_MessageHeader::size, TransportDVBoxMessage::total_hops, Neighbour::vl, and TransportDVBoxMessage::without_fc.

Referenced by handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_backtalker()

static void free_backtalker ( struct Backtalker b)
static

Free data structures associated with b.

Parameters
bdata structure to release

Definition at line 8507 of file gnunet-service-transport.c.

8508{
8509 if (NULL != b->get)
8510 {
8512 b->get = NULL;
8513 GNUNET_assert (NULL != b->cmc);
8515 b->cmc = NULL;
8516 }
8517 if (NULL != b->task)
8518 {
8520 b->task = NULL;
8521 }
8522 if (NULL != b->sc)
8523 {
8525 "store cancel\n");
8527 b->sc = NULL;
8528 }
8530 "Removing backtalker for %s\n",
8531 GNUNET_i2s (&b->pid));
8533 GNUNET_YES ==
8535 GNUNET_free (b);
8536}
struct CommunicatorMessageContext * cmc
Communicator context waiting on this backchannel's get, or NULL.
struct GNUNET_PEERSTORE_StoreContext * sc
Handle to a PEERSTORE store operation for this pid's monotonic_time.
struct GNUNET_SCHEDULER_Task * task
Task associated with this backtalker.
struct GNUNET_PEERSTORE_IterateContext * get
Handle for an operation to fetch monotonic_time information from the PEERSTORE, or NULL.
struct GNUNET_PeerIdentity pid
Peer this is about.

References backtalkers, Backtalker::cmc, finish_cmc_handling(), Backtalker::get, GNUNET_assert, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_PEERSTORE_iteration_stop(), GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, Backtalker::pid, Backtalker::sc, and Backtalker::task.

Referenced by backtalker_timeout_cb(), and free_backtalker_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_backtalker_cb()

static int free_backtalker_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Callback to free backtalker records.

Parameters
clsNULL
pidunused
valuea struct Backtalker
Returns
GNUNET_OK (always)

Definition at line 8548 of file gnunet-service-transport.c.

8551{
8552 struct Backtalker *b = value;
8553
8554 (void) cls;
8555 (void) pid;
8556 free_backtalker (b);
8557 return GNUNET_OK;
8558}
static void free_backtalker(struct Backtalker *b)
Free data structures associated with b.
A Backtalker is a peer sending us backchannel messages.

References free_backtalker(), GNUNET_OK, pid, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ backtalker_timeout_cb()

static void backtalker_timeout_cb ( void *  cls)
static

Function called when it is time to clean up a backtalker.

Parameters
clsa struct Backtalker

Definition at line 8567 of file gnunet-service-transport.c.

8568{
8569 struct Backtalker *b = cls;
8570
8572 "backtalker timeout.\n");
8573 b->task = NULL;
8575 {
8577 return;
8578 }
8579 GNUNET_assert (NULL == b->sc);
8580 free_backtalker (b);
8581}
static void backtalker_timeout_cb(void *cls)
Function called when it is time to clean up a backtalker.
struct GNUNET_TIME_Absolute timeout
When will this entry time out?

References backtalker_timeout_cb(), free_backtalker(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_SCHEDULER_add_at(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_Relative::rel_value_us, Backtalker::sc, Backtalker::task, and Backtalker::timeout.

Referenced by backtalker_monotime_store_cb(), backtalker_timeout_cb(), and handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ backtalker_monotime_cb()

static void backtalker_monotime_cb ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Function called with the monotonic time of a backtalker by PEERSTORE.

Updates the time and continues processing.

Parameters
clsa struct Backtalker
recordthe information found, NULL for the last call
emsgerror message

Definition at line 8593 of file gnunet-service-transport.c.

8596{
8597 struct Backtalker *b = cls;
8598 struct GNUNET_TIME_AbsoluteNBO *mtbe;
8599 struct GNUNET_TIME_Absolute mt;
8600
8601 (void) emsg;
8602 if (NULL == record)
8603 {
8604 /* we're done with #backtalker_monotime_cb() invocations,
8605 continue normal processing */
8606 b->get = NULL;
8607 GNUNET_assert (NULL != b->cmc);
8608 b->cmc->mh = (const struct GNUNET_MessageHeader *) &b[1];
8609 if (0 != b->body_size)
8611 else
8613 b->cmc = NULL;
8614 return;
8615 }
8616 if (sizeof(*mtbe) != record->value_size)
8617 {
8619 GNUNET_break (0);
8620 return;
8621 }
8622 mtbe = record->value;
8623 mt = GNUNET_TIME_absolute_ntoh (*mtbe);
8624 if (mt.abs_value_us > b->monotonic_time.abs_value_us)
8625 {
8627 "Backtalker message from %s dropped, monotime in the past\n",
8628 GNUNET_i2s (&b->pid));
8630 GST_stats,
8631 "# Backchannel messages dropped: monotonic time not increasing",
8632 1,
8633 GNUNET_NO);
8634 b->monotonic_time = mt;
8635 /* Setting body_size to 0 prevents call to #forward_backchannel_payload()
8636 */
8637 b->body_size = 0;
8638 }
8640}
static void record(void *cls, size_t data_size, const void *data)
Process recorded audio data.
void GNUNET_PEERSTORE_iteration_next(struct GNUNET_PEERSTORE_IterateContext *ic, uint64_t limit)
Continue an iteration.
size_t body_size
Number of bytes of the original message body that follows after this struct.
struct GNUNET_TIME_Absolute monotonic_time
Last (valid) monotonic time received from this sender.
Time for absolute time used by GNUnet, in microseconds and in network byte order.

References GNUNET_TIME_Absolute::abs_value_us, Backtalker::body_size, Backtalker::cmc, demultiplex_with_cmc(), finish_cmc_handling(), Backtalker::get, GNUNET_assert, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_PEERSTORE_iteration_next(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_ntoh(), GST_stats, CommunicatorMessageContext::mh, Backtalker::monotonic_time, Backtalker::pid, and record().

Referenced by handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ backtalker_monotime_store_cb()

static void backtalker_monotime_store_cb ( void *  cls,
int  success 
)
static

Function called by PEERSTORE when the store operation of a backtalker's monotonic time is complete.

Parameters
clsthe struct Backtalker
successGNUNET_OK on success

Definition at line 8651 of file gnunet-service-transport.c.

8652{
8653 struct Backtalker *b = cls;
8654
8655 if (GNUNET_OK != success)
8656 {
8658 "Failed to store backtalker's monotonic time in PEERSTORE!\n");
8659 }
8660 b->sc = NULL;
8661 if (NULL != b->task)
8662 {
8664 b->task = NULL;
8665 }
8667}

References backtalker_timeout_cb(), GNUNET_ERROR_TYPE_ERROR, GNUNET_log, GNUNET_OK, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_cancel(), Backtalker::sc, Backtalker::task, and Backtalker::timeout.

Referenced by update_backtalker_monotime().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_backtalker_monotime()

static void update_backtalker_monotime ( struct Backtalker b)
static

The backtalker b monotonic time changed.

Update PEERSTORE.

Parameters
ba backtalker with updated monotonic time

Definition at line 8676 of file gnunet-service-transport.c.

8677{
8678 struct GNUNET_TIME_AbsoluteNBO mtbe;
8679
8680 if (NULL != b->sc)
8681 {
8683 "store cancel before store with sc %p\n",
8684 b->sc);
8685 /*GNUNET_PEERSTORE_store_cancel (b->sc);
8686 b->sc = NULL;*/
8688 "store cancel before store with sc %p is null\n",
8689 b->sc);
8690 }
8691 else
8692 {
8694 b->task = NULL;
8695 }
8697 b->sc =
8699 "transport",
8700 &b->pid,
8702 &mtbe,
8703 sizeof(mtbe),
8707 b);
8708}
static void backtalker_monotime_store_cb(void *cls, int success)
Function called by PEERSTORE when the store operation of a backtalker's monotonic time is complete.
#define GNUNET_PEERSTORE_TRANSPORT_BACKCHANNEL_MONOTIME
Key used to store sender's monotonic time from backchannel messages.

References backtalker_monotime_store_cb(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_PEERSTORE_store(), GNUNET_PEERSTORE_STOREOPTION_REPLACE, GNUNET_PEERSTORE_TRANSPORT_BACKCHANNEL_MONOTIME, GNUNET_SCHEDULER_cancel(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_UNIT_FOREVER_ABS, Backtalker::monotonic_time, peerstore, Backtalker::pid, Backtalker::sc, and Backtalker::task.

Referenced by handle_dv_box().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_dv_box()

static void handle_dv_box ( void *  cls,
const struct TransportDVBoxMessage dvb 
)
static

Communicator gave us a DV box.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
dvbthe message that was received

Definition at line 8719 of file gnunet-service-transport.c.

8720{
8721 struct CommunicatorMessageContext *cmc = cls;
8722 uint16_t size = ntohs (dvb->header.size) - sizeof(*dvb);
8723 uint16_t num_hops = ntohs (dvb->num_hops);
8724 const struct GNUNET_PeerIdentity *hops =
8725 (const struct GNUNET_PeerIdentity *) &dvb[1];
8726 const char *enc_payload = (const char *) &hops[num_hops];
8727 uint16_t enc_payload_size =
8728 size - (num_hops * sizeof(struct GNUNET_PeerIdentity));
8729 struct DVKeyState key;
8730 struct GNUNET_HashCode hmac;
8731 const char *hdr;
8732 size_t hdr_len;
8733
8734 if (GNUNET_EXTRA_LOGGING > 0)
8735 {
8736 char *path;
8737
8739 for (unsigned int i = 0; i < num_hops; i++)
8740 {
8741 char *tmp;
8742
8743 GNUNET_asprintf (&tmp, "%s->%s", path, GNUNET_i2s (&hops[i]));
8744 GNUNET_free (path);
8745 path = tmp;
8746 }
8748 "Received DVBox with remaining path %s\n",
8749 path);
8750 GNUNET_free (path);
8751 }
8752
8753 if (num_hops > 0)
8754 {
8755 /* We're trying from the end of the hops array, as we may be
8756 able to find a shortcut unknown to the origin that way */
8757 for (int i = num_hops - 1; i >= 0; i--)
8758 {
8759 struct Neighbour *n;
8760
8761 if (0 == GNUNET_memcmp (&hops[i], &GST_my_identity))
8762 {
8763 GNUNET_break_op (0);
8764 finish_cmc_handling (cmc);
8765 return;
8766 }
8767 n = lookup_neighbour (&hops[i]);
8768 if (NULL == n)
8769 continue;
8771 "Skipping %u/%u hops ahead while routing DV Box\n",
8772 i,
8773 num_hops);
8774
8775 forward_dv_box (n,
8776 (struct TransportDVBoxMessage *) dvb,
8777 ntohs (dvb->total_hops) + 1,
8778 num_hops - i - 1, /* number of hops left */
8779 &hops[i + 1], /* remaining hops */
8780 enc_payload,
8781 enc_payload_size);
8783 "# DV hops skipped routing boxes",
8784 i,
8785 GNUNET_NO);
8787 "# DV boxes routed (total)",
8788 1,
8789 GNUNET_NO);
8790 finish_cmc_handling (cmc);
8791 return;
8792 }
8793 /* Woopsie, next hop not in neighbours, drop! */
8795 "# DV Boxes dropped: next hop unknown",
8796 1,
8797 GNUNET_NO);
8798 finish_cmc_handling (cmc);
8799 return;
8800 }
8801 /* We are the target. Unbox and handle message. */
8803 "# DV boxes opened (ultimate target)",
8804 1,
8805 GNUNET_NO);
8806 cmc->total_hops = ntohs (dvb->total_hops);
8807
8808 // DH key derivation with received DV, could be garbage.
8809 {
8810 struct GNUNET_ShortHashCode km;
8811
8813 &dvb->ephemeral_key,
8814 &km))
8815 {
8816 GNUNET_break_op (0);
8817 finish_cmc_handling (cmc);
8818 return;
8819 }
8820 dv_setup_key_state_from_km (&km, &dvb->iv, &key);
8821 }
8822 hdr = (const char *) &dvb[1];
8823 hdr_len = ntohs (dvb->orig_size) - sizeof(*dvb) - sizeof(struct
8825 * ntohs (dvb->total_hops);
8826
8827 dv_hmac (&key, &hmac, hdr, hdr_len);
8828 if (0 != GNUNET_memcmp (&hmac, &dvb->hmac))
8829 {
8830 /* HMAC mismatch, discard! */
8831 GNUNET_break_op (0);
8832 finish_cmc_handling (cmc);
8833 return;
8834 }
8835 /* begin actual decryption */
8836 {
8837 struct Backtalker *b;
8838 struct GNUNET_TIME_Absolute monotime;
8839 struct TransportDVBoxPayloadP ppay;
8840 char body[hdr_len - sizeof(ppay)] GNUNET_ALIGN;
8841 const struct GNUNET_MessageHeader *mh;
8842
8843 GNUNET_assert (hdr_len >=
8844 sizeof(ppay) + sizeof(struct GNUNET_MessageHeader));
8845 if (GNUNET_OK != dv_decrypt (&key, &ppay, hdr, sizeof(ppay)))
8846 {
8848 "Error decrypting DV payload header\n");
8849 GNUNET_break_op (0);
8850 finish_cmc_handling (cmc);
8851 return;
8852 }
8853 if (GNUNET_OK != dv_decrypt (&key, body,
8854 &hdr[sizeof(ppay)], hdr_len - sizeof(ppay)))
8855 {
8857 "Error decrypting DV payload\n");
8858 GNUNET_break_op (0);
8859 finish_cmc_handling (cmc);
8860 return;
8861 }
8862 mh = (const struct GNUNET_MessageHeader *) body;
8863 dv_key_clean (&key);
8864 if (ntohs (mh->size) != sizeof(body))
8865 {
8866 GNUNET_break_op (0);
8867 finish_cmc_handling (cmc);
8868 return;
8869 }
8870 /* need to prevent box-in-a-box (and DV_LEARN) so check inbox type! */
8871 switch (ntohs (mh->type))
8872 {
8874 GNUNET_break_op (0);
8875 finish_cmc_handling (cmc);
8876 return;
8877
8879 GNUNET_break_op (0);
8880 finish_cmc_handling (cmc);
8881 return;
8882
8883 default:
8884 /* permitted, continue */
8885 break;
8886 }
8887 monotime = GNUNET_TIME_absolute_ntoh (ppay.monotonic_time);
8889 "Decrypted backtalk from %s\n",
8890 GNUNET_i2s (&ppay.sender));
8892 if ((NULL != b) && (monotime.abs_value_us < b->monotonic_time.abs_value_us))
8893 {
8895 GST_stats,
8896 "# Backchannel messages dropped: monotonic time not increasing",
8897 1,
8898 GNUNET_NO);
8899 finish_cmc_handling (cmc);
8900 return;
8901 }
8902 if ((NULL == b) ||
8903 (0 != GNUNET_memcmp (&b->last_ephemeral, &dvb->ephemeral_key)))
8904 {
8905 /* Check signature */
8906 struct EphemeralConfirmationPS ec;
8907
8909 ec.target = GST_my_identity;
8910 ec.ephemeral_key = dvb->ephemeral_key;
8911 ec.purpose.size = htonl (sizeof(ec));
8912 ec.sender_monotonic_time = ppay.monotonic_time;
8913 if (
8914 GNUNET_OK !=
8917 &ec,
8918 &ppay.sender_sig,
8919 &ppay.sender.public_key))
8920 {
8921 /* Signature invalid, discard! */
8922 GNUNET_break_op (0);
8923 finish_cmc_handling (cmc);
8924 return;
8925 }
8926 }
8927 /* Update sender, we now know the real origin! */
8929 "DVBox received for me from %s via %s\n",
8930 GNUNET_i2s2 (&ppay.sender),
8931 GNUNET_i2s (&cmc->im.sender));
8932 cmc->im.sender = ppay.sender;
8933
8934 if (NULL != b)
8935 {
8936 /* update key cache and mono time */
8937 b->last_ephemeral = dvb->ephemeral_key;
8938 b->monotonic_time = monotime;
8940 b->timeout =
8942 cmc->mh = mh;
8944 return;
8945 }
8946 /* setup data structure to cache signature AND check
8947 monotonic time with PEERSTORE before forwarding backchannel payload */
8948 b = GNUNET_malloc (sizeof(struct Backtalker) + sizeof(body));
8949 b->pid = ppay.sender;
8950 b->body_size = sizeof(body);
8951 memcpy (&b[1], body, sizeof(body));
8955 &b->pid,
8956 b,
8958 b->monotonic_time = monotime; /* NOTE: to be checked still! */
8959 b->cmc = cmc;
8960 b->timeout =
8963 b->get =
8965 "transport",
8966 &b->pid,
8969 b);
8970 } /* end actual decryption */
8971}
static enum GNUNET_GenericReturnValue dv_decrypt(struct DVKeyState *key, void *out, const void *ciph, size_t out_size)
Perform backchannel encryption using symmetric secret in key to encrypt data from in to dst.
static void update_backtalker_monotime(struct Backtalker *b)
The backtalker b monotonic time changed.
#define BACKCHANNEL_INACTIVITY_TIMEOUT
How long do we cache backchannel (struct Backtalker) information after a backchannel goes inactive?
static void backtalker_monotime_cb(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
Function called with the monotonic time of a backtalker by PEERSTORE.
static void forward_dv_box(struct Neighbour *next_hop, struct TransportDVBoxMessage *hdr, uint16_t total_hops, uint16_t num_hops, const struct GNUNET_PeerIdentity *hops, const void *enc_payload, uint16_t enc_payload_size)
Create a DV Box message and queue it for transmission to next_hop.
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_eddsa_kem_decaps(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, const struct GNUNET_CRYPTO_HpkeEncapsulation *c, struct GNUNET_ShortHashCode *prk)
Decapsulate a key for a private EdDSA key.
Definition: crypto_hpke.c:407
struct GNUNET_PEERSTORE_IterateContext * GNUNET_PEERSTORE_iteration_start(struct GNUNET_PEERSTORE_Handle *h, const char *sub_system, const struct GNUNET_PeerIdentity *peer, const char *key, GNUNET_PEERSTORE_Processor callback, void *callback_cls)
Iterate over peerstore entries.
struct GNUNET_CRYPTO_HpkeEncapsulation last_ephemeral
Last (valid) ephemeral key received from this sender.
uint16_t total_hops
Number of hops the message has travelled (if DV-routed).
struct GNUNET_CRYPTO_EccSignaturePurpose purpose
Purpose is GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL.
A 512-bit hashcode.
struct GNUNET_HashCode hmac
HMAC over the ciphertext of the encrypted, variable-size body that follows.
uint16_t orig_size
Size this msg had initially.
struct GNUNET_CRYPTO_HpkeEncapsulation ephemeral_key
Ephemeral key setup by the sender for target, used to encrypt the payload.
struct GNUNET_ShortHashCode iv
We use an IV here as the ephemeral_key is re-used for EPHEMERAL_VALIDITY time to avoid re-signing it ...

References GNUNET_TIME_Absolute::abs_value_us, BACKCHANNEL_INACTIVITY_TIMEOUT, backtalker_monotime_cb(), backtalker_timeout_cb(), backtalkers, Backtalker::body_size, Backtalker::cmc, demultiplex_with_cmc(), dv_decrypt(), dv_hmac(), dv_key_clean(), dv_setup_key_state_from_km(), EphemeralConfirmationPS::ephemeral_key, TransportDVBoxMessage::ephemeral_key, finish_cmc_handling(), forward_dv_box(), Backtalker::get, GNUNET_ALIGN, GNUNET_asprintf(), GNUNET_assert, GNUNET_break_op, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_eddsa_kem_decaps(), GNUNET_CRYPTO_eddsa_verify, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_ERROR, GNUNET_EXTRA_LOGGING, GNUNET_free, GNUNET_i2s(), GNUNET_i2s2(), GNUNET_log, GNUNET_malloc, GNUNET_memcmp, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN, GNUNET_NO, GNUNET_OK, GNUNET_PEERSTORE_iteration_start(), GNUNET_PEERSTORE_TRANSPORT_BACKCHANNEL_MONOTIME, GNUNET_SCHEDULER_add_at(), GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL, GNUNET_STATISTICS_update(), GNUNET_strdup, GNUNET_TIME_absolute_ntoh(), GNUNET_TIME_relative_to_absolute(), GNUNET_YES, GST_my_identity, GST_my_private_key, GST_stats, TransportDVBoxMessage::header, TransportDVBoxMessage::hmac, CommunicatorMessageContext::im, TransportDVBoxMessage::iv, key, Backtalker::last_ephemeral, lookup_neighbour(), mh, CommunicatorMessageContext::mh, TransportDVBoxPayloadP::monotonic_time, Backtalker::monotonic_time, TransportDVBoxMessage::num_hops, TransportDVBoxMessage::orig_size, peerstore, Backtalker::pid, GNUNET_PeerIdentity::public_key, GNUNET_CRYPTO_EccSignaturePurpose::purpose, EphemeralConfirmationPS::purpose, TransportDVBoxPayloadP::sender, GNUNET_TRANSPORT_IncomingMessage::sender, EphemeralConfirmationPS::sender_monotonic_time, TransportDVBoxPayloadP::sender_sig, GNUNET_MessageHeader::size, GNUNET_CRYPTO_EccSignaturePurpose::size, size, EphemeralConfirmationPS::target, Backtalker::task, Backtalker::timeout, TransportDVBoxMessage::total_hops, CommunicatorMessageContext::total_hops, and update_backtalker_monotime().

Here is the call graph for this function:

◆ check_incoming_msg()

static int check_incoming_msg ( void *  cls,
const struct GNUNET_TRANSPORT_IncomingMessage im 
)
static

Client notified us about transmission from a peer.

Process the request.

Parameters
clsa struct TransportClient which sent us the message
imthe send message that was sent
Returns
GNUNET_YES if message is well-formed

Definition at line 8982 of file gnunet-service-transport.c.

8984{
8985 struct TransportClient *tc = cls;
8986
8987 if (CT_COMMUNICATOR != tc->type)
8988 {
8989 GNUNET_break (0);
8990 return GNUNET_SYSERR;
8991 }
8993 return GNUNET_OK;
8994}

References CT_COMMUNICATOR, GNUNET_break, GNUNET_MQ_check_boxed_message, GNUNET_OK, GNUNET_SYSERR, and tc.

◆ check_known_address()

static int check_known_address ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Test if the validation state in value matches the address from cls.

Parameters
clsa struct CheckKnownAddressContext
pidunused (must match though)
valuea struct ValidationState
Returns
GNUNET_OK if not matching, GNUNET_NO if match found

Definition at line 9024 of file gnunet-service-transport.c.

9027{
9028 struct CheckKnownAddressContext *ckac = cls;
9029 struct ValidationState *vs = value;
9030
9031 (void) pid;
9032 if (0 != strcmp (vs->address, ckac->address))
9033 return GNUNET_OK;
9034 ckac->vs = vs;
9035 return GNUNET_NO;
9036}
Closure for check_known_address.
struct ValidationState * vs
Set to a matching validation state, if one was found.
const char * address
Set to the address we are looking for.
State we keep for validation activities.

References CheckKnownAddressContext::address, GNUNET_NO, GNUNET_OK, pid, value, and CheckKnownAddressContext::vs.

Referenced by start_address_validation().

Here is the caller graph for this function:

◆ validation_start_cb()

static void validation_start_cb ( void *  cls)
static

Task run periodically to validate some address based on validation_heap.

Parameters
clsNULL

Definition at line 11655 of file gnunet-service-transport.c.

11656{
11657 struct ValidationState *vs;
11658 struct Queue *q;
11660 GST_cfg);
11661
11662 (void) cls;
11663 validation_task = NULL;
11665 /* drop validations past their expiration */
11666 while (
11667 (NULL != vs) &&
11669 {
11671 "Validation response %s cleaned up\n",
11672 GNUNET_sh2s (&vs->challenge.value));
11675 }
11676 if (NULL == vs)
11677 {
11679 "Address validation task not scheduled anymore, nothing to do\n");
11680 return; /* woopsie, no more addresses known, should only
11681 happen if we're really a lonely peer */
11682 }
11683 q = find_queue (&vs->pid, vs->address);
11684 if (GNUNET_TIME_absolute_cmp (vs->first_challenge_use, >, now))
11685 {
11687 "To early to start next address validation for challenge %s\n",
11688 GNUNET_sh2s (&vs->challenge.value));
11689 return;
11690 }
11691 if (NULL == q)
11692 {
11693 vs->awaiting_queue = GNUNET_YES;
11694 suggest_to_connect (&vs->pid, vs->address);
11695 }
11696 else
11698 /* Finally, reschedule next attempt */
11699 vs->challenge_backoff =
11700 GNUNET_TIME_randomized_backoff (vs->challenge_backoff,
11703 "Address validation task will run again in %s\n",
11704 GNUNET_STRINGS_relative_time_to_string (vs->challenge_backoff,
11705 GNUNET_YES));
11708 vs->challenge_backoff));
11709}
static void free_validation_state(struct ValidationState *vs)
Free validation state.
static void suggest_to_connect(const struct GNUNET_PeerIdentity *pid, const char *address)
Signature of a function called with a communicator address of a peer pid that an application wants us...
static struct Queue * find_queue(const struct GNUNET_PeerIdentity *pid, const char *address)
Find the queue matching pid and address.
#define MAX_VALIDATION_CHALLENGE_FREQ
What is the slowest rate at which we send challenges?
static void update_next_challenge_time(struct ValidationState *vs, struct GNUNET_TIME_Absolute new_time)
Set the time for next_challenge of vs to new_time.
static void validation_transmit_on_queue(struct Queue *q, struct ValidationState *vs)
The queue q (which matches the peer and address in vs) is ready for queueing.
struct GNUNET_TIME_Relative GNUNET_TIME_randomized_backoff(struct GNUNET_TIME_Relative rt, struct GNUNET_TIME_Relative threshold)
Randomized exponential back-off, starting at 1 ms and going up by a factor of 2+r,...
Definition: time.c:834
#define GNUNET_TIME_absolute_cmp(t1, op, t2)
Compare two absolute times.
struct GNUNET_TIME_Absolute valid_until
How long did the peer claim this address to be valid? Capped at minimum of MAX_ADDRESS_VALID_UNTIL re...

References find_queue(), free_validation_state(), GNUNET_CONTAINER_heap_peek(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_log, GNUNET_sh2s(), GNUNET_STRINGS_relative_time_to_string(), GNUNET_TIME_absolute_cmp, GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_randomized_backoff(), GNUNET_TIME_relative_to_absolute(), GNUNET_YES, GST_cfg, MAX_VALIDATION_CHALLENGE_FREQ, ValidationState::pid, q, GNUNET_TIME_Relative::rel_value_us, suggest_to_connect(), update_next_challenge_time(), ValidationState::valid_until, validation_heap, validation_task, and validation_transmit_on_queue().

Referenced by update_next_challenge_time().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_next_challenge_time()

static void update_next_challenge_time ( struct ValidationState vs,
struct GNUNET_TIME_Absolute  new_time 
)
static

Set the time for next_challenge of vs to new_time.

Updates the heap and if necessary reschedules the job.

Parameters
vsvalidation state to update
new_timenew time for revalidation

Definition at line 9056 of file gnunet-service-transport.c.

9058{
9060
9061 if (new_time.abs_value_us == vs->next_challenge.abs_value_us)
9062 return; /* be lazy */
9063 vs->next_challenge = new_time;
9064 if (NULL == vs->hn)
9065 vs->hn =
9067 else
9070 (NULL != validation_task))
9071 return;
9072 if (NULL != validation_task)
9074 /* randomize a bit */
9077 MIN_DELAY_ADDRESS_VALIDATION.rel_value_us);
9078 new_time = GNUNET_TIME_absolute_add (new_time, delta);
9081}
#define MIN_DELAY_ADDRESS_VALIDATION
What is the maximum frequency at which we do address validation? A random value between 0 and this va...
static void validation_start_cb(void *cls)
Task run periodically to validate some address based on validation_heap.
void GNUNET_CONTAINER_heap_update_cost(struct GNUNET_CONTAINER_HeapNode *node, GNUNET_CONTAINER_HeapCostType new_cost)
Updates the cost of any node in the tree.

References GNUNET_TIME_Absolute::abs_value_us, delta, GNUNET_CONTAINER_heap_insert(), GNUNET_CONTAINER_heap_peek(), GNUNET_CONTAINER_heap_update_cost(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u64(), GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_cancel(), GNUNET_TIME_absolute_add(), MIN_DELAY_ADDRESS_VALIDATION, GNUNET_TIME_Relative::rel_value_us, validation_heap, validation_start_cb(), and validation_task.

Referenced by handle_validation_response(), revalidation_start_cb(), start_address_validation(), and validation_start_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ start_address_validation()

static void start_address_validation ( const struct GNUNET_PeerIdentity pid,
const char *  address 
)
static

Start address validation.

Parameters
pidpeer the address is for
addressan address to reach pid (presumably)

Definition at line 9091 of file gnunet-service-transport.c.

9093{
9094 struct GNUNET_TIME_Absolute now;
9095 struct ValidationState *vs;
9096 struct CheckKnownAddressContext ckac = { .address = address, .vs = NULL };
9097
9099 pid,
9101 &ckac);
9102 if (NULL != (vs = ckac.vs))
9103 {
9104 /* if 'vs' is not currently valid, we need to speed up retrying the
9105 * validation */
9106 if (vs->validated_until.abs_value_us < vs->next_challenge.abs_value_us)
9107 {
9108 /* reduce backoff as we got a fresh advertisement */
9109 vs->challenge_backoff =
9112 vs->challenge_backoff,
9113 2));
9116 vs->challenge_backoff));
9117 }
9118 return;
9119 }
9121 vs = GNUNET_new (struct ValidationState);
9122 vs->pid = *pid;
9123 vs->valid_until =
9125 vs->first_challenge_use = now;
9126 vs->validation_rtt = GNUNET_TIME_UNIT_FOREVER_REL;
9128 &vs->challenge,
9129 sizeof(vs->challenge));
9130 vs->address = GNUNET_strdup (address);
9131 GNUNET_CRYPTO_hash (vs->address, strlen (vs->address), &vs->hc);
9133 "Starting address validation `%s' of peer %s using challenge %s\n",
9134 address,
9135 GNUNET_i2s (pid),
9136 GNUNET_sh2s (&vs->challenge.value));
9140 &vs->pid,
9141 vs,
9144}
#define FAST_VALIDATION_CHALLENGE_FREQ
What is the fastest rate at which we send challenges if we keep learning an address (gossip,...
static int check_known_address(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Test if the validation state in value matches the address from cls.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:41
int GNUNET_CONTAINER_multipeermap_get_multiple(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map that match a particular key.
struct GNUNET_TIME_Absolute validated_until
How long do we consider this address to be valid? In the past or zero if we have not yet validated it...

References GNUNET_TIME_Absolute::abs_value_us, address, CheckKnownAddressContext::address, ADDRESS_VALIDATION_LIFETIME, check_known_address(), FAST_VALIDATION_CHALLENGE_FREQ, GNUNET_assert, GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE, GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_hash(), GNUNET_CRYPTO_QUALITY_NONCE, GNUNET_CRYPTO_random_block(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_sh2s(), GNUNET_strdup, GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_relative_divide(), GNUNET_TIME_relative_min(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_YES, GST_cfg, ValidationState::pid, pid, update_next_challenge_time(), ValidationState::valid_until, ValidationState::validated_until, validation_map, and CheckKnownAddressContext::vs.

Referenced by handle_add_queue_message(), handle_request_hello_validation(), handle_validation_challenge(), hello_for_client_cb(), and hello_for_incoming_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ find_queue()

static struct Queue * find_queue ( const struct GNUNET_PeerIdentity pid,
const char *  address 
)
static

Find the queue matching pid and address.

Parameters
pidpeer the queue must go to
addressaddress the queue must use
Returns
NULL if no such queue exists

Definition at line 9431 of file gnunet-service-transport.c.

9432{
9433 struct Neighbour *n;
9434
9435 n = lookup_neighbour (pid);
9436 if (NULL == n)
9437 return NULL;
9438 for (struct Queue *pos = n->queue_head; NULL != pos;
9439 pos = pos->next_neighbour)
9440 {
9441 if (0 == strcmp (pos->address, address))
9442 return pos;
9443 }
9444 return NULL;
9445}

References address, lookup_neighbour(), Queue::next_neighbour, pid, and Neighbour::queue_head.

Referenced by handle_request_hello_validation(), handle_validation_response(), hello_for_client_cb(), hello_for_incoming_cb(), revalidation_start_cb(), and validation_start_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ suggest_to_connect()

static void suggest_to_connect ( const struct GNUNET_PeerIdentity pid,
const char *  address 
)
static

Signature of a function called with a communicator address of a peer pid that an application wants us to connect to.

Parameters
pidtarget peer
addressthe address to try

Definition at line 11551 of file gnunet-service-transport.c.

11552{
11553 static uint32_t idgen;
11554 struct TransportClient *tc;
11555 char *prefix;
11556 struct GNUNET_TRANSPORT_CreateQueue *cqm;
11557 struct GNUNET_MQ_Envelope *env;
11558 size_t alen;
11559
11561 if (NULL == prefix)
11562 {
11563 GNUNET_break (0); /* We got an invalid address!? */
11564 return;
11565 }
11567 if (NULL == tc)
11568 {
11570 "# Suggestions ignored due to missing communicator",
11571 1,
11572 GNUNET_NO);
11574 "Cannot connect to %s at `%s', no matching communicator present\n",
11575 GNUNET_i2s (pid),
11576 address);
11578 return;
11579 }
11580 /* forward suggestion for queue creation to communicator */
11582 "Request #%u for `%s' communicator to create queue to `%s' at `%s'\n",
11583 (unsigned int) idgen,
11584 prefix,
11585 GNUNET_i2s (pid),
11586 address);
11588 alen = strlen (address) + 1;
11589 env =
11591 cqm->request_id = htonl (idgen++);
11592 cqm->receiver = *pid;
11593 memcpy (&cqm[1], address, alen);
11594 GNUNET_MQ_send (tc->mq, env);
11595}
static struct TransportClient * lookup_communicator(const char *prefix)
Find transport client providing communication service for the protocol prefix.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE
transport tells communicator it wants a queue
Transport tells communicator that it wants a new queue.
Definition: transport.h:521
uint32_t request_id
Unique ID for the request.
Definition: transport.h:530
struct GNUNET_PeerIdentity receiver
Receiver that can be addressed via the queue.
Definition: transport.h:535

References address, env, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_free, GNUNET_HELLO_address_to_prefix(), GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_NO, GNUNET_STATISTICS_update(), GST_stats, lookup_communicator(), pid, prefix, GNUNET_TRANSPORT_CreateQueue::receiver, GNUNET_TRANSPORT_CreateQueue::request_id, and tc.

Referenced by handle_request_hello_validation(), hello_for_client_cb(), hello_for_incoming_cb(), revalidation_start_cb(), and validation_start_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ hello_for_incoming_cb()

static void hello_for_incoming_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
const char *  uri 
)
static

Definition at line 9156 of file gnunet-service-transport.c.

9159{
9160 struct Queue *q;
9161 int pfx_len;
9162 const char *eou;
9163 char *address;
9164 (void) cls;
9165
9166 eou = strstr (uri,
9167 "://");
9168 pfx_len = eou - uri;
9169 eou += 3;
9171 "%.*s-%s",
9172 pfx_len,
9173 uri,
9174 eou);
9175
9177 "helo for client %s\n",
9178 address);
9179 q = find_queue (pid, address);
9180 if (NULL == q)
9181 {
9183 }
9184 else
9187}
static struct GNUNET_FS_Uri * uri
Value of URI provided on command-line (when not publishing a file but just creating UBlocks to refer ...
static void start_address_validation(const struct GNUNET_PeerIdentity *pid, const char *address)
Start address validation.

References address, find_queue(), GNUNET_asprintf(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, pid, q, start_address_validation(), suggest_to_connect(), and uri.

Referenced by handle_hello_for_incoming().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_hello_for_incoming()

static void handle_hello_for_incoming ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Function called by PEERSTORE for each matching record.

Parameters
clsclosure, a struct IncomingRequest
recordpeerstore record information
emsgerror message, or NULL if no errors

Definition at line 9198 of file gnunet-service-transport.c.

9201{
9202 struct IncomingRequest *ir = cls;
9204 struct GNUNET_MessageHeader *hello;
9205
9206 if (NULL != emsg)
9207 {
9209 "Got failure from PEERSTORE: %s\n",
9210 emsg);
9211 return;
9212 }
9213 hello = record->value;
9214 if (0 == GNUNET_memcmp (&record->peer, &GST_my_identity))
9215 {
9217 return;
9218 }
9222 NULL);
9224}
static void hello_for_incoming_cb(void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
void GNUNET_HELLO_parser_free(struct GNUNET_HELLO_Parser *parser)
Release resources of a builder.
Definition: hello-uri.c:435
struct GNUNET_HELLO_Parser * GNUNET_HELLO_parser_from_msg(const struct GNUNET_MessageHeader *msg)
Parse msg.
Definition: hello-uri.c:471
const struct GNUNET_PeerIdentity * GNUNET_HELLO_parser_iterate(const struct GNUNET_HELLO_Parser *parser, GNUNET_HELLO_UriCallback uc, void *uc_cls)
Iterate over URIs in a parser.
Definition: hello-uri.c:1201
void GNUNET_PEERSTORE_monitor_next(struct GNUNET_PEERSTORE_Monitor *zm, uint64_t limit)
Calls the monitor processor specified in GNUNET_PEERSTORE_monitor_start for the next record(s).
Context for parsing HELLOs.
Definition: hello-uri.c:258
Another peer attempted to talk to us, we should try to establish a connection in the other direction.

References GNUNET_ERROR_TYPE_WARNING, GNUNET_HELLO_parser_free(), GNUNET_HELLO_parser_from_msg(), GNUNET_HELLO_parser_iterate(), GNUNET_log, GNUNET_memcmp, GNUNET_PEERSTORE_monitor_next(), GST_my_identity, hello_for_incoming_cb(), IncomingRequest::nc, consensus-simulation::parser, and record().

Referenced by handle_validation_challenge().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ hello_for_incoming_error_cb()

static void hello_for_incoming_error_cb ( void *  cls)
static

Definition at line 9228 of file gnunet-service-transport.c.

9229{
9231 "Error in PEERSTORE monitoring\n");
9232}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_validation_challenge().

Here is the caller graph for this function:

◆ hello_for_incoming_sync_cb()

static void hello_for_incoming_sync_cb ( void *  cls)
static

Definition at line 9236 of file gnunet-service-transport.c.

9237{
9239 "Done with initial PEERSTORE iteration during monitoring\n");
9240}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_validation_challenge().

Here is the caller graph for this function:

◆ handle_validation_challenge()

static void handle_validation_challenge ( void *  cls,
const struct TransportValidationChallengeMessage tvc 
)
static

Communicator gave us a transport address validation challenge.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
tvcthe message that was received

Definition at line 9252 of file gnunet-service-transport.c.

9255{
9256 struct CommunicatorMessageContext *cmc = cls;
9258 struct VirtualLink *vl;
9259 struct GNUNET_TIME_RelativeNBO validity_duration;
9260 struct IncomingRequest *ir;
9261 struct Neighbour *n;
9262 struct GNUNET_PeerIdentity sender;
9263
9264 /* DV-routed messages are not allowed for validation challenges */
9265 if (cmc->total_hops > 0)
9266 {
9267 GNUNET_break_op (0);
9268 finish_cmc_handling (cmc);
9269 return;
9270 }
9271 validity_duration = cmc->im.expected_address_validity;
9273 "Received address validation challenge %s\n",
9274 GNUNET_sh2s (&tvc->challenge.value));
9275 /* If we have a virtual link, we use this mechanism to signal the
9276 size of the flow control window, and to allow the sender
9277 to ask for increases. If for us the virtual link is still down,
9278 we will always give a window size of zero. */
9279 tvr.header.type =
9281 tvr.header.size = htons (sizeof(tvr));
9282 tvr.reserved = htonl (0);
9283 tvr.challenge = tvc->challenge;
9284 tvr.origin_time = tvc->sender_time;
9285 tvr.validity_duration = validity_duration;
9286 {
9287 /* create signature */
9288 struct TransportValidationPS tvp = {
9290 .purpose.size = htonl (sizeof(tvp)),
9291 .validity_duration = validity_duration,
9292 .challenge = tvc->challenge
9293 };
9294
9296 &tvp,
9297 &tvr.signature);
9298 }
9299 sender = cmc->im.sender;
9300 vl = lookup_virtual_link (&sender);
9301 if ((NULL != vl) && (GNUNET_YES == vl->confirmed))
9302 {
9303 // route_control_message_without_fc (&cmc->im.sender,
9305 &tvr.header,
9307 }
9308 else
9309 {
9310 /* Use route via neighbour */
9311 n = lookup_neighbour (&sender);
9312 if (NULL != n)
9313 route_via_neighbour (n, &tvr.header,
9316 }
9317
9318 finish_cmc_handling (cmc);
9319 if (NULL != vl)
9320 return;
9321
9322 /* For us, the link is still down, but we need bi-directional
9323 connections (for flow-control and for this to be useful for
9324 CORE), so we must try to bring the link up! */
9325
9326 /* (1) Check existing queues, if any, we may be lucky! */
9327 n = lookup_neighbour (&sender);
9328 if (NULL != n)
9329 for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour)
9330 start_address_validation (&sender, q->address);
9331 /* (2) Also try to see if we have addresses in PEERSTORE for this peer
9332 we could use */
9333 for (ir = ir_head; NULL != ir; ir = ir->next)
9334 if (0 == GNUNET_memcmp (&ir->pid, &sender))
9335 return;
9336 /* we are already trying */
9337 ir = GNUNET_new (struct IncomingRequest);
9338 ir->pid = sender;
9340
9342 GNUNET_YES,
9343 "peerstore",
9344 NULL,
9347 NULL,
9349 NULL,
9351 ir);
9352 ir_total++;
9353 /* Bound attempts we do in parallel here, might otherwise get excessive */
9356}
static void hello_for_incoming_sync_cb(void *cls)
static void hello_for_incoming_error_cb(void *cls)
static void handle_hello_for_incoming(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
Function called by PEERSTORE for each matching record.
#define MAX_INCOMING_REQUEST
For how many incoming connections do we try to create a virtual link for (at the same time!...
struct GNUNET_PEERSTORE_Monitor * GNUNET_PEERSTORE_monitor_start(const struct GNUNET_CONFIGURATION_Handle *cfg, int iterate_first, const char *sub_system, const struct GNUNET_PeerIdentity *peer, const char *key, GNUNET_SCHEDULER_TaskCallback error_cb, void *error_cb_cls, GNUNET_SCHEDULER_TaskCallback sync_cb, void *sync_cb_cls, GNUNET_PEERSTORE_Processor callback, void *callback_cls)
Request watching a given key The monitoring can be filtered to contain only records matching peer and...
#define GNUNET_PEERSTORE_HELLO_KEY
Key used for storing HELLO in the peerstore.
#define GNUNET_SIGNATURE_PURPOSE_TRANSPORT_CHALLENGE
Signature by a peer affirming that it received a challenge (and stating how long it expects the addre...
Time for relative time used by GNUnet, in microseconds and in network byte order.
struct GNUNET_TIME_RelativeNBO expected_address_validity
How long does the communicator believe the address on which the message was received to remain valid?
Definition: transport.h:353
struct IncomingRequest * next
Kept in a DLL.
struct GNUNET_PeerIdentity pid
Which peer is this about?
struct GNUNET_CRYPTO_ChallengeNonceP challenge
Challenge to be signed by the receiving peer.
struct GNUNET_TIME_AbsoluteNBO sender_time
Timestamp of the sender, to be copied into the reply to allow sender to calculate RTT.
Message signed by a peer to confirm that it can indeed receive messages at a particular address.
struct GNUNET_CRYPTO_EccSignaturePurpose purpose
Purpose is GNUNET_SIGNATURE_PURPOSE_TRANSPORT_CHALLENGE.
struct GNUNET_TIME_RelativeNBO validity_duration
How long does the sender believe the address on which the challenge was received to remain valid?

References TransportValidationChallengeMessage::challenge, TransportValidationResponseMessage::challenge, VirtualLink::confirmed, GNUNET_TRANSPORT_IncomingMessage::expected_address_validity, finish_cmc_handling(), free_incoming_request(), GNUNET_break_op, GNUNET_CONTAINER_DLL_insert, GNUNET_CRYPTO_eddsa_sign, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_memcmp, GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_RESPONSE, GNUNET_new, GNUNET_PEERSTORE_HELLO_KEY, GNUNET_PEERSTORE_monitor_start(), GNUNET_sh2s(), GNUNET_SIGNATURE_PURPOSE_TRANSPORT_CHALLENGE, GNUNET_YES, GST_cfg, GST_my_private_key, handle_hello_for_incoming(), TransportValidationResponseMessage::header, hello_for_incoming_error_cb(), hello_for_incoming_sync_cb(), CommunicatorMessageContext::im, ir_head, ir_tail, ir_total, lookup_neighbour(), lookup_virtual_link(), MAX_INCOMING_REQUEST, IncomingRequest::nc, IncomingRequest::next, IncomingRequest::pid, GNUNET_CRYPTO_EccSignaturePurpose::purpose, TransportValidationPS::purpose, q, Neighbour::queue_head, TransportValidationResponseMessage::reserved, RMO_ANYTHING_GOES, RMO_REDUNDANT, RMO_UNCONFIRMED_ALLOWED, route_control_message_without_fc(), route_via_neighbour(), GNUNET_TRANSPORT_IncomingMessage::sender, TransportValidationChallengeMessage::sender_time, TransportValidationResponseMessage::signature, GNUNET_MessageHeader::size, start_address_validation(), CommunicatorMessageContext::total_hops, GNUNET_MessageHeader::type, TransportValidationPS::validity_duration, and GNUNET_CRYPTO_ChallengeNonceP::value.

Here is the call graph for this function:

◆ check_known_challenge()

static int check_known_challenge ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Test if the validation state in value matches the challenge from cls.

Parameters
clsa struct CheckKnownChallengeContext
pidunused (must match though)
valuea struct ValidationState
Returns
GNUNET_OK if not matching, GNUNET_NO if match found

Definition at line 9386 of file gnunet-service-transport.c.

9389{
9390 struct CheckKnownChallengeContext *ckac = cls;
9391 struct ValidationState *vs = value;
9392
9393 (void) pid;
9394 if (0 != GNUNET_memcmp (&vs->challenge, ckac->challenge))
9395 return GNUNET_OK;
9396 ckac->vs = vs;
9397 return GNUNET_NO;
9398}
Closure for check_known_challenge.
struct ValidationState * vs
Set to a matching validation state, if one was found.
const struct GNUNET_CRYPTO_ChallengeNonceP * challenge
Set to the challenge we are looking for.

References CheckKnownChallengeContext::challenge, GNUNET_memcmp, GNUNET_NO, GNUNET_OK, pid, value, and CheckKnownChallengeContext::vs.

Referenced by handle_validation_response().

Here is the caller graph for this function:

◆ peerstore_store_validation_cb()

static void peerstore_store_validation_cb ( void *  cls,
int  success 
)
static

Function called when peerstore is done storing a validated address.

Parameters
clsa struct ValidationState
successGNUNET_YES on success

Definition at line 9409 of file gnunet-service-transport.c.

9410{
9411 struct ValidationState *vs = cls;
9412
9413 vs->sc = NULL;
9414 if (GNUNET_YES == success)
9415 return;
9417 "# Peerstore failed to store foreign address",
9418 1,
9419 GNUNET_NO);
9420}

References GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_YES, and GST_stats.

Referenced by handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ validation_transmit_on_queue()

static void validation_transmit_on_queue ( struct Queue q,
struct ValidationState vs 
)
static

The queue q (which matches the peer and address in vs) is ready for queueing.

We should now queue the validation request.

Parameters
qqueue to send on
vsstate to derive validation challenge from

Definition at line 11606 of file gnunet-service-transport.c.

11607{
11609 struct GNUNET_TIME_Absolute monotonic_time;
11610
11611 if (NULL != vs->revalidation_task)
11612 {
11613 GNUNET_SCHEDULER_cancel (vs->revalidation_task);
11614 vs->revalidation_task = NULL;
11615 }
11616 /*memcpy (&hkey,
11617 &hc,
11618 sizeof (hkey));*/
11620 "Remove key %s for address %s map size %u contains %u\n",
11621 GNUNET_h2s (&vs->hc),
11622 vs->address,
11625 &vs->hc));
11627
11629 if (GNUNET_TIME_UNIT_ZERO_ABS.abs_value_us ==
11630 vs->last_challenge_use.abs_value_us)
11631 {
11632 vs->first_challenge_use = monotonic_time;
11633 }
11634 vs->last_challenge_use = monotonic_time;
11635 tvc.header.type =
11637 tvc.header.size = htons (sizeof(tvc));
11638 tvc.reserved = htonl (0);
11639 tvc.challenge = vs->challenge;
11640 tvc.sender_time = GNUNET_TIME_absolute_hton (vs->last_challenge_use);
11642 "Sending address validation challenge %s to %s\n",
11643 GNUNET_sh2s (&tvc.challenge.value),
11644 GNUNET_i2s (&q->neighbour->pid));
11645 queue_send_msg (q, NULL, &tvc, sizeof(tvc));
11646}

References TransportValidationChallengeMessage::challenge, GNUNET_CONTAINER_multihashmap_contains(), GNUNET_CONTAINER_multihashmap_remove(), GNUNET_CONTAINER_multihashmap_size(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_ADDRESS_VALIDATION_CHALLENGE, GNUNET_SCHEDULER_cancel(), GNUNET_sh2s(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_UNIT_ZERO_ABS, GST_cfg, TransportValidationChallengeMessage::header, q, queue_send_msg(), TransportValidationChallengeMessage::reserved, revalidation_map, TransportValidationChallengeMessage::sender_time, GNUNET_MessageHeader::size, GNUNET_MessageHeader::type, and GNUNET_CRYPTO_ChallengeNonceP::value.

Referenced by check_validation_request_pending(), revalidation_start_cb(), and validation_start_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ revalidation_start_cb()

static void revalidation_start_cb ( void *  cls)
static

Definition at line 9452 of file gnunet-service-transport.c.

9453{
9454 struct ValidationState *vs = cls;
9455 struct Queue *q;
9456 struct GNUNET_TIME_Absolute now;
9457
9458 vs->revalidation_task = NULL;
9459 q = find_queue (&vs->pid, vs->address);
9460 if (NULL == q)
9461 {
9462 now = GNUNET_TIME_absolute_get ();
9463 vs->awaiting_queue = GNUNET_YES;
9464 suggest_to_connect (&vs->pid, vs->address);
9466 }
9467 else
9469}

References find_queue(), GNUNET_TIME_absolute_get(), GNUNET_YES, ValidationState::pid, q, suggest_to_connect(), update_next_challenge_time(), and validation_transmit_on_queue().

Referenced by handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ revalidate_map_it()

static enum GNUNET_GenericReturnValue revalidate_map_it ( void *  cls,
const struct GNUNET_HashCode key,
void *  value 
)
static

Definition at line 9473 of file gnunet-service-transport.c.

9477{
9478 (void) cls;
9480 "Key in revalidate map %s \n",
9481 GNUNET_h2s (key));
9482 return GNUNET_YES;
9483}

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_log, GNUNET_YES, and key.

Referenced by handle_validation_response().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_validation_response()

static void handle_validation_response ( void *  cls,
const struct TransportValidationResponseMessage tvr 
)
static

Communicator gave us a transport address validation response.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
tvrthe message that was received

Definition at line 9495 of file gnunet-service-transport.c.

9498{
9499 struct CommunicatorMessageContext *cmc = cls;
9500 struct ValidationState *vs;
9501 struct CheckKnownChallengeContext ckac = { .challenge = &tvr->challenge,
9502 .vs = NULL};
9503 struct GNUNET_TIME_Absolute origin_time;
9504 struct Queue *q;
9505 struct Neighbour *n;
9506 struct VirtualLink *vl;
9508 GST_cfg);
9509
9510 /* check this is one of our challenges */
9512 &cmc->im.sender,
9514 &ckac);
9515 if (NULL == (vs = ckac.vs))
9516 {
9517 /* This can happen simply if we 'forgot' the challenge by now,
9518 i.e. because we received the validation response twice */
9520 "# Validations dropped, challenge unknown",
9521 1,
9522 GNUNET_NO);
9524 "Validation response %s dropped, challenge unknown\n",
9525 GNUNET_sh2s (&tvr->challenge.value));
9526 finish_cmc_handling (cmc);
9527 return;
9528 }
9529
9530 /* sanity check on origin time */
9531 origin_time = GNUNET_TIME_absolute_ntoh (tvr->origin_time);
9532 if ((origin_time.abs_value_us < vs->first_challenge_use.abs_value_us) ||
9533 (origin_time.abs_value_us > vs->last_challenge_use.abs_value_us))
9534 {
9536 "Diff first use %" PRIu64 " and last use %" PRIu64 "\n",
9537 vs->first_challenge_use.abs_value_us - origin_time.abs_value_us,
9538 origin_time.abs_value_us - vs->last_challenge_use.abs_value_us);
9539 GNUNET_break_op (0);
9540 finish_cmc_handling (cmc);
9541 return;
9542 }
9543
9544 {
9545 /* check signature */
9546 struct TransportValidationPS tvp = {
9548 .purpose.size = htonl (sizeof(tvp)),
9549 .validity_duration = tvr->validity_duration,
9550 .challenge = tvr->challenge
9551 };
9552
9553 if (
9554 GNUNET_OK !=
9556 &tvp,
9557 &tvr->signature,
9558 &cmc->im.sender.public_key))
9559 {
9560 GNUNET_break_op (0);
9561 finish_cmc_handling (cmc);
9562 return;
9563 }
9564 }
9565
9566 /* validity is capped by our willingness to keep track of the
9567 validation entry and the maximum the other peer allows */
9570 tvr->validity_duration),
9572 vs->validated_until =
9576 vs->validation_rtt = GNUNET_TIME_absolute_get_duration (origin_time);
9577 vs->challenge_backoff = GNUNET_TIME_UNIT_ZERO;
9579 &vs->challenge,
9580 sizeof(vs->challenge));
9581 vs->first_challenge_use = GNUNET_TIME_absolute_subtract (
9582 vs->validated_until,
9583 GNUNET_TIME_relative_multiply (vs->validation_rtt,
9585 if (GNUNET_TIME_absolute_cmp (vs->first_challenge_use, <, now))
9586 {
9588 "First challenge use is now %" PRIu64 " %s \n",
9589 vs->first_challenge_use.abs_value_us,
9590 GNUNET_sh2s (&vs->challenge.value));
9591 vs->first_challenge_use = now;
9592 }
9593 else
9595 "First challenge use is later %" PRIu64 " %s \n",
9596 vs->first_challenge_use.abs_value_us,
9597 GNUNET_sh2s (&vs->challenge.value));
9598 vs->last_challenge_use =
9599 GNUNET_TIME_UNIT_ZERO_ABS; /* challenge was not yet used */
9600 update_next_challenge_time (vs, vs->first_challenge_use);
9602 "Validation response %s from %s accepted, address valid until %s\n",
9603 GNUNET_sh2s (&tvr->challenge.value),
9604 GNUNET_i2s (&cmc->im.sender),
9606 /*memcpy (&hkey,
9607 &hc,
9608 sizeof (hkey));*/
9610 "Key %s for address %s map size %u contains %u\n",
9611 GNUNET_h2s (&vs->hc),
9612 vs->address,
9615 &vs->hc));
9619 &vs->hc,
9620 vs,
9624 NULL);
9625 vs->revalidation_task =
9630 "transport",
9631 &cmc->im.sender,
9633 vs->address,
9634 strlen (vs->address) + 1,
9635 vs->valid_until,
9638 vs);
9639 finish_cmc_handling (cmc);
9640
9641 /* Finally, we now possibly have a confirmed (!) working queue,
9642 update queue status (if queue still is around) */
9643 q = find_queue (&vs->pid, vs->address);
9644 if (NULL == q)
9645 {
9647 "# Queues lost at time of successful validation",
9648 1,
9649 GNUNET_NO);
9650 return;
9651 }
9652 q->validated_until = vs->validated_until;
9653 q->pd.aged_rtt = vs->validation_rtt;
9654 n = q->neighbour;
9655 vl = lookup_virtual_link (&vs->pid);
9656 if (NULL == vl)
9657 {
9658 vl = GNUNET_new (struct VirtualLink);
9660 "Creating new virtual link %p to %s using direct neighbour!\n",
9661 vl,
9662 GNUNET_i2s (&vs->pid));
9663 vl->burst_addr = NULL;
9664 vl->confirmed = GNUNET_YES;
9665 vl->message_uuid_ctr =
9667 vl->target = n->pid;
9673 links,
9674 &vl->target,
9675 vl,
9677 vl->n = n;
9678 n->vl = vl;
9679 q->idle = GNUNET_YES;
9680 vl->visibility_task =
9681 GNUNET_SCHEDULER_add_at (q->validated_until, &check_link_down, vl);
9683 /* We lacked a confirmed connection to the target
9684 before, so tell CORE about it (finally!) */
9687 }
9688 else
9689 {
9690 /* Link was already up, remember n is also now available and we are done */
9691 if (NULL == vl->n)
9692 {
9693 vl->n = n;
9694 n->vl = vl;
9695 if (GNUNET_YES == vl->confirmed)
9697 "Virtual link to %s could now also use direct neighbour!\n",
9698 GNUNET_i2s (&vs->pid));
9699 }
9700 else
9701 {
9702 GNUNET_assert (n == vl->n);
9703 }
9704 if (GNUNET_NO == vl->confirmed)
9705 {
9706 vl->confirmed = GNUNET_YES;
9707 q->idle = GNUNET_YES;
9708 vl->visibility_task =
9709 GNUNET_SCHEDULER_add_at (q->validated_until, &check_link_down, vl);
9711 /* We lacked a confirmed connection to the target
9712 before, so tell CORE about it (finally!) */
9715 }
9716 }
9717}
static void peerstore_store_validation_cb(void *cls, int success)
Function called when peerstore is done storing a validated address.
static int check_known_challenge(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Test if the validation state in value matches the challenge from cls.
static void revalidation_start_cb(void *cls)
#define MAX_ADDRESS_VALID_UNTIL
When do we forget an invalid address for sure?
static enum GNUNET_GenericReturnValue revalidate_map_it(void *cls, const struct GNUNET_HashCode *key, void *value)
#define VALIDATION_RTT_BUFFER_FACTOR
How many network RTTs before an address validation expires should we begin trying to revalidate?...
int GNUNET_CONTAINER_multihashmap_iterate(struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_MultiHashMapIteratorCallback it, void *it_cls)
Iterate over all entries in the map.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
#define GNUNET_PEERSTORE_TRANSPORT_URLADDRESS_KEY
Key used for storing addresses in URL format in the peerstore.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_subtract(struct GNUNET_TIME_Absolute start, struct GNUNET_TIME_Relative duration)
Subtract a given relative duration from the given start time.
Definition: time.c:471
struct GNUNET_CRYPTO_ChallengeNonceP challenge
The challenge that was signed by the receiving peer.
struct GNUNET_CRYPTO_EddsaSignature signature
The peer's signature matching the GNUNET_SIGNATURE_PURPOSE_TRANSPORT_CHALLENGE purpose.

References GNUNET_TIME_Absolute::abs_value_us, ADDRESS_VALIDATION_LIFETIME, VirtualLink::available_fc_window_size, VirtualLink::burst_addr, TransportValidationResponseMessage::challenge, CheckKnownChallengeContext::challenge, check_known_challenge(), check_link_down(), VirtualLink::confirmed, consider_sending_fc(), VirtualLink::core_recv_window, cores_send_connect_info(), DEFAULT_WINDOW_SIZE, find_queue(), finish_cmc_handling(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CONTAINER_multihashmap_contains(), GNUNET_CONTAINER_multihashmap_iterate(), GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_multihashmap_size(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_eddsa_verify, GNUNET_CRYPTO_QUALITY_NONCE, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_block(), GNUNET_CRYPTO_random_u64(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_PEERSTORE_store(), GNUNET_PEERSTORE_STOREOPTION_MULTIPLE, GNUNET_PEERSTORE_TRANSPORT_URLADDRESS_KEY, GNUNET_SCHEDULER_add_at(), GNUNET_sh2s(), GNUNET_SIGNATURE_PURPOSE_TRANSPORT_CHALLENGE, GNUNET_STATISTICS_update(), GNUNET_STRINGS_absolute_time_to_string(), GNUNET_TIME_absolute_cmp, GNUNET_TIME_absolute_get_duration(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_min(), GNUNET_TIME_absolute_ntoh(), GNUNET_TIME_absolute_subtract(), GNUNET_TIME_relative_min(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_relative_ntoh(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_UNIT_MINUTES, GNUNET_TIME_UNIT_ZERO, GNUNET_TIME_UNIT_ZERO_ABS, GNUNET_YES, GST_cfg, GST_stats, CommunicatorMessageContext::im, VirtualLink::incoming_fc_window_size, links, lookup_virtual_link(), MAX_ADDRESS_VALID_UNTIL, VirtualLink::message_uuid_ctr, VirtualLink::n, peerstore, peerstore_store_validation_cb(), Neighbour::pid, ValidationState::pid, GNUNET_PeerIdentity::public_key, GNUNET_CRYPTO_EccSignaturePurpose::purpose, TransportValidationPS::purpose, q, RECV_WINDOW_SIZE, revalidate_map_it(), revalidation_map, revalidation_start_cb(), send_msg_from_cache(), GNUNET_TRANSPORT_IncomingMessage::sender, TransportValidationResponseMessage::signature, VirtualLink::target, update_next_challenge_time(), ValidationState::valid_until, ValidationState::validated_until, validation_map, VALIDATION_RTT_BUFFER_FACTOR, GNUNET_CRYPTO_ChallengeNonceP::value, VirtualLink::visibility_task, Neighbour::vl, and CheckKnownChallengeContext::vs.

Here is the call graph for this function:

◆ handle_incoming_msg()

static void handle_incoming_msg ( void *  cls,
const struct GNUNET_TRANSPORT_IncomingMessage im 
)
static

Incoming message.

Process the request.

Parameters
imthe send message that was received

Definition at line 9726 of file gnunet-service-transport.c.

9728{
9729 struct TransportClient *tc = cls;
9730 struct CommunicatorMessageContext *cmc =
9732
9733 cmc->tc = tc;
9734 cmc->im = *im;
9736 "Received message with size %u and flow control id %" PRIu64
9737 " via communicator from peer %s\n",
9738 ntohs (im->header.size),
9739 im->fc_id,
9740 GNUNET_i2s (&im->sender));
9741 cmc->im.neighbour_sender = cmc->im.sender;
9742 cmc->mh = (const struct GNUNET_MessageHeader *) &im[1];
9744}
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG.
Definition: transport.h:337

References demultiplex_with_cmc(), GNUNET_TRANSPORT_IncomingMessage::fc_id, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_TRANSPORT_IncomingMessage::header, CommunicatorMessageContext::im, CommunicatorMessageContext::mh, GNUNET_TRANSPORT_IncomingMessage::neighbour_sender, GNUNET_TRANSPORT_IncomingMessage::sender, GNUNET_MessageHeader::size, tc, and CommunicatorMessageContext::tc.

Here is the call graph for this function:

◆ check_flow_control()

static int check_flow_control ( void *  cls,
const struct TransportFlowControlMessage fc 
)
static

Communicator gave us a transport address validation response.

Check the request.

Parameters
clsa struct CommunicatorMessageContext
fcthe message that was received
Returns
GNUNET_YES if message is well-formed

Definition at line 9756 of file gnunet-service-transport.c.

9757{
9758 unsigned int number_of_addresses = ntohl (fc->number_of_addresses);
9759 (void) cls;
9760
9762 "Flow control header size %u size of addresses %u number of addresses %u size of message struct %lu second struct %lu\n",
9763 ntohs (fc->header.size),
9764 ntohl (fc->size_of_addresses),
9765 ntohl (fc->number_of_addresses),
9766 sizeof(struct TransportFlowControlMessage),
9767 sizeof (struct TransportGlobalNattedAddress));
9768
9769 if (0 == number_of_addresses || ntohs (fc->header.size) == sizeof(struct
9771 + ntohl (fc->number_of_addresses) * sizeof (struct
9773 + ntohl (fc->size_of_addresses))
9774 return GNUNET_OK;
9775 else
9776 {
9777 GNUNET_break_op (0);
9778 return GNUNET_SYSERR;
9779 }
9780}

References GNUNET_break_op, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_OK, GNUNET_SYSERR, TransportFlowControlMessage::header, TransportFlowControlMessage::number_of_addresses, GNUNET_MessageHeader::size, and TransportFlowControlMessage::size_of_addresses.

◆ iterate_address_start_burst()

static void iterate_address_start_burst ( void *  cls,
const struct GNUNET_PeerIdentity pid,
const char *  uri 
)
static

Definition at line 9811 of file gnunet-service-transport.c.

9814{
9815 struct VirtualLink *vl = cls;
9816 const char *slash;
9817 char *address_uri;
9818 char *prefix;
9819 char *uri_without_port;
9820
9821 slash = strrchr (uri, '/');
9822 prefix = GNUNET_strndup (uri, (slash - uri) - 2);
9823 GNUNET_assert (NULL != slash);
9824 slash++;
9825 GNUNET_asprintf (&address_uri,
9826 "%s-%s",
9827 prefix,
9828 slash);
9829
9830 uri_without_port = get_address_without_port (address_uri);
9832 "iterate_address_start_burst %s %s %s %s\n",
9833 uri_without_port,
9834 uri,
9835 address_uri,
9836 slash);
9837 if (0 == strcmp (uri_without_port, slash))
9838 {
9839 vl->burst_addr = GNUNET_strndup (uri_without_port, strlen (uri_without_port)
9840 );
9841 }
9842 else
9843 vl->burst_addr = NULL;
9844
9846 GNUNET_free (uri_without_port);
9847}

References VirtualLink::burst_addr, get_address_without_port(), GNUNET_asprintf(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_strndup, prefix, and uri.

Referenced by check_for_burst_address().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_for_burst_address()

static void check_for_burst_address ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Definition at line 9851 of file gnunet-service-transport.c.

9854{
9855 struct GNUNET_StartBurstCls *sb_cls = cls;
9856 struct VirtualLink *vl = sb_cls->vl;
9857 struct GNUNET_MessageHeader *hello;
9859
9860 if (NULL != emsg)
9861 {
9863 "Got failure from PEERSTORE: %s\n",
9864 emsg);
9865 return;
9866 }
9867 if (NULL == record)
9868 {
9870 "Hello iteration end for %s\n",
9871 GNUNET_i2s (&vl->target));
9872 vl->ic = NULL;
9873 GNUNET_free (sb_cls);
9874 return;
9875 }
9876
9878 "check_for_burst_address\n");
9879 hello = record->value;
9883 vl);
9885
9887 GNUNET_free (sb_cls);
9888}
static void iterate_address_start_burst(void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
Struct wrapping information we use for starting the burst.
struct VirtualLink * vl
The VirtualLink of the peer to which we like to burst with.

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_HELLO_parser_free(), GNUNET_HELLO_parser_from_msg(), GNUNET_HELLO_parser_iterate(), GNUNET_i2s(), GNUNET_log, GNUNET_PEERSTORE_iteration_stop(), VirtualLink::ic, iterate_address_start_burst(), consensus-simulation::parser, record(), VirtualLink::sb_cls, VirtualLink::target, and GNUNET_StartBurstCls::vl.

Referenced by queue_burst().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ burst_timeout()

static void burst_timeout ( void *  cls)
static

Definition at line 9892 of file gnunet-service-transport.c.

9893{
9895}
static enum GNUNET_GenericReturnValue burst_running
Is there a burst running?

References burst_running, and GNUNET_NO.

Referenced by start_burst().

Here is the caller graph for this function:

◆ start_burst()

static void start_burst ( void *  cls)
static

Definition at line 9899 of file gnunet-service-transport.c.

9900{
9901 struct GNUNET_StartBurstCls *sb_cls = cls;
9902 struct VirtualLink *vl = sb_cls->vl;
9903 struct GNUNET_TRANSPORT_StartBurst *sb;
9904 struct GNUNET_MQ_Envelope *env;
9905 char *uri_without_port = vl->burst_addr;
9906
9907 burst_task = NULL;
9908 /*char buf[strlen (uri_without_port) + 1];
9909
9910 GNUNET_memcpy (buf, uri_without_port, strlen (uri_without_port));
9911 buf[strlen (uri_without_port)] = '\0';*/
9912 env =
9914 strlen (uri_without_port) + 1,
9916 sb->rtt = GNUNET_TIME_relative_hton (sb_cls->rtt);
9917 sb->pid = vl->target;
9918 memcpy (&sb[1], uri_without_port, strlen (uri_without_port) + 1);
9919 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
9920 {
9922 "iterate_address_start_burst client tc prefix %s\n",
9923 tc->details.communicator.address_prefix);
9924 if (CT_COMMUNICATOR != tc->type)
9925 continue;
9926 if (GNUNET_YES == tc->details.communicator.can_burst)
9927 {
9929 "iterate_address_start_burst %s call %lu %u rtt %lu\n",
9930 uri_without_port,
9931 strlen (uri_without_port),
9932 ntohs (sb->header.size),
9933 (unsigned long) sb_cls->rtt.rel_value_us);
9934 GNUNET_MQ_send (tc->mq, env);
9938 60),
9940 NULL);
9941 // TODO We need some algo to choose from available communicators. Can we run two bursts at once? Atm we only implemented udp burst.
9942 break;
9943 }
9944 }
9945 GNUNET_free (env);
9946 GNUNET_free (sb_cls);
9947}
static void burst_timeout(void *cls)
struct GNUNET_SCHEDULER_Task * burst_timeout_task
static struct GNUNET_SCHEDULER_Task * burst_task
The task to start the burst.
#define GNUNET_MESSAGE_TYPE_TRANSPORT_START_BURST
Burst message we send to another peer for hole punching.
struct GNUNET_TIME_Relative rtt
The average RTT between the peers.
Message from transport to communicator to start a burst.
Definition: transport.h:680
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_START_BURST.
Definition: transport.h:684
struct GNUNET_TIME_RelativeNBO rtt
Definition: transport.h:691
struct GNUNET_PeerIdentity pid
Target peer.
Definition: transport.h:689

References VirtualLink::burst_addr, burst_running, burst_task, burst_timeout(), burst_timeout_task, clients_head, CT_COMMUNICATOR, env, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_START_BURST, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_relative_hton(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_UNIT_SECONDS, GNUNET_YES, GNUNET_TRANSPORT_StartBurst::header, GNUNET_TRANSPORT_StartBurst::pid, GNUNET_TIME_Relative::rel_value_us, GNUNET_StartBurstCls::rtt, GNUNET_TRANSPORT_StartBurst::rtt, VirtualLink::sb_cls, GNUNET_MessageHeader::size, VirtualLink::target, tc, and GNUNET_StartBurstCls::vl.

Referenced by queue_burst().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ queue_burst()

static void queue_burst ( void *  cls)
static

Definition at line 9951 of file gnunet-service-transport.c.

9952{
9953 struct GNUNET_StartBurstCls *sb_cls = cls;
9954 struct VirtualLink *vl = sb_cls->vl;
9955
9956 if (GNUNET_YES != use_burst)
9957 return;
9959 "burst_task %p ready %s burst addr %s (%p)\n",
9960 burst_task,
9961 sb_cls->sync_ready ? "yes" : "no",
9962 vl->burst_addr,
9963 vl->burst_addr);
9964 if (NULL != burst_task && GNUNET_NO == sb_cls->sync_ready)
9965 {
9967 burst_task = NULL;
9969 return;
9970 }
9971 if (GNUNET_NO == burst_running && NULL != vl->burst_addr && NULL == burst_task
9972 )
9973 {
9975 &start_burst,
9976 sb_cls);
9977 }
9978 else if (NULL == vl->burst_addr)
9979 {
9981 "peerstore",
9982 &vl->target,
9985 sb_cls);
9986 }
9987}
static void start_burst(void *cls)
static void check_for_burst_address(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
enum GNUNET_GenericReturnValue use_burst
struct GNUNET_TIME_Relative delay
The delay - calculate from the RTT and which peer was ready to sync first, after we will start the bu...
unsigned int sync_ready
We are ready to start the burst.

References VirtualLink::burst_addr, burst_running, burst_task, check_for_burst_address(), GNUNET_StartBurstCls::delay, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_NO, GNUNET_PEERSTORE_HELLO_KEY, GNUNET_PEERSTORE_iteration_start(), GNUNET_SCHEDULER_add_delayed(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, VirtualLink::ic, peerstore, VirtualLink::sb_cls, start_burst(), GNUNET_StartBurstCls::sync_ready, VirtualLink::target, use_burst, and GNUNET_StartBurstCls::vl.

Referenced by handle_flow_control().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_flow_control()

static void handle_flow_control ( void *  cls,
const struct TransportFlowControlMessage fc 
)
static

Communicator gave us a transport address validation response.

Process the request.

Parameters
clsa struct CommunicatorMessageContext (must call finish_cmc_handling() when done)
fcthe message that was received

Definition at line 9999 of file gnunet-service-transport.c.

10000{
10001 struct CommunicatorMessageContext *cmc = cls;
10002 struct VirtualLink *vl;
10004 uint32_t seq;
10005 struct GNUNET_TIME_Absolute st;
10006 uint64_t os;
10007 uint64_t wnd;
10008 uint32_t random;
10009
10011 "Received FC from %s\n", GNUNET_i2s (&cmc->im.sender));
10012 vl = lookup_virtual_link (&cmc->im.sender);
10013 if (NULL == vl)
10014 {
10015 vl = GNUNET_new (struct VirtualLink);
10017 "No virtual link for %p FC creating new unconfirmed virtual link to %s!\n",
10018 vl,
10019 GNUNET_i2s (&cmc->im.sender));
10020 vl->burst_addr = NULL;
10021 vl->confirmed = GNUNET_NO;
10022 vl->message_uuid_ctr =
10024 vl->target = cmc->im.sender;
10030 links,
10031 &vl->target,
10032 vl,
10034 }
10035 if (NULL != vl->n)
10036 {
10037 for (struct Queue *q = vl->n->queue_head; NULL != q; q = q->next_neighbour)
10038 q_timeout = GNUNET_TIME_absolute_max (q_timeout, q->validated_until);
10039 }
10040
10042 "remaining %lu timeout for neighbour %p\n",
10043 (unsigned long) GNUNET_TIME_absolute_get_remaining (q_timeout).
10044 rel_value_us,
10045 vl->n);
10046 if (NULL == vl->n ||
10047 0 == GNUNET_TIME_absolute_get_remaining (q_timeout).rel_value_us)
10048 {
10049 struct GNUNET_TIME_Relative rtt;
10050 struct GNUNET_BurstSync burst_sync;
10051 struct GNUNET_StartBurstCls *bcls;
10052
10053 bcls = GNUNET_new (struct GNUNET_StartBurstCls);
10054 bcls->vl = vl;
10055 vl->sb_cls = bcls;
10056 if (NULL != vl->dv)
10057 rtt = calculate_rtt (vl->dv);
10058 else
10060 burst_sync.rtt_average = fc->rtt;
10061 bcls->rtt = GNUNET_TIME_relative_ntoh (burst_sync.rtt_average);
10062 burst_sync.sync_ready = fc->sync_ready;
10063
10065 &burst_sync,
10066 &queue_burst,
10067 bcls);
10068 }
10069 if (0 != ntohl (fc->number_of_addresses))
10070 {
10071 unsigned int number_of_addresses = ntohl (fc->number_of_addresses);
10072 const char *tgnas;
10073 unsigned int off = 0;
10074
10075 tgnas = (const char *) &fc[1];
10076
10077 for (int i = 1; i <= number_of_addresses; i++)
10078 {
10079 struct TransportGlobalNattedAddress *tgna;
10080 char *addr;
10081 unsigned int address_length;
10082
10083 tgna = (struct TransportGlobalNattedAddress*) &tgnas[off];
10084 addr = (char *) &tgna[1];
10085 address_length = ntohl (tgna->address_length);
10086 off += sizeof(struct TransportGlobalNattedAddress) + address_length;
10087
10089 "received address %s length %u\n",
10090 addr,
10091 ntohl (tgna->address_length));
10092
10093 GNUNET_NAT_add_global_address (nh, addr, ntohl (tgna->address_length));
10094 }
10095 }
10097 if (st.abs_value_us < vl->last_fc_timestamp.abs_value_us)
10098 {
10100 "FC dropped: Message out of order\n");
10101 /* out of order, drop */
10103 "# FC dropped: message out of order",
10104 1,
10105 GNUNET_NO);
10106 finish_cmc_handling (cmc);
10107 return;
10108 }
10109 seq = ntohl (fc->seq);
10110 if (seq < vl->last_fc_seq)
10111 {
10112 /* Wrap-around/reset of other peer; start all counters from zero */
10114 }
10115 vl->last_fc_seq = seq;
10116 vl->last_fc_timestamp = st;
10120 (int64_t) (os - vl->incoming_fc_window_size_used);
10122 "Received FC from %s, seq %u, new window %llu (loss at %lld)\n",
10123 GNUNET_i2s (&vl->target),
10124 (unsigned int) seq,
10125 (unsigned long long) vl->outbound_fc_window_size,
10126 (long long) vl->incoming_fc_window_size_loss);
10129 UINT32_MAX);
10130 if ((GNUNET_YES == vl->confirmed) && ((wnd < vl->incoming_fc_window_size
10134 != wnd) ||
10135 (0 == random
10137 {
10139 "Consider re-sending our FC message, as clearly the other peer's idea of the window is not up-to-date (%llu vs %llu) or %llu last received differs, or random reply %u\n",
10140 (unsigned long long) wnd,
10141 (unsigned long long) vl->incoming_fc_window_size,
10142 (unsigned long long) vl->last_outbound_window_size_received,
10145 }
10146 if ((wnd == vl->incoming_fc_window_size
10150 (NULL != vl->fc_retransmit_task))
10151 {
10153 "Stopping FC retransmission to %s: peer is current at window %llu\n",
10154 GNUNET_i2s (&vl->target),
10155 (unsigned long long) wnd);
10157 vl->fc_retransmit_task = NULL;
10158 vl->fc_retransmit_count = 0;
10159 }
10161 /* FC window likely increased, check transmission possibilities! */
10163 finish_cmc_handling (cmc);
10164}
static struct GNUNET_SCHEDULER_Task * st
The shutdown task.
static ogg_stream_state os
Ogg stream state.
static void queue_burst(void *cls)
#define FC_NO_CHANGE_REPLY_PROBABILITY
What is the 1:n chance that we send a Flow control response when receiving a flow control message tha...
void GNUNET_is_burst_ready(struct GNUNET_TIME_Relative rtt_average, struct GNUNET_BurstSync *burst_sync, GNUNET_SCHEDULER_TaskCallback task, struct GNUNET_StartBurstCls *task_cls)
Checks if we are ready and starts burst when we and the other peer is ready.
Definition: nat.c:89
void GNUNET_NAT_add_global_address(struct GNUNET_NAT_Handle *nh, char *addr, unsigned int address_length)
Add global address to the list of addresses and notify clients.
Definition: nat_api.c:460
Wrapper struct with the average RTT of message to some peer and if this peer und us is ready to sync.

References GNUNET_TIME_Absolute::abs_value_us, TransportGlobalNattedAddress::address_length, VirtualLink::available_fc_window_size, VirtualLink::burst_addr, calculate_rtt(), check_vl_transmission(), VirtualLink::confirmed, consider_sending_fc(), VirtualLink::core_recv_window, DEFAULT_WINDOW_SIZE, VirtualLink::dv, FC_NO_CHANGE_REPLY_PROBABILITY, VirtualLink::fc_retransmit_count, VirtualLink::fc_retransmit_task, finish_cmc_handling(), GNUNET_break, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_CRYPTO_random_u64(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_is_burst_ready(), GNUNET_log, GNUNET_NAT_add_global_address(), GNUNET_new, GNUNET_NO, GNUNET_ntohll(), GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_max(), GNUNET_TIME_absolute_ntoh(), GNUNET_TIME_relative_ntoh(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_ZERO_ABS, GNUNET_YES, GST_stats, CommunicatorMessageContext::im, TransportFlowControlMessage::inbound_window_size, VirtualLink::incoming_fc_window_size, VirtualLink::incoming_fc_window_size_loss, VirtualLink::incoming_fc_window_size_used, VirtualLink::last_fc_seq, VirtualLink::last_fc_timestamp, VirtualLink::last_outbound_window_size_received, links, lookup_virtual_link(), VirtualLink::message_uuid_ctr, VirtualLink::n, nh, TransportFlowControlMessage::number_of_addresses, os, VirtualLink::outbound_fc_window_size, VirtualLink::outbound_fc_window_size_used, TransportFlowControlMessage::outbound_sent, TransportFlowControlMessage::outbound_window_size, q, queue_burst(), Neighbour::queue_head, RECV_WINDOW_SIZE, GNUNET_StartBurstCls::rtt, TransportFlowControlMessage::rtt, GNUNET_BurstSync::rtt_average, VirtualLink::sb_cls, GNUNET_TRANSPORT_IncomingMessage::sender, TransportFlowControlMessage::sender_time, TransportFlowControlMessage::seq, st, GNUNET_BurstSync::sync_ready, TransportFlowControlMessage::sync_ready, VirtualLink::target, and GNUNET_StartBurstCls::vl.

Here is the call graph for this function:

◆ check_add_queue_message()

static int check_add_queue_message ( void *  cls,
const struct GNUNET_TRANSPORT_AddQueueMessage aqm 
)
static

New queue became available.

Check message.

Parameters
clsthe client
aqmthe send message that was sent

Definition at line 10247 of file gnunet-service-transport.c.

10249{
10250 struct TransportClient *tc = cls;
10251
10252 if (CT_COMMUNICATOR != tc->type)
10253 {
10254 GNUNET_break (0);
10255 return GNUNET_SYSERR;
10256 }
10258 return GNUNET_OK;
10259}

References CT_COMMUNICATOR, GNUNET_break, GNUNET_MQ_check_zero_termination, GNUNET_OK, GNUNET_SYSERR, and tc.

◆ set_pending_message_uuid()

static void set_pending_message_uuid ( struct PendingMessage pm)
static

If necessary, generates the UUID for a pm.

Parameters
pmpending message to generate UUID for.

Definition at line 10268 of file gnunet-service-transport.c.

10269{
10270 if (pm->msg_uuid_set)
10271 return;
10272 pm->msg_uuid.uuid = pm->vl->message_uuid_ctr++;
10273 pm->msg_uuid_set = GNUNET_YES;
10274}

References GNUNET_YES, and pm.

Referenced by extract_box_cb(), fragment_message(), and reliability_box_message().

Here is the caller graph for this function:

◆ prepare_pending_acknowledgement()

static struct PendingAcknowledgement * prepare_pending_acknowledgement ( struct Queue queue,
struct DistanceVectorHop dvh,
struct PendingMessage pm 
)
static

Setup data structure waiting for acknowledgements.

Parameters
queuequeue the pm will be sent over
dvhpath the message will take, may be NULL
pmthe pending message for transmission
Returns
corresponding fresh pending acknowledgement

Definition at line 10286 of file gnunet-service-transport.c.

10289{
10290 struct PendingAcknowledgement *pa;
10291
10292 pa = GNUNET_new (struct PendingAcknowledgement);
10293 pa->queue = queue;
10294 pa->dvh = dvh;
10295 pa->pm = pm;
10296 do
10297 {
10299 &pa->ack_uuid,
10300 sizeof(pa->ack_uuid));
10301 }
10304 &pa->ack_uuid.value,
10305 pa,
10307 GNUNET_CONTAINER_MDLL_insert (queue, queue->pa_head, queue->pa_tail, pa);
10308 GNUNET_CONTAINER_MDLL_insert (pm, pm->pa_head, pm->pa_tail, pa);
10309 if (NULL != dvh)
10312 pa->message_size = pm->bytes_msg;
10314 "Waiting for ACKnowledgment `%s' for <%" PRIu64 ">\n",
10316 pm->logging_uuid);
10317 return pa;
10318}
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multiuuidmap_put(struct GNUNET_CONTAINER_MultiUuidmap *map, const struct GNUNET_Uuid *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.

References PendingAcknowledgement::ack_uuid, PendingAcknowledgement::dvh, GNUNET_CONTAINER_MDLL_insert, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multiuuidmap_put(), GNUNET_CRYPTO_QUALITY_NONCE, GNUNET_CRYPTO_random_block(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_new, GNUNET_TIME_absolute_get(), GNUNET_uuid2s(), GNUNET_YES, PendingAcknowledgement::message_size, DistanceVectorHop::pa_head, DistanceVectorHop::pa_tail, pending_acks, PendingAcknowledgement::pm, pm, queue(), PendingAcknowledgement::queue, PendingAcknowledgement::transmission_time, and AcknowledgementUUIDP::value.

Referenced by fragment_message(), and reliability_box_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ fragment_message()

static struct PendingMessage * fragment_message ( struct Queue queue,
struct DistanceVectorHop dvh,
struct PendingMessage pm 
)
static

Fragment the given pm to the given mtu.

Adds additional fragments to the neighbour as well. If the mtu is too small, generates and error for the pm and returns NULL.

Parameters
queuewhich queue to fragment for
dvhpath the message will take, or NULL
pmpending message to fragment for transmission
Returns
new message to transmit

Definition at line 10333 of file gnunet-service-transport.c.

10336{
10337 struct PendingAcknowledgement *pa;
10338 struct PendingMessage *ff;
10339 uint16_t mtu;
10340 uint16_t msize;
10341
10342 mtu = (UINT16_MAX == queue->mtu)
10343 ? UINT16_MAX - sizeof(struct GNUNET_TRANSPORT_SendMessageTo)
10344 : queue->mtu;
10346 "Fragmenting message <%" PRIu64
10347 "> with size %u to %s for MTU %u\n",
10348 pm->logging_uuid,
10349 pm->bytes_msg,
10350 GNUNET_i2s (&pm->vl->target),
10351 (unsigned int) mtu);
10354 "Fragmenting message %" PRIu64 " <%" PRIu64
10355 "> with size %u to %s for MTU %u\n",
10356 pm->msg_uuid.uuid,
10357 pm->logging_uuid,
10358 pm->bytes_msg,
10359 GNUNET_i2s (&pm->vl->target),
10360 (unsigned int) mtu);
10361
10362 /* This invariant is established in #handle_add_queue_message() */
10363 GNUNET_assert (mtu > sizeof(struct TransportFragmentBoxMessage));
10364
10365 /* select fragment for transmission, descending the tree if it has
10366 been expanded until we are at a leaf or at a fragment that is small
10367 enough
10368 */
10369 ff = pm;
10370 msize = ff->bytes_msg;
10371
10372 while (((ff->bytes_msg > mtu) || (pm == ff)) &&
10373 (ff->frag_off == msize) && (NULL != ff->head_frag))
10374 {
10375 ff = ff->head_frag; /* descent into fragmented fragments */
10376 msize = ff->bytes_msg - sizeof(struct TransportFragmentBoxMessage);
10377 }
10378
10379 if (((ff->bytes_msg > mtu) || (pm == ff)) && (ff->frag_off < msize))
10380 {
10381 /* Did not yet calculate all fragments, calculate next fragment */
10382 struct PendingMessage *frag;
10383 struct TransportFragmentBoxMessage tfb;
10384 const char *orig;
10385 char *msg;
10386 uint16_t fragmax;
10387 uint16_t fragsize;
10388 uint16_t msize_ff;
10389 uint16_t xoff = 0;
10390 pm->frag_count++;
10391
10392 orig = (const char *) &ff[1];
10393 msize_ff = ff->bytes_msg;
10394 if (pm != ff)
10395 {
10396 const struct TransportFragmentBoxMessage *tfbo;
10397
10398 tfbo = (const struct TransportFragmentBoxMessage *) orig;
10399 orig += sizeof(struct TransportFragmentBoxMessage);
10400 msize_ff -= sizeof(struct TransportFragmentBoxMessage);
10401 xoff = ntohs (tfbo->frag_off);
10402 }
10403 fragmax = mtu - sizeof(struct TransportFragmentBoxMessage);
10404 fragsize = GNUNET_MIN (msize_ff - ff->frag_off, fragmax);
10405 frag =
10406 GNUNET_malloc (sizeof(struct PendingMessage)
10407 + sizeof(struct TransportFragmentBoxMessage) + fragsize);
10409 "3 created pm %p from pm %p storing vl %p from pm %p\n",
10410 frag,
10411 ff,
10412 pm->vl,
10413 pm);
10415 frag->vl = pm->vl;
10416 frag->frag_parent = ff;
10417 frag->timeout = pm->timeout;
10418 frag->bytes_msg = sizeof(struct TransportFragmentBoxMessage) + fragsize;
10419 frag->pmt = PMT_FRAGMENT_BOX;
10420 msg = (char *) &frag[1];
10421 tfb.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_FRAGMENT);
10422 tfb.header.size =
10423 htons (sizeof(struct TransportFragmentBoxMessage) + fragsize);
10424 pa = prepare_pending_acknowledgement (queue, dvh, frag);
10425 tfb.ack_uuid = pa->ack_uuid;
10426 tfb.msg_uuid = pm->msg_uuid;
10427 tfb.frag_off = htons (ff->frag_off + xoff);
10428 tfb.msg_size = htons (pm->bytes_msg);
10429 memcpy (msg, &tfb, sizeof(tfb));
10430 memcpy (&msg[sizeof(tfb)], &orig[ff->frag_off], fragsize);
10432 ff->tail_frag, frag);
10433 ff->frag_off += fragsize;
10434 ff = frag;
10435 }
10436
10437 /* Move head to the tail and return it */
10441 ff);
10445 ff);
10446
10447 return ff;
10448}
static struct PendingAcknowledgement * prepare_pending_acknowledgement(struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
Setup data structure waiting for acknowledgements.
static void set_pending_message_uuid(struct PendingMessage *pm)
If necessary, generates the UUID for a pm.
#define GNUNET_CONTAINER_MDLL_insert_tail(mdll, head, tail, element)
Insert an element at the tail of a MDLL.
uint64_t logging_uuid
UUID we use to identify this message in our logs.
struct GNUNET_TIME_Absolute timeout
At what time should we give up on the transmission (and no longer retry)?

References TransportFragmentBoxMessage::ack_uuid, PendingAcknowledgement::ack_uuid, PendingMessage::bytes_msg, TransportFragmentBoxMessage::frag_off, PendingMessage::frag_off, PendingMessage::frag_parent, GNUNET_assert, GNUNET_CONTAINER_MDLL_insert, GNUNET_CONTAINER_MDLL_insert_tail, GNUNET_CONTAINER_MDLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_MESSAGE_TYPE_TRANSPORT_FRAGMENT, GNUNET_MIN, PendingMessage::head_frag, TransportFragmentBoxMessage::header, PendingMessage::logging_uuid, logging_uuid_gen, msg, TransportFragmentBoxMessage::msg_size, TransportFragmentBoxMessage::msg_uuid, pm, PendingMessage::pmt, PMT_FRAGMENT_BOX, prepare_pending_acknowledgement(), queue(), set_pending_message_uuid(), GNUNET_MessageHeader::size, PendingMessage::tail_frag, PendingMessage::timeout, GNUNET_MessageHeader::type, and PendingMessage::vl.

Referenced by transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reliability_box_message()

static struct PendingMessage * reliability_box_message ( struct Queue queue,
struct DistanceVectorHop dvh,
struct PendingMessage pm 
)
static

Reliability-box the given pm.

On error (can there be any), NULL may be returned, otherwise the "replacement" for pm (which should then be added to the respective neighbour's queue instead of pm). If the pm is already fragmented or reliability boxed, or itself an ACK, this function simply returns pm.

Parameters
queuewhich queue to prepare transmission for
dvhpath the message will take, or NULL
pmpending message to box for transmission over unreliabile queue
Returns
new message to transmit

Definition at line 10464 of file gnunet-service-transport.c.

10467{
10469 struct PendingAcknowledgement *pa;
10470 struct PendingMessage *bpm;
10471 char *msg;
10472
10473 if ((PMT_CORE != pm->pmt) && (PMT_DV_BOX != pm->pmt))
10474 return pm; /* already fragmented or reliability boxed, or control message:
10475 do nothing */
10476 if (NULL != pm->bpm)
10477 return pm->bpm; /* already computed earlier: do nothing */
10478 // TODO I guess we do not need this assertion. We might have a DLL with
10479 // fragments, because the MTU changed, and we do not need to fragment anymore.
10480 // But we should keep the fragments until message was completed, because
10481 // the MTU might change again.
10482 // GNUNET_assert (NULL == pm->head_frag);
10483 if (pm->bytes_msg + sizeof(rbox) > UINT16_MAX)
10484 {
10485 /* failed hard */
10486 GNUNET_break (0);
10488 return NULL;
10489 }
10490
10492
10493 bpm = GNUNET_malloc (sizeof(struct PendingMessage) + sizeof(rbox)
10494 + pm->bytes_msg);
10496 "4 created pm %p storing vl %p from pm %p\n",
10497 bpm,
10498 pm->vl,
10499 pm);
10501 bpm->vl = pm->vl;
10502 bpm->frag_parent = pm;
10503 // Why was this needed?
10504 // GNUNET_CONTAINER_MDLL_insert (frag, pm->head_frag, pm->tail_frag, bpm);
10505 bpm->timeout = pm->timeout;
10507 bpm->bytes_msg = pm->bytes_msg + sizeof(rbox);
10509 rbox.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX);
10510 rbox.header.size = htons (sizeof(rbox) + pm->bytes_msg);
10511 rbox.ack_countdown = htonl (0); // FIXME: implement ACK countdown support
10512
10513 rbox.ack_uuid = pa->ack_uuid;
10514 msg = (char *) &bpm[1];
10515 memcpy (msg, &rbox, sizeof(rbox));
10516 memcpy (&msg[sizeof(rbox)], &pm[1], pm->bytes_msg);
10517 pm->bpm = bpm;
10519 "Preparing reliability box for message <%" PRIu64
10520 "> of size %d (%d) to %s on queue %s\n",
10521 pm->logging_uuid,
10522 pm->bytes_msg,
10523 ntohs (((const struct GNUNET_MessageHeader *) &pm[1])->size),
10524 GNUNET_i2s (&pm->vl->target),
10525 queue->address);
10526 return bpm;
10527}

References TransportReliabilityBoxMessage::ack_countdown, TransportReliabilityBoxMessage::ack_uuid, PendingAcknowledgement::ack_uuid, PendingMessage::bpm, PendingMessage::bytes_msg, client_send_response(), PendingMessage::frag_parent, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_MESSAGE_TYPE_TRANSPORT_RELIABILITY_BOX, TransportReliabilityBoxMessage::header, PendingMessage::logging_uuid, logging_uuid_gen, msg, pm, PendingMessage::pmt, PMT_CORE, PMT_DV_BOX, PMT_RELIABILITY_BOX, prepare_pending_acknowledgement(), queue(), set_pending_message_uuid(), GNUNET_MessageHeader::size, size, PendingMessage::timeout, GNUNET_MessageHeader::type, and PendingMessage::vl.

Referenced by transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reorder_root_pm()

static void reorder_root_pm ( struct PendingMessage pm,
struct GNUNET_TIME_Absolute  next_attempt 
)
static

Definition at line 10531 of file gnunet-service-transport.c.

10533{
10534 struct VirtualLink *vl = pm->vl;
10535 struct PendingMessage *pos;
10536
10537 /* re-insert sort in neighbour list */
10541 pm);
10542 pos = vl->pending_msg_tail;
10543 while ((NULL != pos) &&
10545 pos = pos->prev_vl;
10549 pos,
10550 pm);
10551}
#define GNUNET_CONTAINER_MDLL_insert_after(mdll, head, tail, other, element)
Insert an element into a MDLL after the given other element.
struct PendingMessage * prev_vl
Kept in a MDLL of messages for this vl.
struct GNUNET_TIME_Absolute next_attempt
What is the earliest time for us to retry transmission of this message?

References GNUNET_TIME_Absolute::abs_value_us, GNUNET_CONTAINER_MDLL_insert_after, GNUNET_CONTAINER_MDLL_remove, PendingMessage::next_attempt, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, pm, PendingMessage::prev_vl, and PendingMessage::vl.

Referenced by update_pm_next_attempt().

Here is the caller graph for this function:

◆ check_next_attempt_tree()

static unsigned int check_next_attempt_tree ( struct PendingMessage pm,
struct PendingMessage root 
)
static

Definition at line 10555 of file gnunet-service-transport.c.

10556{
10557 struct PendingMessage *pos;
10559
10560 pos = pm->head_frag;
10561 while (NULL != pos)
10562 {
10563 if (pos->frags_in_flight_round == pm->frags_in_flight_round ||
10564 GNUNET_NO == check_next_attempt_tree (pos, root))
10566 else
10567 {
10569 break;
10570 }
10571 pos = pos->next_frag;
10572 }
10573
10574 return frags_in_flight;
10575}
static unsigned int check_next_attempt_tree(struct PendingMessage *pm, struct PendingMessage *root)
GNUNET_GenericReturnValue
Named constants for return values.
uint32_t frags_in_flight_round
The round we are (re)-sending fragments.
uint32_t frags_in_flight
Are we sending fragments at the moment?
struct PendingMessage * next_frag
Kept in a MDLL of messages from this cpm (if pmt is #PMT_FRAGMENT_BOx)

References check_next_attempt_tree(), PendingMessage::frags_in_flight, PendingMessage::frags_in_flight_round, GNUNET_NO, GNUNET_YES, PendingMessage::next_frag, and pm.

Referenced by check_next_attempt_tree(), and update_pm_next_attempt().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ harmonize_flight_round()

static void harmonize_flight_round ( struct PendingMessage pm)
static

Definition at line 10579 of file gnunet-service-transport.c.

10580{
10581 struct PendingMessage *pos;
10582
10583 pos = pm->head_frag;
10584 while (NULL != pos)
10585 {
10586 pos->frags_in_flight_round = pm->frags_in_flight_round;
10588 pos = pos->next_frag;
10589 }
10590}
static void harmonize_flight_round(struct PendingMessage *pm)

References PendingMessage::frags_in_flight_round, harmonize_flight_round(), PendingMessage::next_frag, and pm.

Referenced by harmonize_flight_round(), and update_pm_next_attempt().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_pm_next_attempt()

static void update_pm_next_attempt ( struct PendingMessage pm,
struct GNUNET_TIME_Absolute  next_attempt 
)
static

Change the value of the next_attempt field of pm to next_attempt and re-order pm in the transmission list as required by the new timestamp.

Parameters
pma pending message to update
next_attempttimestamp to use

Definition at line 10602 of file gnunet-service-transport.c.

10604{
10605 if (NULL == pm->frag_parent)
10606 {
10607 pm->next_attempt = next_attempt;
10609 "Next attempt for message <%" PRIu64 "> set to %" PRIu64 "\n",
10610 pm->logging_uuid,
10611 next_attempt.abs_value_us);
10612 reorder_root_pm (pm, next_attempt);
10613 }
10614 else if ((PMT_RELIABILITY_BOX == pm->pmt) || (PMT_DV_BOX == pm->pmt))// || (PMT_FRAGMENT_BOX == pm->pmt))
10615 {
10616 struct PendingMessage *root = pm->frag_parent;
10617
10618 while (NULL != root->frag_parent)
10619 root = root->frag_parent;
10621 "Next attempt for root message <%" PRIu64 "> set to %s\n",
10622 root->logging_uuid,
10624 root->next_attempt = next_attempt;
10626 }
10627 else
10628 {
10629 struct PendingMessage *root = pm->frag_parent;
10630
10631 while (NULL != root->frag_parent && PMT_DV_BOX != root->pmt)
10632 root = root->frag_parent;
10633
10635 "frag_count next attempt %u\n",
10636 root->frag_count);
10637
10638 if (GNUNET_NO == root->frags_in_flight)
10639 {
10640 root->next_attempt = next_attempt;
10642 root->frags_in_flight_round++;
10644 "Next attempt for fragmented message <%" PRIu64 "> (<%" PRIu64
10645 ">)set to %" PRIu64 "\n",
10646 pm->logging_uuid,
10647 root->logging_uuid,
10649 }
10650
10651 pm->next_attempt = root->next_attempt;
10652 pm->frags_in_flight_round = root->frags_in_flight_round;
10654
10655 if (root->bytes_msg == root->frag_off)
10656 root->frags_in_flight = check_next_attempt_tree (root, root);
10657 else
10659
10660 if (GNUNET_NO == root->frags_in_flight)
10661 {
10663 "We have no fragments in flight for message %" PRIu64
10664 ", reorder root! Next attempt is %" PRIu64 "\n",
10665 root->logging_uuid,
10667 if (PMT_DV_BOX == root->pmt)
10668 root = root->frag_parent;
10669 reorder_root_pm (root, root->next_attempt);
10670 // root->next_attempt = GNUNET_TIME_UNIT_ZERO_ABS;
10671 }
10672 else
10673 {
10674 double factor = ((double) root->frag_count - 1)
10675 / (double) root->frag_count;
10676 struct GNUNET_TIME_Relative s1;
10677 struct GNUNET_TIME_Relative s2;
10678 struct GNUNET_TIME_Relative plus_mean =
10681 next_attempt);
10682
10684 "frag_count %u after factor\n",
10685 root->frag_count);
10687 factor);
10688 s2 = GNUNET_TIME_relative_divide (plus,
10689 root->frag_count);
10690 plus_mean = GNUNET_TIME_relative_add (s1, s2);
10693 "We have fragments in flight for message %" PRIu64
10694 ", do not reorder root! Actual next attempt %" PRIu64 "\n",
10695 root->logging_uuid,
10697 }
10698 }
10699}
static void reorder_root_pm(struct PendingMessage *pm, struct GNUNET_TIME_Absolute next_attempt)
struct GNUNET_TIME_Relative GNUNET_TIME_relative_multiply_double(struct GNUNET_TIME_Relative rel, double factor)
Multiply relative time by a given factor.
Definition: time.c:506

References GNUNET_TIME_Absolute::abs_value_us, PendingMessage::bytes_msg, check_next_attempt_tree(), PendingMessage::frag_count, PendingMessage::frag_off, PendingMessage::frag_parent, PendingMessage::frags_in_flight, PendingMessage::frags_in_flight_round, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_STRINGS_absolute_time_to_string(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_relative_add(), GNUNET_TIME_relative_divide(), GNUNET_TIME_relative_multiply_double(), GNUNET_TIME_relative_to_absolute(), GNUNET_YES, harmonize_flight_round(), PendingMessage::logging_uuid, PendingMessage::next_attempt, pm, PendingMessage::pmt, PMT_DV_BOX, PMT_RELIABILITY_BOX, and reorder_root_pm().

Referenced by transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ select_best_pending_from_link()

static void select_best_pending_from_link ( struct PendingMessageScoreContext sc,
struct Queue queue,
struct VirtualLink vl,
struct DistanceVectorHop dvh,
size_t  overhead 
)
static

Select the best pending message from vl for transmission via queue.

Parameters
[in,out]scbest message so far (NULL for none), plus scoring data
queuethe queue that will be used for transmission
vlthe virtual link providing the messages
dvhpath we are currently considering, or NULL for none
overheadnumber of bytes of overhead to be expected from DV encapsulation (0 for without DV)

Definition at line 10766 of file gnunet-service-transport.c.

10771{
10772 struct GNUNET_TIME_Absolute now;
10773
10774 now = GNUNET_TIME_absolute_get ();
10775 sc->to_early = GNUNET_NO;
10776 sc->frags_in_flight = GNUNET_NO;
10777 for (struct PendingMessage *pos = vl->pending_msg_head; NULL != pos;
10778 pos = pos->next_vl)
10779 {
10780 size_t real_overhead = overhead;
10781 int frag;
10782 int relb;
10783
10784 if ((NULL != dvh) && (PMT_DV_BOX == pos->pmt))
10785 {
10787 "DV messages must not be DV-routed to next hop!\n");
10788 continue; /* DV messages must not be DV-routed to next hop! */
10789 }
10790 if (pos->next_attempt.abs_value_us > now.abs_value_us)
10791 {
10792 if (GNUNET_YES == pos->frags_in_flight)
10793 {
10794 sc->frags_in_flight = GNUNET_YES;
10796 "Fragments in flight for message %" PRIu64 "\n",
10797 pos->logging_uuid);
10798 }
10799 else
10800 {
10802 "Maybe too early, because message are sorted by next_attempt, if there are no fragments in flight.Checked message %"
10803 PRIu64 "\n",
10804 pos->logging_uuid);
10805 sc->to_early = GNUNET_YES;
10806 sc->to_early_retry_delay = GNUNET_TIME_absolute_get_remaining (
10807 pos->next_attempt);
10808 continue;
10809 }
10810 // break; /* too early for all messages, they are sorted by next_attempt */
10811 }
10812 if (NULL != pos->qe)
10813 {
10815 "not eligible\n");
10816 continue; /* not eligible */
10817 }
10818 sc->consideration_counter++;
10819 /* determine if we have to fragment, if so add fragmentation
10820 overhead! */
10822 "check %" PRIu64 " for sc->best\n",
10823 pos->logging_uuid);
10824 frag = GNUNET_NO;
10825 if (((0 != queue->mtu) &&
10826 (pos->bytes_msg + real_overhead > queue->mtu)) ||
10827 (pos->bytes_msg > UINT16_MAX - sizeof(struct
10829 ||
10830 (NULL != pos->head_frag /* fragments already exist, should
10831 respect that even if MTU is UINT16_MAX for
10832 this queue */))
10833 {
10835 "fragment msg with size %u, realoverhead is %lu\n",
10836 pos->bytes_msg,
10837 real_overhead);
10838 frag = GNUNET_YES;
10839 if (GNUNET_TRANSPORT_CC_RELIABLE == queue->tc->details.communicator.cc)
10840 {
10841 /* FIXME-FRAG-REL-UUID: we could use an optimized, shorter fragmentation
10842 header without the ACK UUID when using a *reliable* channel! */
10843 }
10844 real_overhead = overhead + sizeof(struct TransportFragmentBoxMessage);
10845 }
10846 /* determine if we have to reliability-box, if so add reliability box
10847 overhead */
10848 relb = GNUNET_NO;
10849 if ((GNUNET_NO == frag) &&
10850 (0 == (pos->prefs & GNUNET_MQ_PREF_UNRELIABLE)) &&
10851 (GNUNET_TRANSPORT_CC_RELIABLE != queue->tc->details.communicator.cc))
10852 {
10853 real_overhead += sizeof(struct TransportReliabilityBoxMessage);
10854
10855 if ((0 != queue->mtu) && (pos->bytes_msg + real_overhead > queue->mtu))
10856 {
10857 frag = GNUNET_YES;
10858 real_overhead = overhead + sizeof(struct TransportFragmentBoxMessage);
10859 }
10860 else
10861 {
10862 relb = GNUNET_YES;
10863 }
10865 "Create reliability box of msg with size %u, realoverhead is %lu %u %u %u\n",
10866 pos->bytes_msg,
10867 real_overhead,
10868 queue->mtu,
10869 frag,
10870 relb);
10871 }
10872
10873 /* Finally, compare to existing 'best' in sc to see if this 'pos' pending
10874 message would beat it! */
10875 if (GNUNET_NO == sc->frags_in_flight && NULL != sc->best)
10876 {
10877 /* CHECK if pos fits queue BETTER (=smaller) than pm, if not: continue;
10878 OPTIMIZE-ME: This is a heuristic, which so far has NOT been
10879 experimentally validated. There may be some huge potential for
10880 improvement here. Also, we right now only compare how well the
10881 given message fits _this_ queue, and do not consider how well other
10882 queues might suit the message. Taking other queues into consideration
10883 may further improve the result, but could also be expensive
10884 in terms of CPU time. */
10885 long long sc_score = sc->frag * 40 + sc->relb * 20 + sc->real_overhead;
10886 long long pm_score = frag * 40 + relb * 20 + real_overhead;
10887 long long time_delta =
10888 (sc->best->next_attempt.abs_value_us - pos->next_attempt.abs_value_us)
10889 / 1000LL;
10890
10891 /* "time_delta" considers which message has been 'ready' for transmission
10892 for longer, if a message has a preference for low latency, increase
10893 the weight of the time_delta by 10x if it is favorable for that message */
10894 if ((0 != (pos->prefs & GNUNET_MQ_PREF_LOW_LATENCY)) &&
10895 (0 != (sc->best->prefs & GNUNET_MQ_PREF_LOW_LATENCY)))
10896 time_delta *= 10; /* increase weight (always, both are low latency) */
10897 else if ((0 != (pos->prefs & GNUNET_MQ_PREF_LOW_LATENCY)) &&
10898 (time_delta > 0))
10899 time_delta *= 10; /* increase weight, favors 'pos', which is low latency */
10900 else if ((0 != (sc->best->prefs & GNUNET_MQ_PREF_LOW_LATENCY)) &&
10901 (time_delta < 0))
10902 time_delta *= 10; /* increase weight, favors 'sc->best', which is low latency */
10903 if (0 != queue->mtu)
10904 {
10905 /* Grant bonus if we are below MTU, larger bonus the closer we will
10906 be to the MTU */
10907 if (queue->mtu > sc->real_overhead + sc->best->bytes_msg)
10908 sc_score -= queue->mtu - (sc->real_overhead + sc->best->bytes_msg);
10909 if (queue->mtu > real_overhead + pos->bytes_msg)
10910 pm_score -= queue->mtu - (real_overhead + pos->bytes_msg);
10911 }
10912 if (sc_score + time_delta > pm_score)
10913 {
10915 "sc_score of %" PRIu64 " larger, keep sc->best %" PRIu64
10916 "\n",
10917 pos->logging_uuid,
10918 sc->best->logging_uuid);
10919 continue; /* sc_score larger, keep sc->best */
10920 }
10921 }
10922 sc->best = pos;
10923 sc->dvh = dvh;
10924 sc->frag = frag;
10925 sc->relb = relb;
10926 sc->real_overhead = real_overhead;
10927 }
10928}
@ GNUNET_MQ_PREF_UNRELIABLE
Flag to indicate that unreliable delivery is acceptable.
@ GNUNET_MQ_PREF_LOW_LATENCY
Flag to indicate that low latency is important.
struct PendingMessage * next_vl
Kept in a MDLL of messages for this vl.

References GNUNET_TIME_Absolute::abs_value_us, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_MQ_PREF_LOW_LATENCY, GNUNET_MQ_PREF_UNRELIABLE, GNUNET_NO, GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TRANSPORT_CC_RELIABLE, GNUNET_YES, PendingMessage::next_vl, VirtualLink::pending_msg_head, PMT_DV_BOX, queue(), and sc.

Referenced by transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ extract_box_cb()

static void extract_box_cb ( void *  cls,
struct Neighbour next_hop,
const struct GNUNET_MessageHeader hdr,
enum RouteMessageOptions  options 
)
static

Function to call to further operate on the now DV encapsulated message hdr, forwarding it via next_hop under respect of options.

Parameters
clsa struct PendingMessageScoreContext
next_hopnext hop of the DV path
hdrencapsulated message, technically a struct TransportDVBoxMessage
optionsoptions of the original message

Definition at line 10942 of file gnunet-service-transport.c.

10946{
10947 struct PendingMessageScoreContext *sc = cls;
10948 struct PendingMessage *pm = sc->best;
10949 struct PendingMessage *bpm;
10950 uint16_t bsize = ntohs (hdr->size);
10951
10952 GNUNET_assert (NULL == pm->bpm);
10953 bpm = GNUNET_malloc (sizeof(struct PendingMessage) + bsize);
10955 "5 created pm %p storing vl %p from pm %p\n",
10956 bpm,
10957 pm->vl,
10958 pm);
10960 bpm->pmt = PMT_DV_BOX;
10961 bpm->vl = pm->vl;
10962 bpm->timeout = pm->timeout;
10963 bpm->bytes_msg = bsize;
10964 bpm->frag_parent = pm;
10967 "Creating DV Box %" PRIu64 " for original message %" PRIu64
10968 " (next hop is %s)\n",
10970 pm->logging_uuid,
10971 GNUNET_i2s (&next_hop->pid));
10972 memcpy (&bpm[1], hdr, bsize);
10973 pm->bpm = bpm;
10974}

References PendingMessage::bpm, bsize, PendingMessage::bytes_msg, PendingMessage::frag_parent, GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, PendingMessage::logging_uuid, logging_uuid_gen, Neighbour::pid, pm, PendingMessage::pmt, PMT_DV_BOX, sc, set_pending_message_uuid(), GNUNET_MessageHeader::size, PendingMessage::timeout, and PendingMessage::vl.

Referenced by transmit_on_queue().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_del_queue_message()

static void handle_del_queue_message ( void *  cls,
const struct GNUNET_TRANSPORT_DelQueueMessage dqm 
)
static

Queue to a peer went down.

Process the request.

Parameters
clsthe client
dqmthe send message that was sent

Definition at line 11249 of file gnunet-service-transport.c.

11251{
11252 struct TransportClient *tc = cls;
11253
11254 if (CT_COMMUNICATOR != tc->type)
11255 {
11256 GNUNET_break (0);
11258 return;
11259 }
11260 for (struct Queue *queue = tc->details.communicator.queue_head; NULL != queue;
11261 queue = queue->next_client)
11262 {
11263 struct Neighbour *neighbour = queue->neighbour;
11264
11265 if ((ntohl (dqm->qid) != queue->qid) ||
11266 (0 != GNUNET_memcmp (&dqm->receiver, &neighbour->pid)))
11267 continue;
11269 "Dropped queue %s to peer %s\n",
11270 queue->address,
11271 GNUNET_i2s (&neighbour->pid));
11272 free_queue (queue);
11274 return;
11275 }
11276 GNUNET_break (0);
11278}
struct GNUNET_PeerIdentity receiver
Receiver that can be addressed via the queue.
Definition: transport.h:513
uint32_t qid
Address identifier.
Definition: transport.h:508

References CT_COMMUNICATOR, free_queue(), GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), Neighbour::pid, GNUNET_TRANSPORT_DelQueueMessage::qid, queue(), GNUNET_TRANSPORT_DelQueueMessage::receiver, and tc.

Here is the call graph for this function:

◆ handle_send_message_ack()

static void handle_send_message_ack ( void *  cls,
const struct GNUNET_TRANSPORT_SendMessageToAck sma 
)
static

Message was transmitted.

Process the request.

Parameters
clsthe client
smathe send message that was sent

Definition at line 11379 of file gnunet-service-transport.c.

11381{
11382 struct TransportClient *tc = cls;
11383 struct QueueEntry *qe;
11384
11385 if (CT_COMMUNICATOR != tc->type)
11386 {
11387 GNUNET_break (0);
11389 return;
11390 }
11391
11392 /* find our queue entry matching the ACK */
11393 qe = NULL;
11395 "Looking for queue for PID %s\n",
11396 GNUNET_i2s (&sma->receiver));
11397 for (struct Queue *queue = tc->details.communicator.queue_head; NULL != queue;
11398 queue = queue->next_client)
11399 {
11400 if (0 != GNUNET_memcmp (&queue->neighbour->pid, &sma->receiver))
11401 continue;
11403 "Found PID %s\n",
11404 GNUNET_i2s (&queue->neighbour->pid));
11405
11406
11407 for (struct QueueEntry *qep = queue->queue_head; NULL != qep;
11408 qep = qep->next)
11409 {
11410 if (qep->mid != GNUNET_ntohll (sma->mid) || queue->qid != ntohl (
11411 sma->qid))
11412 continue;
11414 "QueueEntry MID: %" PRIu64 " on queue QID: %u, Ack MID: %"
11415 PRIu64 " Ack QID %u\n",
11416 qep->mid,
11417 queue->qid,
11418 GNUNET_ntohll (sma->mid),
11419 ntohl (sma->qid));
11420 qe = qep;
11421 if ((NULL != qe->pm) && (qe->pm->qe != qe))
11423 "For pending message %" PRIu64 " we had retransmissions.\n",
11424 qe->pm->logging_uuid);
11425 break;
11426 }
11427 }
11428 if (NULL == qe)
11429 {
11431 "No QueueEntry found for Ack MID %" PRIu64 " QID: %u\n",
11432 GNUNET_ntohll (sma->mid),
11433 ntohl (sma->qid));
11434 // TODO I guess this can happen, if the Ack from the peer comes before the Ack from the queue.
11435 // Update: Maybe QueueEntry was accidentally freed during freeing PendingMessage.
11436 /* this should never happen */
11437 // GNUNET_break (0);
11438 // GNUNET_SERVICE_client_drop (tc->client);
11440 return;
11441 }
11444}
uint64_t mid
Message ID of the original message.
Definition: transport.h:606
uint32_t qid
Queue ID for the queue which was used to send the message.
Definition: transport.h:611
struct GNUNET_PeerIdentity receiver
Receiver identifier.
Definition: transport.h:616

References CT_COMMUNICATOR, free_queue_entry(), GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_ntohll(), GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_TRANSPORT_SendMessageToAck::mid, qe, GNUNET_TRANSPORT_SendMessageToAck::qid, queue(), GNUNET_TRANSPORT_SendMessageToAck::receiver, and tc.

Here is the call graph for this function:

◆ handle_burst_finished()

static void handle_burst_finished ( )
static

The burst finished.

Parameters
clsthe client

Definition at line 11453 of file gnunet-service-transport.c.

11454{
11456}

References burst_running, and GNUNET_NO.

◆ notify_client_queues()

static int notify_client_queues ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Iterator telling new MONITOR client about all existing queues to peers.

Parameters
clsthe new struct TransportClient
pida connected peer
valuethe struct Neighbour with more information
Returns
GNUNET_OK (continue to iterate)

Definition at line 11469 of file gnunet-service-transport.c.

11472{
11473 struct TransportClient *tc = cls;
11474 struct Neighbour *neighbour = value;
11475
11476 GNUNET_assert (CT_MONITOR == tc->type);
11477 for (struct Queue *q = neighbour->queue_head; NULL != q;
11478 q = q->next_neighbour)
11479 {
11480 struct MonitorEvent me = { .rtt = q->pd.aged_rtt,
11481 .cs = q->cs,
11482 .num_msg_pending = q->num_msg_pending,
11483 .num_bytes_pending = q->num_bytes_pending };
11484
11485 notify_monitor (tc, pid, q->address, q->nt, &me);
11486 }
11487 return GNUNET_OK;
11488}

References CT_MONITOR, GNUNET_assert, GNUNET_OK, me, notify_monitor(), pid, q, Neighbour::queue_head, tc, and value.

Referenced by handle_monitor_start().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_monitor_start()

static void handle_monitor_start ( void *  cls,
const struct GNUNET_TRANSPORT_MonitorStart start 
)
static

Initialize a monitor client.

Parameters
clsthe client
startthe start message that was sent

Definition at line 11498 of file gnunet-service-transport.c.

11500{
11501 struct TransportClient *tc = cls;
11502
11503 if (CT_NONE != tc->type)
11504 {
11505 GNUNET_break (0);
11507 return;
11508 }
11509 tc->type = CT_MONITOR;
11510 tc->details.monitor.peer = start->peer;
11511 tc->details.monitor.one_shot = ntohl (start->one_shot);
11515}
static int notify_client_queues(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Iterator telling new MONITOR client about all existing queues to peers.
void GNUNET_SERVICE_client_mark_monitor(struct GNUNET_SERVICE_Client *c)
Set the 'monitor' flag on this client.
Definition: service.c:2483

References CT_MONITOR, CT_NONE, GNUNET_break, GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_SERVICE_client_mark_monitor(), neighbours, notify_client_queues(), start, and tc.

Here is the call graph for this function:

◆ lookup_communicator()

static struct TransportClient * lookup_communicator ( const char *  prefix)
static

Find transport client providing communication service for the protocol prefix.

Parameters
prefixcommunicator name
Returns
NULL if no such transport client is available

Definition at line 11526 of file gnunet-service-transport.c.

11527{
11528 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
11529 {
11530 if (CT_COMMUNICATOR != tc->type)
11531 continue;
11532 if (0 == strcmp (prefix, tc->details.communicator.address_prefix))
11533 return tc;
11534 }
11535 GNUNET_log (
11537 "Someone suggested use of communicator for `%s', but we do not have such a communicator!\n",
11538 prefix);
11539 return NULL;
11540}

References clients_head, CT_COMMUNICATOR, GNUNET_ERROR_TYPE_WARNING, GNUNET_log, prefix, and tc.

Referenced by suggest_to_connect().

Here is the caller graph for this function:

◆ check_connection_quality()

static int check_connection_quality ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Check whether any queue to the given neighbour is of a good "quality" and if so, increment the counter.

Also counts the total number of queues, and returns the k-th queue found.

Parameters
clsa struct QueueQualityContext * with counters
pidpeer this is about
valuea struct Neighbour
Returns
GNUNET_OK (continue to iterate)

Definition at line 11752 of file gnunet-service-transport.c.

11755{
11756 struct QueueQualityContext *ctx = cls;
11757 struct Neighbour *n = value;
11758 int do_inc;
11759
11760 (void) pid;
11761 do_inc = GNUNET_NO;
11762 for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour)
11763 {
11764 ctx->num_queues++;
11765 if (0 == ctx->k--)
11766 ctx->q = q;
11767 /* FIXME-CONQ-STATISTICS: in the future, add reliability / goodput
11768 statistics and consider those as well here? */
11769 if (q->pd.aged_rtt.rel_value_us < DV_QUALITY_RTT_THRESHOLD.rel_value_us)
11770 do_inc = GNUNET_YES;
11771 }
11772 if (GNUNET_YES == do_inc)
11773 ctx->quality_count++;
11774 return GNUNET_OK;
11775}
#define DV_QUALITY_RTT_THRESHOLD
We only consider queues as "quality" connections when suppressing the generation of DV initiation mes...
Closure for check_connection_quality.

References ctx, DV_QUALITY_RTT_THRESHOLD, GNUNET_NO, GNUNET_OK, GNUNET_YES, pid, q, Neighbour::queue_head, and value.

Referenced by start_dv_learn().

Here is the caller graph for this function:

◆ start_dv_learn()

static void start_dv_learn ( void *  cls)
static

Task run when we CONSIDER initiating a DV learn process.

We first check that sending out a message is even possible (queues exist), then that it is desirable (if not, reschedule the task for later), and finally we may then begin the job. If there are too many entries in the dvlearn_map, we purge the oldest entry using lle_tail.

Parameters
clsNULL

Definition at line 11790 of file gnunet-service-transport.c.

11791{
11792 struct LearnLaunchEntry *lle;
11793 struct QueueQualityContext qqc;
11794 struct TransportDVLearnMessage dvl;
11795
11796 (void) cls;
11797 dvlearn_task = NULL;
11799 return; /* lost all connectivity, cannot do learning */
11800 qqc.quality_count = 0;
11801 qqc.num_queues = 0;
11805 &qqc);
11806 if (qqc.quality_count > DV_LEARN_QUALITY_THRESHOLD)
11807 {
11808 struct GNUNET_TIME_Relative delay;
11809 unsigned int factor;
11810
11811 /* scale our retries by how far we are above the threshold */
11812 factor = qqc.quality_count / DV_LEARN_QUALITY_THRESHOLD;
11815 "At connection quality %u, will launch DV learn in %s\n",
11816 qqc.quality_count,
11819 return;
11820 }
11821 /* remove old entries in #dvlearn_map if it has grown too big */
11822 while (MAX_DV_LEARN_PENDING <=
11824 {
11825 lle = lle_tail;
11828 &lle->challenge.value,
11829 lle));
11831 GNUNET_free (lle);
11832 }
11833 /* setup data structure for learning */
11834 lle = GNUNET_new (struct LearnLaunchEntry);
11836 &lle->challenge,
11837 sizeof(lle->challenge));
11839 "Starting launch DV learn with challenge %s\n",
11840 GNUNET_sh2s (&lle->challenge.value));
11845 &lle->challenge.value,
11846 lle,
11848 dvl.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN);
11849 dvl.header.size = htons (sizeof(dvl));
11850 dvl.num_hops = htons (0);
11851 dvl.bidirectional = htons (0);
11852 dvl.non_network_delay = GNUNET_TIME_relative_hton (GNUNET_TIME_UNIT_ZERO);
11853 dvl.monotonic_time =
11855 {
11856 struct DvInitPS dvip = {
11857 .purpose.purpose = htonl (
11859 .purpose.size = htonl (sizeof(dvip)),
11860 .monotonic_time = dvl.monotonic_time,
11861 .challenge = lle->challenge
11862 };
11863
11865 &dvip,
11866 &dvl.init_sig);
11867 }
11868 dvl.initiator = GST_my_identity;
11869 dvl.challenge = lle->challenge;
11870
11871 qqc.quality_count = 0;
11872 qqc.k = GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, qqc.num_queues);
11873 qqc.num_queues = 0;
11874 qqc.q = NULL;
11877 &qqc);
11878 GNUNET_assert (NULL != qqc.q);
11879
11880 /* Do this as close to transmission time as possible! */
11882
11883 queue_send_msg (qqc.q, NULL, &dvl, sizeof(dvl));
11884 /* reschedule this job, randomizing the time it runs (but no
11885 actual backoff!) */
11889 NULL);
11890}
static void start_dv_learn(void *cls)
Task run when we CONSIDER initiating a DV learn process.
#define DV_LEARN_QUALITY_THRESHOLD
How many good connections (confirmed, bi-directional, not DV) do we need to have to suppress initiati...
static int check_connection_quality(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Check whether any queue to the given neighbour is of a good "quality" and if so, increment the counte...
#define DV_LEARN_BASE_FREQUENCY
What is the non-randomized base frequency at which we would initiate DV learn messages?
#define MAX_DV_LEARN_PENDING
Maximum number of DV learning activities we may have pending at the same time.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multishortmap_put(struct GNUNET_CONTAINER_MultiShortmap *map, const struct GNUNET_ShortHashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
unsigned int GNUNET_CONTAINER_multishortmap_size(const struct GNUNET_CONTAINER_MultiShortmap *map)
Get the number of key-value pairs in the map.
int GNUNET_CONTAINER_multishortmap_remove(struct GNUNET_CONTAINER_MultiShortmap *map, const struct GNUNET_ShortHashCode *key, const void *value)
Remove the given key-value pair from the map.
struct GNUNET_TIME_Relative GNUNET_TIME_randomize(struct GNUNET_TIME_Relative r)
Return a random time value between 0.5*r and 1.5*r.
Definition: time.c:855
struct GNUNET_CRYPTO_ChallengeNonceP challenge
Challenge that uniquely identifies this activity.
struct GNUNET_TIME_Absolute launch_time
When did we transmit the DV learn message (used to calculate RTT) and determine freshness of paths le...

References TransportDVLearnMessage::bidirectional, TransportDVLearnMessage::challenge, LearnLaunchEntry::challenge, check_connection_quality(), DV_LEARN_BASE_FREQUENCY, DV_LEARN_QUALITY_THRESHOLD, dvlearn_map, dvlearn_task, GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_DLL_insert, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_CONTAINER_multishortmap_put(), GNUNET_CONTAINER_multishortmap_remove(), GNUNET_CONTAINER_multishortmap_size(), GNUNET_CRYPTO_eddsa_sign, GNUNET_CRYPTO_QUALITY_NONCE, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_block(), GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_DV_LEARN, GNUNET_new, GNUNET_SCHEDULER_add_delayed(), GNUNET_sh2s(), GNUNET_SIGNATURE_PURPOSE_TRANSPORT_DV_INITIATOR, GNUNET_STRINGS_relative_time_to_string(), GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_randomize(), GNUNET_TIME_relative_hton(), GNUNET_TIME_relative_multiply(), GNUNET_TIME_UNIT_ZERO, GNUNET_YES, GST_cfg, GST_my_identity, GST_my_private_key, TransportDVLearnMessage::header, TransportDVLearnMessage::init_sig, TransportDVLearnMessage::initiator, QueueQualityContext::k, LearnLaunchEntry::launch_time, lle_head, lle_tail, MAX_DV_LEARN_PENDING, TransportDVLearnMessage::monotonic_time, neighbours, TransportDVLearnMessage::non_network_delay, TransportDVLearnMessage::num_hops, QueueQualityContext::num_queues, GNUNET_CRYPTO_EccSignaturePurpose::purpose, DvInitPS::purpose, QueueQualityContext::q, QueueQualityContext::quality_count, queue_send_msg(), GNUNET_MessageHeader::size, start_dv_learn(), GNUNET_MessageHeader::type, and GNUNET_CRYPTO_ChallengeNonceP::value.

Referenced by handle_add_queue_message(), and start_dv_learn().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_validation_request_pending()

static int check_validation_request_pending ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

A new queue has been created, check if any address validation requests have been waiting for it.

Parameters
clsa struct Queue
pidpeer concerned (unused)
valuea struct ValidationState
Returns
GNUNET_NO if a match was found and we can stop looking

Definition at line 11928 of file gnunet-service-transport.c.

11931{
11932 struct Queue *q = cls;
11933 struct ValidationState *vs = value;
11934 char *address_without_port_vs;
11935 char *address_without_port_q;
11936 int success = GNUNET_YES;
11937
11938 // TODO Check if this is really necessary.
11939 address_without_port_vs = get_address_without_port (vs->address);
11940 address_without_port_q = get_address_without_port (q->address);
11941
11943 "Check validation request pending for `%s' at `%s'/`%s' (vs)/(q)\n",
11944 GNUNET_i2s (pid),
11945 address_without_port_vs,
11946 address_without_port_q);
11947 (void) pid;
11948 if ((GNUNET_YES == vs->awaiting_queue) &&
11949 (0 == strcmp (address_without_port_vs, address_without_port_q)))
11950 {
11951
11952 vs->awaiting_queue = GNUNET_NO;
11954 success = GNUNET_NO;
11955 }
11956
11957 GNUNET_free (address_without_port_vs);
11958 GNUNET_free (address_without_port_q);
11959 return success;
11960}

References get_address_without_port(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_YES, pid, q, validation_transmit_on_queue(), and value.

Referenced by handle_add_queue_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ neighbour_dv_monotime_cb()

static void neighbour_dv_monotime_cb ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Function called with the monotonic time of a DV initiator by PEERSTORE.

Updates the time.

Parameters
clsa struct Neighbour
recordthe information found, NULL for the last call
emsgerror message

Definition at line 11972 of file gnunet-service-transport.c.

11975{
11976 struct Neighbour *n = cls;
11977 struct GNUNET_TIME_AbsoluteNBO *mtbe;
11978
11979 (void) emsg;
11980 if (NULL == record)
11981 {
11982 /* we're done with #neighbour_dv_monotime_cb() invocations,
11983 continue normal processing */
11984 n->get = NULL;
11986 return;
11987 }
11988 if (0 == record->value_size)
11989 {
11991 GNUNET_break (0);
11992 return;
11993 }
11994 mtbe = record->value;
11999}

References Neighbour::dv_monotime_available, Neighbour::get, GNUNET_break, GNUNET_PEERSTORE_iteration_next(), GNUNET_TIME_absolute_max(), GNUNET_TIME_absolute_ntoh(), GNUNET_YES, Neighbour::last_dv_learn_monotime, and record().

Referenced by handle_add_queue_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ iterate_address_and_compare_cb()

static void iterate_address_and_compare_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
const char *  uri 
)
static

Definition at line 12003 of file gnunet-service-transport.c.

12006{
12007 struct Queue *queue = cls;
12008 struct sockaddr_in v4;
12009 const char *slash;
12010 char *address_uri;
12011 char *prefix;
12012 char *uri_without_port;
12013 char *address_uri_without_port;
12014
12015 slash = strrchr (uri, '/');
12016 prefix = GNUNET_strndup (uri, (slash - uri) - 2);
12017 GNUNET_assert (NULL != slash);
12018 slash++;
12019 GNUNET_asprintf (&address_uri,
12020 "%s-%s",
12021 prefix,
12022 slash);
12023
12025 "1 not global natted_address %u %s %s %s\n",
12026 queue->is_global_natted,
12027 uri,
12028 queue->address,
12029 slash);
12030
12031 uri_without_port = get_address_without_port (address_uri);
12032 if (1 != inet_pton (AF_INET, uri_without_port, &v4.sin_addr))
12033 {
12035 GNUNET_free (address_uri);
12036 GNUNET_free (uri_without_port);
12037 return;
12038 }
12039
12041 "2 not global natted_address %u %s %s\n",
12042 queue->is_global_natted,
12043 uri,
12044 queue->address);
12045
12046 if (GNUNET_NO == queue->is_global_natted)
12047 {
12049 GNUNET_free (address_uri);
12050 GNUNET_free (uri_without_port);
12051 return;
12052 }
12053
12055 "3 not global natted_address %u %s %s\n",
12056 queue->is_global_natted,
12057 uri,
12058 queue->address);
12059
12060 if (0 == strcmp (uri_without_port, address_uri))
12061 {
12063 GNUNET_free (address_uri);
12064 GNUNET_free (uri_without_port);
12065 return;
12066 }
12067
12069 "4 not global natted_address %u %s %s\n",
12070 queue->is_global_natted,
12071 uri,
12072 queue->address);
12073
12074 address_uri_without_port = get_address_without_port (queue->address);
12075 if (0 == strcmp (uri_without_port, address_uri_without_port))
12076 {
12077 queue->is_global_natted = GNUNET_NO;
12078 }
12079
12081 "not global natted_address %u %s %s %s %s %s %u\n",
12082 queue->is_global_natted,
12083 uri,
12084 queue->address,
12085 uri_without_port,
12086 address_uri_without_port,
12087 prefix,
12088 GNUNET_NO);
12090 GNUNET_free (address_uri);
12091 GNUNET_free (address_uri_without_port);
12092 GNUNET_free (uri_without_port);
12093}

References get_address_without_port(), GNUNET_asprintf(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, GNUNET_NO, GNUNET_strndup, prefix, queue(), and uri.

Referenced by check_for_global_natted().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ contains_address()

static enum GNUNET_GenericReturnValue contains_address ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Definition at line 12111 of file gnunet-service-transport.c.

12114{
12115 struct TransportGlobalNattedAddressClosure *tgna_cls = cls;
12116 struct TransportGlobalNattedAddress *tgna = value;
12117 char *addr = (char *) &tgna[1];
12118
12120 "Checking tgna %p with addr %s and length %u compare length %lu\n",
12121 tgna,
12122 addr,
12123 ntohl (tgna->address_length),
12124 strlen (tgna_cls->addr));
12125 if (strlen (tgna_cls->addr) == ntohl (tgna->address_length)
12126 && 0 == strncmp (addr, tgna_cls->addr, ntohl (tgna->address_length)))
12127 {
12128 tgna_cls->tgna = tgna;
12129 return GNUNET_NO;
12130 }
12131 return GNUNET_YES;
12132}
char * addr
The address to search for.
struct TransportGlobalNattedAddress * tgna
The struct TransportGlobalNattedAddress to set.

References TransportGlobalNattedAddressClosure::addr, TransportGlobalNattedAddress::address_length, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_YES, TransportGlobalNattedAddressClosure::tgna, and value.

Referenced by check_for_global_natted().

Here is the caller graph for this function:

◆ check_for_global_natted_error_cb()

static void check_for_global_natted_error_cb ( void *  cls)
static

Definition at line 12136 of file gnunet-service-transport.c.

12137{
12139 "Error in PEERSTORE monitoring for checking global natted\n");
12140}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_add_queue_message().

Here is the caller graph for this function:

◆ check_for_global_natted_sync_cb()

static void check_for_global_natted_sync_cb ( void *  cls)
static

Definition at line 12144 of file gnunet-service-transport.c.

12145{
12147 "Done with initial PEERSTORE iteration during monitoring for checking global natted\n");
12148}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_add_queue_message().

Here is the caller graph for this function:

◆ check_for_global_natted()

static void check_for_global_natted ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Definition at line 12152 of file gnunet-service-transport.c.

12155{
12156 struct Queue *queue = cls;
12157 struct Neighbour *neighbour = queue->neighbour;
12159 struct GNUNET_MessageHeader *hello;
12161 size_t address_len_without_port;
12162
12163 if (NULL != emsg)
12164 {
12166 "Got failure from PEERSTORE: %s\n",
12167 emsg);
12168 return;
12169 }
12170 if (0 == record->value_size)
12171 {
12173 GNUNET_break (0);
12174 return;
12175 }
12176 queue->is_global_natted = GNUNET_YES;
12177 hello = record->value;
12180 "before not global natted %u\n",
12181 queue->is_global_natted);
12184 queue);
12186 "after not global natted %u\n",
12187 queue->is_global_natted);
12189
12190 tgna_cls.addr = get_address_without_port (queue->address);
12191 address_len_without_port = strlen (tgna_cls.addr);
12192 /*{
12193 char buf[address_len_without_port + 1];
12194
12195 GNUNET_memcpy (&buf, addr, address_len_without_port);
12196 buf[address_len_without_port] = '\0';
12197 GNUNET_free (addr);
12198 GNUNET_memcpy (tgna_cls.addr, buf, address_len_without_port + 1);
12199 }*/
12200 tgna_cls.tgna = NULL;
12202 &neighbour->pid,
12204 &tgna_cls);
12205 if (NULL != tgna_cls.tgna)
12207 " tgna_cls.tgna tgna %p %lu %u %u\n",
12208 tgna_cls.tgna,
12209 neighbour->size_of_global_addresses,
12210 ntohl (tgna_cls.tgna->address_length),
12211 neighbour->number_of_addresses);
12212 if (NULL == tgna_cls.tgna && GNUNET_YES == queue->is_global_natted)
12213 {
12214 struct TransportGlobalNattedAddress *tgna;
12215
12216 tgna = GNUNET_malloc (sizeof (struct TransportGlobalNattedAddress)
12217 + address_len_without_port);
12218 tgna->address_length = htonl (address_len_without_port);
12219 GNUNET_memcpy (&tgna[1], tgna_cls.addr, address_len_without_port);
12221 &neighbour->pid,
12222 tgna,
12224 neighbour->number_of_addresses++;
12225 neighbour->size_of_global_addresses += address_len_without_port + 1;
12227 "Created tgna %p with address %s and length %lu\n",
12228 tgna,
12229 tgna_cls.addr,
12230 address_len_without_port + 1);
12231 }
12232 else if (NULL != tgna_cls.tgna && GNUNET_NO == queue->is_global_natted)
12233 {
12235 &neighbour->pid,
12236 tgna_cls.tgna);
12237 GNUNET_assert (neighbour->size_of_global_addresses >= ntohl (tgna_cls.tgna->
12239 );
12240 neighbour->size_of_global_addresses -= ntohl (tgna_cls.tgna->address_length)
12241 ;
12242 GNUNET_assert (0 < neighbour->number_of_addresses);
12243 neighbour->number_of_addresses--;
12245 "removed tgna %p\n",
12246 tgna_cls.tgna);
12247 GNUNET_free (tgna_cls.tgna);
12248 }
12250 GNUNET_free (tgna_cls.addr);
12251}
static enum GNUNET_GenericReturnValue contains_address(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
static void iterate_address_and_compare_cb(void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)

References TransportGlobalNattedAddressClosure::addr, TransportGlobalNattedAddress::address_length, contains_address(), get_address_without_port(), GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE, GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_HELLO_parser_free(), GNUNET_HELLO_parser_from_msg(), GNUNET_HELLO_parser_iterate(), GNUNET_log, GNUNET_malloc, GNUNET_memcpy, GNUNET_NO, GNUNET_PEERSTORE_monitor_next(), GNUNET_YES, iterate_address_and_compare_cb(), Neighbour::natted_addresses, Neighbour::number_of_addresses, consensus-simulation::parser, Neighbour::pid, queue(), record(), Neighbour::size_of_global_addresses, and TransportGlobalNattedAddressClosure::tgna.

Referenced by handle_add_queue_message().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_add_queue_message()

static void handle_add_queue_message ( void *  cls,
const struct GNUNET_TRANSPORT_AddQueueMessage aqm 
)
static

New queue became available.

Process the request.

Parameters
clsthe client
aqmthe send message that was sent

Definition at line 12261 of file gnunet-service-transport.c.

12263{
12264 struct TransportClient *tc = cls;
12265 struct Queue *queue;
12266 struct Neighbour *neighbour;
12267 const char *addr;
12268 uint16_t addr_len;
12269
12270 if (ntohl (aqm->mtu) <= sizeof(struct TransportFragmentBoxMessage))
12271 {
12272 /* MTU so small as to be useless for transmissions,
12273 required for #fragment_message()! */
12274 GNUNET_break_op (0);
12276 return;
12277 }
12278 /* This may simply be a queue update */
12279 for (queue = tc->details.communicator.queue_head;
12280 NULL != queue;
12281 queue = queue->next_client)
12282 {
12283 if (queue->qid != ntohl (aqm->qid))
12284 continue;
12285 break;
12286 }
12287
12288 if (NULL != queue)
12289 {
12290 neighbour = queue->neighbour;
12291 }
12292 else
12293 {
12294 struct GNUNET_TIME_Absolute validated_until = GNUNET_TIME_UNIT_ZERO_ABS;
12295
12296 neighbour = lookup_neighbour (&aqm->receiver);
12297 if (NULL == neighbour)
12298 {
12299 neighbour = GNUNET_new (struct Neighbour);
12301 GNUNET_YES);
12302 neighbour->pid = aqm->receiver;
12305 neighbours,
12306 &neighbour->pid,
12307 neighbour,
12309 neighbour->get =
12311 "transport",
12312 &neighbour->pid,
12315 neighbour);
12316 }
12317 addr_len = ntohs (aqm->header.size) - sizeof(*aqm);
12318 addr = (const char *) &aqm[1];
12320 "New queue %s to %s available with QID %u and q_len %" PRIu64
12321 " and mtu %u\n",
12322 addr,
12323 GNUNET_i2s (&aqm->receiver),
12324 ntohl (aqm->qid),
12325 GNUNET_ntohll (aqm->q_len),
12326 ntohl (aqm->mtu));
12327 queue = GNUNET_malloc (sizeof(struct Queue) + addr_len);
12328 queue->tc = tc;
12329 for (struct Queue *q = neighbour->queue_head; NULL != q; q = q->
12330 next_neighbour)
12331 validated_until = GNUNET_TIME_absolute_max (validated_until, q->
12332 validated_until);
12333 if (0 == GNUNET_TIME_absolute_get_remaining (validated_until).rel_value_us)
12334 {
12336 "New queue with QID %u inherit validated until\n",
12337 ntohl (aqm->qid));
12338 queue->validated_until = validated_until;
12339 }
12340 queue->address = (const char *) &queue[1];
12341 queue->pd.aged_rtt = GNUNET_TIME_UNIT_FOREVER_REL;
12342 queue->qid = ntohl (aqm->qid);
12343 queue->neighbour = neighbour;
12345 queue->unlimited_length = GNUNET_YES;
12346 queue->q_capacity = GNUNET_ntohll (aqm->q_len);
12347 memcpy (&queue[1], addr, addr_len);
12348 /* notify monitors about new queue */
12349 {
12350 struct MonitorEvent me = { .rtt = queue->pd.aged_rtt, .cs = queue->cs };
12351
12352 notify_monitors (&neighbour->pid, queue->address, queue->nt, &me);
12353 }
12355 neighbour->queue_head,
12356 neighbour->queue_tail,
12357 queue);
12359 tc->details.communicator.queue_head,
12360 tc->details.communicator.queue_tail,
12361 queue);
12362
12363 }
12364 queue->mtu = ntohl (aqm->mtu);
12365 queue->nt = ntohl (aqm->nt);
12366 queue->cs = ntohl (aqm->cs);
12367 queue->idle = GNUNET_YES;
12368
12369 {
12370 struct sockaddr_in v4;
12371 char *addr_without = get_address_without_port (queue->address);
12372 if (1 == inet_pton (AF_INET, addr_without, &v4.sin_addr))
12373 {
12375 "start not global natted\n");
12377 GNUNET_YES,
12378 "peerstore",
12379 &neighbour->pid,
12381 &
12383 NULL,
12384 &
12386 NULL,
12388 queue);
12389 }
12390 GNUNET_free (addr_without);
12391 }
12392 /* check if valdiations are waiting for the queue */
12394 &aqm->receiver))
12395 {
12398 &aqm->
12399 receiver,
12400 &
12402 queue))
12403 start_address_validation (&aqm->receiver, queue->address);
12404 }
12405 else
12406 start_address_validation (&aqm->receiver, queue->address);
12407 /* look for traffic for this queue */
12408 // TODO Check whether this makes any sense at all.
12409 /*schedule_transmit_on_queue (GNUNET_TIME_UNIT_ZERO,
12410 queue, GNUNET_SCHEDULER_PRIORITY_DEFAULT);*/
12411 /* might be our first queue, try launching DV learning */
12412 if (NULL == dvlearn_task)
12415}
static void check_for_global_natted(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
static int check_validation_request_pending(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
A new queue has been created, check if any address validation requests have been waiting for it.
static void check_for_global_natted_sync_cb(void *cls)
static void check_for_global_natted_error_cb(void *cls)
static void neighbour_dv_monotime_cb(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
Function called with the monotonic time of a DV initiator by PEERSTORE.
#define GNUNET_TRANSPORT_QUEUE_LENGTH_UNLIMITED
Queue length.
struct GNUNET_CONTAINER_MultiPeerMap * GNUNET_CONTAINER_multipeermap_create(unsigned int len, int do_not_copy_keys)
Create a multi peer map (hash map for public keys of peers).
void receiver(void *cls, const void *buf, size_t available, const struct sockaddr *addr, socklen_t addrlen, int errCode)
Callback to read from the SOCKS5 proxy.
Definition: socks.c:330
uint32_t nt
An enum GNUNET_NetworkType in NBO.
Definition: transport.h:420
uint32_t mtu
Maximum transmission unit, in NBO.
Definition: transport.h:425
uint64_t q_len
Queue length, in NBO.
Definition: transport.h:431
uint32_t qid
Queue identifier (used to identify the queue).
Definition: transport.h:410
struct GNUNET_PeerIdentity receiver
Receiver that can be addressed via the queue.
Definition: transport.h:415
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_SETUP.
Definition: transport.h:405
uint32_t cs
An enum GNUNET_TRANSPORT_ConnectionStatus in NBO.
Definition: transport.h:441

References check_for_global_natted(), check_for_global_natted_error_cb(), check_for_global_natted_sync_cb(), check_validation_request_pending(), GNUNET_TRANSPORT_AddQueueMessage::cs, dvlearn_task, Neighbour::get, get_address_without_port(), GNUNET_assert, GNUNET_break_op, GNUNET_CONTAINER_MDLL_insert, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_contains(), GNUNET_CONTAINER_multipeermap_create(), GNUNET_CONTAINER_multipeermap_get_multiple(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_malloc, GNUNET_new, GNUNET_ntohll(), GNUNET_OK, GNUNET_PEERSTORE_HELLO_KEY, GNUNET_PEERSTORE_iteration_start(), GNUNET_PEERSTORE_monitor_start(), GNUNET_PEERSTORE_TRANSPORT_DVLEARN_MONOTIME, GNUNET_SCHEDULER_add_now(), GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_SYSERR, GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_max(), GNUNET_TIME_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_ZERO_ABS, GNUNET_TRANSPORT_QUEUE_LENGTH_UNLIMITED, GNUNET_YES, GST_cfg, GNUNET_TRANSPORT_AddQueueMessage::header, lookup_neighbour(), me, GNUNET_TRANSPORT_AddQueueMessage::mtu, Neighbour::natted_addresses, neighbour_dv_monotime_cb(), neighbours, notify_monitors(), GNUNET_TRANSPORT_AddQueueMessage::nt, peerstore, Neighbour::pid, q, GNUNET_TRANSPORT_AddQueueMessage::q_len, GNUNET_TRANSPORT_AddQueueMessage::qid, queue(), Neighbour::queue_head, Neighbour::queue_tail, receiver(), GNUNET_TRANSPORT_AddQueueMessage::receiver, GNUNET_MessageHeader::size, start_address_validation(), start_dv_learn(), tc, and validation_map.

Here is the call graph for this function:

◆ handle_update_queue_message()

static void handle_update_queue_message ( void *  cls,
const struct GNUNET_TRANSPORT_UpdateQueueMessage msg 
)
static

Handle updates to queues.

Parameters
clsthe transport client.
msgMessage struct.

Definition at line 12425 of file gnunet-service-transport.c.

12428{
12429 struct TransportClient *tc = cls;
12430 struct Queue *target_queue = NULL;
12431
12433 "Received queue update message for %u with q_len %llu and mtu %u\n",
12434 ntohl (msg->qid),
12435 (unsigned long long) GNUNET_ntohll (msg->q_len),
12436 ntohl (msg->mtu));
12437 for (target_queue = tc->details.communicator.queue_head;
12438 NULL != target_queue;
12439 target_queue = target_queue->next_client)
12440 {
12441 if (ntohl (msg->qid) == target_queue->qid)
12442 break;
12443 }
12444 if (NULL == target_queue)
12445 {
12447 "Queue to update no longer exists! Discarding update.\n");
12448 return;
12449 }
12450
12451 target_queue->nt = msg->nt;
12452 target_queue->mtu = ntohl (msg->mtu);
12453 target_queue->cs = msg->cs;
12454 target_queue->priority = ntohl (msg->priority);
12455 /* The update message indicates how many messages
12456 * the queue should be able to handle.
12457 */
12459 target_queue->unlimited_length = GNUNET_YES;
12460 else
12461 target_queue->unlimited_length = GNUNET_NO;
12462 target_queue->q_capacity += GNUNET_ntohll (msg->q_len);
12463 if (0 < target_queue->q_capacity)
12465 target_queue,
12468}
uint32_t qid
Unique identifier of this queue with the communicator.
uint64_t q_capacity
Capacity of the queue.
uint32_t priority
Queue priority.
enum GNUNET_NetworkType nt
Which network type does this queue use?
uint32_t mtu
Maximum transmission unit supported by this queue.
unsigned int unlimited_length
Is this queue of unlimited length.
enum GNUNET_TRANSPORT_ConnectionStatus cs
The connection status of this queue.

References Queue::cs, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_log, GNUNET_NO, GNUNET_ntohll(), GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_SERVICE_client_continue(), GNUNET_TIME_UNIT_ZERO, GNUNET_TRANSPORT_QUEUE_LENGTH_UNLIMITED, GNUNET_YES, msg, Queue::mtu, Queue::next_client, Queue::nt, Queue::priority, Queue::q_capacity, Queue::qid, schedule_transmit_on_queue(), tc, and Queue::unlimited_length.

Here is the call graph for this function:

◆ handle_queue_create_ok()

static void handle_queue_create_ok ( void *  cls,
const struct GNUNET_TRANSPORT_CreateQueueResponse cqr 
)
static

Communicator tells us that our request to create a queue "worked", that is setting up the queue is now in process.

Parameters
clsthe struct TransportClient
cqrconfirmation message

Definition at line 12479 of file gnunet-service-transport.c.

12481{
12482 struct TransportClient *tc = cls;
12483
12484 if (CT_COMMUNICATOR != tc->type)
12485 {
12486 GNUNET_break (0);
12488 return;
12489 }
12491 "# Suggestions succeeded at communicator",
12492 1,
12493 GNUNET_NO);
12495 "Request #%u for communicator to create queue succeeded\n",
12496 (unsigned int) ntohs (cqr->request_id));
12498}
uint32_t request_id
Unique ID for the request.
Definition: transport.h:555

References CT_COMMUNICATOR, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_STATISTICS_update(), GST_stats, GNUNET_TRANSPORT_CreateQueueResponse::request_id, and tc.

Here is the call graph for this function:

◆ handle_queue_create_fail()

static void handle_queue_create_fail ( void *  cls,
const struct GNUNET_TRANSPORT_CreateQueueResponse cqr 
)
static

Communicator tells us that our request to create a queue failed.

This usually indicates that the provided address is simply invalid or that the communicator's resources are exhausted.

Parameters
clsthe struct TransportClient
cqrfailure message

Definition at line 12510 of file gnunet-service-transport.c.

12513{
12514 struct TransportClient *tc = cls;
12515
12516 if (CT_COMMUNICATOR != tc->type)
12517 {
12518 GNUNET_break (0);
12520 return;
12521 }
12523 "Request #%u for communicator to create queue failed\n",
12524 (unsigned int) ntohs (cqr->request_id));
12526 "# Suggestions failed in queue creation at communicator",
12527 1,
12528 GNUNET_NO);
12530}

References CT_COMMUNICATOR, GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_NO, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_STATISTICS_update(), GST_stats, GNUNET_TRANSPORT_CreateQueueResponse::request_id, and tc.

Here is the call graph for this function:

◆ handle_suggest_cancel()

static void handle_suggest_cancel ( void *  cls,
const struct ExpressPreferenceMessage msg 
)
static

We have received a struct ExpressPreferenceMessage from an application client.

Parameters
clshandle to the client
msgthe start message

Definition at line 12541 of file gnunet-service-transport.c.

12542{
12543 struct TransportClient *tc = cls;
12544 struct PeerRequest *pr;
12545
12546 if (CT_APPLICATION != tc->type)
12547 {
12548 GNUNET_break (0);
12550 return;
12551 }
12552 pr = GNUNET_CONTAINER_multipeermap_get (tc->details.application.requests,
12553 &msg->peer);
12554 if (NULL == pr)
12555 {
12556 GNUNET_break (0);
12558 return;
12559 }
12560 (void) stop_peer_request (tc, &pr->pid, pr);
12562}

References CT_APPLICATION, GNUNET_break, GNUNET_CONTAINER_multipeermap_get(), GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), msg, PeerRequest::pr, stop_peer_request(), and tc.

Here is the call graph for this function:

◆ hello_for_client_cb()

static void hello_for_client_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
const char *  uri 
)
static

Definition at line 12566 of file gnunet-service-transport.c.

12569{
12570 struct Queue *q;
12571 int pfx_len;
12572 const char *eou;
12573 char *address;
12574 (void) cls;
12575
12576 eou = strstr (uri,
12577 "://");
12578 pfx_len = eou - uri;
12579 eou += 3;
12581 "%.*s-%s",
12582 pfx_len,
12583 uri,
12584 eou);
12585
12587 "hello for client %s\n",
12588 address);
12589
12590 q = find_queue (pid, address);
12591 if (NULL == q)
12592 {
12594 }
12595 else
12598}

References address, find_queue(), GNUNET_asprintf(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_log, pid, q, start_address_validation(), suggest_to_connect(), and uri.

Referenced by handle_hello_for_client().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_hello_for_client()

static void handle_hello_for_client ( void *  cls,
const struct GNUNET_PEERSTORE_Record record,
const char *  emsg 
)
static

Function called by PEERSTORE for each matching record.

Parameters
clsclosure, a struct PeerRequest
recordpeerstore record information
emsgerror message, or NULL if no errors

Definition at line 12609 of file gnunet-service-transport.c.

12612{
12613 struct PeerRequest *pr = cls;
12615 struct GNUNET_MessageHeader *hello;
12616
12617 if (NULL != emsg)
12618 {
12620 "Got failure from PEERSTORE: %s\n",
12621 emsg);
12622 return;
12623 }
12624 hello = record->value;
12625 if (0 == GNUNET_memcmp (&record->peer, &GST_my_identity))
12626 {
12628 return;
12629 }
12633 NULL);
12635}
static void hello_for_client_cb(void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
struct GNUNET_PEERSTORE_Monitor * nc
Notify context for new HELLOs.

References GNUNET_ERROR_TYPE_WARNING, GNUNET_HELLO_parser_free(), GNUNET_HELLO_parser_from_msg(), GNUNET_HELLO_parser_iterate(), GNUNET_log, GNUNET_memcmp, GNUNET_PEERSTORE_monitor_next(), GST_my_identity, hello_for_client_cb(), PeerRequest::nc, consensus-simulation::parser, PeerRequest::pr, and record().

Referenced by handle_suggest().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ hello_for_client_error_cb()

static void hello_for_client_error_cb ( void *  cls)
static

Definition at line 12639 of file gnunet-service-transport.c.

12640{
12642 "Error in PEERSTORE monitoring\n");
12643}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_suggest().

Here is the caller graph for this function:

◆ hello_for_client_sync_cb()

static void hello_for_client_sync_cb ( void *  cls)
static

Definition at line 12647 of file gnunet-service-transport.c.

12648{
12650 "Done with initial PEERSTORE iteration during monitoring\n");
12651}

References GNUNET_ERROR_TYPE_WARNING, and GNUNET_log.

Referenced by handle_suggest().

Here is the caller graph for this function:

◆ handle_suggest()

static void handle_suggest ( void *  cls,
const struct ExpressPreferenceMessage msg 
)
static

We have received a struct ExpressPreferenceMessage from an application client.

Parameters
clshandle to the client
msgthe start message

Definition at line 12662 of file gnunet-service-transport.c.

12663{
12664 struct TransportClient *tc = cls;
12665 struct PeerRequest *pr;
12666
12667 if (CT_NONE == tc->type)
12668 {
12669 tc->type = CT_APPLICATION;
12670 tc->details.application.requests =
12672 }
12673 if (CT_APPLICATION != tc->type)
12674 {
12675 GNUNET_break (0);
12677 return;
12678 }
12680 "Client suggested we talk to %s with preference %d at rate %u\n",
12681 GNUNET_i2s (&msg->peer),
12682 (int) ntohl (msg->pk),
12683 (int) ntohl (msg->bw.value__));
12684 pr = GNUNET_new (struct PeerRequest);
12685 pr->tc = tc;
12686 pr->pid = msg->peer;
12687 pr->bw = msg->bw;
12688 pr->pk = ntohl (msg->pk);
12690 tc->details.application.requests,
12691 &pr->pid,
12692 pr,
12694 {
12695 GNUNET_break (0);
12696 GNUNET_free (pr);
12698 return;
12699 }
12700 pr->nc =
12702 GNUNET_YES,
12703 "peerstore",
12704 NULL,
12707 NULL,
12709 NULL,
12711 pr);
12713}
static void hello_for_client_error_cb(void *cls)
static void handle_hello_for_client(void *cls, const struct GNUNET_PEERSTORE_Record *record, const char *emsg)
Function called by PEERSTORE for each matching record.
static void hello_for_client_sync_cb(void *cls)

References CT_APPLICATION, CT_NONE, GNUNET_break, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_create(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_new, GNUNET_PEERSTORE_HELLO_KEY, GNUNET_PEERSTORE_monitor_start(), GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_YES, GST_cfg, handle_hello_for_client(), hello_for_client_error_cb(), hello_for_client_sync_cb(), msg, PeerRequest::pr, and tc.

Here is the call graph for this function:

◆ check_request_hello_validation()

static int check_request_hello_validation ( void *  cls,
const struct RequestHelloValidationMessage m 
)
static

Check GNUNET_MESSAGE_TYPE_TRANSPORT_REQUEST_HELLO_VALIDATION messages.

Parameters
clsa struct TransportClient *
mmessage to verify
Returns
GNUNET_OK on success

Definition at line 12725 of file gnunet-service-transport.c.

12727{
12728 (void) cls;
12730 return GNUNET_OK;
12731}
static struct GNUNET_ARM_MonitorHandle * m
Monitor connection with ARM.
Definition: gnunet-arm.c:103

References GNUNET_MQ_check_zero_termination, GNUNET_OK, and m.

◆ handle_request_hello_validation()

static void handle_request_hello_validation ( void *  cls,
const struct RequestHelloValidationMessage m 
)
static

A client encountered an address of another peer.

Consider validating it, and if validation succeeds, persist it to PEERSTORE.

Parameters
clsa struct TransportClient *
mmessage to verify

Definition at line 12742 of file gnunet-service-transport.c.

12744{
12745 struct TransportClient *tc = cls;
12746 struct Queue *q;
12747
12748 q = find_queue (&m->peer, (const char *) &m[1]);
12749 if (NULL == q)
12750 {
12751 suggest_to_connect (&m->peer, (const char *) &m[1]);
12752 }
12753 else
12754 start_address_validation (&m->peer, (const char *) &m[1]);
12756}

References find_queue(), GNUNET_SERVICE_client_continue(), m, q, start_address_validation(), suggest_to_connect(), and tc.

Here is the call graph for this function:

◆ free_neighbour_cb()

static int free_neighbour_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Free neighbour entry.

Parameters
clsNULL
pidunused
valuea struct Neighbour
Returns
GNUNET_OK (always)

Definition at line 12768 of file gnunet-service-transport.c.

12771{
12772 struct Neighbour *neighbour = value;
12773
12774 (void) cls;
12775 (void) pid;
12776 GNUNET_break (0); // should this ever happen?
12777 free_neighbour (neighbour, GNUNET_YES);
12778
12779 return GNUNET_OK;
12780}

References free_neighbour(), GNUNET_break, GNUNET_OK, GNUNET_YES, pid, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_dv_routes_cb()

static int free_dv_routes_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Free DV route entry.

Parameters
clsNULL
pidunused
valuea struct DistanceVector
Returns
GNUNET_OK (always)

Definition at line 12792 of file gnunet-service-transport.c.

12795{
12796 struct DistanceVector *dv = value;
12797
12798 (void) cls;
12799 (void) pid;
12800 free_dv_route (dv);
12801
12802 return GNUNET_OK;
12803}

References free_dv_route(), GNUNET_OK, pid, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_validation_state_cb()

static int free_validation_state_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Free validation state.

Parameters
clsNULL
pidunused
valuea struct ValidationState
Returns
GNUNET_OK (always)

Definition at line 12815 of file gnunet-service-transport.c.

12818{
12819 struct ValidationState *vs = value;
12820
12821 (void) cls;
12822 (void) pid;
12824 return GNUNET_OK;
12825}

References free_validation_state(), GNUNET_OK, pid, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_pending_ack_cb()

static int free_pending_ack_cb ( void *  cls,
const struct GNUNET_Uuid key,
void *  value 
)
static

Free pending acknowledgement.

Parameters
clsNULL
keyunused
valuea struct PendingAcknowledgement
Returns
GNUNET_OK (always)

Definition at line 12837 of file gnunet-service-transport.c.

12838{
12839 struct PendingAcknowledgement *pa = value;
12840
12841 (void) cls;
12842 (void) key;
12844 return GNUNET_OK;
12845}

References free_pending_acknowledgement(), GNUNET_OK, key, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ free_ack_cummulator_cb()

static int free_ack_cummulator_cb ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Free acknowledgement cummulator.

Parameters
clsNULL
pidunused
valuea struct AcknowledgementCummulator
Returns
GNUNET_OK (always)

Definition at line 12857 of file gnunet-service-transport.c.

12860{
12861 struct AcknowledgementCummulator *ac = value;
12862
12863 (void) cls;
12864 (void) pid;
12866 GNUNET_free (ac);
12867 return GNUNET_OK;
12868}

References GNUNET_free, GNUNET_OK, GNUNET_SCHEDULER_cancel(), pid, AcknowledgementCummulator::task, and value.

Referenced by do_shutdown().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ shutdown_task()

static void shutdown_task ( void *  cls)
static

Definition at line 12968 of file gnunet-service-transport.c.

12969{
12971
12973 "Shutdown task executed\n");
12974 if (NULL != clients_head)
12975 {
12976 for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
12977 {
12979 "client still connected: %u\n",
12980 tc->type);
12981 }
12982 }
12983 else
12984 do_shutdown (cls);
12985
12986}

References clients_head, do_shutdown(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_ERROR, GNUNET_log, GNUNET_YES, in_shutdown, and tc.

Referenced by run().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ run()

static void run ( void *  cls,
const struct GNUNET_CONFIGURATION_Handle c,
struct GNUNET_SERVICE_Handle service 
)
static

Initiate transport service.

Parameters
clsclosure
cconfiguration to use
servicethe initialized service

Definition at line 12997 of file gnunet-service-transport.c.

13000{
13001 (void) cls;
13002 (void) service;
13003 /* setup globals */
13006 GST_cfg = c;
13014 GNUNET_YES);
13021 if (NULL == GST_my_private_key)
13022 {
13023 GNUNET_log (
13025 _ (
13026 "Transport service is lacking key configuration settings. Exiting.\n"));
13028 return;
13029 }
13033 "My identity is `%s'\n",
13037 "transport",
13038 "USE_BURST_NAT");
13039 if (GNUNET_SYSERR == use_burst)
13041 "Could not configure burst nat use. Default to no.\n");
13046 "transport",
13047 0,
13048 0,
13049 NULL,
13050 0,
13051 NULL,
13052 NULL,
13053 NULL);
13054 if (NULL == peerstore)
13055 {
13056 GNUNET_break (0);
13058 return;
13059 }
13060}
static struct GNUNET_SERVICE_Handle * service
Handle to our service instance.
static void shutdown_task(void *cls)
enum GNUNET_GenericReturnValue GNUNET_CONFIGURATION_get_value_yesno(const struct GNUNET_CONFIGURATION_Handle *cfg, const char *section, const char *option)
Get a configuration value that should be in a set of "YES" or "NO".
void GNUNET_CRYPTO_eddsa_key_get_public(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, struct GNUNET_CRYPTO_EddsaPublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:201
struct GNUNET_CRYPTO_EddsaPrivateKey * GNUNET_CRYPTO_eddsa_key_create_from_configuration(const struct GNUNET_CONFIGURATION_Handle *cfg)
Create a new private key by reading our peer's key from the file specified in the configuration.
struct GNUNET_CONTAINER_MultiUuidmap * GNUNET_CONTAINER_multiuuidmap_create(unsigned int len, int do_not_copy_keys)
Create a multi peer map (hash map for public keys of peers).
struct GNUNET_CONTAINER_MultiShortmap * GNUNET_CONTAINER_multishortmap_create(unsigned int len, int do_not_copy_keys)
Create a multi peer map (hash map for public keys of peers).
struct GNUNET_CONTAINER_MultiHashMap * GNUNET_CONTAINER_multihashmap_create(unsigned int len, int do_not_copy_keys)
Create a multi hash map.
struct GNUNET_HELLO_Builder * GNUNET_HELLO_builder_new(const struct GNUNET_PeerIdentity *pid)
Allocate builder.
Definition: hello-uri.c:401
const char * GNUNET_i2s_full(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
struct GNUNET_NAT_Handle * GNUNET_NAT_register(const struct GNUNET_CONFIGURATION_Handle *cfg, const char *config_section, uint8_t proto, unsigned int num_addrs, const struct sockaddr **addrs, const socklen_t *addrlens, GNUNET_NAT_AddressCallback address_callback, GNUNET_NAT_ReversalCallback reversal_callback, void *callback_cls)
Attempt to enable port redirection and detect public IP address contacting UPnP or NAT-PMP routers on...
Definition: nat_api.c:366
struct GNUNET_PEERSTORE_Handle * GNUNET_PEERSTORE_connect(const struct GNUNET_CONFIGURATION_Handle *cfg)
Connect to the PEERSTORE service.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_shutdown(GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run on shutdown, that is when a CTRL-C signal is received,...
Definition: scheduler.c:1339
struct GNUNET_STATISTICS_Handle * GNUNET_STATISTICS_create(const char *subsystem, const struct GNUNET_CONFIGURATION_Handle *cfg)
Get handle for the statistics service.
#define _(String)
GNU gettext support macro.
Definition: platform.h:178

References _, ack_cummulators, backtalkers, dv_routes, dvlearn_map, GNUNET_break, GNUNET_CONFIGURATION_get_value_yesno(), GNUNET_CONTAINER_heap_create(), GNUNET_CONTAINER_HEAP_ORDER_MIN, GNUNET_CONTAINER_multihashmap_create(), GNUNET_CONTAINER_multipeermap_create(), GNUNET_CONTAINER_multishortmap_create(), GNUNET_CONTAINER_multiuuidmap_create(), GNUNET_CRYPTO_eddsa_key_create_from_configuration(), GNUNET_CRYPTO_eddsa_key_get_public(), GNUNET_ERROR_TYPE_ERROR, GNUNET_ERROR_TYPE_INFO, GNUNET_ERROR_TYPE_WARNING, GNUNET_HELLO_builder_new(), GNUNET_i2s_full(), GNUNET_log, GNUNET_NAT_register(), GNUNET_NO, GNUNET_PEERSTORE_connect(), GNUNET_SCHEDULER_add_shutdown(), GNUNET_SCHEDULER_shutdown(), GNUNET_STATISTICS_create(), GNUNET_SYSERR, GNUNET_TIME_absolute_get_monotonic(), GNUNET_YES, GST_cfg, GST_my_hello, GST_my_identity, GST_my_private_key, GST_stats, hello_mono_time, in_shutdown, links, MAX_DV_LEARN_PENDING, neighbours, nh, peerstore, pending_acks, GNUNET_PeerIdentity::public_key, revalidation_map, service, shutdown_task(), use_burst, validation_heap, and validation_map.

Here is the call graph for this function:

◆ GNUNET_SERVICE_MAIN()

GNUNET_SERVICE_MAIN ( GNUNET_OS_project_data_gnunet()  ,
"transport"  ,
GNUNET_SERVICE_OPTION_SOFT_SHUTDOWN  ,
run,
client_connect_cb,
client_disconnect_cb,
NULL  ,
GNUNET_MQ_hd_fixed_size(suggest, GNUNET_MESSAGE_TYPE_TRANSPORT_SUGGEST, struct ExpressPreferenceMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(suggest_cancel, GNUNET_MESSAGE_TYPE_TRANSPORT_SUGGEST_CANCEL, struct ExpressPreferenceMessage, NULL)  ,
GNUNET_MQ_hd_var_size(request_hello_validation, GNUNET_MESSAGE_TYPE_TRANSPORT_REQUEST_HELLO_VALIDATION, struct RequestHelloValidationMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(client_start, GNUNET_MESSAGE_TYPE_TRANSPORT_START, struct StartMessage, NULL)  ,
GNUNET_MQ_hd_var_size(client_send, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND, struct OutboundMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(client_recv_ok, GNUNET_MESSAGE_TYPE_TRANSPORT_RECV_OK, struct RecvOkMessage, NULL)  ,
GNUNET_MQ_hd_var_size(communicator_available, GNUNET_MESSAGE_TYPE_TRANSPORT_NEW_COMMUNICATOR, struct GNUNET_TRANSPORT_CommunicatorAvailableMessage, NULL)  ,
GNUNET_MQ_hd_var_size(communicator_backchannel, GNUNET_MESSAGE_TYPE_TRANSPORT_COMMUNICATOR_BACKCHANNEL, struct GNUNET_TRANSPORT_CommunicatorBackchannel, NULL)  ,
GNUNET_MQ_hd_var_size(add_address, GNUNET_MESSAGE_TYPE_TRANSPORT_ADD_ADDRESS, struct GNUNET_TRANSPORT_AddAddressMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(del_address, GNUNET_MESSAGE_TYPE_TRANSPORT_DEL_ADDRESS, struct GNUNET_TRANSPORT_DelAddressMessage, NULL)  ,
GNUNET_MQ_hd_var_size(incoming_msg, GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG, struct GNUNET_TRANSPORT_IncomingMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(queue_create_ok, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE_OK, struct GNUNET_TRANSPORT_CreateQueueResponse, NULL)  ,
GNUNET_MQ_hd_fixed_size(queue_create_fail, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_CREATE_FAIL, struct GNUNET_TRANSPORT_CreateQueueResponse, NULL)  ,
GNUNET_MQ_hd_var_size(add_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_SETUP, struct GNUNET_TRANSPORT_AddQueueMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(update_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_UPDATE, struct GNUNET_TRANSPORT_UpdateQueueMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(del_queue_message, GNUNET_MESSAGE_TYPE_TRANSPORT_QUEUE_TEARDOWN, struct GNUNET_TRANSPORT_DelQueueMessage, NULL)  ,
GNUNET_MQ_hd_fixed_size(send_message_ack, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG_ACK, struct GNUNET_TRANSPORT_SendMessageToAck, NULL)  ,
GNUNET_MQ_hd_fixed_size(burst_finished, GNUNET_MESSAGE_TYPE_TRANSPORT_BURST_FINISHED, struct GNUNET_TRANSPORT_BurstFinished, NULL)  ,
GNUNET_MQ_hd_fixed_size(monitor_start, GNUNET_MESSAGE_TYPE_TRANSPORT_MONITOR_START, struct GNUNET_TRANSPORT_MonitorStart, NULL)  ,
GNUNET_MQ_handler_end()   
)

Define "main" method using service macro.

Variable Documentation

◆ ring_buffer

struct RingBufferEntry* ring_buffer[RING_BUFFER_SIZE]
static

Ring buffer for a CORE message we did not deliver to CORE, because of missing virtual link to sender.

Definition at line 2866 of file gnunet-service-transport.c.

Referenced by handle_raw_message(), and send_msg_from_cache().

◆ ring_buffer_head

unsigned int ring_buffer_head
static

Head of the ring buffer.

Definition at line 2871 of file gnunet-service-transport.c.

Referenced by handle_raw_message(), and send_msg_from_cache().

◆ is_ring_buffer_full

unsigned int is_ring_buffer_full
static

Is the ring buffer filled up to RING_BUFFER_SIZE.

Definition at line 2876 of file gnunet-service-transport.c.

Referenced by handle_raw_message(), and send_msg_from_cache().

◆ ring_buffer_dv

struct PendingMessage* ring_buffer_dv[RING_BUFFER_SIZE]
static

Ring buffer for a forwarded DVBox message we did not deliver to the next hop, because of missing virtual link that hop.

Definition at line 2881 of file gnunet-service-transport.c.

Referenced by forward_dv_box(), and send_msg_from_cache().

◆ ring_buffer_dv_head

unsigned int ring_buffer_dv_head
static

Head of the ring buffer.

Definition at line 2886 of file gnunet-service-transport.c.

Referenced by forward_dv_box(), and send_msg_from_cache().

◆ is_ring_buffer_dv_full

unsigned int is_ring_buffer_dv_full
static

Is the ring buffer filled up to RING_BUFFER_SIZE.

Definition at line 2891 of file gnunet-service-transport.c.

Referenced by forward_dv_box(), and send_msg_from_cache().

◆ clients_head

◆ clients_tail

struct TransportClient* clients_tail
static

Tail of linked list of all clients to this service.

Definition at line 2901 of file gnunet-service-transport.c.

Referenced by client_connect_cb(), and client_disconnect_cb().

◆ GST_stats

◆ GST_cfg

◆ GST_my_identity

◆ GST_my_hello

struct GNUNET_HELLO_Builder* GST_my_hello

Our HELLO.

Definition at line 2921 of file gnunet-service-transport.c.

Referenced by do_shutdown(), run(), and store_pi().

◆ GST_my_private_key

◆ neighbours

struct GNUNET_CONTAINER_MultiPeerMap* neighbours
static

Map from PIDs to struct Neighbour entries.

A peer is a neighbour if we have an MQ to it from some communicator.

Definition at line 2932 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_neighbour(), handle_add_queue_message(), handle_dv_learn(), handle_monitor_start(), lookup_neighbour(), run(), and start_dv_learn().

◆ backtalkers

struct GNUNET_CONTAINER_MultiPeerMap* backtalkers
static

Map from PIDs to struct Backtalker entries.

A peer is a backtalker if it recently send us backchannel messages.

Definition at line 2938 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_backtalker(), handle_dv_box(), and run().

◆ ack_cummulators

struct GNUNET_CONTAINER_MultiPeerMap* ack_cummulators
static

Map from PIDs to struct AcknowledgementCummulators.

Here we track the cumulative ACKs for transmission.

Definition at line 2944 of file gnunet-service-transport.c.

Referenced by cummulative_ack(), destroy_ack_cummulator(), do_shutdown(), and run().

◆ pending_acks

struct GNUNET_CONTAINER_MultiUuidmap* pending_acks
static

Map of pending acknowledgements, mapping struct AcknowledgementUUID to a struct PendingAcknowledgement.

Definition at line 2950 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_pending_acknowledgement(), handle_reliability_ack(), prepare_pending_acknowledgement(), and run().

◆ dv_routes

struct GNUNET_CONTAINER_MultiPeerMap* dv_routes
static

Map from PIDs to struct DistanceVector entries describing known paths to the peer.

Definition at line 2956 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_dv_route(), learn_dv_path(), route_control_message_without_fc(), and run().

◆ validation_map

struct GNUNET_CONTAINER_MultiPeerMap* validation_map
static

Map from PIDs to struct ValidationState entries describing addresses we are aware of and their validity state.

Definition at line 2962 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_validation_state(), handle_add_queue_message(), handle_validation_response(), run(), and start_address_validation().

◆ revalidation_map

struct GNUNET_CONTAINER_MultiHashMap* revalidation_map
static

Map from addresses to struct ValidationState entries describing addresses we are aware of and their validity state.

Definition at line 2968 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_validation_state(), handle_validation_response(), run(), and validation_transmit_on_queue().

◆ links

struct GNUNET_CONTAINER_MultiPeerMap* links
static

Map from PIDs to struct VirtualLink entries describing links CORE knows to exist.

Definition at line 2974 of file gnunet-service-transport.c.

Referenced by activate_core_visible_dv_path(), do_shutdown(), free_virtual_link(), handle_client_start(), handle_flow_control(), handle_validation_response(), lookup_virtual_link(), and run().

◆ dvlearn_map

struct GNUNET_CONTAINER_MultiShortmap* dvlearn_map
static

Map from challenges to struct LearnLaunchEntry values.

Definition at line 2979 of file gnunet-service-transport.c.

Referenced by do_shutdown(), run(), and start_dv_learn().

◆ lle_head

struct LearnLaunchEntry* lle_head = NULL
static

Head of a DLL sorted by launch time.

Definition at line 2984 of file gnunet-service-transport.c.

Referenced by do_shutdown(), and start_dv_learn().

◆ lle_tail

struct LearnLaunchEntry* lle_tail = NULL
static

Tail of a DLL sorted by launch time.

Definition at line 2989 of file gnunet-service-transport.c.

Referenced by do_shutdown(), and start_dv_learn().

◆ validation_heap

struct GNUNET_CONTAINER_Heap* validation_heap
static

MIN Heap sorted by "next_challenge" to struct ValidationState entries sorting addresses we are aware of by when we should next try to (re)validate (or expire) them.

Definition at line 2996 of file gnunet-service-transport.c.

Referenced by do_shutdown(), run(), update_next_challenge_time(), and validation_start_cb().

◆ nh

◆ peerstore

◆ dvlearn_task

struct GNUNET_SCHEDULER_Task* dvlearn_task
static

Task run to initiate DV learning.

Definition at line 3011 of file gnunet-service-transport.c.

Referenced by do_shutdown(), handle_add_queue_message(), and start_dv_learn().

◆ validation_task

struct GNUNET_SCHEDULER_Task* validation_task
static

Task to run address validation.

Definition at line 3016 of file gnunet-service-transport.c.

Referenced by do_shutdown(), update_next_challenge_time(), and validation_start_cb().

◆ ir_head

struct IncomingRequest* ir_head
static

List of incoming connections where we are trying to get a connection back established.

Length kept in ir_total.

Definition at line 3023 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_incoming_request(), and handle_validation_challenge().

◆ ir_tail

struct IncomingRequest* ir_tail
static

Tail of DLL starting at ir_head.

Definition at line 3028 of file gnunet-service-transport.c.

Referenced by free_incoming_request(), and handle_validation_challenge().

◆ ir_total

unsigned int ir_total
static

Length of the DLL starting at ir_head.

Definition at line 3033 of file gnunet-service-transport.c.

Referenced by do_shutdown(), free_incoming_request(), and handle_validation_challenge().

◆ logging_uuid_gen

unsigned long long logging_uuid_gen
static

Generator of logging_uuid in struct PendingMessage.

Definition at line 3038 of file gnunet-service-transport.c.

Referenced by extract_box_cb(), forward_dv_box(), fragment_message(), handle_client_send(), and reliability_box_message().

◆ burst_running

enum GNUNET_GenericReturnValue burst_running
static

Is there a burst running?

Definition at line 3043 of file gnunet-service-transport.c.

Referenced by burst_timeout(), handle_burst_finished(), queue_burst(), and start_burst().

◆ hello_mono_time

struct GNUNET_TIME_Absolute hello_mono_time
static

Monotonic time we use for HELLOs generated at this time.

TODO: we should increase this value from time to time (i.e. whenever a struct AddressListEntry actually expires), but IF we do this, we must also update all (remaining) addresses in the PEERSTORE at that time! (So for now only increased when the peer is restarted, which hopefully roughly matches whenever our addresses change.)

Definition at line 3053 of file gnunet-service-transport.c.

Referenced by run(), and store_pi().

◆ in_shutdown

int in_shutdown
static

Indication if we have received a shutdown signal and are in the process of cleaning up.

Definition at line 3059 of file gnunet-service-transport.c.

Referenced by client_disconnect_cb(), run(), and shutdown_task().

◆ burst_task

struct GNUNET_SCHEDULER_Task* burst_task
static

The task to start the burst.

Definition at line 3064 of file gnunet-service-transport.c.

Referenced by queue_burst(), and start_burst().

◆ burst_timeout_task

struct GNUNET_SCHEDULER_Task* burst_timeout_task

Definition at line 3066 of file gnunet-service-transport.c.

Referenced by start_burst().

◆ use_burst

enum GNUNET_GenericReturnValue use_burst

Definition at line 3068 of file gnunet-service-transport.c.

Referenced by queue_burst(), and run().