GNUnet  0.11.x
Data Structures | Macros | Functions
gnunet-service-cadet_tunnels.c File Reference

Information we track per tunnel. More...

#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_statistics_service.h"
#include "gnunet_signatures.h"
#include "cadet_protocol.h"
#include "gnunet-service-cadet_channel.h"
#include "gnunet-service-cadet_connection.h"
#include "gnunet-service-cadet_tunnels.h"
#include "gnunet-service-cadet_peer.h"
#include "gnunet-service-cadet_paths.h"
Include dependency graph for gnunet-service-cadet_tunnels.c:

Go to the source code of this file.

Data Structures

struct  CadetTunnelSkippedKey
 Struct to old keys for skipped messages while advancing the Axolotl ratchet. More...
 
struct  CadetTunnelAxolotl
 Axolotl data, according to https://github.com/trevp/axolotl/wiki . More...
 
struct  CadetTunnelQueueEntry
 Struct used to save messages in a non-ready tunnel to send once connected. More...
 
struct  CadetTunnel
 Struct containing all information regarding a tunnel to a peer. More...
 
struct  EvaluationSummary
 Closure for evaluate_connection. More...
 
struct  ChanIterCls
 Closure for iterate_channels_cb. More...
 

Macros

#define LOG(level, ...)   GNUNET_log_from (level, "cadet-tun", __VA_ARGS__)
 
#define MAX_UNVERIFIED_ATTEMPTS   16
 How often do we try to decrypt payload with unverified key material? Used to limit CPU increase upon receiving bogus KX. More...
 
#define IDLE_DESTROY_DELAY
 How long do we wait until tearing down an idle tunnel? More...
 
#define INITIAL_KX_RETRY_DELAY
 How long do we wait initially before retransmitting the KX? TODO: replace by 2 RTT if/once we have connection-level RTT data! More...
 
#define MAX_SKIPPED_KEYS   64
 Maximum number of skipped keys we keep in memory per tunnel. More...
 
#define MAX_KEY_GAP   256
 Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is either a bogus packet or a DoS-attempt. More...
 
#define HIGH_BIT   0x8000000
 
#define LOG2(level, ...)
 

Functions

int GCT_alice_or_betty (const struct GNUNET_PeerIdentity *other)
 Am I Alice or Betty (some call her Bob), or talking to myself? More...
 
static void mark_connection_unready (struct CadetTConnection *ct)
 Connection ct is now unready, clear it's ready flag and move it from the ready DLL to the busy DLL. More...
 
const char * GCT_2s (const struct CadetTunnel *t)
 Get the static string for the peer this tunnel is directed. More...
 
static const char * estate2s (enum CadetTunnelEState es)
 Get string description for tunnel encryption state. More...
 
struct CadetPeerGCT_get_destination (struct CadetTunnel *t)
 Return the peer to which this tunnel goes. More...
 
unsigned int GCT_count_channels (struct CadetTunnel *t)
 Count channels of a tunnel. More...
 
struct CadetChannellookup_channel (struct CadetTunnel *t, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Lookup a channel by its ctn. More...
 
unsigned int GCT_count_any_connections (const struct CadetTunnel *t)
 Count all created connections of a tunnel. More...
 
static struct CadetTConnectionget_ready_connection (struct CadetTunnel *t)
 Find first connection that is ready in the list of our connections. More...
 
enum CadetTunnelEState GCT_get_estate (struct CadetTunnel *t)
 Get the encryption state of a tunnel. More...
 
static void trigger_transmissions (void *cls)
 Called when either we have a new connection, or a new message in the queue, or some existing connection has transmission capacity. More...
 
static void new_ephemeral (struct CadetTunnelAxolotl *ax)
 Create a new Axolotl ephemeral (ratchet) key. More...
 
static void t_hmac (const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
 Calculate HMAC. More...
 
static void t_ax_hmac_hash (const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
 Perform a HMAC. More...
 
static void t_hmac_derive_key (const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
 Derive a symmetric encryption key from an HMAC-HASH. More...
 
static void t_ax_encrypt (struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
 Encrypt data with the axolotl tunnel key. More...
 
static void t_ax_decrypt (struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
 Decrypt data with the axolotl tunnel key. More...
 
static void t_h_encrypt (struct CadetTunnelAxolotl *ax, struct GNUNET_CADET_TunnelEncryptedMessage *msg)
 Encrypt header with the axolotl header key. More...
 
static void t_h_decrypt (struct CadetTunnelAxolotl *ax, const struct GNUNET_CADET_TunnelEncryptedMessage *src, struct GNUNET_CADET_TunnelEncryptedMessage *dst)
 Decrypt header with the current axolotl header key. More...
 
static void delete_skipped_key (struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
 Delete a key from the list of skipped keys. More...
 
static ssize_t try_old_ax_keys (struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
 Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer. More...
 
static void store_skipped_key (struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr)
 Delete a key from the list of skipped keys. More...
 
static int store_ax_keys (struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr, uint32_t Np)
 Stage skipped AX keys and calculate the message key. More...
 
static ssize_t t_ax_decrypt_and_validate (struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
 Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer. More...
 
static int notify_tunnel_up_cb (void *cls, uint32_t key, void *value)
 Our tunnel became ready for the first time, notify channels that have been waiting. More...
 
void GCT_change_estate (struct CadetTunnel *t, enum CadetTunnelEState state)
 Change the tunnel encryption state. More...
 
static void send_kx (struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
 Send a KX message. More...
 
static void send_kx_auth (struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
 Send a KX_AUTH message. More...
 
static void cleanup_ax (struct CadetTunnelAxolotl *ax)
 Cleanup state used by ax. More...
 
static int update_ax_by_kx (struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
 Update our Axolotl key state based on the KX data we received. More...
 
static void retry_kx (void *cls)
 Try to redo the KX or KX_AUTH handshake, if we can. More...
 
void GCT_handle_kx (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelKeyExchangeMessage *msg)
 Handle KX message that lacks authentication (and which will thus only be considered authenticated after we respond with our own KX_AUTH and finally successfully decrypt payload). More...
 
void GCT_handle_kx_auth (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelKeyExchangeAuthMessage *msg)
 Handle KX_AUTH message. More...
 
static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn (struct CadetTunnel *t)
 Compute the next free channel tunnel number for this tunnel. More...
 
struct GNUNET_CADET_ChannelTunnelNumber GCT_add_channel (struct CadetTunnel *t, struct CadetChannel *ch)
 Add a channel to a tunnel, and notify channel that we are ready for transmission if we are already up. More...
 
void GCT_connection_lost (struct CadetTConnection *ct)
 We lost a connection, remove it from our list and clean up the connection object itself. More...
 
static void destroy_t_connection (void *cls, struct CadetTConnection *ct)
 Clean up connection ct of a tunnel. More...
 
static void destroy_tunnel (void *cls)
 This tunnel is no longer used, destroy it. More...
 
void GCT_remove_channel (struct CadetTunnel *t, struct CadetChannel *ch, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Remove a channel from a tunnel. More...
 
static int destroy_remaining_channels (void *cls, uint32_t key, void *value)
 Destroy remaining channels during shutdown. More...
 
void GCT_destroy_tunnel_now (struct CadetTunnel *t)
 Destroys the tunnel t now, without delay. More...
 
static void try_send_normal_payload (struct CadetTunnel *t, struct CadetTConnection *ct)
 Send normal payload from queue in t via connection ct. More...
 
static void connection_ready_cb (void *cls, int is_ready)
 A connection is is_ready for transmission. More...
 
static void evaluate_connection (void *cls, struct CadetTConnection *ct)
 Evaluate a connection, updating our summary information in cls about what kinds of connections we have. More...
 
static int consider_path_cb (void *cls, struct CadetPeerPath *path, unsigned int off)
 Consider using the path p for the tunnel t. More...
 
static void maintain_connections_cb (void *cls)
 Function called to maintain the connections underlying our tunnel. More...
 
void GCT_consider_path (struct CadetTunnel *t, struct CadetPeerPath *p, unsigned int off)
 Consider using the path p for the tunnel t. More...
 
static void handle_plaintext_keepalive (void *cls, const struct GNUNET_MessageHeader *msg)
 We got a keepalive. More...
 
static int check_plaintext_data (void *cls, const struct GNUNET_CADET_ChannelAppDataMessage *msg)
 Check that msg is well-formed. More...
 
static void handle_plaintext_data (void *cls, const struct GNUNET_CADET_ChannelAppDataMessage *msg)
 We received payload data for a channel. More...
 
static void handle_plaintext_data_ack (void *cls, const struct GNUNET_CADET_ChannelDataAckMessage *ack)
 We received an acknowledgement for data we sent on a channel. More...
 
static void handle_plaintext_channel_open (void *cls, const struct GNUNET_CADET_ChannelOpenMessage *copen)
 We have received a request to open a channel to a port from another peer. More...
 
void GCT_send_channel_destroy (struct CadetTunnel *t, struct GNUNET_CADET_ChannelTunnelNumber ctn)
 Send a DESTROY message via the tunnel. More...
 
static void handle_plaintext_channel_open_ack (void *cls, const struct GNUNET_CADET_ChannelOpenAckMessage *cm)
 We have received confirmation from the target peer that the given channel could be established (the port is open). More...
 
static void handle_plaintext_channel_destroy (void *cls, const struct GNUNET_CADET_ChannelDestroyMessage *cm)
 We received a message saying that a channel should be destroyed. More...
 
static int handle_decrypted (void *cls, const struct GNUNET_MessageHeader *msg)
 Handles a message we decrypted, by injecting it into our message queue (which will do the dispatching). More...
 
static void decrypted_error_cb (void *cls, enum GNUNET_MQ_Error error)
 Function called if we had an error processing an incoming decrypted message. More...
 
struct CadetTunnelGCT_create_tunnel (struct CadetPeer *destination)
 Create a tunnel to destionation. More...
 
int GCT_add_inbound_connection (struct CadetTunnel *t, const struct GNUNET_CADET_ConnectionTunnelIdentifier *cid, struct CadetPeerPath *path)
 Add a connection to the tunnel. More...
 
void GCT_handle_encrypted (struct CadetTConnection *ct, const struct GNUNET_CADET_TunnelEncryptedMessage *msg)
 Handle encrypted message. More...
 
struct CadetTunnelQueueEntryGCT_send (struct CadetTunnel *t, const struct GNUNET_MessageHeader *message, GCT_SendContinuation cont, void *cont_cls, struct GNUNET_CADET_ChannelTunnelNumber *ctn)
 Sends an already built message on a tunnel, encrypting it and choosing the best connection if not provided. More...
 
void GCT_send_cancel (struct CadetTunnelQueueEntry *tq)
 Cancel a previously sent message while it's in the queue. More...
 
void GCT_iterate_connections (struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
 Iterate over all connections of a tunnel. More...
 
static int iterate_channels_cb (void *cls, uint32_t key, void *value)
 Helper function for GCT_iterate_channels. More...
 
void GCT_iterate_channels (struct CadetTunnel *t, GCT_ChannelIterator iter, void *iter_cls)
 Iterate over all channels of a tunnel. More...
 
static int debug_channel (void *cls, uint32_t key, void *value)
 Call GCCH_debug() on a channel. More...
 
void GCT_debug (const struct CadetTunnel *t, enum GNUNET_ErrorType level)
 Log all possible info about the tunnel state. More...
 

Detailed Description

Information we track per tunnel.

Author
Bartlomiej Polot
Christian Grothoff

FIXME:

Definition in file gnunet-service-cadet_tunnels.c.

Macro Definition Documentation

◆ LOG

#define LOG (   level,
  ... 
)    GNUNET_log_from (level, "cadet-tun", __VA_ARGS__)

◆ MAX_UNVERIFIED_ATTEMPTS

#define MAX_UNVERIFIED_ATTEMPTS   16

How often do we try to decrypt payload with unverified key material? Used to limit CPU increase upon receiving bogus KX.

Definition at line 52 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_handle_encrypted().

◆ IDLE_DESTROY_DELAY

#define IDLE_DESTROY_DELAY
Value:
#define GNUNET_TIME_UNIT_SECONDS
One second.
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:442

How long do we wait until tearing down an idle tunnel?

Definition at line 57 of file gnunet-service-cadet_tunnels.c.

Referenced by connection_ready_cb(), and GCT_remove_channel().

◆ INITIAL_KX_RETRY_DELAY

#define INITIAL_KX_RETRY_DELAY
Value:
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:442
#define GNUNET_TIME_UNIT_MILLISECONDS
One millisecond.

How long do we wait initially before retransmitting the KX? TODO: replace by 2 RTT if/once we have connection-level RTT data!

Definition at line 64 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_create_tunnel().

◆ MAX_SKIPPED_KEYS

#define MAX_SKIPPED_KEYS   64

Maximum number of skipped keys we keep in memory per tunnel.

Definition at line 70 of file gnunet-service-cadet_tunnels.c.

Referenced by store_ax_keys().

◆ MAX_KEY_GAP

#define MAX_KEY_GAP   256

Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is either a bogus packet or a DoS-attempt.

Definition at line 76 of file gnunet-service-cadet_tunnels.c.

Referenced by store_ax_keys().

◆ HIGH_BIT

#define HIGH_BIT   0x8000000

Referenced by get_next_free_ctn().

◆ LOG2

#define LOG2 (   level,
  ... 
)
Value:
GNUNET_log_from_nocheck (level, "cadet-tun", \
__VA_ARGS__)
void GNUNET_log_from_nocheck(enum GNUNET_ErrorType kind, const char *comp, const char *message,...)
Log function that specifies an alternative component.

Definition at line 3677 of file gnunet-service-cadet_tunnels.c.

Referenced by GCT_debug().

Function Documentation

◆ GCT_alice_or_betty()

int GCT_alice_or_betty ( const struct GNUNET_PeerIdentity other)

Am I Alice or Betty (some call her Bob), or talking to myself?

Parameters
otherthe other peer
Returns
GNUNET_YES for Alice, GNUNET_NO for Betty, GNUNET_SYSERR if talking to myself

Definition at line 468 of file gnunet-service-cadet_tunnels.c.

References GNUNET_break_op, GNUNET_memcmp, GNUNET_NO, GNUNET_SYSERR, GNUNET_YES, and my_full_id.

Referenced by GCT_handle_kx(), send_create(), send_kx(), and update_ax_by_kx().

469 {
470  if (0 > GNUNET_memcmp (&my_full_id,
471  other))
472  return GNUNET_YES;
473  else if (0 < GNUNET_memcmp (&my_full_id,
474  other))
475  return GNUNET_NO;
476  else
477  {
478  GNUNET_break_op (0);
479  return GNUNET_SYSERR;
480  }
481 }
struct GNUNET_PeerIdentity my_full_id
Local peer own ID.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
Here is the caller graph for this function:

◆ mark_connection_unready()

static void mark_connection_unready ( struct CadetTConnection ct)
static

Connection ct is now unready, clear it's ready flag and move it from the ready DLL to the busy DLL.

Parameters
ctconnection to move to unready status

Definition at line 491 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_CONTAINER_DLL_remove, GNUNET_NO, GNUNET_YES, CadetTConnection::is_ready, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, t, and CadetTConnection::t.

Referenced by connection_ready_cb(), send_kx(), send_kx_auth(), and try_send_normal_payload().

492 {
493  struct CadetTunnel *t = ct->t;
494 
498  ct);
501  ct->is_ready = GNUNET_NO;
504  ct);
506 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
int is_ready
Is the connection currently ready for transmission?
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct CadetTunnel * t
Tunnel this connection belongs to.
Struct containing all information regarding a tunnel to a peer.
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
Here is the caller graph for this function:

◆ GCT_2s()

const char* GCT_2s ( const struct CadetTunnel t)

Get the static string for the peer this tunnel is directed.

Parameters
tTunnel.
Returns
Static string the destination peer's ID.

Definition at line 517 of file gnunet-service-cadet_tunnels.c.

References buf, CadetTunnel::destination, GCP_get_id(), GNUNET_i2s(), and GNUNET_snprintf().

Referenced by connection_ready_cb(), consider_path_cb(), destroy_tunnel(), GCC_2s(), GCCH_bind(), GCCH_channel_local_new(), GCCH_debug(), GCP_drop_tunnel(), GCT_add_channel(), GCT_add_inbound_connection(), GCT_change_estate(), GCT_consider_path(), GCT_debug(), GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), GCT_remove_channel(), GCT_send(), handle_plaintext_channel_destroy(), handle_plaintext_channel_open(), handle_plaintext_channel_open_ack(), handle_plaintext_keepalive(), maintain_connections_cb(), retry_kx(), send_keepalive(), send_kx(), send_kx_auth(), try_send_normal_payload(), and update_state().

518 {
519  static char buf[64];
520 
521  if (NULL == t)
522  return "Tunnel(NULL)";
523  GNUNET_snprintf (buf,
524  sizeof(buf),
525  "Tunnel %s",
527  return buf;
528 }
int GNUNET_snprintf(char *buf, size_t size, const char *format,...)
Like snprintf, just aborts if the buffer is of insufficient size.
static char buf[2048]
struct CadetPeer * destination
Destination of the tunnel.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ estate2s()

static const char* estate2s ( enum CadetTunnelEState  es)
static

Get string description for tunnel encryption state.

Parameters
esTunnel state.
Returns
String representation.

Definition at line 539 of file gnunet-service-cadet_tunnels.c.

References buf, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, and GNUNET_snprintf().

Referenced by connection_ready_cb(), GCT_change_estate(), GCT_debug(), retry_kx(), and send_kx().

540 {
541  static char buf[32];
542 
543  switch (es)
544  {
546  return "CADET_TUNNEL_KEY_UNINITIALIZED";
548  return "CADET_TUNNEL_KEY_AX_RECV";
550  return "CADET_TUNNEL_KEY_AX_SENT";
552  return "CADET_TUNNEL_KEY_AX_SENT_AND_RECV";
554  return "CADET_TUNNEL_KEY_AX_AUTH_SENT";
555  case CADET_TUNNEL_KEY_OK:
556  return "CADET_TUNNEL_KEY_OK";
557  }
558  GNUNET_snprintf (buf,
559  sizeof(buf),
560  "%u (UNKNOWN STATE)",
561  es);
562  return buf;
563 }
int GNUNET_snprintf(char *buf, size_t size, const char *format,...)
Like snprintf, just aborts if the buffer is of insufficient size.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
KX message sent, waiting for other peer&#39;s KX_AUTH.
static char buf[2048]
Handshake completed: session key available.
KX message sent and received, trying to send back KX_AUTH.
Uninitialized status, we need to send KX.
KX message received, trying to send back KX_AUTH.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_get_destination()

struct CadetPeer* GCT_get_destination ( struct CadetTunnel t)

Return the peer to which this tunnel goes.

Parameters
ta tunnel
Returns
the destination of the tunnel

Definition at line 573 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::destination.

Referenced by GCCH_2s(), GCCH_bind(), GCCH_channel_incoming_new(), get_next_free_ctn(), and timeout_closed_cb().

574 {
575  return t->destination;
576 }
struct CadetPeer * destination
Destination of the tunnel.
Here is the caller graph for this function:

◆ GCT_count_channels()

unsigned int GCT_count_channels ( struct CadetTunnel t)

Count channels of a tunnel.

Return the number of channels using a tunnel.

Parameters
tTunnel on which to count.
Returns
Number of channels.

Definition at line 587 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, and GNUNET_CONTAINER_multihashmap32_size().

Referenced by connection_ready_cb(), destroy_tunnel(), GCT_destroy_tunnel_now(), GCT_remove_channel(), get_all_tunnels_iterator(), and retry_kx().

588 {
590 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
unsigned int GNUNET_CONTAINER_multihashmap32_size(const struct GNUNET_CONTAINER_MultiHashMap32 *map)
Get the number of key-value pairs in the map.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ lookup_channel()

struct CadetChannel* lookup_channel ( struct CadetTunnel t,
struct GNUNET_CADET_ChannelTunnelNumber  ctn 
)

Lookup a channel by its ctn.

Parameters
ttunnel to look in
ctnnumber of channel to find
Returns
NULL if channel does not exist

Definition at line 601 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, GNUNET_CADET_ChannelTunnelNumber::cn, and GNUNET_CONTAINER_multihashmap32_get().

Referenced by GCT_send(), handle_plaintext_channel_destroy(), handle_plaintext_channel_open_ack(), handle_plaintext_data(), and handle_plaintext_data_ack().

603 {
605  ntohl (ctn.cn));
606 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
void * GNUNET_CONTAINER_multihashmap32_get(const struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key)
Given a key find a value in the map matching the key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_count_any_connections()

unsigned int GCT_count_any_connections ( const struct CadetTunnel t)

Count all created connections of a tunnel.

Return the number of connections available for a tunnel.

Not necessarily ready connections!

Parameters
tTunnel on which to count.
Returns
Number of connections created, either being established or ready.

Definition at line 617 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::num_busy_connections, and CadetTunnel::num_ready_connections.

Referenced by consider_path_cb(), GCT_debug(), get_all_tunnels_iterator(), and maintain_connections_cb().

618 {
620 }
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
Here is the caller graph for this function:

◆ get_ready_connection()

static struct CadetTConnection* get_ready_connection ( struct CadetTunnel t)
static

Find first connection that is ready in the list of our connections.

Picks ready connections round-robin.

Parameters
ttunnel to search
Returns
NULL if we have no connection that is ready

Definition at line 631 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_ready_head, GNUNET_assert, GNUNET_YES, and CadetTConnection::is_ready.

Referenced by send_kx(), send_kx_auth(), and trigger_transmissions().

632 {
633  struct CadetTConnection *hd = t->connection_ready_head;
634 
635  GNUNET_assert ((NULL == hd) ||
636  (GNUNET_YES == hd->is_ready));
637  return hd;
638 }
int is_ready
Is the connection currently ready for transmission?
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
Entry in list of connections used by tunnel, with metadata.
Here is the caller graph for this function:

◆ GCT_get_estate()

enum CadetTunnelEState GCT_get_estate ( struct CadetTunnel t)

Get the encryption state of a tunnel.

Parameters
tTunnel.
Returns
Tunnel's encryption state.

Definition at line 649 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::estate, and trigger_transmissions().

Referenced by get_all_tunnels_iterator(), handle_connection_create(), send_create(), and send_keepalive().

650 {
651  return t->estate;
652 }
enum CadetTunnelEState estate
State of the tunnel encryption.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ trigger_transmissions()

static void trigger_transmissions ( void *  cls)
static

Called when either we have a new connection, or a new message in the queue, or some existing connection has transmission capacity.

Looks at our message queue and if there is a message, picks a connection to send it on.

Parameters
clsthe struct CadetTunnel to process messages on

Definition at line 2512 of file gnunet-service-cadet_tunnels.c.

References get_ready_connection(), CadetTunnel::send_task, CadetTunnel::tq_head, and try_send_normal_payload().

Referenced by GCT_change_estate(), GCT_get_estate(), GCT_handle_encrypted(), and GCT_send().

2513 {
2514  struct CadetTunnel *t = cls;
2515  struct CadetTConnection *ct;
2516 
2517  t->send_task = NULL;
2518  if (NULL == t->tq_head)
2519  return; /* no messages pending right now */
2520  ct = get_ready_connection (t);
2521  if (NULL == ct)
2522  return; /* no connections ready */
2524  ct);
2525 }
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
static struct GNUNET_SCHEDULER_Task * t
Main task.
Struct containing all information regarding a tunnel to a peer.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
Entry in list of connections used by tunnel, with metadata.
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
static void try_send_normal_payload(struct CadetTunnel *t, struct CadetTConnection *ct)
Send normal payload from queue in t via connection ct.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ new_ephemeral()

static void new_ephemeral ( struct CadetTunnelAxolotl ax)
static

Create a new Axolotl ephemeral (ratchet) key.

Parameters
axkey material to update

Definition at line 676 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::DHRs, GNUNET_CRYPTO_ecdhe_key_create(), GNUNET_ERROR_TYPE_DEBUG, and LOG.

Referenced by GCT_create_tunnel(), and t_ax_encrypt().

677 {
679  "Creating new ephemeral ratchet key (DHRs)\n");
681 }
void GNUNET_CRYPTO_ecdhe_key_create(struct GNUNET_CRYPTO_EcdhePrivateKey *pk)
Create a new private key.
Definition: crypto_ecc.c:508
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
#define LOG(level,...)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_hmac()

static void t_hmac ( const void *  plaintext,
size_t  size,
uint32_t  iv,
const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_ShortHashCode hmac 
)
static

Calculate HMAC.

Parameters
plaintextContent to HMAC.
sizeSize of plaintext.
ivInitialization vector for the message.
keyKey to use.
hmac[out]Destination to store the HMAC.

Definition at line 694 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_hmac(), GNUNET_CRYPTO_hmac_derive_key(), and GNUNET_memcpy.

Referenced by GCT_send(), t_ax_decrypt_and_validate(), and try_old_ax_keys().

699 {
700  static const char ctx[] = "cadet authentication key";
701  struct GNUNET_CRYPTO_AuthKey auth_key;
702  struct GNUNET_HashCode hash;
703 
705  key,
706  &iv, sizeof(iv),
707  key, sizeof(*key),
708  ctx, sizeof(ctx),
709  NULL);
710  /* Two step: GNUNET_ShortHash is only 256 bits,
711  GNUNET_HashCode is 512, so we truncate. */
712  GNUNET_CRYPTO_hmac (&auth_key,
713  plaintext,
714  size,
715  &hash);
716  GNUNET_memcpy (hmac,
717  &hash,
718  sizeof(*hmac));
719 }
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
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:455
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
A 512-bit hashcode.
static unsigned int size
Size of the "table".
Definition: peer.c:67
void GNUNET_CRYPTO_hmac_derive_key(struct GNUNET_CRYPTO_AuthKey *key, const struct GNUNET_CRYPTO_SymmetricSessionKey *rkey, const void *salt, size_t salt_len,...)
Derive an authentication key.
Definition: crypto_hash.c:373
type for (message) authentication keys
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_hmac_hash()

static void t_ax_hmac_hash ( const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_HashCode hash,
const void *  source,
unsigned int  len 
)
static

Perform a HMAC.

Parameters
keyKey to use.
[out]hashResulting HMAC.
sourceSource key material (data to HMAC).
lenLength of source.

Definition at line 731 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_hmac(), and GNUNET_CRYPTO_hmac_derive_key().

Referenced by t_ax_decrypt_and_validate(), t_ax_encrypt(), and t_hmac_derive_key().

735 {
736  static const char ctx[] = "axolotl HMAC-HASH";
737  struct GNUNET_CRYPTO_AuthKey auth_key;
738 
740  key,
741  ctx, sizeof(ctx),
742  NULL);
743  GNUNET_CRYPTO_hmac (&auth_key,
744  source,
745  len,
746  hash);
747 }
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:455
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static GstElement * source
Appsrc instance into which we write data for the pipeline.
void GNUNET_CRYPTO_hmac_derive_key(struct GNUNET_CRYPTO_AuthKey *key, const struct GNUNET_CRYPTO_SymmetricSessionKey *rkey, const void *salt, size_t salt_len,...)
Derive an authentication key.
Definition: crypto_hash.c:373
type for (message) authentication keys
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_hmac_derive_key()

static void t_hmac_derive_key ( const struct GNUNET_CRYPTO_SymmetricSessionKey key,
struct GNUNET_CRYPTO_SymmetricSessionKey out,
const void *  source,
unsigned int  len 
)
static

Derive a symmetric encryption key from an HMAC-HASH.

Parameters
keyKey to use for the HMAC.
[out]outKey to generate.
sourceSource key material (data to HMAC).
lenLength of source.

Definition at line 759 of file gnunet-service-cadet_tunnels.c.

References ctx, GNUNET_CRYPTO_kdf(), and t_ax_hmac_hash().

Referenced by store_skipped_key(), t_ax_decrypt(), and t_ax_encrypt().

763 {
764  static const char ctx[] = "axolotl derive key";
765  struct GNUNET_HashCode h;
766 
767  t_ax_hmac_hash (key,
768  &h,
769  source,
770  len);
771  GNUNET_CRYPTO_kdf (out, sizeof(*out),
772  ctx, sizeof(ctx),
773  &h, sizeof(h),
774  NULL);
775 }
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:99
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
A 512-bit hashcode.
static GstElement * source
Appsrc instance into which we write data for the pipeline.
int 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
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_encrypt()

static void t_ax_encrypt ( struct CadetTunnelAxolotl ax,
void *  dst,
const void *  src,
size_t  size 
)
static

Encrypt data with the axolotl tunnel key.

Parameters
axkey material to use.
dstDestination with size bytes for the encrypted data.
srcSource of the plaintext. Can overlap with dst, must contain size bytes
sizeSize of the buffers at src and dst

Definition at line 787 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKs, ctx, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_assert, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_CRYPTO_symmetric_encrypt(), GNUNET_NO, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get(), GNUNET_TIME_absolute_get_remaining(), GNUNET_YES, CadetTunnelAxolotl::HKs, new_ephemeral(), CadetTunnelAxolotl::NHKs, CadetTunnelAxolotl::Ns, CadetTunnelAxolotl::PNs, CadetTunnelAxolotl::ratchet_allowed, CadetTunnelAxolotl::ratchet_counter, CadetTunnelAxolotl::ratchet_expiration, CadetTunnelAxolotl::ratchet_flag, ratchet_time, GNUNET_TIME_Relative::rel_value_us, CadetTunnelAxolotl::RK, t_ax_hmac_hash(), and t_hmac_derive_key().

Referenced by GCT_send().

791 {
794  size_t out_size;
795 
796  ax->ratchet_counter++;
797  if ((GNUNET_YES == ax->ratchet_allowed) &&
798  ((ratchet_messages <= ax->ratchet_counter) ||
801  {
802  ax->ratchet_flag = GNUNET_YES;
803  }
804  if (GNUNET_YES == ax->ratchet_flag)
805  {
806  /* Advance ratchet */
807  struct GNUNET_CRYPTO_SymmetricSessionKey keys[3];
808  struct GNUNET_HashCode dh;
809  struct GNUNET_HashCode hmac;
810  static const char ctx[] = "axolotl ratchet";
811 
812  new_ephemeral (ax);
813  ax->HKs = ax->NHKs;
814 
815  /* RK, NHKs, CKs = KDF( HMAC-HASH(RK, DH(DHRs, DHRr)) ) */
817  &ax->DHRr,
818  &dh);
819  t_ax_hmac_hash (&ax->RK,
820  &hmac,
821  &dh,
822  sizeof(dh));
823  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
824  ctx, sizeof(ctx),
825  &hmac, sizeof(hmac),
826  NULL);
827  ax->RK = keys[0];
828  ax->NHKs = keys[1];
829  ax->CKs = keys[2];
830 
831  ax->PNs = ax->Ns;
832  ax->Ns = 0;
833  ax->ratchet_flag = GNUNET_NO;
835  ax->ratchet_counter = 0;
838  ratchet_time);
839  }
840 
841  t_hmac_derive_key (&ax->CKs,
842  &MK,
843  "0",
844  1);
846  &MK,
847  NULL, 0,
848  NULL);
849 
850  out_size = GNUNET_CRYPTO_symmetric_encrypt (src,
851  size,
852  &MK,
853  &iv,
854  dst);
855  GNUNET_assert (size == out_size);
856  t_hmac_derive_key (&ax->CKs,
857  &ax->CKs,
858  "1",
859  1);
860 }
uint64_t rel_value_us
The actual value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_TIME_Absolute ratchet_expiration
Time when the current ratchet expires and a new one is triggered (if ratchet_allowed is GNUNET_YES)...
uint32_t PNs
Previous message numbers (# of msgs sent under prev ratchet)
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:850
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:395
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
struct GNUNET_TIME_Relative ratchet_time
How long until we trigger a ratched advance due to time.
ssize_t GNUNET_CRYPTO_symmetric_encrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Encrypt a block using a symmetric sessionkey.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
A 512-bit hashcode.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
int ratchet_allowed
True (GNUNET_YES) if we have received a message from the other peer that uses the keys from our last ...
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
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:331
unsigned int ratchet_counter
Number of messages recieved since our last ratchet advance.
struct GNUNET_CRYPTO_SymmetricSessionKey CKs
32-byte chain keys (used for forward-secrecy) for sending messages.
static void new_ephemeral(struct CadetTunnelAxolotl *ax)
Create a new Axolotl ephemeral (ratchet) key.
int ratchet_flag
True (GNUNET_YES) if we have to send a new ratchet key in next msg.
int 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
struct GNUNET_CRYPTO_SymmetricSessionKey NHKs
32-byte next header key (for sending), used once the ratchet advances.
uint32_t Ns
Message number (reset to 0 with each new ratchet, next message to send).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_decrypt()

static void t_ax_decrypt ( struct CadetTunnelAxolotl ax,
void *  dst,
const void *  src,
size_t  size 
)
static

Decrypt data with the axolotl tunnel key.

Parameters
axkey material to use.
dstDestination for the decrypted data, must contain size bytes.
srcSource of the ciphertext. Can overlap with dst, must contain size bytes.
sizeSize of the src and dst buffers

Definition at line 872 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKr, GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), and t_hmac_derive_key().

Referenced by t_ax_decrypt_and_validate().

876 {
879  size_t out_size;
880 
881  t_hmac_derive_key (&ax->CKr,
882  &MK,
883  "0",
884  1);
886  &MK,
887  NULL, 0,
888  NULL);
889  GNUNET_assert (size >= sizeof(struct GNUNET_MessageHeader));
890  out_size = GNUNET_CRYPTO_symmetric_decrypt (src,
891  size,
892  &MK,
893  &iv,
894  dst);
895  GNUNET_assert (out_size == size);
896  t_hmac_derive_key (&ax->CKr,
897  &ax->CKr,
898  "1",
899  1);
900 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
static unsigned int size
Size of the "table".
Definition: peer.c:67
Header for all communications.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_h_encrypt()

static void t_h_encrypt ( struct CadetTunnelAxolotl ax,
struct GNUNET_CADET_TunnelEncryptedMessage msg 
)
static

Encrypt header with the axolotl header key.

Parameters
axkey material to use.

Definition at line 910 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, GNUNET_assert, GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_CRYPTO_symmetric_encrypt(), and CadetTunnelAxolotl::HKs.

Referenced by GCT_send().

912 {
914  size_t out_size;
915 
917  &ax->HKs,
918  NULL, 0,
919  NULL);
920  out_size = GNUNET_CRYPTO_symmetric_encrypt (&msg->ax_header,
921  sizeof(struct
923  &ax->HKs,
924  &iv,
925  &msg->ax_header);
926  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == out_size);
927 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
ssize_t GNUNET_CRYPTO_symmetric_encrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Encrypt a block using a symmetric sessionkey.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_h_decrypt()

static void t_h_decrypt ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
struct GNUNET_CADET_TunnelEncryptedMessage dst 
)
static

Decrypt header with the current axolotl header key.

Parameters
axkey material to use.
srcMessage whose header to decrypt.
dstWhere to decrypt header to.

Definition at line 938 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), CadetTunnelAxolotl::HKr, and GNUNET_CADET_AxHeader::Ns.

Referenced by t_ax_decrypt_and_validate().

941 {
943  size_t out_size;
944 
946  &ax->HKr,
947  NULL, 0,
948  NULL);
949  out_size = GNUNET_CRYPTO_symmetric_decrypt (&src->ax_header.Ns,
950  sizeof(struct
952  &ax->HKr,
953  &iv,
954  &dst->ax_header.Ns);
955  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == out_size);
956 }
uint32_t Ns
Number of messages sent with the current ratchet key.
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ delete_skipped_key()

static void delete_skipped_key ( struct CadetTunnelAxolotl ax,
struct CadetTunnelSkippedKey key 
)
static

Delete a key from the list of skipped keys.

Parameters
axkey material to delete key from.
keyKey to delete.

Definition at line 966 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CONTAINER_DLL_remove, GNUNET_free, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_head, and CadetTunnelAxolotl::skipped_tail.

Referenced by cleanup_ax(), store_ax_keys(), and try_old_ax_keys().

968 {
970  ax->skipped_tail,
971  key);
972  GNUNET_free (key);
973  ax->skipped--;
974 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the caller graph for this function:

◆ try_old_ax_keys()

static ssize_t try_old_ax_keys ( struct CadetTunnelAxolotl ax,
void *  dst,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
size_t  size 
)
static

Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer.

Parameters
axkey material to use.
dstDestination for the plaintext.
srcSource of the message. Can overlap with dst.
sizeSize of the message.
Returns
Size of the decrypted data, -1 if an error was encountered.

Definition at line 988 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, delete_skipped_key(), GNUNET_assert, GNUNET_CRYPTO_symmetric_decrypt(), GNUNET_CRYPTO_symmetric_derive_iv(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_memcmp, CadetTunnelSkippedKey::HK, GNUNET_CADET_TunnelEncryptedMessage::hmac, key, CadetTunnelSkippedKey::Kn, len, LOG, CadetTunnelSkippedKey::MK, N, CadetTunnelSkippedKey::next, GNUNET_CADET_AxHeader::Ns, res, CadetTunnelAxolotl::skipped_head, and t_hmac().

Referenced by t_ax_decrypt_and_validate().

992 {
993  struct CadetTunnelSkippedKey *key;
994  struct GNUNET_ShortHashCode *hmac;
996  struct GNUNET_CADET_TunnelEncryptedMessage plaintext_header;
997  struct GNUNET_CRYPTO_SymmetricSessionKey *valid_HK;
998  size_t esize;
999  size_t res;
1000  size_t len;
1001  unsigned int N;
1002 
1004  "Trying skipped keys\n");
1005  hmac = &plaintext_header.hmac;
1006  esize = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1007 
1008  /* Find a correct Header Key */
1009  valid_HK = NULL;
1010  for (key = ax->skipped_head; NULL != key; key = key->next)
1011  {
1012  t_hmac (&src->ax_header,
1013  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1014  0,
1015  &key->HK,
1016  hmac);
1017  if (0 == GNUNET_memcmp (hmac,
1018  &src->hmac))
1019  {
1020  valid_HK = &key->HK;
1021  break;
1022  }
1023  }
1024  if (NULL == key)
1025  return -1;
1026 
1027  /* Should've been checked in -cadet_connection.c handle_cadet_encrypted. */
1029  len = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1030  GNUNET_assert (len >= sizeof(struct GNUNET_MessageHeader));
1031 
1032  /* Decrypt header */
1034  &key->HK,
1035  NULL, 0,
1036  NULL);
1038  sizeof(struct GNUNET_CADET_AxHeader),
1039  &key->HK,
1040  &iv,
1041  &plaintext_header.ax_header.Ns);
1042  GNUNET_assert (sizeof(struct GNUNET_CADET_AxHeader) == res);
1043 
1044  /* Find the correct message key */
1045  N = ntohl (plaintext_header.ax_header.Ns);
1046  while ((NULL != key) &&
1047  (N != key->Kn))
1048  key = key->next;
1049  if ((NULL == key) ||
1050  (0 != GNUNET_memcmp (&key->HK,
1051  valid_HK)))
1052  return -1;
1053 
1054  /* Decrypt payload */
1056  &key->MK,
1057  NULL,
1058  0,
1059  NULL);
1060  res = GNUNET_CRYPTO_symmetric_decrypt (&src[1],
1061  len,
1062  &key->MK,
1063  &iv,
1064  dst);
1065  delete_skipped_key (ax,
1066  key);
1067  return res;
1068 }
Axolotl-encrypted tunnel message with application payload.
Struct to old keys for skipped messages while advancing the Axolotl ratchet.
uint32_t Ns
Number of messages sent with the current ratchet key.
static void t_hmac(const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
Calculate HMAC.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
A 256-bit hashcode.
struct GNUNET_CRYPTO_SymmetricSessionKey HK
Header key.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
void GNUNET_CRYPTO_symmetric_derive_iv(struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *skey, const void *salt, size_t salt_len,...)
Derive an IV.
static int res
struct GNUNET_HashCode key
The key used in the DHT.
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_ShortHashCode hmac
MAC of the encrypted message, used to verify message integrity.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
unsigned int Kn
Key number for a given HK.
#define N
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
#define LOG(level,...)
Header for all communications.
struct CadetTunnelSkippedKey * next
DLL next.
ssize_t GNUNET_CRYPTO_symmetric_decrypt(const void *block, size_t size, const struct GNUNET_CRYPTO_SymmetricSessionKey *sessionkey, const struct GNUNET_CRYPTO_SymmetricInitializationVector *iv, void *result)
Decrypt a given block using a symmetric sessionkey.
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
struct GNUNET_CRYPTO_SymmetricSessionKey MK
Message key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ store_skipped_key()

static void store_skipped_key ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CRYPTO_SymmetricSessionKey HKr 
)
static

Delete a key from the list of skipped keys.

Parameters
axkey material to delete from.
HKrHeader Key to use.

Definition at line 1078 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKr, GNUNET_CONTAINER_DLL_insert, GNUNET_new, GNUNET_TIME_absolute_get(), CadetTunnelSkippedKey::HK, CadetTunnelAxolotl::HKr, key, CadetTunnelSkippedKey::Kn, CadetTunnelSkippedKey::MK, CadetTunnelAxolotl::Nr, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_head, CadetTunnelAxolotl::skipped_tail, t_hmac_derive_key(), and CadetTunnelSkippedKey::timestamp.

Referenced by store_ax_keys().

1080 {
1081  struct CadetTunnelSkippedKey *key;
1082 
1083  key = GNUNET_new (struct CadetTunnelSkippedKey);
1085  key->Kn = ax->Nr;
1086  key->HK = ax->HKr;
1087  t_hmac_derive_key (&ax->CKr,
1088  &key->MK,
1089  "0",
1090  1);
1091  t_hmac_derive_key (&ax->CKr,
1092  &ax->CKr,
1093  "1",
1094  1);
1096  ax->skipped_tail,
1097  key);
1098  ax->skipped++;
1099  ax->Nr++;
1100 }
Struct to old keys for skipped messages while advancing the Axolotl ratchet.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
struct GNUNET_TIME_Absolute timestamp
When was this key stored (for timeout).
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
#define GNUNET_new(type)
Allocate a struct or union of the given type.
struct GNUNET_CRYPTO_SymmetricSessionKey HK
Header key.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static void t_hmac_derive_key(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_CRYPTO_SymmetricSessionKey *out, const void *source, unsigned int len)
Derive a symmetric encryption key from an HMAC-HASH.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct GNUNET_HashCode key
The key used in the DHT.
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
unsigned int Kn
Key number for a given HK.
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
struct GNUNET_CRYPTO_SymmetricSessionKey MK
Message key.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ store_ax_keys()

static int store_ax_keys ( struct CadetTunnelAxolotl ax,
const struct GNUNET_CRYPTO_SymmetricSessionKey HKr,
uint32_t  Np 
)
static

Stage skipped AX keys and calculate the message key.

Stores each HK and MK for skipped messages.

Parameters
axkey material to use
HKrHeader key.
NpReceived meesage number.
Returns
GNUNET_OK if keys were stored. GNUNET_SYSERR if an error ocurred (Np not expected).

Definition at line 1114 of file gnunet-service-cadet_tunnels.c.

References delete_skipped_key(), GNUNET_break_op, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_OK, GNUNET_SYSERR, LOG, MAX_KEY_GAP, MAX_SKIPPED_KEYS, CadetTunnelAxolotl::Nr, CadetTunnelAxolotl::skipped, CadetTunnelAxolotl::skipped_tail, and store_skipped_key().

Referenced by t_ax_decrypt_and_validate().

1117 {
1118  int gap;
1119 
1120  gap = Np - ax->Nr;
1122  "Storing skipped keys [%u, %u)\n",
1123  ax->Nr,
1124  Np);
1125  if (MAX_KEY_GAP < gap)
1126  {
1127  /* Avoid DoS (forcing peer to do more than #MAX_KEY_GAP HMAC operations) */
1128  /* TODO: start new key exchange on return */
1129  GNUNET_break_op (0);
1131  "Got message %u, expected %u+\n",
1132  Np,
1133  ax->Nr);
1134  return GNUNET_SYSERR;
1135  }
1136  if (0 > gap)
1137  {
1138  /* Delayed message: don't store keys, flag to try old keys. */
1139  return GNUNET_SYSERR;
1140  }
1141 
1142  while (ax->Nr < Np)
1143  store_skipped_key (ax,
1144  HKr);
1145 
1146  while (ax->skipped > MAX_SKIPPED_KEYS)
1147  delete_skipped_key (ax,
1148  ax->skipped_tail);
1149  return GNUNET_OK;
1150 }
struct CadetTunnelSkippedKey * skipped_tail
Skipped messages&#39; keys DLL, tail.
static void store_skipped_key(struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr)
Delete a key from the list of skipped keys.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
#define MAX_SKIPPED_KEYS
Maximum number of skipped keys we keep in memory per tunnel.
#define LOG(level,...)
#define MAX_KEY_GAP
Maximum number of keys (and thus ratchet steps) we are willing to skip before we decide this is eithe...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ t_ax_decrypt_and_validate()

static ssize_t t_ax_decrypt_and_validate ( struct CadetTunnelAxolotl ax,
void *  dst,
const struct GNUNET_CADET_TunnelEncryptedMessage src,
size_t  size 
)
static

Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered since it was sent by the remote peer.

Parameters
axkey material to use
dstDestination for the plaintext.
srcSource of the message. Can overlap with dst.
sizeSize of the message.
Returns
Size of the decrypted data, -1 if an error was encountered.

Definition at line 1164 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelEncryptedMessage::ax_header, CadetTunnelAxolotl::CKr, ctx, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_CADET_AxHeader::DHRs, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_memcmp, GNUNET_OK, GNUNET_YES, CadetTunnelAxolotl::HKr, GNUNET_CADET_TunnelEncryptedMessage::hmac, CadetTunnelAxolotl::NHKr, CadetTunnelAxolotl::Nr, GNUNET_CADET_AxHeader::Ns, GNUNET_CADET_AxHeader::PNs, CadetTunnelAxolotl::ratchet_allowed, CadetTunnelAxolotl::RK, store_ax_keys(), t_ax_decrypt(), t_ax_hmac_hash(), t_h_decrypt(), t_hmac(), and try_old_ax_keys().

Referenced by GCT_handle_encrypted().

1169 {
1170  struct GNUNET_ShortHashCode msg_hmac;
1171  struct GNUNET_HashCode hmac;
1172  struct GNUNET_CADET_TunnelEncryptedMessage plaintext_header;
1173  uint32_t Np;
1174  uint32_t PNp;
1175  size_t esize; /* Size of encryped payload */
1176 
1177  esize = size - sizeof(struct GNUNET_CADET_TunnelEncryptedMessage);
1178 
1179  /* Try current HK */
1180  t_hmac (&src->ax_header,
1181  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1182  0, &ax->HKr,
1183  &msg_hmac);
1184  if (0 != GNUNET_memcmp (&msg_hmac,
1185  &src->hmac))
1186  {
1187  static const char ctx[] = "axolotl ratchet";
1188  struct GNUNET_CRYPTO_SymmetricSessionKey keys[3]; /* RKp, NHKp, CKp */
1190  struct GNUNET_HashCode dh;
1191  struct GNUNET_CRYPTO_EcdhePublicKey *DHRp;
1192 
1193  /* Try Next HK */
1194  t_hmac (&src->ax_header,
1195  sizeof(struct GNUNET_CADET_AxHeader) + esize,
1196  0,
1197  &ax->NHKr,
1198  &msg_hmac);
1199  if (0 != GNUNET_memcmp (&msg_hmac,
1200  &src->hmac))
1201  {
1202  /* Try the skipped keys, if that fails, we're out of luck. */
1203  return try_old_ax_keys (ax,
1204  dst,
1205  src,
1206  size);
1207  }
1208  HK = ax->HKr;
1209  ax->HKr = ax->NHKr;
1210  t_h_decrypt (ax,
1211  src,
1212  &plaintext_header);
1213  Np = ntohl (plaintext_header.ax_header.Ns);
1214  PNp = ntohl (plaintext_header.ax_header.PNs);
1215  DHRp = &plaintext_header.ax_header.DHRs;
1216  store_ax_keys (ax,
1217  &HK,
1218  PNp);
1219 
1220  /* RKp, NHKp, CKp = KDF (HMAC-HASH (RK, DH (DHRp, DHRs))) */
1222  DHRp,
1223  &dh);
1224  t_ax_hmac_hash (&ax->RK,
1225  &hmac,
1226  &dh, sizeof(dh));
1227  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
1228  ctx, sizeof(ctx),
1229  &hmac, sizeof(hmac),
1230  NULL);
1231 
1232  /* Commit "purported" keys */
1233  ax->RK = keys[0];
1234  ax->NHKr = keys[1];
1235  ax->CKr = keys[2];
1236  ax->DHRr = *DHRp;
1237  ax->Nr = 0;
1239  }
1240  else
1241  {
1242  t_h_decrypt (ax,
1243  src,
1244  &plaintext_header);
1245  Np = ntohl (plaintext_header.ax_header.Ns);
1246  PNp = ntohl (plaintext_header.ax_header.PNs);
1247  }
1248  if ((Np != ax->Nr) &&
1249  (GNUNET_OK != store_ax_keys (ax,
1250  &ax->HKr,
1251  Np)))
1252  {
1253  /* Try the skipped keys, if that fails, we're out of luck. */
1254  return try_old_ax_keys (ax,
1255  dst,
1256  src,
1257  size);
1258  }
1259 
1260  t_ax_decrypt (ax,
1261  dst,
1262  &src[1],
1263  esize);
1264  ax->Nr = Np + 1;
1265  return esize;
1266 }
Axolotl-encrypted tunnel message with application payload.
static void t_hmac(const void *plaintext, size_t size, uint32_t iv, const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_ShortHashCode *hmac)
Calculate HMAC.
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:850
struct GNUNET_CRYPTO_SymmetricSessionKey NHKr
32-byte next header key (for receiving).
struct GNUNET_CADET_AxHeader ax_header
Axolotl-header that specifies which keys to use in which ratchet to decrypt the body that follows...
Encrypted axolotl header with numbers that identify which keys in which ratchet are to be used to dec...
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static int store_ax_keys(struct CadetTunnelAxolotl *ax, const struct GNUNET_CRYPTO_SymmetricSessionKey *HKr, uint32_t Np)
Stage skipped AX keys and calculate the message key.
A 256-bit hashcode.
static void t_ax_hmac_hash(const struct GNUNET_CRYPTO_SymmetricSessionKey *key, struct GNUNET_HashCode *hash, const void *source, unsigned int len)
Perform a HMAC.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
static ssize_t try_old_ax_keys(struct CadetTunnelAxolotl *ax, void *dst, const struct GNUNET_CADET_TunnelEncryptedMessage *src, size_t size)
Decrypt and verify data with the appropriate tunnel key and verify that the data has not been altered...
A 512-bit hashcode.
int ratchet_allowed
True (GNUNET_YES) if we have received a message from the other peer that uses the keys from our last ...
static unsigned int size
Size of the "table".
Definition: peer.c:67
uint32_t Nr
Message number (reset to 0 with each new ratchet, next message to recv).
struct GNUNET_ShortHashCode hmac
MAC of the encrypted message, used to verify message integrity.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Public ECC key (always for Curve25519) encoded in a format suitable for network transmission and encr...
static void t_h_decrypt(struct CadetTunnelAxolotl *ax, const struct GNUNET_CADET_TunnelEncryptedMessage *src, struct GNUNET_CADET_TunnelEncryptedMessage *dst)
Decrypt header with the current axolotl header key.
static void t_ax_decrypt(struct CadetTunnelAxolotl *ax, void *dst, const void *src, size_t size)
Decrypt data with the axolotl tunnel key.
int 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
Here is the call graph for this function:
Here is the caller graph for this function:

◆ notify_tunnel_up_cb()

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

Our tunnel became ready for the first time, notify channels that have been waiting.

Parameters
clsour tunnel, not used
keyunique ID of the channel, not used
valuethe struct CadetChannel to notify
Returns
GNUNET_OK (continue to iterate)

Definition at line 1279 of file gnunet-service-cadet_tunnels.c.

References ch, GCCH_tunnel_up(), GNUNET_OK, and value.

Referenced by GCT_change_estate().

1282 {
1283  struct CadetChannel *ch = value;
1284 
1285  GCCH_tunnel_up (ch);
1286  return GNUNET_OK;
1287 }
static struct GNUNET_CADET_Channel * ch
Channel handle.
Definition: gnunet-cadet.c:117
void GCCH_tunnel_up(struct CadetChannel *ch)
Function called once and only once after a channel was bound to its tunnel via GCT_add_channel() is r...
static char * value
Value of the record to add/remove.
Struct containing all information regarding a channel to a remote client.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_change_estate()

void GCT_change_estate ( struct CadetTunnel t,
enum CadetTunnelEState  state 
)

Change the tunnel encryption state.

If the encryption state changes to OK, stop the rekey task.

Parameters
tTunnel whose encryption state to change, or NULL.
stateNew encryption state.

Definition at line 1298 of file gnunet-service-cadet_tunnels.c.

References CADET_TUNNEL_KEY_OK, CadetTunnel::channels, CadetTunnel::estate, estate2s(), GCT_2s(), GNUNET_CONTAINER_multihashmap32_iterate(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), CadetTunnel::kx_task, LOG, notify_tunnel_up_cb(), CadetTunnel::send_task, state, and trigger_transmissions().

Referenced by GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), handle_connection_create(), send_kx(), and send_kx_auth().

1300 {
1301  enum CadetTunnelEState old = t->estate;
1302 
1303  t->estate = state;
1305  "%s estate changed from %s to %s\n",
1306  GCT_2s (t),
1307  estate2s (old),
1308  estate2s (state));
1309 
1310  if ((CADET_TUNNEL_KEY_OK != old) &&
1311  (CADET_TUNNEL_KEY_OK == t->estate))
1312  {
1313  if (NULL != t->kx_task)
1314  {
1316  t->kx_task = NULL;
1317  }
1318  /* notify all channels that have been waiting */
1321  t);
1322  if (NULL != t->send_task)
1325  t);
1326  }
1327 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MulitHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
static void trigger_transmissions(void *cls)
Called when either we have a new connection, or a new message in the queue, or some existing connecti...
enum State state
current state of profiling
CadetTunnelEState
All the encryption states a tunnel can be in.
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
Handshake completed: session key available.
static int notify_tunnel_up_cb(void *cls, uint32_t key, void *value)
Our tunnel became ready for the first time, notify channels that have been waiting.
#define LOG(level,...)
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
enum CadetTunnelEState estate
State of the tunnel encryption.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_kx()

static void send_kx ( struct CadetTunnel t,
struct CadetTConnection ct,
struct CadetTunnelAxolotl ax 
)
static

Send a KX message.

Parameters
ttunnel on which to send the KX_AUTH
ctTunnel and connection on which to send the KX_AUTH, NULL if we are to find one that is ready.
axaxolotl key context to use

Definition at line 1339 of file gnunet-service-cadet_tunnels.c.

References CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, GNUNET_CADET_TunnelKeyExchangeMessage::cid, GNUNET_CADET_ConnectionTunnelIdentifier::connection_of_tunnel, CadetTunnel::destination, CadetTunnelAxolotl::DHRs, env, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, estate2s(), GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCC_get_id(), GCC_transmit(), GCP_get_id(), GCT_2s(), GCT_alice_or_betty(), GCT_change_estate(), get_ready_connection(), GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX, GNUNET_MQ_msg, GNUNET_NO, GNUNET_sh2s(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_STD_BACKOFF, GNUNET_YES, CadetTConnection::is_ready, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_retry_delay, LOG, mark_connection_unready(), msg, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, and stats.

Referenced by connection_ready_cb(), GCT_handle_encrypted(), and retry_kx().

1342 {
1343  struct CadetConnection *cc;
1344  struct GNUNET_MQ_Envelope *env;
1347 
1349  return; /* only Alice may send KX */
1350  if ((NULL == ct) ||
1351  (GNUNET_NO == ct->is_ready))
1352  ct = get_ready_connection (t);
1353  if (NULL == ct)
1354  {
1356  "Wanted to send %s in state %s, but no connection is ready, deferring\n",
1357  GCT_2s (t),
1358  estate2s (t->estate));
1360  return;
1361  }
1362  cc = ct->cc;
1363  env = GNUNET_MQ_msg (msg,
1365  flags = GNUNET_CADET_KX_FLAG_FORCE_REPLY; /* always for KX */
1366  msg->flags = htonl (flags);
1367  msg->cid = *GCC_get_id (cc);
1369  &msg->ephemeral_key);
1370 #if DEBUG_KX
1371  msg->ephemeral_key_XXX = ax->kx_0;
1372  msg->private_key_XXX = *my_private_key;
1373 #endif
1375  "Sending KX message to %s with ephemeral %s on CID %s\n",
1376  GCT_2s (t),
1377  GNUNET_e2s (&msg->ephemeral_key),
1380  &msg->ratchet_key);
1385  GCT_change_estate (t,
1387  else if (CADET_TUNNEL_KEY_AX_RECV == t->estate)
1388  GCT_change_estate (t,
1390  GCC_transmit (cc,
1391  env);
1393  "# KX transmitted",
1394  1,
1395  GNUNET_NO);
1396 }
int GCT_alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
Low-level connection to a destination.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
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:246
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
GNUNET_CADET_KX_Flags
Flags to be used in GNUNET_CADET_KX.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CADET_ConnectionTunnelIdentifier cid
ID of the connection.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
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:215
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
#define GNUNET_TIME_STD_BACKOFF(r)
Perform our standard exponential back-off calculation, starting at 1 ms and then going by a factor of...
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
The peer should reply with its KX details?
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Message for a Key eXchange for a tunnel.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
struct GNUNET_TIME_Relative kx_retry_delay
How long do we wait until we retry the KX?
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
struct GNUNET_ShortHashCode connection_of_tunnel
enum CadetTunnelEState estate
State of the tunnel encryption.
#define GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX
Axolotl key exchange.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_kx_auth()

static void send_kx_auth ( struct CadetTunnel t,
struct CadetTConnection ct,
struct CadetTunnelAxolotl ax,
int  force_reply 
)
static

Send a KX_AUTH message.

Parameters
ttunnel on which to send the KX_AUTH
ctTunnel and connection on which to send the KX_AUTH, NULL if we are to find one that is ready.
axaxolotl key context to use
force_replyForce the other peer to reply with a KX_AUTH message (set if we would like to transmit right now, but cannot)

Definition at line 1410 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelKeyExchangeAuthMessage::auth, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_OK, CadetTConnection::cc, GNUNET_CADET_TunnelKeyExchangeMessage::cid, GNUNET_CADET_ConnectionTunnelIdentifier::connection_of_tunnel, CadetTunnelAxolotl::DHRs, env, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCC_get_id(), GCC_transmit(), GCT_2s(), GCT_change_estate(), get_ready_connection(), GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CADET_KX_FLAG_NONE, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_hash(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX_AUTH, GNUNET_MQ_msg, GNUNET_NO, GNUNET_sh2s(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_get(), GNUNET_TIME_relative_to_absolute(), GNUNET_TIME_STD_BACKOFF, GNUNET_YES, CadetTConnection::is_ready, GNUNET_CADET_TunnelKeyExchangeAuthMessage::kx, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_auth_requested, CadetTunnel::kx_retry_delay, CadetTunnelAxolotl::last_ephemeral, LOG, mark_connection_unready(), msg, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, CadetTunnelAxolotl::RK, and stats.

Referenced by connection_ready_cb(), GCT_handle_encrypted(), GCT_handle_kx(), GCT_handle_kx_auth(), and retry_kx().

1414 {
1415  struct CadetConnection *cc;
1416  struct GNUNET_MQ_Envelope *env;
1418  enum GNUNET_CADET_KX_Flags flags;
1419 
1420  if ((NULL == ct) ||
1421  (GNUNET_NO == ct->is_ready))
1422  ct = get_ready_connection (t);
1423  if (NULL == ct)
1424  {
1426  "Wanted to send KX_AUTH on %s, but no connection is ready, deferring\n",
1427  GCT_2s (t));
1429  t->kx_auth_requested = GNUNET_YES; /* queue KX_AUTH independent of estate */
1430  return;
1431  }
1432  t->kx_auth_requested = GNUNET_NO; /* clear flag */
1433  cc = ct->cc;
1434  env = GNUNET_MQ_msg (msg,
1436  flags = GNUNET_CADET_KX_FLAG_NONE;
1437  if (GNUNET_YES == force_reply)
1439  msg->kx.flags = htonl (flags);
1440  msg->kx.cid = *GCC_get_id (cc);
1442  &msg->kx.ephemeral_key);
1444  &msg->kx.ratchet_key);
1445 #if DEBUG_KX
1446  msg->kx.ephemeral_key_XXX = ax->kx_0;
1447  msg->kx.private_key_XXX = *my_private_key;
1448  msg->r_ephemeral_key_XXX = ax->last_ephemeral;
1449 #endif
1451  "Sending KX_AUTH message to %s with ephemeral %s on CID %s\n",
1452  GCT_2s (t),
1453  GNUNET_e2s (&msg->kx.ephemeral_key),
1455 
1456  /* Compute authenticator (this is the main difference to #send_kx()) */
1457  GNUNET_CRYPTO_hash (&ax->RK,
1458  sizeof(ax->RK),
1459  &msg->auth);
1460  /* Compute when to be triggered again; actual job will
1461  be scheduled via #connection_ready_cb() */
1462  t->kx_retry_delay
1464  t->next_kx_attempt
1466 
1467  /* Send via cc, mark it as unready */
1469 
1470  /* Update state machine, unless we are already OK */
1471  if (CADET_TUNNEL_KEY_OK != t->estate)
1472  GCT_change_estate (t,
1474  GCC_transmit (cc,
1475  env);
1477  "# KX_AUTH transmitted",
1478  1,
1479  GNUNET_NO);
1480 }
const char * GNUNET_sh2s(const struct GNUNET_ShortHashCode *shc)
Convert a short hash value to a string (for printing debug messages).
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
Low-level connection to a destination.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_CADET_TunnelKeyExchangeMessage kx
Message header with key material.
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
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:246
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
#define GNUNET_MQ_msg(mvar, type)
Allocate a GNUNET_MQ_Envelope.
Definition: gnunet_mq_lib.h:67
int kx_auth_requested
Force triggering KX_AUTH independent of estate.
Should the peer reply with its KX details?
static struct CadetTConnection * get_ready_connection(struct CadetTunnel *t)
Find first connection that is ready in the list of our connections.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
GNUNET_CADET_KX_Flags
Flags to be used in GNUNET_CADET_KX.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:48
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
Message for a Key eXchange for a tunnel, with authentication.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
struct GNUNET_CADET_ConnectionTunnelIdentifier cid
ID of the connection.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
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:215
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
#define GNUNET_TIME_STD_BACKOFF(r)
Perform our standard exponential back-off calculation, starting at 1 ms and then going by a factor of...
Handshake completed: session key available.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
The peer should reply with its KX details?
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct GNUNET_HashCode auth
KDF-proof that sender could compute the 3-DH, used in lieu of a signature or payload data...
#define LOG(level,...)
#define GNUNET_MESSAGE_TYPE_CADET_TUNNEL_KX_AUTH
Axolotl key exchange response with authentication.
struct GNUNET_TIME_Relative kx_retry_delay
How long do we wait until we retry the KX?
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
struct GNUNET_ShortHashCode connection_of_tunnel
enum CadetTunnelEState estate
State of the tunnel encryption.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ cleanup_ax()

static void cleanup_ax ( struct CadetTunnelAxolotl ax)
static

Cleanup state used by ax.

Parameters
axstate to free, but not memory of ax itself

Definition at line 1489 of file gnunet-service-cadet_tunnels.c.

References delete_skipped_key(), CadetTunnelAxolotl::DHRs, GNUNET_assert, GNUNET_CRYPTO_ecdhe_key_clear(), CadetTunnelAxolotl::kx_0, CadetTunnelAxolotl::skipped, and CadetTunnelAxolotl::skipped_head.

Referenced by destroy_tunnel(), GCT_handle_encrypted(), and GCT_handle_kx_auth().

1490 {
1491  while (NULL != ax->skipped_head)
1492  delete_skipped_key (ax,
1493  ax->skipped_head);
1494  GNUNET_assert (0 == ax->skipped);
1497 }
void GNUNET_CRYPTO_ecdhe_key_clear(struct GNUNET_CRYPTO_EcdhePrivateKey *pk)
Clear memory that was used to store a private key.
Definition: crypto_ecc.c:470
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static void delete_skipped_key(struct CadetTunnelAxolotl *ax, struct CadetTunnelSkippedKey *key)
Delete a key from the list of skipped keys.
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
unsigned int skipped
Number of elements in skipped_head <-> skipped_tail.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_ax_by_kx()

static int update_ax_by_kx ( struct CadetTunnelAxolotl ax,
const struct GNUNET_PeerIdentity pid,
const struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key,
const struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key 
)
static

Update our Axolotl key state based on the KX data we received.

Computes the new chain keys, and root keys, etc, and also checks whether this is a replay of the current chain.

Parameters

Definition at line 1514 of file gnunet-service-cadet_tunnels.c.

References CadetTunnelAxolotl::CKr, CadetTunnelAxolotl::CKs, CadetTunnelAxolotl::DHRr, GCT_alice_or_betty(), GNUNET_break_op, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_ecdh_eddsa(), GNUNET_CRYPTO_eddsa_ecdh(), GNUNET_CRYPTO_kdf(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_memcmp, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_SYSERR, GNUNET_TIME_absolute_add(), GNUNET_TIME_absolute_get(), GNUNET_YES, CadetTunnelAxolotl::HKr, CadetTunnelAxolotl::HKs, CadetTunnelAxolotl::kx_0, CadetTunnelAxolotl::last_ephemeral, LOG, my_private_key, CadetTunnelAxolotl::NHKr, CadetTunnelAxolotl::NHKs, GNUNET_PeerIdentity::public_key, CadetTunnelAxolotl::ratchet_expiration, CadetTunnelAxolotl::ratchet_flag, ratchet_time, CadetTunnelAxolotl::RK, salt, and stats.

Referenced by GCT_handle_kx(), and GCT_handle_kx_auth().

1518 {
1519  struct GNUNET_HashCode key_material[3];
1520  struct GNUNET_CRYPTO_SymmetricSessionKey keys[5];
1521  const char salt[] = "CADET Axolotl salt";
1522  int am_I_alice;
1523 
1524  if (GNUNET_SYSERR == (am_I_alice = GCT_alice_or_betty (pid)))
1525  {
1526  GNUNET_break_op (0);
1527  return GNUNET_SYSERR;
1528  }
1529  if (0 == GNUNET_memcmp (&ax->DHRr,
1530  ratchet_key))
1531  {
1533  "# Ratchet key already known",
1534  1,
1535  GNUNET_NO);
1537  "Ratchet key already known. Ignoring KX.\n");
1538  return GNUNET_NO;
1539  }
1540 
1541  ax->DHRr = *ratchet_key;
1542  ax->last_ephemeral = *ephemeral_key;
1543  /* ECDH A B0 */
1544  if (GNUNET_YES == am_I_alice)
1545  {
1547  ephemeral_key, /* B0 */
1548  &key_material[0]);
1549  }
1550  else
1551  {
1552  GNUNET_CRYPTO_ecdh_eddsa (&ax->kx_0, /* b0 */
1553  &pid->public_key, /* A */
1554  &key_material[0]);
1555  }
1556  /* ECDH A0 B */
1557  if (GNUNET_YES == am_I_alice)
1558  {
1559  GNUNET_CRYPTO_ecdh_eddsa (&ax->kx_0, /* a0 */
1560  &pid->public_key, /* B */
1561  &key_material[1]);
1562  }
1563  else
1564  {
1566  ephemeral_key, /* A0 */
1567  &key_material[1]);
1568  }
1569 
1570  /* ECDH A0 B0 */
1571  GNUNET_CRYPTO_ecc_ecdh (&ax->kx_0, /* a0 or b0 */
1572  ephemeral_key, /* B0 or A0 */
1573  &key_material[2]);
1574  /* KDF */
1575  GNUNET_CRYPTO_kdf (keys, sizeof(keys),
1576  salt, sizeof(salt),
1577  &key_material, sizeof(key_material),
1578  NULL);
1579 
1580  if (0 == memcmp (&ax->RK,
1581  &keys[0],
1582  sizeof(ax->RK)))
1583  {
1585  "Root key already known. Ignoring KX.\n");
1587  "# Root key already known",
1588  1,
1589  GNUNET_NO);
1590  return GNUNET_NO;
1591  }
1592 
1593  ax->RK = keys[0];
1594  if (GNUNET_YES == am_I_alice)
1595  {
1596  ax->HKr = keys[1];
1597  ax->NHKs = keys[2];
1598  ax->NHKr = keys[3];
1599  ax->CKr = keys[4];
1600  ax->ratchet_flag = GNUNET_YES;
1601  }
1602  else
1603  {
1604  ax->HKs = keys[1];
1605  ax->NHKr = keys[2];
1606  ax->NHKs = keys[3];
1607  ax->CKs = keys[4];
1608  ax->ratchet_flag = GNUNET_NO;
1609  ax->ratchet_expiration
1611  ratchet_time);
1612  }
1613  return GNUNET_OK;
1614 }
int GCT_alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
struct GNUNET_CRYPTO_SymmetricSessionKey HKr
32-byte header key (currently used for receiving)
struct GNUNET_TIME_Absolute ratchet_expiration
Time when the current ratchet expires and a new one is triggered (if ratchet_allowed is GNUNET_YES)...
int GNUNET_CRYPTO_ecc_ecdh(const struct GNUNET_CRYPTO_EcdhePrivateKey *priv, const struct GNUNET_CRYPTO_EcdhePublicKey *pub, struct GNUNET_HashCode *key_material)
Derive key material from a public and a private ECC key.
Definition: crypto_ecc.c:850
struct GNUNET_CRYPTO_SymmetricSessionKey NHKr
32-byte next header key (for receiving).
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:395
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
struct GNUNET_CRYPTO_SymmetricSessionKey CKr
32-byte chain keys (used for forward-secrecy) for receiving messages.
struct GNUNET_TIME_Relative ratchet_time
How long until we trigger a ratched advance due to time.
int 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:1024
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
A 512-bit hashcode.
int 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:1084
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
static struct GNUNET_CRYPTO_PowSalt salt
Salt for PoW calcualations.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
struct GNUNET_CRYPTO_SymmetricSessionKey HKs
32-byte header key (currently used for sending).
#define LOG(level,...)
struct GNUNET_CRYPTO_SymmetricSessionKey CKs
32-byte chain keys (used for forward-secrecy) for sending messages.
int ratchet_flag
True (GNUNET_YES) if we have to send a new ratchet key in next msg.
int 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
struct GNUNET_CRYPTO_SymmetricSessionKey NHKs
32-byte next header key (for sending), used once the ratchet advances.
struct GNUNET_CRYPTO_EddsaPublicKey public_key
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ retry_kx()

static void retry_kx ( void *  cls)
static

Try to redo the KX or KX_AUTH handshake, if we can.

Parameters
clsthe struct CadetTunnel to do KX for.

Definition at line 1623 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTunnel::estate, estate2s(), GCT_2s(), GCT_count_channels(), GNUNET_break, GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_YES, CadetTunnel::kx_task, LOG, send_kx(), send_kx_auth(), t, and CadetTunnel::unverified_ax.

Referenced by connection_ready_cb(), GCT_add_channel(), GCT_handle_kx(), and GCT_handle_kx_auth().

1624 {
1625  struct CadetTunnel *t = cls;
1626  struct CadetTunnelAxolotl *ax;
1627 
1628  t->kx_task = NULL;
1630  "Trying to make KX progress on %s in state %s\n",
1631  GCT_2s (t),
1632  estate2s (t->estate));
1633  switch (t->estate)
1634  {
1635  case CADET_TUNNEL_KEY_UNINITIALIZED: /* first attempt */
1636  case CADET_TUNNEL_KEY_AX_SENT: /* trying again */
1637  send_kx (t,
1638  NULL,
1639  &t->ax);
1640  break;
1641 
1644  /* We are responding, so only require reply
1645  if WE have a channel waiting. */
1646  if (NULL != t->unverified_ax)
1647  {
1648  /* Send AX_AUTH so we might get this one verified */
1649  ax = t->unverified_ax;
1650  }
1651  else
1652  {
1653  /* How can this be? */
1654  GNUNET_break (0);
1655  ax = &t->ax;
1656  }
1657  send_kx_auth (t,
1658  NULL,
1659  ax,
1660  (0 == GCT_count_channels (t))
1661  ? GNUNET_NO
1662  : GNUNET_YES);
1663  break;
1664 
1666  /* We are responding, so only require reply
1667  if WE have a channel waiting. */
1668  if (NULL != t->unverified_ax)
1669  {
1670  /* Send AX_AUTH so we might get this one verified */
1671  ax = t->unverified_ax;
1672  }
1673  else
1674  {
1675  /* How can this be? */
1676  GNUNET_break (0);
1677  ax = &t->ax;
1678  }
1679  send_kx_auth (t,
1680  NULL,
1681  ax,
1682  (0 == GCT_count_channels (t))
1683  ? GNUNET_NO
1684  : GNUNET_YES);
1685  break;
1686 
1687  case CADET_TUNNEL_KEY_OK:
1688  /* Must have been the *other* peer asking us to
1689  respond with a KX_AUTH. */
1690  if (NULL != t->unverified_ax)
1691  {
1692  /* Sending AX_AUTH in response to AX so we might get this one verified */
1693  ax = t->unverified_ax;
1694  }
1695  else
1696  {
1697  /* Sending AX_AUTH in response to AX_AUTH */
1698  ax = &t->ax;
1699  }
1700  send_kx_auth (t,
1701  NULL,
1702  ax,
1703  GNUNET_NO);
1704  break;
1705  }
1706 }
struct CadetTunnelAxolotl ax
Axolotl info.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
static void send_kx(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
Send a KX message.
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
Struct containing all information regarding a tunnel to a peer.
Handshake completed: session key available.
KX message sent and received, trying to send back KX_AUTH.
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
enum CadetTunnelEState estate
State of the tunnel encryption.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_handle_kx()

void GCT_handle_kx ( struct CadetTConnection ct,
const struct GNUNET_CADET_TunnelKeyExchangeMessage msg 
)

Handle KX message that lacks authentication (and which will thus only be considered authenticated after we respond with our own KX_AUTH and finally successfully decrypt payload).

Handle KX message.

Parameters
ctconnection/tunnel combo that received encrypted message
msgthe key exchange message

Definition at line 1718 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, CadetTunnel::destination, CadetTunnelAxolotl::DHRr, CadetTunnelAxolotl::DHRs, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GCC_2s(), GCP_get_id(), GCT_2s(), GCT_alice_or_betty(), GCT_change_estate(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CRYPTO_ecc_ecdh(), GNUNET_CRYPTO_ecdh_eddsa(), GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_eddsa_ecdh(), GNUNET_CRYPTO_eddsa_key_get_public(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_memcmp, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_now(), GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GNUNET_SYSERR, GNUNET_YES, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_task, CadetTunnelAxolotl::last_ephemeral, LOG, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, ret, retry_kx(), CadetTunnelAxolotl::RK, send_kx_auth(), CadetTunnelAxolotl::skipped_head, stats, t, CadetTConnection::t, CadetTunnel::unverified_attempts, CadetTunnel::unverified_ax, and update_ax_by_kx().

Referenced by GCC_handle_kx().

1720 {
1721  struct CadetTunnel *t = ct->t;
1722  int ret;
1723 
1725  "# KX received",
1726  1,
1727  GNUNET_NO);
1728  if (GNUNET_YES ==
1730  {
1731  /* Betty/Bob is not allowed to send KX! */
1732  GNUNET_break_op (0);
1733  return;
1734  }
1736  "Received KX message from %s with ephemeral %s from %s on connection %s\n",
1737  GCT_2s (t),
1738  GNUNET_e2s (&msg->ephemeral_key),
1740  GCC_2s (ct->cc));
1741 #if 1
1742  if ((0 ==
1743  memcmp (&t->ax.DHRr,
1744  &msg->ratchet_key,
1745  sizeof(msg->ratchet_key))) &&
1746  (0 ==
1747  memcmp (&t->ax.last_ephemeral,
1748  &msg->ephemeral_key,
1749  sizeof(msg->ephemeral_key))))
1750 
1751  {
1753  "# Duplicate KX received",
1754  1,
1755  GNUNET_NO);
1756  send_kx_auth (t,
1757  ct,
1758  &t->ax,
1759  GNUNET_NO);
1760  return;
1761  }
1762 #endif
1763  /* We only keep ONE unverified KX around, so if there is an existing one,
1764  clean it up. */
1765  if (NULL != t->unverified_ax)
1766  {
1767  if ((0 ==
1768  memcmp (&t->unverified_ax->DHRr,
1769  &msg->ratchet_key,
1770  sizeof(msg->ratchet_key))) &&
1771  (0 ==
1772  memcmp (&t->unverified_ax->last_ephemeral,
1773  &msg->ephemeral_key,
1774  sizeof(msg->ephemeral_key))))
1775  {
1777  "# Duplicate unverified KX received",
1778  1,
1779  GNUNET_NO);
1780 #if 1
1781  send_kx_auth (t,
1782  ct,
1783  t->unverified_ax,
1784  GNUNET_NO);
1785  return;
1786 #endif
1787  }
1789  "Dropping old unverified KX state.\n");
1791  "# Unverified KX dropped for fresh KX",
1792  1,
1793  GNUNET_NO);
1794  GNUNET_break (NULL == t->unverified_ax->skipped_head);
1795  memset (t->unverified_ax,
1796  0,
1797  sizeof(struct CadetTunnelAxolotl));
1798  }
1799  else
1800  {
1802  "Creating fresh unverified KX for %s\n",
1803  GCT_2s (t));
1805  "# Fresh KX setup",
1806  1,
1807  GNUNET_NO);
1809  }
1810  /* Set as the 'current' RK/DHRr the one we are currently using,
1811  so that the duplicate-detection logic of
1812  #update_ax_by_kx can work. */
1813  t->unverified_ax->RK = t->ax.RK;
1814  t->unverified_ax->DHRr = t->ax.DHRr;
1815  t->unverified_ax->DHRs = t->ax.DHRs;
1816  t->unverified_ax->kx_0 = t->ax.kx_0;
1817  t->unverified_attempts = 0;
1818 
1819  /* Update 'ax' by the new key material */
1820  ret = update_ax_by_kx (t->unverified_ax,
1821  GCP_get_id (t->destination),
1822  &msg->ephemeral_key,
1823  &msg->ratchet_key);
1824  GNUNET_break (GNUNET_SYSERR != ret);
1825  if (GNUNET_OK != ret)
1826  {
1828  "# Useless KX",
1829  1,
1830  GNUNET_NO);
1831  return; /* duplicate KX, nothing to do */
1832  }
1833  /* move ahead in our state machine */
1835  GCT_change_estate (t,
1837  else if (CADET_TUNNEL_KEY_AX_SENT == t->estate)
1838  GCT_change_estate (t,
1840 
1841  /* KX is still not done, try again our end. */
1842  if (CADET_TUNNEL_KEY_OK != t->estate)
1843  {
1844  if (NULL != t->kx_task)
1846  t->kx_task
1848  t);
1849  }
1850 }
struct CadetTunnelAxolotl ax
Axolotl info.
int GCT_alice_or_betty(const struct GNUNET_PeerIdentity *other)
Am I Alice or Betty (some call her Bob), or talking to myself?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
#define GNUNET_new(type)
Allocate a struct or union of the given type.
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static int update_ax_by_kx(struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
Update our Axolotl key state based on the KX data we received.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnel * t
Tunnel this connection belongs to.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
struct GNUNET_CRYPTO_EcdhePublicKey last_ephemeral
Last ephemeral public key received from the other peer, for duplicate detection.
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
unsigned int unverified_attempts
How often have we tried and failed to decrypt a message using the unverified KX material from unverif...
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
Handshake completed: session key available.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
struct GNUNET_CRYPTO_SymmetricSessionKey RK
32-byte root key which gets updated by DH ratchet.
struct GNUNET_CRYPTO_EcdhePublicKey DHRr
ECDH Ratchet key (other peer&#39;s public key in the current DH).
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
struct GNUNET_CRYPTO_EcdhePrivateKey DHRs
ECDH Ratchet key (our private key in the current DH).
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
struct CadetTunnelSkippedKey * skipped_head
A (double linked) list of stored message keys and associated header keys for "skipped" messages...
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
enum CadetTunnelEState estate
State of the tunnel encryption.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
struct GNUNET_CRYPTO_EcdhePrivateKey kx_0
ECDH for key exchange (A0 / B0).
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_handle_kx_auth()

void GCT_handle_kx_auth ( struct CadetTConnection ct,
const struct GNUNET_CADET_TunnelKeyExchangeAuthMessage msg 
)

Handle KX_AUTH message.

Parameters
ctconnection/tunnel combo that received encrypted message
msgthe key exchange message

Definition at line 1928 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_TunnelKeyExchangeAuthMessage::auth, CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, cleanup_ax(), CadetTunnel::destination, GNUNET_CADET_TunnelKeyExchangeMessage::ephemeral_key, CadetTunnel::estate, GNUNET_CADET_TunnelKeyExchangeMessage::flags, GCP_get_id(), GCT_2s(), GCT_change_estate(), GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_CADET_KX_FLAG_FORCE_REPLY, GNUNET_CRYPTO_ecdhe_key_get_public(), GNUNET_CRYPTO_hash(), GNUNET_e2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_memcmp, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_at(), GNUNET_STATISTICS_update(), GNUNET_CADET_TunnelKeyExchangeAuthMessage::kx, CadetTunnelAxolotl::kx_0, CadetTunnel::kx_task, LOG, my_private_key, CadetTunnel::next_kx_attempt, GNUNET_CADET_TunnelKeyExchangeMessage::ratchet_key, ret, retry_kx(), CadetTunnelAxolotl::RK, send_kx_auth(), stats, t, CadetTConnection::t, CadetTunnel::unverified_ax, and update_ax_by_kx().

Referenced by GCC_handle_kx_auth().

1930 {
1931  struct CadetTunnel *t = ct->t;
1932  struct CadetTunnelAxolotl ax_tmp;
1933  struct GNUNET_HashCode kx_auth;
1934  int ret;
1935 
1937  "# KX_AUTH received",
1938  1,
1939  GNUNET_NO);
1940  if ((CADET_TUNNEL_KEY_UNINITIALIZED == t->estate) ||
1942  {
1943  /* Confusing, we got a KX_AUTH before we even send our own
1944  KX. This should not happen. We'll send our own KX ASAP anyway,
1945  so let's ignore this here. */
1946  GNUNET_break_op (0);
1947  return;
1948  }
1950  "Handling KX_AUTH message from %s with ephemeral %s\n",
1951  GCT_2s (t),
1952  GNUNET_e2s (&msg->kx.ephemeral_key));
1953  /* We do everything in ax_tmp until we've checked the authentication
1954  so we don't clobber anything we care about by accident. */
1955  ax_tmp = t->ax;
1956 
1957  /* Update 'ax' by the new key material */
1958  ret = update_ax_by_kx (&ax_tmp,
1959  GCP_get_id (t->destination),
1960  &msg->kx.ephemeral_key,
1961  &msg->kx.ratchet_key);
1962  if (GNUNET_OK != ret)
1963  {
1964  if (GNUNET_NO == ret)
1966  "# redundant KX_AUTH received",
1967  1,
1968  GNUNET_NO);
1969  else
1970  GNUNET_break (0); /* connect to self!? */
1971  return;
1972  }
1973  GNUNET_CRYPTO_hash (&ax_tmp.RK,
1974  sizeof(ax_tmp.RK),
1975  &kx_auth);
1976  if (0 != GNUNET_memcmp (&kx_auth,
1977  &msg->auth))
1978  {
1979  /* This KX_AUTH is not using the latest KX/KX_AUTH data
1980  we transmitted to the sender, refuse it, try KX again. */
1982  "# KX_AUTH not using our last KX received (auth failure)",
1983  1,
1984  GNUNET_NO);
1986  "KX AUTH mismatch!\n");
1987 #if DEBUG_KX
1988  {
1989  struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key;
1990 
1991  GNUNET_CRYPTO_ecdhe_key_get_public (&ax_tmp.kx_0,
1992  &ephemeral_key);
1993  if (0 != GNUNET_memcmp (&ephemeral_key,
1994  &msg->r_ephemeral_key_XXX))
1995  {
1997  "My ephemeral is %s!\n",
1998  GNUNET_e2s (&ephemeral_key));
2000  "Response is for ephemeral %s!\n",
2001  GNUNET_e2s (&msg->r_ephemeral_key_XXX));
2002  }
2003  else
2004  {
2005  test_crypto_bug (&ax_tmp.kx_0,
2006  &msg->kx.ephemeral_key_XXX,
2008  &msg->kx.private_key_XXX);
2009  }
2010  }
2011 #endif
2012  if (NULL == t->kx_task)
2013  t->kx_task
2015  &retry_kx,
2016  t);
2017  return;
2018  }
2019  /* Yep, we're good. */
2020  t->ax = ax_tmp;
2021  if (NULL != t->unverified_ax)
2022  {
2023  /* We got some "stale" KX before, drop that. */
2026  t->unverified_ax = NULL;
2027  }
2028 
2029  /* move ahead in our state machine */
2030  switch (t->estate)
2031  {
2034  /* Checked above, this is impossible. */
2035  GNUNET_assert (0);
2036  break;
2037 
2038  case CADET_TUNNEL_KEY_AX_SENT: /* This is the normal case */
2039  case CADET_TUNNEL_KEY_AX_SENT_AND_RECV: /* both peers started KX */
2040  case CADET_TUNNEL_KEY_AX_AUTH_SENT: /* both peers now did KX_AUTH */
2041  GCT_change_estate (t,
2043  break;
2044 
2045  case CADET_TUNNEL_KEY_OK:
2046  /* Did not expect another KX_AUTH, but so what, still acceptable.
2047  Nothing to do here. */
2048  break;
2049  }
2050  if (0 != (GNUNET_CADET_KX_FLAG_FORCE_REPLY & ntohl (msg->kx.flags)))
2051  {
2052  send_kx_auth (t,
2053  NULL,
2054  &t->ax,
2055  GNUNET_NO);
2056  }
2057 }
struct CadetTunnelAxolotl ax
Axolotl info.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_CADET_TunnelKeyExchangeMessage kx
Message header with key material.
uint32_t flags
Flags for the key exchange in NBO, based on enum GNUNET_CADET_KX_Flags.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static int update_ax_by_kx(struct CadetTunnelAxolotl *ax, const struct GNUNET_PeerIdentity *pid, const struct GNUNET_CRYPTO_EcdhePublicKey *ephemeral_key, const struct GNUNET_CRYPTO_EcdhePublicKey *ratchet_key)
Update our Axolotl key state based on the KX data we received.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnel * t
Tunnel this connection belongs to.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:48
struct GNUNET_STATISTICS_Handle * stats
Handle to the statistics service.
A 512-bit hashcode.
struct GNUNET_CRYPTO_EcdhePublicKey ratchet_key
Sender&#39;s next ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
Struct containing all information regarding a tunnel to a peer.
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:215
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
Handshake completed: session key available.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
struct GNUNET_CRYPTO_EddsaPrivateKey * my_private_key
Own private key.
void GCT_change_estate(struct CadetTunnel *t, enum CadetTunnelEState state)
Change the tunnel encryption state.
KX message sent and received, trying to send back KX_AUTH.
struct CadetPeer * destination
Destination of the tunnel.
The peer should reply with its KX details?
Axolotl data, according to https://github.com/trevp/axolotl/wiki .
struct GNUNET_HashCode auth
KDF-proof that sender could compute the 3-DH, used in lieu of a signature or payload data...
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
Public ECC key (always for Curve25519) encoded in a format suitable for network transmission and encr...
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
static void cleanup_ax(struct CadetTunnelAxolotl *ax)
Cleanup state used by ax.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
struct GNUNET_CRYPTO_EcdhePublicKey ephemeral_key
Sender&#39;s ephemeral public ECC key encoded in a format suitable for network transmission, as created using &#39;gcry_sexp_sprint&#39;.
const char * GNUNET_e2s(const struct GNUNET_CRYPTO_EcdhePublicKey *p)
Convert a public key value to a string (for printing debug messages).
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
enum CadetTunnelEState estate
State of the tunnel encryption.
#define GNUNET_free(ptr)
Wrapper around free.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_next_free_ctn()

static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn ( struct CadetTunnel t)
static

Compute the next free channel tunnel number for this tunnel.

Parameters
tthe tunnel
Returns
unused number that can uniquely identify a channel in the tunnel

Definition at line 2070 of file gnunet-service-cadet_tunnels.c.

References GNUNET_CADET_ChannelTunnelNumber::cn, GCP_get_id(), GCT_get_destination(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_get(), GNUNET_memcmp, HIGH_BIT, my_full_id, ret, and t.

Referenced by GCT_add_channel().

2071 {
2072 #define HIGH_BIT 0x8000000
2074  uint32_t ctn;
2075  int cmp;
2076  uint32_t highbit;
2077 
2078  cmp = GNUNET_memcmp (&my_full_id,
2080  if (0 < cmp)
2081  highbit = HIGH_BIT;
2082  else if (0 > cmp)
2083  highbit = 0;
2084  else
2085  GNUNET_assert (0); // loopback must never go here!
2086  ctn = ntohl (t->next_ctn.cn);
2087  while (NULL !=
2089  ctn | highbit))
2090  {
2091  ctn = ((ctn + 1) & (~HIGH_BIT));
2092  }
2093  t->next_ctn.cn = htonl ((ctn + 1) & (~HIGH_BIT));
2094  ret.cn = htonl (ctn | highbit);
2095  return ret;
2096 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
struct CadetPeer * GCT_get_destination(struct CadetTunnel *t)
Return the peer to which this tunnel goes.
struct GNUNET_PeerIdentity my_full_id
Local peer own ID.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static int ret
Return value of the commandline.
Definition: gnunet-abd.c:81
struct GNUNET_CADET_ChannelTunnelNumber next_ctn
Channel ID for the next created channel in this tunnel.
void * GNUNET_CONTAINER_multihashmap32_get(const struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key)
Given a key find a value in the map matching the key.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
#define HIGH_BIT
Number identifying a CADET channel within a tunnel.
const struct GNUNET_PeerIdentity * GCP_get_id(struct CadetPeer *cp)
Obtain the peer identity for a struct CadetPeer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_add_channel()

struct GNUNET_CADET_ChannelTunnelNumber GCT_add_channel ( struct CadetTunnel t,
struct CadetChannel ch 
)

Add a channel to a tunnel, and notify channel that we are ready for transmission if we are already up.

Add a channel to a tunnel.

Otherwise that notification will be done later in notify_tunnel_up_cb().

Parameters
tTunnel.
chChannel
Returns
unique number identifying ch within t

Definition at line 2109 of file gnunet-service-cadet_tunnels.c.

References CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, ch, GCCH_2s(), GCCH_tunnel_up(), GCT_2s(), get_next_free_ctn(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, LOG, and retry_kx().

Referenced by GCCH_channel_local_new().

2111 {
2113 
2114  ctn = get_next_free_ctn (t);
2115  if (NULL != t->destroy_task)
2116  {
2118  t->destroy_task = NULL;
2119  }
2122  ntohl (ctn.cn),
2123  ch,
2126  "Adding %s to %s with state %d\n",
2127  GCCH_2s (ch),
2128  GCT_2s (t),
2129  t->estate);
2130  switch (t->estate)
2131  {
2133  /* waiting for connection to start KX */
2134  break;
2135 
2139  /* we're currently waiting for KX to complete */
2140  break;
2141 
2143  /* waiting for OTHER peer to send us data,
2144  we might need to prompt more aggressively! */
2145  if (NULL == t->kx_task)
2146  t->kx_task
2148  &retry_kx,
2149  t);
2150  break;
2151 
2152  case CADET_TUNNEL_KEY_OK:
2153  /* We are ready. Tell the new channel that we are up. */
2154  GCCH_tunnel_up (ch);
2155  break;
2156  }
2157  return ctn;
2158 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
void GCCH_tunnel_up(struct CadetChannel *ch)
Function called once and only once after a channel was bound to its tunnel via GCT_add_channel() is r...
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
KX message sent, waiting for other peer&#39;s KX_AUTH.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
int GNUNET_CONTAINER_multihashmap32_put(struct GNUNET_CONTAINER_MultiHashMap32 *map, uint32_t key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
Handshake completed: session key available.
const char * GCCH_2s(const struct CadetChannel *ch)
Get the static string for identification of the channel.
KX message sent and received, trying to send back KX_AUTH.
Number identifying a CADET channel within a tunnel.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
KX message received, trying to send back KX_AUTH.
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
enum CadetTunnelEState estate
State of the tunnel encryption.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
static struct GNUNET_CADET_ChannelTunnelNumber get_next_free_ctn(struct CadetTunnel *t)
Compute the next free channel tunnel number for this tunnel.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_connection_lost()

void GCT_connection_lost ( struct CadetTConnection ct)

We lost a connection, remove it from our list and clean up the connection object itself.

Parameters
ctbinding of connection to tunnel of the connection that was lost.

Definition at line 2168 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, GNUNET_CONTAINER_DLL_remove, GNUNET_free, GNUNET_YES, CadetTConnection::is_ready, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, and CadetTConnection::t.

Referenced by destroy_t_connection(), GCC_create_inbound(), and GCC_destroy_without_core().

2169 {
2170  struct CadetTunnel *t = ct->t;
2171 
2172  if (GNUNET_YES == ct->is_ready)
2173  {
2176  ct);
2177  t->num_ready_connections--;
2178  }
2179  else
2180  {
2183  ct);
2184  t->num_busy_connections--;
2185  }
2186  GNUNET_free (ct);
2187 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
int is_ready
Is the connection currently ready for transmission?
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct CadetTunnel * t
Tunnel this connection belongs to.
Struct containing all information regarding a tunnel to a peer.
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the caller graph for this function:

◆ destroy_t_connection()

static void destroy_t_connection ( void *  cls,
struct CadetTConnection ct 
)
static

Clean up connection ct of a tunnel.

Parameters
clsthe struct CadetTunnel
ctconnection to clean up

Definition at line 2197 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, GCC_destroy_without_tunnel(), GCT_connection_lost(), GNUNET_assert, and CadetTConnection::t.

Referenced by destroy_tunnel(), and maintain_connections_cb().

2199 {
2200  struct CadetTunnel *t = cls;
2201  struct CadetConnection *cc = ct->cc;
2202 
2203  GNUNET_assert (ct->t == t);
2204  GCT_connection_lost (ct);
2206 }
void GCT_connection_lost(struct CadetTConnection *ct)
We lost a connection, remove it from our list and clean up the connection object itself.
Low-level connection to a destination.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTunnel * t
Tunnel this connection belongs to.
void GCC_destroy_without_tunnel(struct CadetConnection *cc)
Destroy a connection, called if the tunnel association with the connection was already broken...
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ destroy_tunnel()

static void destroy_tunnel ( void *  cls)
static

This tunnel is no longer used, destroy it.

Parameters
clsthe idle tunnel

Definition at line 2215 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CadetTunnel::channels, cleanup_ax(), CadetTunnel::connection_busy_head, CadetTunnel::connection_ready_head, CadetTunnelQueueEntry::cont, CadetTunnelQueueEntry::cont_cls, CadetTunnel::destination, destroy_t_connection(), CadetTunnel::destroy_task, GCP_drop_tunnel(), GCT_2s(), GCT_count_channels(), GCT_iterate_connections(), GCT_send_cancel(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_destroy(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_MQ_destroy(), GNUNET_MST_destroy(), GNUNET_SCHEDULER_cancel(), CadetTunnel::kx_task, LOG, CadetTunnel::maintain_connections_task, CadetTunnel::mq, CadetTunnel::mst, CadetTunnel::send_task, CadetTunnel::tq_head, and CadetTunnel::unverified_ax.

Referenced by connection_ready_cb(), GCT_destroy_tunnel_now(), and GCT_remove_channel().

2216 {
2217  struct CadetTunnel *t = cls;
2218  struct CadetTunnelQueueEntry *tq;
2219 
2220  t->destroy_task = NULL;
2222  "Destroying idle %s\n",
2223  GCT_2s (t));
2224  GNUNET_assert (0 == GCT_count_channels (t));
2227  t);
2228  GNUNET_assert (NULL == t->connection_ready_head);
2229  GNUNET_assert (NULL == t->connection_busy_head);
2230  while (NULL != (tq = t->tq_head))
2231  {
2232  if (NULL != tq->cont)
2233  tq->cont (tq->cont_cls,
2234  NULL);
2235  GCT_send_cancel (tq);
2236  }
2238  t);
2240  if (NULL != t->maintain_connections_task)
2241  {
2243  t->maintain_connections_task = NULL;
2244  }
2245  if (NULL != t->send_task)
2246  {
2248  t->send_task = NULL;
2249  }
2250  if (NULL != t->kx_task)
2251  {
2253  t->kx_task = NULL;
2254  }
2255  GNUNET_MST_destroy (t->mst);
2256  GNUNET_MQ_destroy (t->mq);
2257  if (NULL != t->unverified_ax)
2258  {
2261  }
2262  cleanup_ax (&t->ax);
2263  GNUNET_assert (NULL == t->destroy_task);
2264  GNUNET_free (t);
2265 }
struct CadetTunnelAxolotl ax
Axolotl info.
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
struct GNUNET_MQ_Handle * mq
Dispatcher for decrypted messages only (do NOT use for sending!).
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
void GCT_send_cancel(struct CadetTunnelQueueEntry *tq)
Cancel a previously sent message while it&#39;s in the queue.
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
struct CadetTunnelAxolotl * unverified_ax
Unverified Axolotl info, used only if we got a fresh KX (not a KX_AUTH) while our end of the tunnel w...
void GNUNET_MST_destroy(struct GNUNET_MessageStreamTokenizer *mst)
Destroys a tokenizer.
Definition: mst.c:411
struct GNUNET_MessageStreamTokenizer * mst
Tokenizer for decrypted messages.
void GNUNET_CONTAINER_multihashmap32_destroy(struct GNUNET_CONTAINER_MultiHashMap32 *map)
Destroy a 32-bit key hash map.
Struct containing all information regarding a tunnel to a peer.
Struct used to save messages in a non-ready tunnel to send once connected.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
void * cont_cls
Closure for cont.
void GCP_drop_tunnel(struct CadetPeer *cp, struct CadetTunnel *t)
The tunnel to the given peer no longer exists, remove it from our data structures, and possibly clean up the peer itself.
struct CadetPeer * destination
Destination of the tunnel.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
struct GNUNET_SCHEDULER_Task * maintain_connections_task
Task to trim connections if too many are present.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
static void destroy_t_connection(void *cls, struct CadetTConnection *ct)
Clean up connection ct of a tunnel.
static void cleanup_ax(struct CadetTunnelAxolotl *ax)
Cleanup state used by ax.
#define LOG(level,...)
struct GNUNET_SCHEDULER_Task * send_task
Task to send messages from queue (if possible).
void GNUNET_MQ_destroy(struct GNUNET_MQ_Handle *mq)
Destroy the message queue.
Definition: mq.c:837
GCT_SendContinuation cont
Continuation to call once sent (on the channel layer).
#define GNUNET_free(ptr)
Wrapper around free.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_remove_channel()

void GCT_remove_channel ( struct CadetTunnel t,
struct CadetChannel ch,
struct GNUNET_CADET_ChannelTunnelNumber  ctn 
)

Remove a channel from a tunnel.

Parameters
tTunnel.
chChannel
ctnunique number identifying ch within t

Definition at line 2276 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, GNUNET_CADET_ChannelTunnelNumber::cn, CadetTunnel::destroy_task, destroy_tunnel(), GCCH_2s(), GCT_2s(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_SCHEDULER_add_delayed(), GNUNET_YES, IDLE_DESTROY_DELAY, and LOG.

Referenced by channel_destroy().

2279 {
2281  "Removing %s from %s\n",
2282  GCCH_2s (ch),
2283  GCT_2s (t));
2286  ntohl (ctn.cn),
2287  ch));
2288  if ((0 ==
2289  GCT_count_channels (t)) &&
2290  (NULL == t->destroy_task))
2291  {
2292  t->destroy_task
2294  &destroy_tunnel,
2295  t);
2296  }
2297 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
uint32_t cn
Which number does this channel have that uniquely identfies it within its tunnel, in network byte ord...
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
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
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.
const char * GCCH_2s(const struct CadetChannel *ch)
Get the static string for identification of the channel.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
#define LOG(level,...)
#define IDLE_DESTROY_DELAY
How long do we wait until tearing down an idle tunnel?
Here is the call graph for this function:
Here is the caller graph for this function:

◆ destroy_remaining_channels()

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

Destroy remaining channels during shutdown.

Parameters
clsthe struct CadetTunnel of the channel
keykey of the channel
valuethe struct CadetChannel
Returns
GNUNET_OK (continue to iterate)

Definition at line 2309 of file gnunet-service-cadet_tunnels.c.

References ch, GCCH_handle_remote_destroy(), GNUNET_OK, and value.

Referenced by GCT_destroy_tunnel_now().

2312 {
2313  struct CadetChannel *ch = value;
2314 
2316  NULL);
2317  return GNUNET_OK;
2318 }
void GCCH_handle_remote_destroy(struct CadetChannel *ch, const struct GNUNET_CADET_ConnectionTunnelIdentifier *cti)
Destroy channel, based on the other peer closing the connection.
static struct GNUNET_CADET_Channel * ch
Channel handle.
Definition: gnunet-cadet.c:117
static char * value
Value of the record to add/remove.
Struct containing all information regarding a channel to a remote client.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_destroy_tunnel_now()

void GCT_destroy_tunnel_now ( struct CadetTunnel t)

Destroys the tunnel t now, without delay.

Used during shutdown.

Parameters
ttunnel to destroy

Definition at line 2327 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::channels, destroy_remaining_channels(), CadetTunnel::destroy_task, destroy_tunnel(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_multihashmap32_iterate(), GNUNET_SCHEDULER_cancel(), GNUNET_YES, and shutting_down.

Referenced by destroy_tunnels_now().

2328 {
2332  t);
2333  GNUNET_assert (0 ==
2334  GCT_count_channels (t));
2335  if (NULL != t->destroy_task)
2336  {
2338  t->destroy_task = NULL;
2339  }
2340  destroy_tunnel (t);
2341 }
struct GNUNET_CONTAINER_MultiHashMap32 * channels
Channels inside this tunnel.
int GNUNET_CONTAINER_multihashmap32_iterate(struct GNUNET_CONTAINER_MultiHashMap32 *map, GNUNET_CONTAINER_MulitHashMapIterator32Callback it, void *it_cls)
Iterate over all entries in the map.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
static int destroy_remaining_channels(void *cls, uint32_t key, void *value)
Destroy remaining channels during shutdown.
int shutting_down
Signal that shutdown is happening: prevent recovery measures.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
Here is the call graph for this function:
Here is the caller graph for this function:

◆ try_send_normal_payload()

static void try_send_normal_payload ( struct CadetTunnel t,
struct CadetTConnection ct 
)
static

Send normal payload from queue in t via connection ct.

Does nothing if our payload queue is empty.

Parameters
ttunnel to send data from
ctconnection to use for transmission (is ready)

Definition at line 2352 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, CadetTunnelQueueEntry::cid, CadetTunnelQueueEntry::cont, CadetTunnelQueueEntry::cont_cls, CadetTunnelQueueEntry::env, GCC_2s(), GCC_get_id(), GCC_transmit(), GCT_2s(), GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_YES, CadetTConnection::is_ready, LOG, mark_connection_unready(), CadetTunnelQueueEntry::t, CadetTunnel::tq_head, and CadetTunnel::tq_tail.

Referenced by connection_ready_cb(), and trigger_transmissions().

2354 {
2355  struct CadetTunnelQueueEntry *tq;
2356 
2358  tq = t->tq_head;
2359  if (NULL == tq)
2360  {
2361  /* no messages pending right now */
2363  "Not sending payload of %s on ready %s (nothing pending)\n",
2364  GCT_2s (t),
2365  GCC_2s (ct->cc));
2366  return;
2367  }
2368  /* ready to send message 'tq' on tunnel 'ct' */
2369  GNUNET_assert (t == tq->t);
2371  t->tq_tail,
2372  tq);
2373  if (NULL != tq->cid)
2374  *tq->cid = *GCC_get_id (ct->cc);
2377  "Sending payload of %s on %s\n",
2378  GCT_2s (t),
2379  GCC_2s (ct->cc));
2380  GCC_transmit (ct->cc,
2381  tq->env);
2382  if (NULL != tq->cont)
2383  tq->cont (tq->cont_cls,
2384  GCC_get_id (ct->cc));
2385  GNUNET_free (tq);
2386 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
struct CadetTunnelQueueEntry * tq_tail
Queued messages, to transmit once tunnel gets connected.
struct CadetConnection * cc
Connection handle.
Struct used to save messages in a non-ready tunnel to send once connected.
struct CadetTunnelQueueEntry * tq_head
Queued messages, to transmit once tunnel gets connected.
struct CadetTunnel * t
Tunnel these messages belong in.
void * cont_cls
Closure for cont.
struct GNUNET_MQ_Envelope * env
Envelope of message to send follows.
void GCC_transmit(struct CadetConnection *cc, struct GNUNET_MQ_Envelope *env)
Transmit message msg via connection cc.
#define LOG(level,...)
GCT_SendContinuation cont
Continuation to call once sent (on the channel layer).
#define GNUNET_free(ptr)
Wrapper around free.
struct GNUNET_CADET_ConnectionTunnelIdentifier * cid
Where to put the connection identifier into the payload of the message in env once we have it...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ connection_ready_cb()

static void connection_ready_cb ( void *  cls,
int  is_ready 
)
static

A connection is is_ready for transmission.

Looks at our message queue and if there is a message, sends it out via the connection.

Parameters
clsthe struct CadetTConnection that is is_ready
is_readyGNUNET_YES if connection are now ready, GNUNET_NO if connection are no longer ready

Definition at line 2398 of file gnunet-service-cadet_tunnels.c.

References CadetTunnel::ax, CADET_TUNNEL_KEY_AX_AUTH_SENT, CADET_TUNNEL_KEY_AX_RECV, CADET_TUNNEL_KEY_AX_SENT, CADET_TUNNEL_KEY_AX_SENT_AND_RECV, CADET_TUNNEL_KEY_OK, CADET_TUNNEL_KEY_UNINITIALIZED, CadetTConnection::cc, CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, CadetTunnel::connection_ready_head, CadetTunnel::connection_ready_tail, CadetTunnel::destroy_task, destroy_tunnel(), CadetTunnel::estate, estate2s(), GCC_2s(), GCT_2s(), GCT_count_channels(), GNUNET_assert, GNUNET_CONTAINER_DLL_insert_tail, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_SCHEDULER_add_at(), GNUNET_SCHEDULER_add_delayed(), GNUNET_SCHEDULER_cancel(), GNUNET_TIME_absolute_get_remaining(), GNUNET_YES, IDLE_DESTROY_DELAY, CadetTConnection::is_ready, CadetTunnel::kx_auth_requested, CadetTunnel::kx_task, LOG, mark_connection_unready(), CadetTunnel::next_kx_attempt, CadetTunnel::num_busy_connections, CadetTunnel::num_ready_connections, GNUNET_TIME_Relative::rel_value_us, retry_kx(), send_kx(), send_kx_auth(), CadetTConnection::t, and try_send_normal_payload().

Referenced by consider_path_cb(), and GCT_add_inbound_connection().

2400 {
2401  struct CadetTConnection *ct = cls;
2402  struct CadetTunnel *t = ct->t;
2403 
2404  if (GNUNET_NO == is_ready)
2405  {
2407  "%s no longer ready for %s\n",
2408  GCC_2s (ct->cc),
2409  GCT_2s (t));
2411  return;
2412  }
2413  GNUNET_assert (GNUNET_NO == ct->is_ready);
2416  ct);
2418  t->num_busy_connections--;
2419  ct->is_ready = GNUNET_YES;
2422  ct);
2423  t->num_ready_connections++;
2424 
2426  "%s now ready for %s in state %s\n",
2427  GCC_2s (ct->cc),
2428  GCT_2s (t),
2429  estate2s (t->estate));
2430  switch (t->estate)
2431  {
2434  "Do not begin KX for %s if WE have no channels waiting. Retrying after %d\n",
2435  GCT_2s (t),
2437  /* Do not begin KX if WE have no channels waiting! */
2440  return; /* wait for timeout before retrying */
2441  /* We are uninitialized, just transmit immediately,
2442  without undue delay. */
2443 
2445  "Why for %s \n",
2446  GCT_2s (t));
2447 
2448  if (NULL != t->kx_task)
2449  {
2451  t->kx_task = NULL;
2452  }
2453  send_kx (t,
2454  ct,
2455  &t->ax);
2456  if ((0 ==
2457  GCT_count_channels (t)) &&
2458  (NULL == t->destroy_task))
2459  {
2460  t->destroy_task
2462  &destroy_tunnel,
2463  t);
2464  }
2465  break;
2466 
2471  /* we're currently waiting for KX to complete, schedule job */
2472  if (NULL == t->kx_task)
2473  t->kx_task
2475  &retry_kx,
2476  t);
2477  break;
2478 
2479  case CADET_TUNNEL_KEY_OK:
2480  if (GNUNET_YES == t->kx_auth_requested)
2481  {
2484  return; /* wait for timeout */
2485  if (NULL != t->kx_task)
2486  {
2488  t->kx_task = NULL;
2489  }
2490  send_kx_auth (t,
2491  ct,
2492  &t->ax,
2493  GNUNET_NO);
2494  return;
2495  }
2497  ct);
2498  break;
2499  }
2500 }
struct CadetTunnelAxolotl ax
Axolotl info.
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetTConnection * connection_ready_tail
DLL of ready connections that are actively used to reach the destination peer.
static const char * estate2s(enum CadetTunnelEState es)
Get string description for tunnel encryption state.
uint64_t rel_value_us
The actual value.
int is_ready
Is the connection currently ready for transmission?
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
unsigned int num_ready_connections
Number of connections in the connection_ready_head DLL.
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static void mark_connection_unready(struct CadetTConnection *ct)
Connection ct is now unready, clear it&#39;s ready flag and move it from the ready DLL to the busy DLL...
KX received and we sent KX_AUTH back, but we got no traffic yet, so we&#39;re waiting for either KX_AUTH ...
struct CadetTConnection * connection_ready_head
DLL of ready connections that are actively used to reach the destination peer.
int kx_auth_requested
Force triggering KX_AUTH independent of estate.
static void send_kx(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax)
Send a KX message.
KX message sent, waiting for other peer&#39;s KX_AUTH.
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct GNUNET_SCHEDULER_Task * destroy_task
Task scheduled if there are no more channels using the tunnel.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
struct GNUNET_SCHEDULER_Task * kx_task
Task to trigger KX.
static void destroy_tunnel(void *cls)
This tunnel is no longer used, destroy it.
struct CadetTunnel * t
Tunnel this connection belongs to.
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 CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
struct GNUNET_TIME_Absolute next_kx_attempt
When do we try the next KX?
#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element)
Insert an element at the tail of a DLL.
Handshake completed: session key available.
Entry in list of connections used by tunnel, with metadata.
KX message sent and received, trying to send back KX_AUTH.
static void send_kx_auth(struct CadetTunnel *t, struct CadetTConnection *ct, struct CadetTunnelAxolotl *ax, int force_reply)
Send a KX_AUTH message.
unsigned int GCT_count_channels(struct CadetTunnel *t)
Count channels of a tunnel.
static void retry_kx(void *cls)
Try to redo the KX or KX_AUTH handshake, if we can.
Uninitialized status, we need to send KX.
#define LOG(level,...)
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:331
KX message received, trying to send back KX_AUTH.
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
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 CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
enum CadetTunnelEState estate
State of the tunnel encryption.
static void try_send_normal_payload(struct CadetTunnel *t, struct CadetTConnection *ct)
Send normal payload from queue in t via connection ct.
#define IDLE_DESTROY_DELAY
How long do we wait until tearing down an idle tunnel?
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:972
Here is the call graph for this function:
Here is the caller graph for this function:

◆ evaluate_connection()

static void evaluate_connection ( void *  cls,
struct CadetTConnection ct 
)
static

Evaluate a connection, updating our summary information in cls about what kinds of connections we have.

Parameters
clsthe struct EvaluationSummary * to update
cta connection to include in the summary

Definition at line 2585 of file gnunet-service-cadet_tunnels.c.

References CadetConnectionMetrics::age, CadetTConnection::cc, EvaluationSummary::duplicate, GCC_2s(), GCC_get_metrics(), GCC_get_path(), GCPP_2s(), GCPP_get_desirability(), GCPP_get_length(), GCPP_get_peer_at_offset(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_MAX, GNUNET_MIN, GNUNET_NO, GNUNET_TIME_absolute_get_duration(), GNUNET_YES, CadetConnectionMetrics::last_use, LOG, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, CadetConnectionMetrics::num_acked_transmissions, CadetConnectionMetrics::num_successes, EvaluationSummary::path, GNUNET_TIME_Relative::rel_value_us, EvaluationSummary::worst, and EvaluationSummary::worst_score.

Referenced by consider_path_cb(), and maintain_connections_cb().

2587 {
2588  struct EvaluationSummary *es = cls;
2589  struct CadetConnection *cc = ct->cc;
2590  unsigned int ct_length;
2591  struct CadetPeerPath *ps;
2592  const struct CadetConnectionMetrics *metrics;
2593  GNUNET_CONTAINER_HeapCostType ct_desirability;
2594  struct GNUNET_TIME_Relative uptime;
2595  struct GNUNET_TIME_Relative last_use;
2596  double score;
2597  double success_rate;
2598 
2599  ps = GCC_get_path (cc,
2600  &ct_length);
2602  "Evaluating path %s of existing %s\n",
2603  GCPP_2s (ps),
2604  GCC_2s (cc));
2605  if (ps == es->path)
2606  {
2608  "Ignoring duplicate path %s.\n",
2609  GCPP_2s (es->path));
2610  es->duplicate = GNUNET_YES;
2611  return;
2612  }
2613  if (NULL != es->path)
2614  {
2615  int duplicate = GNUNET_YES;
2616 
2617  for (unsigned int i = 0; i < ct_length; i++)
2618  {
2619  GNUNET_assert (GCPP_get_length (es->path) > i);
2620  if (GCPP_get_peer_at_offset (es->path,
2621  i) !=
2623  i))
2624  {
2625  duplicate = GNUNET_NO;
2626  break;
2627  }
2628  }
2629  if (GNUNET_YES == duplicate)
2630  {
2632  "Ignoring overlapping path %s.\n",
2633  GCPP_2s (es->path));
2634  es->duplicate = GNUNET_YES;
2635  return;
2636  }
2637  else
2638  {
2640  "Known path %s differs from proposed path\n",
2641  GCPP_2s (ps));
2642  }
2643  }
2644 
2645  ct_desirability = GCPP_get_desirability (ps);
2646  metrics = GCC_get_metrics (cc);
2647  uptime = GNUNET_TIME_absolute_get_duration (metrics->age);
2648  last_use = GNUNET_TIME_absolute_get_duration (metrics->last_use);
2649  /* We add 1.0 here to avoid division by zero. */
2650  success_rate = (metrics->num_acked_transmissions + 1.0)
2651  / (metrics->num_successes + 1.0);
2652  score
2653  = ct_desirability
2654  + 100.0 / (1.0 + ct_length) /* longer paths = better */
2655  + sqrt (uptime.rel_value_us / 60000000LL) /* larger uptime = better */
2656  - last_use.rel_value_us / 1000L; /* longer idle = worse */
2657  score *= success_rate; /* weigh overall by success rate */
2658 
2659  if ((NULL == es->worst) ||
2660  (score < es->worst_score))
2661  {
2662  es->worst = ct;
2663  es->worst_score = score;
2664  }
2665  es->min_length = GNUNET_MIN (es->min_length,
2666  ct_length);
2667  es->max_length = GNUNET_MAX (es->max_length,
2668  ct_length);
2669  es->min_desire = GNUNET_MIN (es->min_desire,
2670  ct_desirability);
2671  es->max_desire = GNUNET_MAX (es->max_desire,
2672  ct_desirability);
2673 }
Closure for evaluate_connection.
const struct CadetConnectionMetrics * GCC_get_metrics(struct CadetConnection *cc)
Obtain performance metrics from cc.
struct CadetPeerPath * path
Path we are comparing against for evaluate_connection, can be NULL.
Low-level connection to a destination.
int duplicate
Set to GNUNET_YES if we have a connection over path already.
unsigned int max_length
Maximum length of any of our connections, 0 if we have none.
unsigned long long num_successes
Number of packets that were sent via this connection did actually receive an ACK? (Note: ACKs may be ...
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
struct GNUNET_TIME_Absolute last_use
When was this connection last used? (by us sending or receiving a PAYLOAD message on it) ...
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
Performance metrics for a connection.
double worst_score
Numeric score of worst, only set if worst is non-NULL.
GNUNET_CONTAINER_HeapCostType min_desire
Minimum desirability of any of our connections, UINT64_MAX if we have none.
#define GNUNET_MAX(a, b)
Definition: gnunet_common.h:95
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:93
struct CadetConnection * cc
Connection handle.
uint64_t GNUNET_CONTAINER_HeapCostType
Cost by which elements in a heap can be ordered.
GNUNET_CONTAINER_HeapCostType GCPP_get_desirability(const struct CadetPeerPath *path)
Return how much we like keeping the path.
struct CadetPeerPath * GCC_get_path(struct CadetConnection *cc, unsigned int *off)
Obtain the path used by this connection.
GNUNET_CONTAINER_HeapCostType max_desire
Maximum desirability of any of our connections, 0 if we have none.
unsigned int min_length
Minimum length of any of our connections, UINT_MAX if we have none.
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:375
unsigned long long num_acked_transmissions
How many packets that ought to generate an ACK did we send via this connection?
struct CadetPeer * GCPP_get_peer_at_offset(struct CadetPeerPath *path, unsigned int off)
Obtain the peer at offset off in path.
#define LOG(level,...)
struct GNUNET_TIME_Absolute age
When was this connection first established? (by us sending or receiving the CREATE_ACK for the first ...
Information regarding a possible path to reach a peer.
unsigned int GCPP_get_length(struct CadetPeerPath *path)
Return the length of the path.
Time for relative time used by GNUnet, in microseconds.
struct CadetTConnection * worst
Connection deemed the "worst" so far encountered by evaluate_connection, NULL if we did not yet encou...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ consider_path_cb()

static int consider_path_cb ( void *  cls,
struct CadetPeerPath path,
unsigned int  off 
)
static

Consider using the path p for the tunnel t.

The tunnel destination is at offset off in path p.

Parameters
clsour tunnel
patha path to our destination
offoffset of the destination on path path
Returns
GNUNET_YES (should keep iterating)

Definition at line 2686 of file gnunet-service-cadet_tunnels.c.

References CadetTConnection::cc, CadetTunnel::connection_busy_head, CadetTunnel::connection_busy_tail, connection_ready_cb(), CadetTConnection::created, DESIRED_CONNECTIONS_PER_TUNNEL, CadetTunnel::destination, EvaluationSummary::duplicate, evaluate_connection(), GCC_2s(), GCC_create(), GCP_2s(), GCPP_2s(), GCPP_get_desirability(), GCPP_get_length(), GCPP_get_peer_at_offset(), GCT_2s(), GCT_count_any_connections(), GCT_iterate_connections(), GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_new, GNUNET_NO, GNUNET_TIME_absolute_get(), GNUNET_YES, LOG, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, CadetTunnel::num_busy_connections, EvaluationSummary::path, t, CadetTConnection::t, and EvaluationSummary::worst.

Referenced by GCT_consider_path(), and maintain_connections_cb().

2689 {
2690  struct CadetTunnel *t = cls;
2691  struct EvaluationSummary es;
2692  struct CadetTConnection *ct;
2693 
2694  GNUNET_assert (off < GCPP_get_length (path));
2696  off) == t->destination);
2697  es.min_length = UINT_MAX;
2698  es.max_length = 0;
2699  es.max_desire = 0;
2700  es.min_desire = UINT64_MAX;
2701  es.path = path;
2702  es.duplicate = GNUNET_NO;
2703  es.worst = NULL;
2704 
2705  /* Compute evaluation summary over existing connections. */
2707  "Evaluating proposed path %s for target %s\n",
2708  GCPP_2s (path),
2709  GCT_2s (t));
2710  /* FIXME: suspect this does not ACTUALLY iterate
2711  over all existing paths, otherwise dup detection
2712  should work!!! */
2715  &es);
2716  if (GNUNET_YES == es.duplicate)
2717  return GNUNET_YES;
2718 
2719  /* FIXME: not sure we should really just count
2720  'num_connections' here, as they may all have
2721  consistently failed to connect. */
2722 
2723  /* We iterate by increasing path length; if we have enough paths and
2724  this one is more than twice as long than what we are currently
2725  using, then ignore all of these super-long ones! */
2727  (es.min_length * 2 < off) &&
2728  (es.max_length < off))
2729  {
2731  "Ignoring paths of length %u, they are way too long.\n",
2732  es.min_length * 2);
2733  return GNUNET_NO;
2734  }
2735  /* If we have enough paths and this one looks no better, ignore it. */
2737  (es.min_length < GCPP_get_length (path)) &&
2738  (es.min_desire > GCPP_get_desirability (path)) &&
2739  (es.max_length < off))
2740  {
2742  "Ignoring path (%u/%llu) to %s, got something better already.\n",
2743  GCPP_get_length (path),
2744  (unsigned long long) GCPP_get_desirability (path),
2745  GCP_2s (t->destination));
2746  return GNUNET_YES;
2747  }
2748 
2749  /* Path is interesting (better by some metric, or we don't have
2750  enough paths yet). */
2751  ct = GNUNET_new (struct CadetTConnection);
2753  ct->t = t;
2754  ct->cc = GCC_create (t->destination,
2755  path,
2756  off,
2757  ct,
2759  ct);
2760 
2761  /* FIXME: schedule job to kill connection (and path?) if it takes
2762  too long to get ready! (And track performance data on how long
2763  other connections took with the tunnel!)
2764  => Note: to be done within 'connection'-logic! */
2767  ct);
2768  t->num_busy_connections++;
2770  "Found interesting path %s for %s, created %s\n",
2771  GCPP_2s (path),
2772  GCT_2s (t),
2773  GCC_2s (ct->cc));
2774  return GNUNET_YES;
2775 }
Closure for evaluate_connection.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define DESIRED_CONNECTIONS_PER_TUNNEL
How many connections would we like to have per tunnel?
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
unsigned int GCT_count_any_connections(const struct CadetTunnel *t)
Count all created connections of a tunnel.
#define GNUNET_new(type)
Allocate a struct or union of the given type.
struct CadetConnection * GCC_create(struct CadetPeer *destination, struct CadetPeerPath *path, unsigned int off, struct CadetTConnection *ct, GCC_ReadyCallback ready_cb, void *ready_cb_cls)
Create a connection to destination via path and notify cb whenever we are ready for more data...
static struct GNUNET_SCHEDULER_Task * t
Main task.
struct CadetTConnection * connection_busy_head
DLL of connections that we maintain that might be used to reach the destination peer.
const char * GCP_2s(const struct CadetPeer *cp)
Get the static string for a peer ID.
struct CadetTunnel * t
Tunnel this connection belongs to.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:118
struct CadetConnection * cc
Connection handle.
Struct containing all information regarding a tunnel to a peer.
GNUNET_CONTAINER_HeapCostType GCPP_get_desirability(const struct CadetPeerPath *path)
Return how much we like keeping the path.
static void evaluate_connection(void *cls, struct CadetTConnection *ct)
Evaluate a connection, updating our summary information in cls about what kinds of connections we hav...
Entry in list of connections used by tunnel, with metadata.
struct CadetPeer * destination
Destination of the tunnel.
static void connection_ready_cb(void *cls, int is_ready)
A connection is is_ready for transmission.
struct GNUNET_TIME_Absolute created
Creation time, to keep oldest connection alive.
struct CadetPeer * GCPP_get_peer_at_offset(struct CadetPeerPath *path, unsigned int off)
Obtain the peer at offset off in path.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
#define LOG(level,...)
unsigned int num_busy_connections
Number of connections in the connection_busy_head DLL.
struct CadetTConnection * connection_busy_tail
DLL of connections that we maintain that might be used to reach the destination peer.
unsigned int GCPP_get_length(struct CadetPeerPath *path)
Return the length of the path.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ maintain_connections_cb()

static void maintain_connections_cb ( void *  cls)
static

Function called to maintain the connections underlying our tunnel.

Tries to maintain (incl. tear down) connections for the tunnel, and if there is a significant change, may trigger transmissions.

Basically, needs to check if there are connections that perform badly, and if so eventually kill them and trigger a replacement. The strategy is to open one more connection than DESIRED_CONNECTIONS_PER_TUNNEL, and then periodically kick out the least-performing one, and then inquire for new ones.

Parameters
clsthe struct CadetTunnel

Definition at line 2792 of file gnunet-service-cadet_tunnels.c.

References consider_path_cb(), DESIRED_CONNECTIONS_PER_TUNNEL, CadetTunnel::destination, destroy_t_connection(), EvaluationSummary::duplicate, evaluate_connection(), GCP_iterate_paths(), GCT_2s(), GCT_count_any_connections(), GCT_iterate_connections(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_SCHEDULER_add_delayed(), GNUNET_TIME_UNIT_MINUTES, LOG, CadetTunnel::maintain_connections_task, EvaluationSummary::max_desire, EvaluationSummary::max_length, EvaluationSummary::min_desire, EvaluationSummary::min_length, EvaluationSummary::path, and EvaluationSummary::worst.

Referenced by GCT_create_tunnel().

2793 {
2794  struct CadetTunnel *t = cls;
2795  struct GNUNET_TIME_Relative delay;
2796  struct EvaluationSummary es;
2797 
2798  t->maintain_connections_task = NULL;
2800  "Performing connection maintenance for %s.\n",
2801  GCT_2s (t));
2802 
2803  es.min_length = UINT_MAX;
2804  es.max_length = 0;
2805  es.max_desire = 0;
2806  es.min_desire = UINT64_MAX;
2807  es.path = NULL;
2808  es.worst = NULL;
2809  es.duplicate = GNUNET_NO;
2812  &es);
2813  if ((NULL != es.worst) &&
2815  {
2816  /* Clear out worst-performing connection 'es.worst'. */
2818  es.worst);
2819  }
2820 
2821  /* Consider additional paths */
2822  (void) GCP_iterate_paths (t->destination,
2824  t);
2825 
2826  /* FIXME: calculate when to try again based on how well we are doing;
2827  in particular, if we have to few connections, we might be able
2828  to do without this (as PATHS should tell us whenever a new path
2829  is available instantly; however, need to make sure this job is
2830  restarted after that happens).
2831  Furthermore, if the paths we do know are in a reasonably narrow
2832  quality band and are plentyful, we might also consider us stabilized
2833  and then reduce the frequency accordingly. */delay = GNUNET_TIME_UNIT_MINUTES;
2837  t);
2838 }
Closure for evaluate_connection.
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
#define DESIRED_CONNECTIONS_PER_TUNNEL
How many connections would we like to have per tunnel?
#define GNUNET_TIME_UNIT_MINUTES
One minute.
unsigned int GCT_count_any_connections(const struct CadetTunnel *t)
Count all created connections of a tunnel.
unsigned int GCP_iterate_paths(struct CadetPeer *cp, GCP_PathIterator callback, void *callback_cls)
Iterate over the paths to a peer.
static struct GNUNET_SCHEDULER_Task * t
Main task.
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
static int consider_path_cb(void *cls, struct CadetPeerPath *path, unsigned int off)
Consider using the path p for the tunnel t.
Struct containing all information regarding a tunnel to a peer.
static struct GNUNET_TIME_Relative delay
When should dkg communication start?
static void evaluate_connection(void *cls, struct CadetTConnection *ct)
Evaluate a connection, updating our summary information in cls about what kinds of connections we hav...
static void maintain_connections_cb(void *cls)
Function called to maintain the connections underlying our tunnel.
struct CadetPeer * destination
Destination of the tunnel.
struct GNUNET_SCHEDULER_Task * maintain_connections_task
Task to trim connections if too many are present.
void GCT_iterate_connections(struct CadetTunnel *t, GCT_ConnectionIterator iter, void *iter_cls)
Iterate over all connections of a tunnel.
static void destroy_t_connection(void *cls, struct CadetTConnection *ct)
Clean up connection ct of a tunnel.
#define LOG(level,...)
Time for relative time used by GNUnet, in microseconds.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GCT_consider_path()

void GCT_consider_path ( struct CadetTunnel t,
struct CadetPeerPath p,
unsigned int  off 
)

Consider using the path p for the tunnel t.

The tunnel destination is at offset off in path p.

Parameters
clsour tunnel
patha path to our destination
offoffset of the destination on path path

Definition at line 2850 of file gnunet-service-cadet_tunnels.c.

References consider_path_cb(), GCPP_2s(), GCT_2s(), GNUNET_ERROR_TYPE_DEBUG, and LOG.

Referenced by GCP_path_entry_add(), and GCP_set_mq().

2853 {
2855  "Considering %s for %s (offset %u)\n",
2856  GCPP_2s (p),
2857  GCT_2s (t),
2858  off);
2859  (void) consider_path_cb (t,
2860  p,
2861  off);
2862 }
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
static int consider_path_cb(void *cls, struct CadetPeerPath *path, unsigned int off)
Consider using the path p for the tunnel t.
#define LOG(level,...)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_plaintext_keepalive()

static void handle_plaintext_keepalive ( void *  cls,
const struct GNUNET_MessageHeader