GNUnet  0.11.x
Data Structures | Macros | Typedefs | Enumerations | Functions | Variables
gnunet-service-tng.c File Reference

main for gnunet-service-tng More...

#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_statistics_service.h"
#include "gnunet_transport_monitor_service.h"
#include "gnunet_peerstore_service.h"
#include "gnunet_hello_lib.h"
#include "gnunet_signatures.h"
#include "transport.h"
Include dependency graph for gnunet-service-tng.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 initator 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  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  CoreSentContext
 Closure for core_env_sent_cb. 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
 An entry in the operation queue. More...
 
struct  Queue
 Handle for a queue. More...
 
struct  ReassemblyContext
 Information we keep for a message that we are reassembling. More...
 
struct  Neighbour
 A connected controller which is not our child. 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  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...
 

Macros

#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 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...
 

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 , CT_NONE = 0 , CT_CORE = 1 , CT_MONITOR = 2 ,
  CT_BLACKLIST = 3 , CT_CORE_NO_HANDLERS = 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_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 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_neighbour (struct Neighbour *neighbour)
 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 void schedule_transmit_on_queue (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 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)
 Send ACK to communicator (if requested) and free cmc. More...
 
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 update_ephemeral (struct DistanceVector *dv)
 Ensure ephemeral keys in our dv are current. More...
 
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_HashCode *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 dh_key_derive_eph_pid (const struct GNUNET_CRYPTO_EcdhePrivateKey *priv_ephemeral, const struct GNUNET_PeerIdentity *target, const struct GNUNET_ShortHashCode *iv, struct DVKeyState *key)
 Derive backchannel encryption key material from priv_ephemeral and target and iv. More...
 
static void dh_key_derive_eph_pub (const struct GNUNET_CRYPTO_EcdhePublicKey *pub_ephemeral, const struct GNUNET_ShortHashCode *iv, struct DVKeyState *key)
 Derive backchannel encryption key material from GST_my_private_key and pub_ephemeral and iv. 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 void 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)
 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 (const struct GNUNET_PeerIdentity *target, 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 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 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, const struct GNUNET_MessageHeader *msg)
 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 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 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 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 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, const 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 @ea 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 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 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 struct Queuefind_queue (const struct GNUNET_PeerIdentity *pid, const char *address)
 Find the queue matching pid and address. More...
 
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 meessage. More...
 
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 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 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 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 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 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 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 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 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 ("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(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 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...
 
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_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...
 
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 PendingAcknowledgementpa_head
 The most recent PA we have created, head of DLL. More...
 
static struct PendingAcknowledgementpa_tail
 The oldest PA we have created, tail of DLL. 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 unsigned int pa_count
 Number of entries in the pa_head/pa_tail DLL. 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...
 

Detailed Description

main for gnunet-service-tng

Author
Christian Grothoff

TODO: Implement next:

Optimizations-Statistics:

Optimizations-DV:

Optimizations-Fragmentation:

Optimizations-internals:

Definition in file gnunet-service-tng.c.

Macro Definition Documentation

◆ 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 88 of file gnunet-service-tng.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 102 of file gnunet-service-tng.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 108 of file gnunet-service-tng.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 114 of file gnunet-service-tng.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 120 of file gnunet-service-tng.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 130 of file gnunet-service-tng.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 136 of file gnunet-service-tng.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 thoughput, 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 146 of file gnunet-service-tng.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 155 of file gnunet-service-tng.c.

◆ MAX_DV_HOPS_ALLOWED

#define MAX_DV_HOPS_ALLOWED   16

Maximum DV distance allowed ever.

Definition at line 160 of file gnunet-service-tng.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 166 of file gnunet-service-tng.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 171 of file gnunet-service-tng.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 178 of file gnunet-service-tng.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 185 of file gnunet-service-tng.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 193 of file gnunet-service-tng.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 200 of file gnunet-service-tng.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 207 of file gnunet-service-tng.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 214 of file gnunet-service-tng.c.

◆ EPHEMERAL_VALIDITY

#define EPHEMERAL_VALIDITY    GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_HOURS, 4)

How long are ephemeral keys valid?

Definition at line 220 of file gnunet-service-tng.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 226 of file gnunet-service-tng.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 233 of file gnunet-service-tng.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 239 of file gnunet-service-tng.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 247 of file gnunet-service-tng.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 254 of file gnunet-service-tng.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 260 of file gnunet-service-tng.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 265 of file gnunet-service-tng.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 271 of file gnunet-service-tng.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 280 of file gnunet-service-tng.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 288 of file gnunet-service-tng.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 296 of file gnunet-service-tng.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 303 of file gnunet-service-tng.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 4524 of file gnunet-service-tng.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).

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_BLACKLIST 

It is a blacklist, query about allowed connections.

CT_CORE_NO_HANDLERS 

CORE client without any handlers.

Definition at line 951 of file gnunet-service-tng.c.

952 {
956  CT_NONE = 0,
957 
961  CT_CORE = 1,
962 
966  CT_MONITOR = 2,
967 
971  CT_COMMUNICATOR = 3,
972 
976  CT_APPLICATION = 4
977 };
@ 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 984 of file gnunet-service-tng.c.

985 {
989  RMO_NONE = 0,
990 
994  RMO_DV_ALLOWED = 1,
995 
1000 
1005 
1011  RMO_REDUNDANT = 4
1012 };
@ 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 2019 of file gnunet-service-tng.c.

2020 {
2024  PMT_CORE = 0,
2025 
2029  PMT_FRAGMENT_BOX = 1,
2030 
2034  PMT_RELIABILITY_BOX = 2,
2035 
2039  PMT_DV_BOX = 3
2040 };
@ 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 2792 of file gnunet-service-tng.c.

2793 {
2794  struct GNUNET_TIME_Absolute now;
2795 
2796  now = GNUNET_TIME_absolute_get ();
2797  return now.abs_value_us / GNUNET_TIME_UNIT_MINUTES.rel_value_us / 15;
2798 }
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:86
#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 2807 of file gnunet-service-tng.c.

2808 {
2810  GNUNET_assert (ir_total > 0);
2811  ir_total--;
2813  ir->wc = NULL;
2814  GNUNET_free (ir);
2815 }
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_watch_cancel(struct GNUNET_PEERSTORE_WatchContext *wc)
Cancel a watch request.
struct GNUNET_PEERSTORE_WatchContext * wc
Handle for watching the peerstore for HELLOs for this peer.

References GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_free, GNUNET_PEERSTORE_watch_cancel(), ir_head, ir_tail, ir_total, and IncomingRequest::wc.

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 2824 of file gnunet-service-tng.c.

2825 {
2826  struct Queue *q = pa->queue;
2827  struct PendingMessage *pm = pa->pm;
2828  struct DistanceVectorHop *dvh = pa->dvh;
2829 
2831  pa_count--;
2832  if (NULL != q)
2833  {
2834  GNUNET_CONTAINER_MDLL_remove (queue, q->pa_head, q->pa_tail, pa);
2835  pa->queue = NULL;
2836  }
2837  if (NULL != pm)
2838  {
2839  GNUNET_CONTAINER_MDLL_remove (pm, pm->pa_head, pm->pa_tail, pa);
2840  pa->pm = NULL;
2841  }
2842  if (NULL != dvh)
2843  {
2844  GNUNET_CONTAINER_MDLL_remove (dvh, dvh->pa_head, dvh->pa_tail, pa);
2845  pa->queue = NULL;
2846  }
2849  &pa->ack_uuid.value,
2850  pa));
2851  GNUNET_free (pa);
2852 }
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 PendingAcknowledgement * pa_head
The most recent PA we have created, head of DLL.
static struct PendingAcknowledgement * pa_tail
The oldest PA we have created, tail of DLL.
static unsigned int pa_count
Number of entries in the pa_head/pa_tail DLL.
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.
@ GNUNET_YES
Definition: gnunet_common.h:97
#define GNUNET_CONTAINER_MDLL_remove(mdll, head, tail, element)
Remove an element from a MDLL.
int 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.
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_free, GNUNET_YES, pa_count, DistanceVectorHop::pa_head, pa_head, DistanceVectorHop::pa_tail, 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 2864 of file gnunet-service-tng.c.

2865 {
2866  struct PendingMessage *frag;
2867 
2868  while (NULL != (frag = root->head_frag))
2869  {
2870  struct PendingAcknowledgement *pa;
2871 
2872  free_fragment_tree (frag);
2873  while (NULL != (pa = frag->pa_head))
2874  {
2875  GNUNET_CONTAINER_MDLL_remove (pm, frag->pa_head, frag->pa_tail, pa);
2876  pa->pm = NULL;
2877  }
2878  GNUNET_CONTAINER_MDLL_remove (frag, root->head_frag, root->tail_frag, frag);
2879  GNUNET_free (frag);
2880  }
2881 }
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 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.

References GNUNET_CONTAINER_MDLL_remove, GNUNET_free, PendingMessage::head_frag, PendingMessage::pa_head, PendingMessage::pa_tail, PendingAcknowledgement::pm, pm, and PendingMessage::tail_frag.

Referenced by completed_pending_message(), and free_pending_message().

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 2892 of file gnunet-service-tng.c.

2893 {
2894  struct TransportClient *tc = pm->client;
2895  struct VirtualLink *vl = pm->vl;
2896  struct PendingAcknowledgement *pa;
2897 
2898  if (NULL != tc)
2899  {
2901  tc->details.core.pending_msg_head,
2902  tc->details.core.pending_msg_tail,
2903  pm);
2904  }
2905  if (NULL != vl)
2906  {
2908  vl->pending_msg_head,
2909  vl->pending_msg_tail,
2910  pm);
2911  }
2912  while (NULL != (pa = pm->pa_head))
2913  {
2914  GNUNET_CONTAINER_MDLL_remove (pm, pm->pa_head, pm->pa_tail, pa);
2915  pa->pm = NULL;
2916  }
2917 
2919  if (NULL != pm->qe)
2920  {
2921  GNUNET_assert (pm == pm->qe->pm);
2922  pm->qe->pm = NULL;
2923  }
2924  if (NULL != pm->bpm)
2925  {
2926  free_fragment_tree (pm->bpm);
2927  GNUNET_free (pm->bpm);
2928  }
2929  GNUNET_free (pm);
2930 }
static struct GNUNET_SCHEDULER_TaskContext tc
Task context of the current task.
Definition: scheduler.c:423
Client connected to the transport service.

References free_fragment_tree(), GNUNET_assert, GNUNET_CONTAINER_MDLL_remove, GNUNET_free, VirtualLink::pending_msg_head, VirtualLink::pending_msg_tail, PendingAcknowledgement::pm, pm, 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_virtual_link()

static void free_virtual_link ( struct VirtualLink vl)
static

Free virtual link.

Parameters
vllink data to free

Definition at line 2939 of file gnunet-service-tng.c.

2940 {
2941  struct PendingMessage *pm;
2942  struct CoreSentContext *csc;
2943 
2944  while (NULL != (pm = vl->pending_msg_head))
2948  if (NULL != vl->visibility_task)
2949  {
2951  vl->visibility_task = NULL;
2952  }
2953  if (NULL != vl->fc_retransmit_task)
2954  {
2956  vl->fc_retransmit_task = NULL;
2957  }
2958  while (NULL != (csc = vl->csc_head))
2959  {
2961  GNUNET_assert (vl == csc->vl);
2962  csc->vl = NULL;
2963  }
2964  GNUNET_break (NULL == vl->n);
2965  GNUNET_break (NULL == vl->dv);
2966  GNUNET_free (vl);
2967 }
static void free_pending_message(struct PendingMessage *pm)
Release memory associated with pm and remove pm from associated data structures.
static struct GNUNET_CONTAINER_MultiPeerMap * links
Map from PIDs to struct VirtualLink entries describing links CORE knows to exist.
int 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.
#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:972
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(), GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_free, GNUNET_SCHEDULER_cancel(), GNUNET_YES, links, VirtualLink::n, VirtualLink::pending_msg_head, pm, 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 2976 of file gnunet-service-tng.c.

2977 {
2978  GNUNET_assert (
2979  GNUNET_YES ==
2982  vs->hn = NULL;
2983  if (NULL != vs->sc)
2984  {
2986  vs->sc = NULL;
2987  }
2988  GNUNET_free (vs->address);
2989  GNUNET_free (vs);
2990 }
static struct GNUNET_CONTAINER_MultiPeerMap * validation_map
Map from PIDs to struct ValidationState entries describing addresses we are aware of and their validi...
void * GNUNET_CONTAINER_heap_remove_node(struct GNUNET_CONTAINER_HeapNode *node)
Removes a node from the heap.
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_multipeermap_remove(), GNUNET_free, GNUNET_PEERSTORE_store_cancel(), GNUNET_YES, ValidationState::pid, 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 3000 of file gnunet-service-tng.c.

3001 {
3003 }
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(), handle_add_queue_message(), handle_dv_box(), handle_dv_learn(), handle_fragment_box(), handle_validation_challenge(), and learn_dv_path().

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 3013 of file gnunet-service-tng.c.

3014 {
3016 }

References GNUNET_CONTAINER_multipeermap_get(), links, and pid.

Referenced by activate_core_visible_dv_path(), free_queue(), handle_client_recv_ok(), handle_client_send(), handle_flow_control(), handle_raw_message(), handle_validation_challenge(), and handle_validation_response().

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 3062 of file gnunet-service-tng.c.

3063 {
3064  struct Neighbour *n = dvh->next_hop;
3065  struct DistanceVector *dv = dvh->dv;
3066  struct PendingAcknowledgement *pa;
3067 
3068  while (NULL != (pa = dvh->pa_head))
3069  {
3071  pa->dvh = NULL;
3072  }
3073  GNUNET_CONTAINER_MDLL_remove (neighbour, n->dv_head, n->dv_tail, dvh);
3075  GNUNET_free (dvh);
3076 }
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 connected controller which is not our child.
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 3502 of file gnunet-service-tng.c.

3503 {
3504  struct VirtualLink *vl = cls;
3505  struct DistanceVector *dv = vl->dv;
3506  struct Neighbour *n = vl->n;
3507  struct GNUNET_TIME_Absolute dvh_timeout;
3508  struct GNUNET_TIME_Absolute q_timeout;
3509 
3511  "Checking if link is down\n");
3512  vl->visibility_task = NULL;
3513  dvh_timeout = GNUNET_TIME_UNIT_ZERO_ABS;
3514  if (NULL != dv)
3515  {
3516  for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
3517  pos = pos->next_dv)
3518  dvh_timeout = GNUNET_TIME_absolute_max (dvh_timeout,
3519  pos->path_valid_until);
3520  if (0 == GNUNET_TIME_absolute_get_remaining (dvh_timeout).rel_value_us)
3521  {
3522  vl->dv->vl = NULL;
3523  vl->dv = NULL;
3524  }
3525  }
3526  q_timeout = GNUNET_TIME_UNIT_ZERO_ABS;
3527  for (struct Queue *q = n->queue_head; NULL != q; q = q->next_neighbour)
3528  q_timeout = GNUNET_TIME_absolute_max (q_timeout, q->validated_until);
3529  if (0 == GNUNET_TIME_absolute_get_remaining (q_timeout).rel_value_us)
3530  {
3531  vl->n->vl = NULL;
3532  vl->n = NULL;
3533  }
3534  if ((NULL == vl->n) && (NULL == vl->dv))
3535  {
3537  free_virtual_link (vl);
3538  return;
3539  }
3540  vl->visibility_task =
3541  GNUNET_SCHEDULER_add_at (GNUNET_TIME_absolute_max (q_timeout, dvh_timeout),
3542  &check_link_down,
3543  vl);
3544 }
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...
#define GNUNET_log(kind,...)
@ GNUNET_ERROR_TYPE_DEBUG
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:1246
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:232
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:224
#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 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(), 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 3095 of file gnunet-service-tng.c.

3096 {
3098  "Informing CORE clients about disconnect from %s\n",
3099  GNUNET_i2s (pid));
3100  for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3101  {
3102  struct GNUNET_MQ_Envelope *env;
3103  struct DisconnectInfoMessage *dim;
3104 
3105  if (CT_CORE != tc->type)
3106  continue;
3108  dim->peer = *pid;
3109  GNUNET_MQ_send (tc->mq, env);
3110  }
3111 }
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
static struct TransportClient * clients_head
Head of linked list of all clients to this service.
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:355
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
#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:150
struct GNUNET_PeerIdentity peer
Who got disconnected?
Definition: transport.h:164

References clients_head, CT_CORE, env, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_DISCONNECT, GNUNET_MQ_msg, GNUNET_MQ_send(), DisconnectInfoMessage::peer, 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 3121 of file gnunet-service-tng.c.

3122 {
3123  struct DistanceVectorHop *dvh;
3124 
3125  while (NULL != (dvh = dv->dv_head))
3127  if (NULL == dv->dv_head)
3128  {
3129  struct VirtualLink *vl;
3130 
3131  GNUNET_assert (
3132  GNUNET_YES ==
3134  if (NULL != (vl = dv->vl))
3135  {
3136  GNUNET_assert (dv == vl->dv);
3137  vl->dv = NULL;
3138  if (NULL == vl->n)
3139  {
3141  free_virtual_link (vl);
3142  }
3143  else
3144  {
3147  }
3148  dv->vl = NULL;
3149  }
3150 
3151  if (NULL != dv->timeout_task)
3152  {
3154  dv->timeout_task = NULL;
3155  }
3156  GNUNET_free (dv);
3157  }
3158 }
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:1296
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, 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 3175 of file gnunet-service-tng.c.

3180 {
3181  struct GNUNET_MQ_Envelope *env;
3182  struct GNUNET_TRANSPORT_MonitorData *md;
3183  size_t addr_len = strlen (address) + 1;
3184 
3185  env = GNUNET_MQ_msg_extra (md,
3186  addr_len,
3188  md->nt = htonl ((uint32_t) nt);
3189  md->peer = *peer;
3190  md->last_validation = GNUNET_TIME_absolute_hton (me->last_validation);
3191  md->valid_until = GNUNET_TIME_absolute_hton (me->valid_until);
3192  md->next_validation = GNUNET_TIME_absolute_hton (me->next_validation);
3193  md->rtt = GNUNET_TIME_relative_hton (me->rtt);
3194  md->cs = htonl ((uint32_t) me->cs);
3195  md->num_msg_pending = htonl (me->num_msg_pending);
3196  md->num_bytes_pending = htonl (me->num_bytes_pending);
3197  memcpy (&md[1], address, addr_len);
3198  GNUNET_MQ_send (tc->mq, env);
3199 }
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:52
#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:444
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition: time.c:464
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.

References address, env, GNUNET_MESSAGE_TYPE_TRANSPORT_MONITOR_DATA, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_relative_hton(), me, nt, peer, and tc.

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 3212 of file gnunet-service-tng.c.

3216 {
3217  for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3218  {
3219  if (CT_MONITOR != tc->type)
3220  continue;
3221  if (tc->details.monitor.one_shot)
3222  continue;
3223  if ((GNUNET_NO == GNUNET_is_zero (&tc->details.monitor.peer)) &&
3224  (0 != GNUNET_memcmp (&tc->details.monitor.peer, peer)))
3225  continue;
3227  }
3228 }
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
Definition: gnunet_common.h:94

References address, clients_head, CT_MONITOR, GNUNET_is_zero, GNUNET_memcmp, GNUNET_NO, me, notify_monitor(), nt, 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 3241 of file gnunet-service-tng.c.

3244 {
3245  struct TransportClient *tc;
3246 
3247  (void) cls;
3248  tc = GNUNET_new (struct TransportClient);
3249  tc->client = client;
3250  tc->mq = mq;
3252  GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Client %p connected\n", tc);
3253  return tc;
3254 }
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.

◆ free_reassembly_context()

static void free_reassembly_context ( struct ReassemblyContext rc)
static

Free rc.

Parameters
rcdata structure to free

Definition at line 3263 of file gnunet-service-tng.c.

3264 {
3265  struct Neighbour *n = rc->neighbour;
3266 
3270  rc->msg_uuid.uuid,
3271  rc));
3272  GNUNET_free (rc);
3273 }
@ GNUNET_OK
Definition: gnunet_common.h:95
int GNUNET_CONTAINER_multihashmap32_remove(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, const void *value)
Remove the given key-value pair from the map.
uint64_t uuid
Unique value, generated by incrementing the message_uuid_ctr of struct Neighbour.
struct GNUNET_CONTAINER_MultiHashMap32 * reassembly_map
Map with struct ReassemblyContext structs for fragments under reassembly.
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 Neighbour * neighbour
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, ReassemblyContext::neighbour, Neighbour::reassembly_map, and MessageUUIDP::uuid.

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 3282 of file gnunet-service-tng.c.

3283 {
3284  struct Neighbour *n = cls;
3285  struct ReassemblyContext *rc;
3286 
3287  n->reassembly_timeout_task = NULL;
3288  while (NULL != (rc = GNUNET_CONTAINER_heap_peek (n->reassembly_heap)))
3289  {
3291  .rel_value_us)
3292  {
3294  continue;
3295  }
3300  n);
3301  return;
3302  }
3303 }
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.
uint64_t rel_value_us
The actual value.
struct GNUNET_CONTAINER_Heap * reassembly_heap
Heap with struct ReassemblyContext structs for fragments under reassembly.
struct GNUNET_SCHEDULER_Task * reassembly_timeout_task
Task to free old entries from the reassembly_heap and reassembly_map.
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(), Neighbour::reassembly_heap, ReassemblyContext::reassembly_timeout, Neighbour::reassembly_timeout_task, and GNUNET_TIME_Relative::rel_value_us.

Referenced by handle_fragment_box().

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 3315 of file gnunet-service-tng.c.

3316 {
3317  struct ReassemblyContext *rc = value;
3318 
3319  (void) cls;
3320  (void) key;
3322  return GNUNET_OK;
3323 }
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_neighbour().

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

◆ free_neighbour()

static void free_neighbour ( struct Neighbour neighbour)
static

Release memory used by neighbour.

Parameters
neighbourneighbour entry to free

Definition at line 3332 of file gnunet-service-tng.c.

3333 {
3334  struct DistanceVectorHop *dvh;
3335  struct VirtualLink *vl;
3336 
3337  GNUNET_assert (NULL == neighbour->queue_head);
3340  &neighbour->pid,
3341  neighbour));
3343  "Freeing neighbour\n");
3344  if (NULL != neighbour->reassembly_map)
3345  {
3348  NULL);
3350  neighbour->reassembly_map = NULL;
3352  neighbour->reassembly_heap = NULL;
3353  }
3354  while (NULL != (dvh = neighbour->dv_head))
3355  {
3356  struct DistanceVector *dv = dvh->dv;
3357 
3359  if (NULL == dv->dv_head)
3360  free_dv_route (dv);
3361  }
3362  if (NULL != neighbour->reassembly_timeout_task)
3363  {
3365  neighbour->reassembly_timeout_task = NULL;
3366  }
3367  if (NULL != neighbour->get)
3368  {
3369  GNUNET_PEERSTORE_iterate_cancel (neighbour->get);
3370  neighbour->get = NULL;
3371  }
3372  if (NULL != neighbour->sc)
3373  {
3374  GNUNET_PEERSTORE_store_cancel (neighbour->sc);
3375  neighbour->sc = NULL;
3376  }
3377  if (NULL != (vl = neighbour->vl))
3378  {
3379  GNUNET_assert (neighbour == vl->n);
3380  vl->n = NULL;
3381  if (NULL == vl->dv)
3382  {
3385  }
3386  else
3387  {
3390  }
3391  neighbour->vl = NULL;
3392  }
3393  GNUNET_free (neighbour);
3394 }
static int free_reassembly_cb(void *cls, uint32_t key, void *value)
function called to free_reassembly_context().
static void free_dv_route(struct DistanceVector *dv)
Free entry in dv_routes.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MulitHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
void GNUNET_CONTAINER_multihashmap32_destroy(struct GNUNET_CONTAINER_MultiHashMap32 *map)
Destroy a 32-bit key hash map.
void GNUNET_CONTAINER_heap_destroy(struct GNUNET_CONTAINER_Heap *heap)
Destroys the heap.
void GNUNET_PEERSTORE_iterate_cancel(struct GNUNET_PEERSTORE_IterateContext *ic)
Cancel an iterate request Please do not call after the iterate request is done.
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_reassembly_cb(), free_virtual_link(), Neighbour::get, GNUNET_assert, 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_PEERSTORE_iterate_cancel(), GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, VirtualLink::n, neighbours, Neighbour::pid, Neighbour::queue_head, Neighbour::reassembly_heap, Neighbour::reassembly_map, Neighbour::reassembly_timeout_task, 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 3404 of file gnunet-service-tng.c.

3406 {
3407  struct GNUNET_MQ_Envelope *env;
3408  struct ConnectInfoMessage *cim;
3409 
3410  GNUNET_assert (CT_CORE == tc->type);
3412  cim->id = *pid;
3413  GNUNET_MQ_send (tc->mq, env);
3414 }
#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:118
struct GNUNET_PeerIdentity id
Identity of the new neighbour.
Definition: transport.h:141

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 3423 of file gnunet-service-tng.c.

3424 {
3426  "Informing CORE clients about connection to %s\n",
3427  GNUNET_i2s (pid));
3428  for (struct TransportClient *tc = clients_head; NULL != tc; tc = tc->next)
3429  {
3430  if (CT_CORE != tc->type)
3431  continue;
3433  }
3434 }
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 8827 of file gnunet-service-tng.c.

8828 {
8829  struct Queue *queue = cls;
8830  struct Neighbour *n = queue->neighbour;
8832  struct PendingMessage *pm;
8833 
8834  queue->transmit_task = NULL;
8835  if (NULL == n->vl)
8836  {
8838  "Virtual link `%s' is down, cannot have PM for queue `%s'\n",
8839  GNUNET_i2s (&n->pid),
8840  queue->address);
8841  queue->idle = GNUNET_YES;
8842  return;
8843  }
8844  memset (&sc, 0, sizeof(sc));
8845  select_best_pending_from_link (&sc, queue, n->vl, NULL, 0);
8846  if (NULL == sc.best)
8847  {
8848  /* Also look at DVH that have the n as first hop! */
8849  for (struct DistanceVectorHop *dvh = n->dv_head; NULL != dvh;
8850  dvh = dvh->next_neighbour)
8851  {
8853  queue,
8854  dvh->dv->vl,
8855  dvh,
8856  sizeof(struct GNUNET_PeerIdentity)
8857  * (1 + dvh->distance)
8858  + sizeof(struct TransportDVBoxMessage)
8859  + sizeof(struct TransportDVBoxPayloadP));
8860  }
8861  }
8862  if (NULL == sc.best)
8863  {
8864  /* no message pending, nothing to do here! */
8866  "No pending messages, queue `%s' to %s now idle\n",
8867  queue->address,
8868  GNUNET_i2s (&n->pid));
8869  queue->idle = GNUNET_YES;
8870  return;
8871  }
8872  /* There is a message pending, we are certainly not idle */
8873  queue->idle = GNUNET_NO;
8874 
8875  /* Given selection in `sc`, do transmission */
8876  pm = sc.best;
8877  if (NULL != sc.dvh)
8878  {
8879  GNUNET_assert (PMT_DV_BOX != pm->pmt);
8880  if (NULL != sc.best->bpm)
8881  {
8882  /* We did this boxing before, but possibly for a different path!
8883  Discard old DV box! OPTIMIZE-ME: we might want to check if
8884  it is the same and then not re-build the message... */
8885  free_pending_message (sc.best->bpm);
8886  sc.best->bpm = NULL;
8887  }
8888  encapsulate_for_dv (sc.dvh->dv,
8889  1,
8890  &sc.dvh,
8891  (const struct GNUNET_MessageHeader *) &sc.best[1],
8892  &extract_box_cb,
8893  &sc,
8894  RMO_NONE);
8895  GNUNET_assert (NULL != sc.best->bpm);
8896  pm = sc.best->bpm;
8897  }
8898  if (GNUNET_YES == sc.frag)
8899  {
8900  pm = fragment_message (queue, sc.dvh, pm);
8901  if (NULL == pm)
8902  {
8904  "Fragmentation failed queue %s to %s for <%llu>, trying again\n",
8905  queue->address,
8906  GNUNET_i2s (&n->pid),
8907  sc.best->logging_uuid);
8909  return;
8910  }
8911  }
8912  else if (GNUNET_YES == sc.relb)
8913  {
8914  pm = reliability_box_message (queue, sc.dvh, pm);
8915  if (NULL == pm)
8916  {
8917  /* Reliability boxing failed, try next message... */
8918  GNUNET_log (
8920  "Reliability boxing failed queue %s to %s for <%llu>, trying again\n",
8921  queue->address,
8922  GNUNET_i2s (&n->pid),
8923  sc.best->logging_uuid);
8925  return;
8926  }
8927  }
8928 
8929  /* Pass 'pm' for transission to the communicator */
8930  GNUNET_log (
8932  "Passing message <%llu> to queue %s for peer %s (considered %u others)\n",
8933  pm->logging_uuid,
8934  queue->address,
8935  GNUNET_i2s (&n->pid),
8936  sc.consideration_counter);
8937 
8938  /* Flow control: increment amount of traffic sent; if we are routing
8939  via DV (and thus the ultimate target of the pending message is for
8940  a different virtual link than the one of the queue), then we need
8941  to use up not only the window of the direct link but also the
8942  flow control window for the DV link! */
8943  pm->vl->outbound_fc_window_size_used += pm->bytes_msg;
8944 
8945  if (pm->vl != queue->neighbour->vl)
8946  {
8947  /* If the virtual link of the queue differs, this better be distance
8948  vector routing! */
8949  GNUNET_assert (NULL != sc.dvh);
8950  /* If we do distance vector routing, we better not do this for a
8951  message that was itself DV-routed */
8952  GNUNET_assert (PMT_DV_BOX != sc.best->pmt);
8953  /* We use the size of the unboxed message here, to avoid counting
8954  the DV-Box header which is eaten up on the way by intermediaries */
8955  queue->neighbour->vl->outbound_fc_window_size_used += sc.best->bytes_msg;
8956  }
8957  else
8958  {
8959  GNUNET_assert (NULL == sc.dvh);
8960  }
8961 
8962  queue_send_msg (queue, pm, &pm[1], pm->bytes_msg);
8963 
8964  /* Check if this transmission somehow conclusively finished handing 'pm'
8965  even without any explicit ACKs */
8966  if ((PMT_CORE == pm->pmt) ||
8967  (GNUNET_TRANSPORT_CC_RELIABLE == queue->tc->details.communicator.cc))
8968  {
8970  }
8971  else
8972  {
8973  /* Message not finished, waiting for acknowledgement.
8974  Update time by which we might retransmit 's' based on queue
8975  characteristics (i.e. RTT); it takes one RTT for the message to
8976  arrive and the ACK to come back in the best case; but the other
8977  side is allowed to delay ACKs by 2 RTTs, so we use 4 RTT before
8978  retransmitting.
8979 
8980  OPTIMIZE: Note that in the future this heuristic should likely
8981  be improved further (measure RTT stability, consider message
8982  urgency and size when delaying ACKs, etc.) */
8985  GNUNET_TIME_relative_multiply (queue->pd.aged_rtt,
8986  4)));
8987  }
8988  /* finally, re-schedule queue transmission task itself */
8990 }
static struct GNUNET_FS_SearchContext * sc
Definition: gnunet-search.c:37
static struct PendingMessage * reliability_box_message(struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
Reliability-box the given pm.
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 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 struct PendingMessage * fragment_message(struct Queue *queue, struct DistanceVectorHop *dvh, struct PendingMessage *pm)
Fragment the given pm to the given mtu.
static void schedule_transmit_on_queue(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 ...
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 ...
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)
Pick a path of dv under constraints options and schedule transmission of hdr.
@ GNUNET_SCHEDULER_PRIORITY_DEFAULT
Run with the default priority (normal P2P operations).
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:181
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:311
@ GNUNET_TRANSPORT_CC_RELIABLE
Transmission is reliabile (with ACKs), e.g.
struct DistanceVectorHop * next_neighbour
Kept in a MDLL.
Header for all communications.
The identity of the host (wraps the signing key of the peer).
Context for select_best_pending_from_link().
Outer layer of an encapsulated message send over multiple hops.
Plaintext of the variable-size payload that is encrypted within a struct TransportBackchannelEncapsul...

References completed_pending_message(), Neighbour::dv_head, encapsulate_for_dv(), extract_box_cb(), fragment_message(), free_pending_message(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_TIME_relative_multiply(), GNUNET_TIME_relative_to_absolute(), GNUNET_TRANSPORT_CC_RELIABLE, GNUNET_YES, DistanceVectorHop::next_neighbour, Neighbour::pid, pm, PMT_CORE, PMT_DV_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:

◆ schedule_transmit_on_queue()

static void schedule_transmit_on_queue ( 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 3456 of file gnunet-service-tng.c.

3458 {
3459  if (queue->tc->details.communicator.total_queue_length >=
3461  {
3463  "Transmission throttled due to communicator queue limit\n");
3465  GST_stats,
3466  "# Transmission throttled due to communicator queue limit",
3467  1,
3468  GNUNET_NO);
3469  queue->idle = GNUNET_NO;
3470  return;
3471  }
3472  if (queue->queue_length >= QUEUE_LENGTH_LIMIT)
3473  {
3475  "Transmission throttled due to communicator queue length limit\n");
3477  "# Transmission throttled due to queue queue limit",
3478  1,
3479  GNUNET_NO);
3480  queue->idle = GNUNET_NO;
3481  return;
3482  }
3483  /* queue might indeed be ready, schedule it */
3484  if (NULL != queue->transmit_task)
3485  GNUNET_SCHEDULER_cancel (queue->transmit_task);
3486  queue->transmit_task =
3489  "Considering transmission on queue `%s' to %s\n",
3490  queue->address,
3491  GNUNET_i2s (&queue->neighbour->pid));
3492 }
static struct GNUNET_OS_Process * p
Helper process we started.
Definition: gnunet-qr.c:59
#define QUEUE_LENGTH_LIMIT
How many messages can we have pending for a given queue (queue to a particular peer via a communicato...
#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.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_with_priority(enum GNUNET_SCHEDULER_Priority prio, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified priority.
Definition: scheduler.c:1223
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.

References COMMUNICATOR_TOTAL_QUEUE_LIMIT, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_add_with_priority(), GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GST_stats, p, queue(), QUEUE_LENGTH_LIMIT, and transmit_on_queue().

Referenced by check_vl_transmission(), free_queue(), handle_add_queue_message(), handle_send_message_ack(), 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 3553 of file gnunet-service-tng.c.

3554 {
3555  struct Neighbour *neighbour = queue->neighbour;
3556  struct TransportClient *tc = queue->tc;
3557  struct MonitorEvent me = { .cs = GNUNET_TRANSPORT_CS_DOWN,
3559  struct QueueEntry *qe;
3560  int maxxed;
3561  struct PendingAcknowledgement *pa;
3562  struct VirtualLink *vl;
3563 
3565  "Cleaning up queue %u\n", queue->qid);
3566  if (NULL != queue->transmit_task)
3567  {
3568  GNUNET_SCHEDULER_cancel (queue->transmit_task);
3569  queue->transmit_task = NULL;
3570  }
3571  while (NULL != (pa = queue->pa_head))
3572  {
3573  GNUNET_CONTAINER_MDLL_remove (queue, queue->pa_head, queue->pa_tail, pa);
3574  pa->queue = NULL;
3575  }
3576 
3577  GNUNET_CONTAINER_MDLL_remove (neighbour,
3578  neighbour->queue_head,
3579  neighbour->queue_tail,
3580  queue);
3582  tc->details.communicator.queue_head,
3583  tc->details.communicator.queue_tail,
3584  queue);
3585  maxxed = (COMMUNICATOR_TOTAL_QUEUE_LIMIT >=
3586  tc->details.communicator.total_queue_length);
3587  while (NULL != (qe = queue->queue_head))
3588  {
3589  GNUNET_CONTAINER_DLL_remove (queue->queue_head, queue->queue_tail, qe);
3590  queue->queue_length--;
3591  tc->details.communicator.total_queue_length--;
3592  if (NULL != qe->pm)
3593  {
3594  GNUNET_assert (qe == qe->pm->qe);
3595  qe->pm->qe = NULL;
3596  }
3597  GNUNET_free (qe);
3598  }
3599  GNUNET_assert (0 == queue->queue_length);
3600  if ((maxxed) && (COMMUNICATOR_TOTAL_QUEUE_LIMIT <
3601  tc->details.communicator.total_queue_length))
3602  {
3603  /* Communicator dropped below threshold, resume all _other_ queues */
3605  GST_stats,
3606  "# Transmission throttled due to communicator queue limit",
3607  -1,
3608  GNUNET_NO);
3609  for (struct Queue *s = tc->details.communicator.queue_head; NULL != s;
3610  s = s->next_client)
3612  }
3613  notify_monitors (&neighbour->pid, queue->address, queue->nt, &me);
3614  GNUNET_free (queue);
3615 
3616  vl = lookup_virtual_link (&neighbour->pid);
3617  if ((NULL != vl) && (neighbour == vl->n))
3618  {
3620  check_link_down (vl);
3621  }
3622  if (NULL == neighbour->queue_head)
3623  {
3624  free_neighbour (neighbour);
3625  }
3626 }
static struct GNUNET_DATASTORE_QueueEntry * qe
Current operation.
static void free_neighbour(struct Neighbour *neighbour)
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.
#define GNUNET_TIME_UNIT_FOREVER_REL
Constant used to specify "forever".
@ 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.
An entry in the operation queue.

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_SCHEDULER_cancel(), GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_STATISTICS_update(), GNUNET_TIME_UNIT_FOREVER_REL, 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 3635 of file gnunet-service-tng.c.

3636 {
3637  struct TransportClient *tc = ale->tc;
3638 
3639  GNUNET_CONTAINER_DLL_remove (tc->details.communicator.addr_head,
3640  tc->details.communicator.addr_tail,
3641  ale);
3642  if (NULL != ale->sc)
3643  {
3645  ale->sc = NULL;
3646  }
3647  if (NULL != ale->st)
3648  {
3649  GNUNET_SCHEDULER_cancel (ale->st);
3650  ale->st = NULL;
3651  }
3652  GNUNET_free (ale);
3653 }
struct TransportClient * tc
Which communicator provides this 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_free, GNUNET_PEERSTORE_store_cancel(), GNUNET_SCHEDULER_cancel(), AddressListEntry::sc, AddressListEntry::st, AddressListEntry::tc, and 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 3665 of file gnunet-service-tng.c.

3668 {
3669  struct TransportClient *tc = cls;
3670  struct PeerRequest *pr = value;
3671 
3673  pr->wc = NULL;
3674  GNUNET_assert (
3675  GNUNET_YES ==
3676  GNUNET_CONTAINER_multipeermap_remove (tc->details.application.requests,
3677  pid,
3678  pr));
3679  GNUNET_free (pr);
3680 
3681  return GNUNET_OK;
3682 }
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_watch_cancel(), 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 10099 of file gnunet-service-tng.c.

10100 {
10101  struct LearnLaunchEntry *lle;
10102 
10103  (void) cls;
10105  &free_neighbour_cb, NULL);
10106  if (NULL != validation_task)
10107  {
10109  validation_task = NULL;
10110  }
10111  if (NULL != dvlearn_task)
10112  {
10114  dvlearn_task = NULL;
10115  }
10116  if (NULL != GST_stats)
10117  {
10119  GST_stats = NULL;
10120  }
10121  if (NULL != GST_my_private_key)
10122  {
10124  GST_my_private_key = NULL;
10125  }
10128  NULL);
10130  ack_cummulators = NULL;
10133  NULL);
10135  pending_acks = NULL;
10138  neighbours = NULL;
10141  links = NULL;
10144  NULL);
10146  backtalkers = NULL;
10149  NULL);
10151  validation_map = NULL;
10152  while (NULL != ir_head)
10154  GNUNET_assert (0 == ir_total);
10155  while (NULL != (lle = lle_head))
10156  {
10158  GNUNET_free (lle);
10159  }
10160  if (NULL != peerstore)
10161  {
10163  "Disconnecting from PEERSTORE service\n");
10165  peerstore = NULL;
10166  }
10168  dvlearn_map = NULL;
10170  validation_heap = NULL;
10173  dv_routes = NULL;
10175 }
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.
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.
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.
int 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_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_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.
void GNUNET_PEERSTORE_disconnect(struct GNUNET_PEERSTORE_Handle *h, int sync_first)
Disconnect from the PEERSTORE service.
void GNUNET_SCHEDULER_shutdown(void)
Request the shutdown of a scheduler.
Definition: scheduler.c:531
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_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_log, GNUNET_NO, GNUNET_PEERSTORE_disconnect(), GNUNET_SCHEDULER_cancel(), GNUNET_SCHEDULER_shutdown(), GNUNET_STATISTICS_destroy(), GST_my_private_key, GST_stats, ir_head, ir_total, links, lle_head, lle_tail, neighbours, peerstore, pending_acks, 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 3697 of file gnunet-service-tng.c.

3700 {
3701  struct TransportClient *tc = app_ctx;
3702 
3703  (void) cls;
3704  (void) client;
3706  switch (tc->type)
3707  {
3708  case CT_NONE:
3710  "Unknown Client %p disconnected, cleaning up.\n",
3711  tc);
3712  break;
3713 
3714  case CT_CORE: {
3716  "CORE Client %p disconnected, cleaning up.\n",
3717  tc);
3718 
3719  struct PendingMessage *pm;
3720 
3721  while (NULL != (pm = tc->details.core.pending_msg_head))
3722  {
3724  tc->details.core.pending_msg_head,
3725  tc->details.core.pending_msg_tail,
3726  pm);
3727  pm->client = NULL;
3728  }
3729  }
3730  break;
3731 
3732  case CT_MONITOR:
3734  "MONITOR Client %p disconnected, cleaning up.\n",
3735  tc);
3736 
3737  break;
3738 
3739  case CT_COMMUNICATOR: {
3741  "COMMUNICATOR Client %p disconnected, cleaning up.\n",
3742  tc);
3743 
3744  struct Queue *q;
3745  struct AddressListEntry *ale;
3746 
3747  while (NULL != (q = tc->details.communicator.queue_head))
3748  free_queue (q);
3749  while (NULL != (ale = tc->details.communicator.addr_head))
3751  GNUNET_free (tc->details.communicator.address_prefix);
3752  }
3753  break;
3754 
3755  case CT_APPLICATION:
3757  "APPLICATION Client %p disconnected, cleaning up.\n",
3758  tc);
3759 
3760  GNUNET_CONTAINER_multipeermap_iterate (tc->details.application.requests,
3762  tc);
3763  GNUNET_CONTAINER_multipeermap_destroy (tc->details.application.requests);
3764  break;
3765  }
3766  GNUNET_free (tc);
3767  if ((GNUNET_YES == in_shutdown) && (NULL == clients_head))
3768  {
3770  "Our last client disconnected\n");
3771  do_shutdown (cls);
3772  }
3773 }
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_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 3786 of file gnunet-service-tng.c.

3789 {
3790  struct TransportClient *tc = cls;
3791 
3792  (void) value;
3794  "Telling new CORE client about existing connection to %s\n",
3795  GNUNET_i2s (pid));
3797  return GNUNET_OK;
3798 }

References core_send_connect_info(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, 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:

◆ 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 3810 of file gnunet-service-tng.c.

3811 {
3812  struct TransportClient *tc = cls;
3813  uint32_t options;
3814 
3815  options = ntohl (start->options);
3816  if ((0 != (1 & options)) &&
3817  (0 != GNUNET_memcmp (&start->self, &GST_my_identity)))
3818  {
3819  /* client thinks this is a different peer, reject */
3820  GNUNET_break (0);
3821  GNUNET_SERVICE_client_drop (tc->client);
3822  return;
3823  }
3824  if (CT_NONE != tc->type)
3825  {
3826  GNUNET_break (0);
3827  GNUNET_SERVICE_client_drop (tc->client);
3828  return;
3829  }
3830  tc->type = CT_CORE;
3832  "New CORE client with PID %s registered\n",
3833  GNUNET_i2s (&start->self));
3836  tc);
3838 }
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:39
static struct GNUNET_PeerIdentity GST_my_identity
Our public key.
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:2325
void GNUNET_SERVICE_client_continue(struct GNUNET_SERVICE_Client *c)
Continue receiving further messages from the given client.
Definition: service.c:2244

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, neighbours, notify_client_connect_info(), options, 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 3848 of file gnunet-service-tng.c.

3849 {
3850  struct TransportClient *tc = cls;
3851  uint16_t size;
3852  const struct GNUNET_MessageHeader *obmm;
3853 
3854  if (CT_CORE != tc->type)
3855  {
3856  GNUNET_break (0);
3857  return GNUNET_SYSERR;
3858  }
3859  size = ntohs (obm->header.size) - sizeof(struct OutboundMessage);
3860  if (size < sizeof(struct GNUNET_MessageHeader))
3861  {
3862  GNUNET_break (0);
3863  return GNUNET_SYSERR;
3864  }
3865  obmm = (const struct GNUNET_MessageHeader *) &obm[1];
3866  if (size != ntohs (obmm->size))
3867  {
3868  GNUNET_break (0);
3869  return GNUNET_SYSERR;
3870  }
3871  return GNUNET_OK;
3872 }
@ GNUNET_SYSERR
Definition: gnunet_common.h:93
static unsigned int size
Size of the "table".
Definition: peer.c:67
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format.
Message used to notify the transport service about a message to be transmitted to another peer.
Definition: transport.h:285
struct GNUNET_MessageHeader header
Type will be GNUNET_MESSAGE_TYPE_TRANSPORT_SEND.
Definition: transport.h:289

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 3883 of file gnunet-service-tng.c.

3884 {
3885  struct TransportClient *tc = pm->client;
3886  struct VirtualLink *vl = pm->vl;
3887 
3888  if (NULL != tc)
3889  {
3890  struct GNUNET_MQ_Envelope *env;
3891  struct SendOkMessage *so_msg;
3892 
3894  so_msg->peer = vl->target;
3896  "Confirming transmission of <%llu> to %s\n",
3897  pm->logging_uuid,
3898  GNUNET_i2s (&vl->target));
3899  GNUNET_MQ_send (tc->mq, env);
3900  }
3902 }
#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:217
struct GNUNET_PeerIdentity peer
Which peer can send more now?
Definition: transport.h:251

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
hops_array[out]set to the result
hops_array_lengthlength of the hops_array
Returns
number of entries set in hops_array

Definition at line 3915 of file gnunet-service-tng.c.

3919 {
3920  uint64_t choices[hops_array_length];
3921  uint64_t num_dv;
3922  unsigned int dv_count;
3923 
3924  /* Pick random vectors, but weighted by distance, giving more weight
3925  to shorter vectors */
3926  num_dv = 0;
3927  dv_count = 0;
3928  for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
3929  pos = pos->next_dv)
3930  {
3931  if ((0 == (options & RMO_UNCONFIRMED_ALLOWED)) &&
3932  (GNUNET_TIME_absolute_get_remaining (pos->path_valid_until)
3933  .rel_value_us == 0))
3934  continue; /* pos unconfirmed and confirmed required */
3935  num_dv += MAX_DV_HOPS_ALLOWED - pos->distance;
3936  dv_count++;
3937  }
3938  if (0 == dv_count)
3939  return 0;
3940  if (dv_count <= hops_array_length)
3941  {
3942  dv_count = 0;
3943  for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
3944  pos = pos->next_dv)
3945  hops_array[dv_count++] = pos;
3946  return dv_count;
3947  }
3948  for (unsigned int i = 0; i < hops_array_length; i++)
3949  {
3950  int ok = GNUNET_NO;
3951  while (GNUNET_NO == ok)
3952  {
3953  choices[i] =
3955  ok = GNUNET_YES;
3956  for (unsigned int j = 0; j < i; j++)
3957  if (choices[i] == choices[j])
3958  {
3959  ok = GNUNET_NO;
3960  break;
3961  }
3962  }
3963  }
3964  dv_count = 0;
3965  num_dv = 0;
3966  for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
3967  pos = pos->next_dv)
3968  {
3969  uint32_t delta = MAX_DV_HOPS_ALLOWED - pos->distance;
3970 
3971  if ((0 == (options & RMO_UNCONFIRMED_ALLOWED)) &&
3972  (GNUNET_TIME_absolute_get_remaining (pos->path_valid_until)
3973  .rel_value_us == 0))
3974  continue; /* pos unconfirmed and confirmed required */
3975  for (unsigned int i = 0; i < hops_array_length; i++)
3976  if ((num_dv <= choices[i]) && (num_dv + delta > choices[i]))
3977  hops_array[dv_count++] = pos;
3978  num_dv += delta;
3979  }
3980  return dv_count;
3981 }
static int ok
Return value from 'main' (0 == success)
#define MAX_DV_HOPS_ALLOWED
Maximum DV distance allowed ever.
uint64_t GNUNET_CRYPTO_random_u64(enum GNUNET_CRYPTO_Quality mode, uint64_t max)
Random on unsigned 64-bit values.
@ 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:35

References 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, ok, options, GNUNET_TIME_Relative::rel_value_us, and RMO_UNCONFIRMED_ALLOWED.

Here is the call 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 3991 of file gnunet-service-tng.c.

3994 {
3995  struct TransportClient *tc = cls;
3996  uint16_t size;
3997 
3998  if (CT_NONE != tc->type)
3999  {
4000  GNUNET_break (0);
4001  return GNUNET_SYSERR;
4002  }
4003  tc->type = CT_COMMUNICATOR;
4004  size = ntohs (cam->header.size) - sizeof(*cam);
4005  if (0 == size)
4006  return GNUNET_OK; /* receive-only communicator */
4008  return GNUNET_OK;
4009 }
#define GNUNET_MQ_check_zero_termination(m)
Insert code for a "check_" function that verifies that a given variable-length message received over ...

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

◆ finish_cmc_handling()

static void finish_cmc_handling ( struct CommunicatorMessageContext cmc)
static

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

Parameters
cmccontext for which we are done handling the message

Definition at line 4018 of file gnunet-service-tng.c.

4019 {
4020  if (0 != ntohl (cmc->im.fc_on))
4021  {
4022  /* send ACK when done to communicator for flow control! */
4023  struct GNUNET_MQ_Envelope *env;
4024  struct GNUNET_TRANSPORT_IncomingMessageAck *ack;
4025 
4027  ack->reserved = htonl (0);
4028  ack->fc_id = cmc->im.fc_id;
4029  ack->sender = cmc->im.sender;
4030  GNUNET_MQ_send (cmc->tc->mq, env);
4031  }
4033  GNUNET_free (cmc);
4034 }
#define GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG_ACK
transport acknowledges processing an incoming message
struct GNUNET_TRANSPORT_IncomingMessage im
Additional information for flow control and about the sender.
struct TransportClient * tc
Which communicator provided us with the message.
struct GNUNET_MQ_Handle * mq
Message queue to the client.

References TransportClient::client, env, GNUNET_free, GNUNET_MESSAGE_TYPE_TRANSPORT_INCOMING_MSG_ACK, GNUNET_MQ_msg, GNUNET_MQ_send(), GNUNET_SERVICE_client_continue(), CommunicatorMessageContext::im, TransportClient::mq, and CommunicatorMessageContext::tc.

Referenced by backtalker_monotime_cb(), free_backtalker(), handle_client_recv_ok(), 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 4047 of file gnunet-service-tng.c.

4048 {
4049  struct TransportClient *tc = cls;
4050  struct VirtualLink *vl;
4051  uint32_t delta;
4052  struct CommunicatorMessageContext *cmc;
4053 
4054  if (CT_CORE != tc->type)
4055  {
4056  GNUNET_break (0);
4057  GNUNET_SERVICE_client_drop (tc->client);
4058  return;
4059  }
4060  vl = lookup_virtual_link (&rom->peer);
4061  if (NULL == vl)
4062  {
4064  "# RECV_OK dropped: virtual link unknown",
4065  1,
4066  GNUNET_NO);
4068  return;
4069  }
4070  delta = ntohl (rom->increase_window_delta);
4071  vl->core_recv_window += delta;
4072  if (vl->core_recv_window <= 0)
4073  return;
4074  /* resume communicators */
4075  while (NULL != (cmc = vl->cmc_tail))
4076  {
4078  finish_cmc_handling (cmc);
4079  }
4080 }
static void finish_cmc_handling(struct CommunicatorMessageContext *cmc)
Send ACK to communicator (if requested) and free cmc.
Context from handle_incoming_msg().
struct GNUNET_PeerIdentity peer
Which peer can CORE handle more from now?
Definition: transport.h:276
uint32_t increase_window_delta
Number of messages by which to increase the window, greater or equal to one.
Definition: transport.h:271

References VirtualLink::cmc_head, VirtualLink::cmc_tail, VirtualLink::core_recv_window, CT_CORE, delta, finish_cmc_handling(), GNUNET_break, GNUNET_CONTAINER_DLL_remove, GNUNET_NO, GNUNET_SERVICE_client_continue(), GNUNET_SERVICE_client_drop(), GNUNET_STATISTICS_update(), 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 4090 of file gnunet-service-tng.c.

4093 {
4094  struct TransportClient *tc = cls;
4095  uint16_t size;
4096 
4097  size = ntohs (cam->header.size) - sizeof(*cam);
4098  if (0 == size)
4099  {
4101  "Receive-only communicator connected\n");
4102  return; /* receive-only communicator */
4103  }
4104  tc->details.communicator.address_prefix =
4105  GNUNET_strdup ((const char *) &cam[1]);
4106  tc->details.communicator.cc =
4107  (enum GNUNET_TRANSPORT_CommunicatorCharacteristics) ntohl (cam->cc);
4109  "Communicator with prefix `%s' connected\n",
4110  tc->details.communicator.address_prefix);
4112 }
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
GNUNET_TRANSPORT_CommunicatorCharacteristics
What characteristics does this communicator have?

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_log, GNUNET_SERVICE_client_continue(), GNUNET_strdup, 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 4123 of file gnunet-service-tng.c.

4126 {
4127  const struct GNUNET_MessageHeader *inbox;
4128  const char *is;
4129  uint16_t msize;
4130  uint16_t isize;
4131 
4132  (void) cls;
4133  msize = ntohs (cb->header.size) - sizeof(*cb);
4134  inbox = (const struct GNUNET_MessageHeader *) &cb[1];
4135  isize = ntohs (inbox->size);
4136  if (isize >= msize)
4137  {
4138  GNUNET_break (0);
4139  return GNUNET_SYSERR;
4140  }
4141  is = (const char *) inbox;
4142  is += isize;
4143  msize -= isize;
4144  GNUNET_assert (0 < msize);
4145  if ('\0' != is[msize - 1])
4146  {
4147  GNUNET_break (0);
4148  return GNUNET_SYSERR;
4149  }
4150  return GNUNET_OK;
4151 }
static struct GNUNET_NT_InterfaceScanner * is
Network scanner to determine network types.

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

◆ update_ephemeral()

static void update_ephemeral ( struct DistanceVector dv)
static

Ensure ephemeral keys in our dv are current.

If no current one exists, set it up.

Parameters
dv[in,out]virtual link to update ephemeral for

Definition at line 4161 of file gnunet-service-tng.c.

4162 {
4163  struct EphemeralConfirmationPS ec;
4164 
4165  if (0 !=
4167  return;
4169  dv->ephemeral_validity =
4173  ec.purpose.purpose = htonl (GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL);
4174  ec.purpose.size = htonl (sizeof(ec));
4175  ec.target = dv->target;
4176  ec.ephemeral_key = dv->ephemeral_key;
4178  &ec,
4179  &dv->sender_sig);
4180 }
#define EPHEMERAL_VALIDITY
How long are ephemeral keys valid?
static const struct GNUNET_CONFIGURATION_Handle * GST_cfg
Configuration handle.
void GNUNET_CRYPTO_ecdhe_key_create(struct GNUNET_CRYPTO_EcdhePrivateKey *pk)
Create a new private key.
Definition: crypto_ecc.c:435
#define GNUNET_CRYPTO_eddsa_sign(priv, ps, sig)
EdDSA sign a given block.
void GNUNET_CRYPTO_ecdhe_key_get_public(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, struct GNUNET_CRYPTO_EcdhePublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:213
#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 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:277
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:658
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_EcdhePublicKey ephemeral_key
Our ephemeral key.
struct GNUNET_CRYPTO_EcdhePrivateKey private_key
Our private 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_ecdhe_key_create(), GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_eddsa_sign, GNUNET_SIGNATURE_PURPOSE_TRANSPORT_EPHEMERAL, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get_monotonic(), GNUNET_TIME_absolute_get_remaining(), GST_cfg, GST_my_private_key, DistanceVector::monotime, DistanceVector::private_key, GNUNET_CRYPTO_EccSignaturePurpose::purpose, EphemeralConfirmationPS::purpose, GNUNET_TIME_Relative::rel_value_us, DistanceVector::sender_sig, GNUNET_CRYPTO_EccSignaturePurpose::size, EphemeralConfirmationPS::target, and DistanceVector::target.

Here is the call 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 4193 of file gnunet-service-tng.c.

4197 {
4198  struct Neighbour *n = queue->neighbour;
4199  struct GNUNET_TRANSPORT_SendMessageTo *smt;
4200  struct GNUNET_MQ_Envelope *env;
4201 
4202  GNUNET_log (
4204  "Queueing %u bytes of payload for transmission <%llu> on queue %llu to %s\n",
4205  (unsigned int) payload_size,
4206  (NULL == pm) ? 0 : pm->logging_uuid,
4207  (unsigned long long) queue->qid,
4208  GNUNET_i2s (&queue->neighbour->pid));
4209  env = GNUNET_MQ_msg_extra (smt,
4210  payload_size,
4212  smt->qid = queue->qid;
4213  smt->mid = queue->mid_gen;
4214  smt->receiver = n->pid;
4215  memcpy (&smt[1], payload, payload_size);
4216  {
4217  /* Pass the env to the communicator of queue for transmission. */
4218  struct QueueEntry *qe;
4219 
4220  qe = GNUNET_new (struct QueueEntry);
4221  qe->mid = queue->mid_gen++;
4222  qe->queue = queue;
4223  if (NULL != pm)
4224  {
4225  qe->pm = pm;
4226  GNUNET_assert (NULL == pm->qe);
4227  pm->qe = qe;
4228  }
4229  GNUNET_CONTAINER_DLL_insert (queue->queue_head, queue->queue_tail, qe);
4230  GNUNET_assert (CT_COMMUNICATOR == queue->tc->type);
4231  queue->queue_length++;
4232  queue->tc->details.communicator.total_queue_length++;
4234  queue->tc->details.communicator.total_queue_length)
4235  queue->idle = GNUNET_NO;
4236  if (QUEUE_LENGTH_LIMIT == queue->queue_length)
4237  queue->idle = GNUNET_NO;
4238  GNUNET_MQ_send (queue->tc->mq, env);
4239  }
4240 }
static unsigned long long payload
How much data are we currently storing in the database?
#define GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG
transport tells communicator it wants to transmit

References COMMUNICATOR_TOTAL_QUEUE_LIMIT, CT_COMMUNICATOR, env, GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_TRANSPORT_SEND_MSG, GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_new, GNUNET_NO, payload, Neighbour::pid, pm, qe, queue(), and QUEUE_LENGTH_LIMIT.

Referenced by 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 4193 of file gnunet-service-tng.c.

4257 {
4258  struct GNUNET_TIME_Absolute now;
4259  unsigned int candidates;
4260  unsigned int sel1;
4261  unsigned int sel2;
4262  struct GNUNET_TIME_Relative rtt;
4263 
4264  /* Pick one or two 'random' queues from n (under constraints of options) */
4265  now = GNUNET_TIME_absolute_get ();
4266  /* FIXME-OPTIMIZE: give queues 'weights' and pick proportional to
4267  weight in the future; weight could be assigned by observed
4268  bandwidth (note: not sure if we should do this for this type
4269  of control traffic though). */
4270  candidates = 0;
4271  for (struct Queue *pos = n->queue_head; NULL != pos;
4272  pos = pos->next_neighbour)
4273  {
4274  if ((0 != (options & RMO_UNCONFIRMED_ALLOWED)) ||
4275  (pos->validated_until.abs_value_us > now.abs_value_us))
4276  candidates++;
4277  }
4278  if (0 == candidates)
4279  {
4280  /* This can happen rarely if the last confirmed queue timed
4281  out just as we were beginning to process this message. */
4283  "Could not route message of type %u to %s: no valid queue\n",
4284  ntohs (hdr->type),
4285  GNUNET_i2s (&n->pid));
4287  "# route selection failed (all no valid queue)",
4288  1,
4289  GNUNET_NO);
4291  }
4292 
4295  if (0 == (options & RMO_REDUNDANT))
4296  sel2 = candidates; /* picks none! */
4297  else
4299  candidates = 0;
4300  for (struct Queue *pos = n->queue_head; NULL != pos;
4301  pos = pos->next_neighbour)
4302  {
4303  if ((0 != (options & RMO_UNCONFIRMED_ALLOWED)) ||
4304  (pos->validated_until.abs_value_us > now.abs_value_us))
4305  {
4306  if ((sel1 == candidates) || (sel2 == candidates))
4307  {
4309  "Routing message of type %u to %s using %s (#%u)\n",
4310  ntohs (hdr->type),
4311  GNUNET_i2s (&n->pid),
4312  pos->address,
4313  (sel1 == candidates) ? 1 : 2);
4314  rtt = GNUNET_TIME_relative_min (rtt, pos->pd.aged_rtt);
4315  queue_send_msg (pos, NULL, hdr, ntohs (hdr->size));
4316  }
4317  candidates++;
4318  }
4319  }
4320  return rtt;
4321 }
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
@ 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:200
uint16_t type
The type of the message (GNUNET_MESSAGE_TYPE_XXXX), in big-endian format.
Time for relative time used by GNUnet, in microseconds.
struct Queue * next_neighbour
Kept in a MDLL.

Referenced by handle_validation_challenge(), and route_control_message_without_fc().

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_HashCode 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
key[out]symmetric cipher and HMAC state to generate

Definition at line 4366 of file gnunet-service-tng.c.

4369 {
4370  /* must match #dh_key_derive_eph_pub */
4372  GNUNET_CRYPTO_kdf (&key->material,
4373  sizeof(key->material),
4374  "transport-backchannel-key",
4375  strlen ("transport-backchannel-key"),
4376  &km,
4377  sizeof(km),
4378  iv,
4379  sizeof(*iv)));
4381  "Deriving backchannel key based on KM %s and IV %s\n",
4382  GNUNET_h2s (km),
4383  GNUNET_sh2s (iv));
4384  GNUNET_assert (0 == gcry_cipher_open (&key->cipher,
4385  GCRY_CIPHER_AES256 /* low level: go for speed */,
4386  GCRY_CIPHER_MODE_CTR,
4387  0 /* flags */));
4388  GNUNET_assert (0 == gcry_cipher_setkey (key->cipher,
4389  &key->material.aes_key,
4390  sizeof(key->material.aes_key)));
4391  gcry_cipher_setctr (key->cipher,
4392  &key->material.aes_ctr,
4393  sizeof(key->material.aes_ctr));
4394 }
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_kdf(void *result, size_t out_len, const void *xts, size_t xts_len, const void *skm, size_t skm_len,...)
Derive key.
Definition: crypto_kdf.c:90
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).

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

Referenced by dh_key_derive_eph_pid(), and dh_key_derive_eph_pub().

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

◆ dh_key_derive_eph_pid()

static void dh_key_derive_eph_pid ( const struct GNUNET_CRYPTO_EcdhePrivateKey priv_ephemeral,
const struct GNUNET_PeerIdentity target,
const struct GNUNET_ShortHashCode iv,
struct DVKeyState key 
)
static

Derive backchannel encryption key material from priv_ephemeral and target and iv.

Parameters
priv_ephemeralephemeral private key to use
targetthe target peer to encrypt to
ivunique IV to use
key[out]set to the key material

Definition at line 4407 of file gnunet-service-tng.c.

4412 {
4413  struct GNUNET_HashCode km;
4414 
4416  &target->public_key,
4417  &km));
4418  dv_setup_key_state_from_km (&km, iv, key);
4419 }
static void dv_setup_key_state_from_km(const struct GNUNET_HashCode *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...
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_ecdh_eddsa(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EddsaPublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a EdDSA public key and a private ECDH key.
Definition: crypto_ecc.c:758
A 512-bit hashcode.
struct GNUNET_CRYPTO_EddsaPublicKey public_key

References dv_setup_key_state_from_km(), GNUNET_assert, GNUNET_CRYPTO_ecdh_eddsa(), GNUNET_YES, key, and GNUNET_PeerIdentity::public_key.

Here is the call graph for this function:

◆ dh_key_derive_eph_pub()

static void dh_key_derive_eph_pub ( const struct GNUNET_CRYPTO_EcdhePublicKey pub_ephemeral,
const struct GNUNET_ShortHashCode iv,
struct DVKeyState key 
)
static

Derive backchannel encryption key material from GST_my_private_key and pub_ephemeral and iv.

Parameters
priv_ephemeralephemeral private key to use
targetthe target peer to encrypt to
ivunique IV to use
key[out]set to the key material

Definition at line 4432 of file gnunet-service-tng.c.

4435 {
4436  struct GNUNET_HashCode km;
4437 
4439  pub_ephemeral,
4440  &km));
4441  dv_setup_key_state_from_km (&km, iv, key);
4442 }
enum GNUNET_GenericReturnValue GNUNET_CRYPTO_eddsa_ecdh(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a ECDH public key and a private EdDSA key.
Definition: crypto_ecc.c:718

References dv_setup_key_state_from_km(), GNUNET_assert, GNUNET_CRYPTO_eddsa_ecdh(), GNUNET_YES, GST_my_private_key, and key.

Referenced by 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)
hmac[out]set to the HMAC
datadata to perform HMAC calculation over
data_sizenumber of bytes in data

Definition at line 4455 of file gnunet-service-tng.c.

4459 {
4460  GNUNET_CRYPTO_hmac (&key->material.hmac_key, data, data_size, hmac);
4461 }
static size_t data_size
Number of bytes in data.
Definition: gnunet-abd.c:187
uint32_t data
The data value.
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:301

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

Referenced by 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
key[in,out]key 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 4474 of file gnunet-service-tng.c.

4475 {
4476  GNUNET_assert (0 ==
4477  gcry_cipher_encrypt (key->cipher, dst, in_size, in, in_size));
4478 }

References GNUNET_assert, and key.

◆ dv_decrypt()

static void 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
key[in,out]key material to use
ciphcipher text to decrypt
out[out]output data to generate (plaintext)
out_sizenumber of bytes of input in ciph and available in out

Definition at line 4491 of file gnunet-service-tng.c.

4495 {
4496  GNUNET_assert (
4497  0 == gcry_cipher_decrypt (key->cipher, out, out_size, ciph, out_size));
4498 }

References GNUNET_assert, 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 4507 of file gnunet-service-tng.c.

4508 {
4509  gcry_cipher_close (key->cipher);
4510  GNUNET_CRYPTO_zero_keys (&key->material, sizeof(key->material));
4511 }
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 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 
)
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
Returns
expected RTT for transmission, GNUNET_TIME_UNIT_FOREVER_REL if sending failed

Definition at line 4524 of file gnunet-service-tng.c.

4550 {
4551  struct TransportDVBoxMessage box_hdr;
4552  struct TransportDVBoxPayloadP payload_hdr;
4553  uint16_t enc_body_size = ntohs (hdr->size);
4554  char enc[sizeof(struct TransportDVBoxPayloadP) + enc_body_size] GNUNET_ALIGN;
4555  struct TransportDVBoxPayloadP *enc_payload_hdr =
4556  (struct TransportDVBoxPayloadP *) enc;
4557  struct DVKeyState key;
4558  struct GNUNET_TIME_Relative rtt;
4559 
4560  /* Encrypt payload */
4561  box_hdr.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_DV_BOX);
4562  box_hdr.total_hops = htons (0);
4563  update_ephemeral (dv);
4564  box_hdr.ephemeral_key = dv->ephemeral_key;
4565  payload_hdr.sender_sig = dv->sender_sig;
4567  &box_hdr.iv,
4568  sizeof(box_hdr.iv));
4569  dh_key_derive_eph_pid (&dv->private_key, &dv->target, &box_hdr.iv, &key);
4570  payload_hdr.sender = GST_my_identity;
4571  payload_hdr.monotonic_time = GNUNET_TIME_absolute_hton (dv->monotime);
4572  dv_encrypt (&key, &payload_hdr, enc_payload_hdr, sizeof(payload_hdr));
4573  dv_encrypt (&key,
4574  hdr,
4575  &enc[sizeof(struct TransportDVBoxPayloadP)],
4576  enc_body_size);
4577  dv_hmac (&key, &box_hdr.hmac, enc, sizeof(enc));
4578  dv_key_clean (&key);
4580  /* For each selected path, take the pre-computed header and body
4581  and add the path in the middle of the message; then send it. */
4582  for (unsigned int i = 0; i < num_dvhs; i++)
4583  {
4584  struct DistanceVectorHop *dvh = dvhs[i];
4585  unsigned int num_hops = dvh->distance + 1;
4586  char buf[sizeof(struct TransportDVBoxMessage)
4587  + sizeof(struct GNUNET_PeerIdentity) * num_hops
4588  + sizeof(struct TransportDVBoxPayloadP)
4589  + enc_body_size] GNUNET_ALIGN;
4590  struct GNUNET_PeerIdentity *dhops;
4591 
4592  box_hdr.header.size = htons (sizeof(buf));
4593  box_hdr.num_hops = htons (num_hops);
4594  memcpy (buf, &box_hdr, sizeof(box_hdr));
4595  dhops = (struct GNUNET_PeerIdentity *) &buf[sizeof(box_hdr)];
4596  memcpy (dhops,
4597  dvh->path,
4598  dvh->distance * sizeof(struct GNUNET_PeerIdentity));
4599  dhops[dvh->distance] = dv->target;
4600  if (GNUNET_EXTRA_LOGGING > 0)
4601  {
4602  char *path;
4603 
4605  for (unsigned int j = 0; j <= num_hops; j++)
4606  {
4607  char *tmp;
4608 
4609  GNUNET_asprintf (&tmp, "%s-%s", path, GNUNET_i2s (&dhops[j]));
4610  GNUNET_free (path);
4611  path = tmp;
4612  }
4614  "Routing message of type %u to %s using DV (#%u/%u) via %s\n",
4615  ntohs (hdr->type),
4616  GNUNET_i2s (&dv->target),
4617  i + 1,
4618  num_dvhs + 1,
4619  path);
4620  GNUNET_free (path);
4621  }
4622  rtt = GNUNET_TIME_relative_min (rtt, dvh->pd.aged_rtt);
4623  memcpy (&dhops[num_hops], enc, sizeof(enc));
4624  use (use_cls,
4625  dvh->next_hop,
4626  (const struct GNUNET_MessageHeader *) buf,
4627  options);
4628  }
4629  return rtt;
4630 }
static OpusEncoder * enc
OPUS encoder.
static char buf[2048]
static void dv_key_clean(struct DVKeyState *key)
Clean up key material in key.
static void update_ephemeral(struct DistanceVector *dv)
Ensure 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 dh_key_derive_eph_pid(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv_ephemeral, const struct GNUNET_PeerIdentity *target, const struct GNUNET_ShortHashCode *iv, struct DVKeyState *key)
Derive backchannel encryption key material from priv_ephemeral and target and iv.
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.
#define GNUNET_ALIGN
gcc-ism to force alignment; we use this to align char-arrays that may then be cast to 'struct's.
void GNUNET_CRYPTO_random_block(enum GNUNET_CRYPTO_Quality mode, void *buffer, size_t length)
Fill block with a random values.
@ GNUNET_CRYPTO_QUALITY_NONCE
Randomness for IVs etc.
#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_TIME_Relative aged_rtt
Weighted average for the RTT.
uint16_t num_hops
Number of hops this messages includes.

Referenced by transmit_on_queue().

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 4643 of file gnunet-service-tng.c.

4647 {
4648  (void) cls;
4649  (void) route_via_neighbour (next_hop, hdr, options);
4650 }
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.

◆ route_control_message_without_fc()

static struct GNUNET_TIME_Relative route_control_message_without_fc ( const struct GNUNET_PeerIdentity target,
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 4643 of file gnunet-service-tng.c.

4668 {
4669  struct VirtualLink *vl;
4670  struct Neighbour *n;
4671  struct DistanceVector *dv;
4672  struct GNUNET_TIME_Relative rtt1;
4673  struct GNUNET_TIME_Relative rtt2;
4674 
4675  vl = lookup_virtual_link (target);
4676  GNUNET_assert (NULL != vl);
4677  n = vl->n;
4678  dv = (0 != (options & RMO_DV_ALLOWED)) ? vl->dv : NULL;
4679  if (0 == (options & RMO_UNCONFIRMED_ALLOWED))
4680  {
4681  /* if confirmed is required, and we do not have anything
4682  confirmed, drop respective options */
4683  if (NULL == n)
4684  n = lookup_neighbour (target);
4685  if ((NULL == dv) && (0 != (options & RMO_DV_ALLOWED)))
4687  }
4688  if ((NULL == n) && (NULL == dv))
4689  {
4691  "Cannot route message of type %u to %s: no route\n",
4692  ntohs (hdr->type),
4693  GNUNET_i2s (target));
4695  "# Messages dropped in routing: no acceptable method",
4696  1,
4697  GNUNET_NO);
4699  }
4701  "Routing message of type %u to %s with options %X\n",
4702  ntohs (hdr->type),
4703  GNUNET_i2s (target),
4704  (unsigned int) options);
4705  /* If both dv and n are possible and we must choose:
4706  flip a coin for the choice between the two; for now 50/50 */
4707  if ((NULL != n) && (NULL != dv) && (0 == (options & RMO_REDUNDANT)))
4708  {
4710  n = NULL;
4711  else
4712  dv = NULL;
4713  }
4714  if ((NULL != n) && (NULL != dv))
4715  options &= ~RMO_REDUNDANT; /* We will do one DV and one direct, that's
4716  enough for redundancy, so clear the flag. */
4719  if (NULL != n)
4720  {
4721  rtt1 = route_via_neighbour (n, hdr, options);
4722  }
4723  if (NULL != dv)
4724  {
4725  struct DistanceVectorHop *hops[2];
4726  unsigned int res;
4727 
4729  options,
4730  hops,
4731  (0 == (options & RMO_REDUNDANT)) ? 1 : 2);
4732  if (0 == res)
4733  {
4735  "Failed to route message, could not determine DV path\n");
4736  return rtt1;
4737  }
4738  rtt2 = encapsulate_for_dv (dv,
4739  res,
4740  hops,
4741  hdr,
4743  NULL,
4744  options & (~RMO_REDUNDANT));
4745  }
4746  return GNUNET_TIME_relative_min (rtt1, rtt2);
4747 }
static int res
static struct Neighbour * lookup_neighbour(const struct GNUNET_PeerIdentity *pid)
Lookup neighbour for peer pid.
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.

References options, and route_via_neighbour().

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 4775 of file gnunet-service-tng.c.

4776 {
4777  struct VirtualLink *vl = cls;
4778  struct GNUNET_TIME_Absolute monotime;
4779  struct TransportFlowControlMessage fc;
4781  struct GNUNET_TIME_Relative rtt;
4782 
4784  /* OPTIMIZE-FC-BDP: decide sane criteria on when to do this, instead of doing
4785  it always! */
4786  /* For example, we should probably ONLY do this if a bit more than
4787  an RTT has passed, or if the window changed "significantly" since
4788  then. See vl->last_fc_rtt! NOTE: to do this properly, we also
4789  need an estimate for the bandwidth-delay-product for the entire
4790  VL, as that determines "significantly". We have the delay, but
4791  the bandwidth statistics need to be added for the VL!*/(void) duration;
4792 
4794  "Sending FC seq %u to %s with new window %llu\n",
4795  (unsigned int) vl->fc_seq_gen,
4796  GNUNET_i2s (&vl->target),
4797  (unsigned long long) vl->incoming_fc_window_size);
4799  vl->last_fc_transmission = monotime;
4800  fc.header.type = htons (GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL);
4801  fc.header.size = htons (sizeof(fc));
4802  fc.seq = htonl (vl->fc_seq_gen++);
4803  fc.inbound_window_size = GNUNET_htonll (vl->incoming_fc_window_size);
4804  fc.outbound_sent = GNUNET_htonll (vl->outbound_fc_window_size_used);
4805  fc.outbound_window_size = GNUNET_htonll (vl->outbound_fc_window_size);
4806  fc.sender_time = GNUNET_TIME_absolute_hton (monotime);
4807  rtt = route_control_message_without_fc (&vl->target, &fc.header, RMO_NONE);
4808  if (GNUNET_TIME_UNIT_FOREVER_REL.rel_value_us == rtt.rel_value_us)
4809  {
4812  "FC retransmission to %s failed, will retry in %s\n",
4813  GNUNET_i2s (&vl->target),
4816  }
4817  else
4818  {
4819  /* OPTIMIZE-FC-BDP: rtt is not ideal, we can do better! */
4820  vl->last_fc_rtt = rtt;
4821  }
4822  if (NULL != vl->fc_retransmit_task)
4824  vl->fc_retransmit_task =
4826 }
static struct GNUNET_TIME_Relative duration
How long do we run the test?
static void task_consider_sending_fc(void *cls)
Something changed on the virtual link with respect to flow control.
static struct GNUNET_TIME_Relative route_control_message_without_fc(const struct GNUNET_PeerIdentity *target, const struct GNUNET_MessageHeader *hdr, enum RouteMessageOptions options)
We need to transmit hdr to target.
uint64_t GNUNET_htonll(uint64_t n)
Convert unsigned 64-bit integer to network byte order.
Definition: common_endian.c:36
#define GNUNET_MESSAGE_TYPE_TRANSPORT_FLOW_CONTROL
Transport signalling incoming backchannel message to a communicator.
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:1269
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:263
#define GNUNET_TIME_UNIT_SECONDS
One second.
#define GNUNET_TIME_UNIT_ZERO
Relative time zero.
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:557
Message for Transport-to-Transport Flow control.

References duration, VirtualLink::fc_retransmit_task, VirtualLink::fc_seq_gen, GNUNET_ERROR_TYPE_DEBUG, GNUNET_htonll(), GNUNET_i2s(), GNUNET_log, 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_UNIT_FOREVER_REL, GNUNET_TIME_UNIT_SECONDS, GNUNET_TIME_UNIT_ZERO, GNUNET_YES, GST_cfg, TransportFlowControlMessage::header, TransportFlowControlMessage::inbound_window_size, VirtualLink::incoming_fc_window_size, VirtualLink::last_fc_rtt, VirtualLink::last_fc_transmission, 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_NONE, route_control_message_without_fc(), TransportFlowControlMessage::sender_time, TransportFlowControlMessage::seq, GNUNET_MessageHeader::size, VirtualLink::target, task_consider_sending_fc(), and GNUNET_MessageHeader::type.

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 4760 of file gnunet-service-tng.c.

4761 {
4762  struct VirtualLink *vl = cls;
4763  vl->fc_retransmit_task = NULL;
4764  consider_sending_fc (cls);
4765 }
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:

◆ 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 4846 of file gnunet-service-tng.c.

4847 {
4848  struct Neighbour *n = vl->n;
4849  struct DistanceVector *dv = vl->dv;
4850  struct GNUNET_TIME_Absolute now;
4851  int elig;
4852 
4853  /* Check that we have an eligible pending message!
4854  (cheaper than having #transmit_on_queue() find out!) */
4855  elig = GNUNET_NO;
4856  for (struct PendingMessage *pm = vl->pending_msg_head; NULL != pm;
4857  pm = pm->next_vl)
4858  {
4859  if (NULL != pm->qe)
4860  continue; /* not eligible, is in a queue! */
4861  if (pm->bytes_msg + vl->outbound_fc_window_size_used >
4863  {
4865  "Stalled transmission on VL %s due to flow control: %llu < %llu\n",
4866  GNUNET_i2s (&vl->target),
4867  (unsigned long long) vl->outbound_fc_window_size,
4868  (unsigned long long) (pm->bytes_msg
4870  consider_sending_fc (vl);
4871  return; /* We have a message, but flow control says "nope" */
4872  }
4873  elig = GNUNET_YES;
4874  break;
4875  }
4876  if (GNUNET_NO == elig)
4877  return;
4879  "Not stalled. Scheduling transmission on queue\n");
4880  /* Notify queues at direct neighbours that we are interested */
4881  now = GNUNET_TIME_absolute_get ();
4882  if (NULL != n)
4883  {
4884  for (struct Queue *queue = n->queue_head; NULL != queue;
4885  queue = queue->next_neighbour)
4886  {
4887  if ((GNUNET_YES == queue->idle) &&
4888  (queue->validated_until.abs_value_us > now.abs_value_us))
4890  else
4892  "Queue busy or invalid\n");
4893  }
4894  }
4895  /* Notify queues via DV that we are interested */
4896  if (NULL != dv)
4897  {
4898  /* Do DV with lower scheduler priority, which effectively means that
4899  IF a neighbour exists and is available, we prefer it. */
4900  for (struct DistanceVectorHop *pos = dv->dv_head; NULL != pos;
4901  pos = pos->next_dv)
4902  {
4903  struct Neighbour *nh = pos->next_hop;
4904 
4905  if (pos->path_valid_until.abs_value_us <= now.abs_value_us)
4906  continue; /* skip this one: path not validated */
4907  for (struct Queue *queue = nh->queue_head; NULL != queue;
4908  queue = queue->next_neighbour)
4909  if ((GNUNET_YES == queue->idle) &&
4910  (queue->validated_until.abs_value_us > now.abs_value_us))
4913  }
4914  }
4915 }
static struct GNUNET_NAT_Handle * nh
Handle to NAT operation.
Definition: gnunet-nat.c:80
@ 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_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_PRIORITY_BACKGROUND, GNUNET_SCHEDULER_PRIORITY_DEFAULT, GNUNET_TIME_absolute_get(), GNUNET_YES, VirtualLink::n, DistanceVectorHop::next_dv, nh, VirtualLink::outbound_fc_window_size, VirtualLink::outbound_fc_window_size_used, VirtualLink::pending_msg_head, pm, queue(), Neighbour::queue_head, schedule_transmit_on_queue(), VirtualLink::target, DistanceVector::vl, and Neighbour::vl.

Referenced by forward_dv_box(), handle_client_send(), handle_flow_control(), and handle_send_message_ack().

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 4925 of file gnunet-service-tng.c.

4926 {
4927  struct TransportClient *tc = cls;
4928  struct PendingMessage *pm;
4929  const struct GNUNET_MessageHeader *obmm;
4930  uint32_t bytes_msg;
4931  struct VirtualLink *vl;
4933 
4934  GNUNET_assert (CT_CORE == tc->type);
4935  obmm = (const struct GNUNET_MessageHeader *) &obm[1];
4936  bytes_msg = ntohs (obmm->size);
4937  pp = (enum GNUNET_MQ_PriorityPreferences) ntohl (obm->priority);
4938  vl = lookup_virtual_link (&obm->peer);
4939  if (NULL == vl)
4940  {
4942  "Don't have %s as a neighbour (anymore).\n",
4943  GNUNET_i2s (&obm->peer));
4944  /* Failure: don't have this peer as a neighbour (anymore).
4945  Might have gone down asynchronously, so this is NOT
4946  a protocol violation by CORE. Still count the event,
4947  as this should be rare. */
4950  "# messages dropped (neighbour unknown)",
4951  1,
4952  GNUNET_NO);
4953  return;
4954  }
4955 
4956  pm = GNUNET_malloc (sizeof(struct PendingMessage) + bytes_msg);
4957  pm->logging_uuid = logging_uuid_gen++;
4958  pm->prefs = pp;
4959  pm->client = tc;
4960  pm->vl = vl;
4961  pm->bytes_msg = bytes_msg;
4962  memcpy (&pm[1], obmm, bytes_msg);
4964  "Sending %u bytes as <%llu> to %s\n",
4965  bytes_msg,
4966  pm->logging_uuid,
4967  GNUNET_i2s (&obm->peer));
4969  tc->details.core.pending_msg_head,
4970  tc->details.core.pending_msg_tail,
4971  pm);
4973  vl->pending_msg_head,
4974  vl->pending_msg_tail,
4975  pm);
4976  check_vl_transmission (vl);
4977 }
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.
static unsigned long long logging_uuid_gen
Generator of logging_uuid in struct PendingMessage.