GNUnet 0.21.1
gnunet-service-cadet_peer.h File Reference

Information we track per peer. More...

Include dependency graph for gnunet-service-cadet_peer.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef int(* GCP_PathIterator) (void *cls, struct CadetPeerPath *path, unsigned int off)
 Peer path iterator. More...
 
typedef void(* GCP_MessageQueueNotificationCallback) (void *cls, int available)
 Function to call with updated message queue object. More...
 

Functions

const char * GCP_2s (const struct CadetPeer *peer)
 Get the static string for a peer ID. More...
 
struct CadetPeerGCP_get (const struct GNUNET_PeerIdentity *peer_id, int create)
 Retrieve the CadetPeer structure associated with the peer. More...
 
double GCP_get_desirability_of_path (struct CadetPeer *cp, unsigned int off)
 Calculate how desirable a path is for cp if cp is at offset off in the path. More...
 
const struct GNUNET_PeerIdentityGCP_get_id (struct CadetPeer *cp)
 Obtain the peer identity for a struct CadetPeer. More...
 
void GCP_iterate_all (GNUNET_CONTAINER_PeerMapIterator iter, void *cls)
 Iterate over all known peers. More...
 
unsigned int GCP_count_paths (const struct CadetPeer *cp)
 Count the number of known paths toward the peer. More...
 
void GCP_drop_owned_paths (struct CadetPeer *cp)
 Drop all paths owned by this peer, and do not allow new ones to be added: We are shutting down. More...
 
unsigned int GCP_iterate_paths (struct CadetPeer *cp, GCP_PathIterator callback, void *callback_cls)
 Iterate over the paths to a peer. More...
 
unsigned int GCP_iterate_indirect_paths (struct CadetPeer *cp, GCP_PathIterator callback, void *callback_cls)
 Iterate over the paths to a peer without direct link. More...
 
unsigned int GCP_iterate_paths_at (struct CadetPeer *cp, unsigned int dist, GCP_PathIterator callback, void *callback_cls)
 Iterate over the paths to peer where peer is at distance dist from us. More...
 
void GCP_path_entry_remove (struct CadetPeer *cp, struct CadetPeerPathEntry *entry, unsigned int off)
 Remove an entry from the DLL of all of the paths that this peer is on. More...
 
void GCP_path_entry_add (struct CadetPeer *cp, struct CadetPeerPathEntry *entry, unsigned int off)
 Add an entry to the DLL of all of the paths that this peer is on. More...
 
struct CadetTunnelGCP_get_tunnel (struct CadetPeer *cp, int create)
 Get the tunnel towards a peer. More...
 
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. More...
 
struct GNUNET_CONTAINER_HeapNodeGCP_attach_path (struct CadetPeer *cp, struct CadetPeerPath *path, unsigned int off, int force)
 Try adding a path to this cp. More...
 
void GCP_detach_path (struct CadetPeer *cp, struct CadetPeerPath *path, struct GNUNET_CONTAINER_HeapNode *hn)
 This peer can no longer own path as the path has been extended and a peer further down the line is now the new owner. More...
 
void GCP_add_connection (struct CadetPeer *cp, struct CadetConnection *cc)
 Add a connection to this cp. More...
 
void GCP_remove_connection (struct CadetPeer *cp, struct CadetConnection *cc)
 Remove a connection that went via this cp. More...
 
void GCP_set_hello (struct CadetPeer *cp, const struct GNUNET_MessageHeader *hello)
 We got a HELLO for a cp, remember it, and possibly trigger adequate actions (like trying to connect). More...
 
void GCP_destroy_all_peers (void)
 Clean up all entries about all peers. More...
 
struct GCP_MessageQueueManagerGCP_request_mq (struct CadetPeer *cp, GCP_MessageQueueNotificationCallback cb, void *cb_cls)
 Start message queue change notifications. More...
 
int GCP_has_core_connection (struct CadetPeer *cp)
 Test if cp has a core-level connection. More...
 
void GCP_send (struct GCP_MessageQueueManager *mqm, struct GNUNET_MQ_Envelope *env)
 Send the message in env via a mqm. More...
 
void GCP_send_ooo (struct CadetPeer *cp, struct GNUNET_MQ_Envelope *env)
 Send the message in env to cp, overriding queueing logic. More...
 
void GCP_request_mq_cancel (struct GCP_MessageQueueManager *mqm, struct GNUNET_MQ_Envelope *last_env)
 Stops message queue change notifications and sends a last message. More...
 
void GCP_set_mq (struct CadetPeer *cp, struct GNUNET_MQ_Handle *mq)
 Set the message queue to mq for peer cp and notify watchers. More...
 
int GCP_check_monotime_sig (struct CadetPeer *peer, const struct GNUNET_CADET_ConnectionCreateMessage *msg)
 Checking the signature for a monotime of a GNUNET_CADET_ConnectionCreateMessage. More...
 
int GCP_check_and_update_monotime (struct CadetPeer *peer, struct GNUNET_TIME_AbsoluteNBO monotime)
 Checking if a monotime value is newer than the last monotime value received from a peer. More...
 

Detailed Description

Information we track per peer.

Author
Bartlomiej Polot
Christian Grothoff

Definition in file gnunet-service-cadet_peer.h.

Typedef Documentation

◆ GCP_PathIterator

typedef int(* GCP_PathIterator) (void *cls, struct CadetPeerPath *path, unsigned int off)

Peer path iterator.

Parameters
clsClosure.
pathPath itself
offoffset of the target peer in path
Returns
GNUNET_YES if should keep iterating. GNUNET_NO otherwise.

Definition at line 131 of file gnunet-service-cadet_peer.h.

◆ GCP_MessageQueueNotificationCallback

typedef void(* GCP_MessageQueueNotificationCallback) (void *cls, int available)

Function to call with updated message queue object.

Parameters
clsclosure
availableGNUNET_YES if sending is now possible, GNUNET_NO if sending is no longer possible GNUNET_SYSERR if sending is no longer possible and the last envelope was discarded

Definition at line 328 of file gnunet-service-cadet_peer.h.

Function Documentation

◆ GCP_2s()

const char * GCP_2s ( const struct CadetPeer peer)

Get the static string for a peer ID.

Parameters
peerPeer.
Returns
Static string for it's ID.

Definition at line 234 of file gnunet-service-cadet_peer.c.

235{
236 static char buf[5];
237 char *ret;
238
239 if ((NULL == cp) ||
240 (GNUNET_YES == GNUNET_is_zero (&cp->pid.public_key)))
241 return "NULL";
242
243 ret = GNUNET_CRYPTO_eddsa_public_key_to_string (&cp->pid.public_key);
244 if (NULL == ret)
245 return "NULL";
246
247 GNUNET_strlcpy (buf,
248 ret,
249 sizeof(buf));
251 return buf;
252}
static int ret
Final status code.
Definition: gnunet-arm.c:94
#define GNUNET_is_zero(a)
Check that memory in a is all zeros.
char * GNUNET_CRYPTO_eddsa_public_key_to_string(const struct GNUNET_CRYPTO_EddsaPublicKey *pub)
Convert a public key to a string.
Definition: crypto_ecc.c:252
@ GNUNET_YES
#define GNUNET_free(ptr)
Wrapper around free.
size_t GNUNET_strlcpy(char *dst, const char *src, size_t n)
Like strlcpy but portable.
Definition: strings.c:138

References GNUNET_CRYPTO_eddsa_public_key_to_string(), GNUNET_free, GNUNET_is_zero, GNUNET_strlcpy(), GNUNET_YES, CadetPeer::pid, GNUNET_PeerIdentity::public_key, and ret.

Referenced by consider_path_cb(), consider_peer_activate(), destroy_peer(), dht_get_id_handler(), GCC_debug(), GCCH_channel_incoming_new(), GCCH_channel_local_new(), GCP_add_connection(), GCP_attach_path(), GCP_detach_path(), GCP_drop_owned_paths(), GCP_drop_tunnel(), GCP_get(), GCP_iterate_indirect_paths(), GCP_iterate_paths(), GCP_path_entry_add(), GCP_path_entry_remove(), GCP_remove_connection(), GCP_request_mq(), GCP_request_mq_cancel(), GCP_send(), GCP_send_ooo(), GCP_set_hello(), GCP_set_mq(), GSC_bind(), handle_connection_create(), mqm_execute(), mqm_send_done(), route_message(), send_broken(), and timeout_closed_cb().

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

◆ GCP_get()

struct CadetPeer * GCP_get ( const struct GNUNET_PeerIdentity peer_id,
int  create 
)

Retrieve the CadetPeer structure associated with the peer.

Optionally create one and insert it in the appropriate structures if the peer is not known yet.

Parameters
peer_idFull identity of the peer.
createGNUNET_YES if a new peer should be created if unknown. GNUNET_NO to return NULL if peer is unknown.
Returns
Existing or newly created peer structure. NULL if unknown and not requested create

Definition at line 1094 of file gnunet-service-cadet_peer.c.

1096{
1097 struct CadetPeer *cp;
1098
1100 peer_id);
1101 if (NULL != cp)
1102 return cp;
1103 if (GNUNET_NO == create)
1104 return NULL;
1105 cp = GNUNET_new (struct CadetPeer);
1106 cp->pid = *peer_id;
1108 GNUNET_YES);
1113 &cp->pid,
1114 cp,
1117 "Creating peer %s\n",
1118 GCP_2s (cp));
1119 return cp;
1120}
static char * peer_id
Option –peer.
Definition: gnunet-cadet.c:42
static int create
Create DID Document Flag.
Definition: gnunet-did.c:68
struct GNUNET_CONTAINER_MultiPeerMap * peers
Map from PIDs to struct CadetPeer entries.
#define LOG(level,...)
const char * GCP_2s(const struct CadetPeer *cp)
Get the static string for a peer ID.
void * GNUNET_CONTAINER_multipeermap_get(const struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key)
Given a key find a value in the map matching the key.
struct GNUNET_CONTAINER_MultiShortmap * GNUNET_CONTAINER_multishortmap_create(unsigned int len, int do_not_copy_keys)
Create a multi peer map (hash map for public keys of peers).
int GNUNET_CONTAINER_multipeermap_put(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
@ GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_CONTAINER_Heap * GNUNET_CONTAINER_heap_create(enum GNUNET_CONTAINER_HeapOrder order)
Create a new heap.
@ GNUNET_CONTAINER_HEAP_ORDER_MIN
Heap with the minimum cost at the root.
@ GNUNET_NO
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
@ GNUNET_ERROR_TYPE_DEBUG
#define GNUNET_new(type)
Allocate a struct or union of the given type.
Struct containing all information regarding a given peer.
struct GNUNET_CONTAINER_Heap * path_heap
MIN-heap of paths owned by this peer (they also end at this peer).
struct GNUNET_CONTAINER_MultiShortmap * connections
Connections that go through this peer; indexed by tid.
struct GNUNET_PeerIdentity pid
ID of the peer.

References CadetPeer::connections, create, GCP_2s(), GNUNET_assert, GNUNET_CONTAINER_heap_create(), GNUNET_CONTAINER_HEAP_ORDER_MIN, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CONTAINER_multishortmap_create(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_new, GNUNET_NO, GNUNET_YES, LOG, CadetPeer::path_heap, peer_id, peers, and CadetPeer::pid.

Referenced by core_connect_cb(), dht_get_id_handler(), GCCH_bind(), GCPP_get_path_from_route(), GCPP_try_path_from_dht(), got_hello(), handle_channel_create(), handle_connection_create(), and handle_show_path().

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

◆ GCP_get_desirability_of_path()

double GCP_get_desirability_of_path ( struct CadetPeer cp,
unsigned int  off 
)

Calculate how desirable a path is for cp if cp is at offset off in the path.

The 'desirability_table.c' program can be used to compute a list of sample outputs for different scenarios. Basically, we score paths lower if there are many alternatives, and higher if they are shorter than average, and very high if they are much shorter than average and without many alternatives.

Parameters
cpa peer reachable via a path
offoffset of cp in a path
Returns
score how useful a path is to reach cp, positive scores mean path is more desirable

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

258{
259 unsigned int num_alts = cp->num_paths;
260 unsigned int off_sum;
261 double avg_sum;
262 double path_delta;
263 double weight_alts;
264
265 GNUNET_assert (num_alts >= 1); /* 'path' should be in there! */
267
268 /* We maintain 'off_sum' in 'peer' and thereby
269 avoid the SLOW recalculation each time. Kept here
270 just to document what is going on. */
271#if SLOW
272 off_sum = 0;
273 for (unsigned int j = 0; j < cp->path_dll_length; j++)
274 for (struct CadetPeerPathEntry *pe = cp->path_heads[j];
275 NULL != pe;
276 pe = pe->next)
277 off_sum += j;
278 GNUNET_assert (off_sum == cp->off_sum);
279#else
280 off_sum = cp->off_sum;
281#endif
282 avg_sum = off_sum * 1.0 / cp->path_dll_length;
283 path_delta = off - avg_sum;
284 /* path_delta positive: path off of peer above average (bad path for peer),
285 path_delta negative: path off of peer below average (good path for peer) */
286 if (path_delta <= -1.0)
287 weight_alts = -num_alts / path_delta; /* discount alternative paths */
288 else if (path_delta >= 1.0)
289 weight_alts = num_alts * path_delta; /* overcount alternative paths */
290 else
291 weight_alts = num_alts; /* count alternative paths normally */
292
293
294 /* off+1: long paths are generally harder to find and thus count
295 a bit more as they get longer. However, above-average paths
296 still need to count less, hence the squaring of that factor. */
297 return (off + 1.0) / (weight_alts * weight_alts);
298}
Entry in a peer path.
struct CadetPeerPathEntry * next
DLL of paths where the same peer is at the same offset.
struct CadetPeerPathEntry ** path_heads
Array of DLLs of paths traversing the peer, organized by the offset of the peer on the larger path.
unsigned int num_paths
How many paths do we have to this peer (in all path_heads DLLs combined).
unsigned int off_sum
Sum over all of the offsets of all of the paths in the path_heads DLLs.
unsigned int path_dll_length
Current length of the path_heads and path_tails arrays.

References GNUNET_assert, CadetPeerPathEntry::next, CadetPeer::num_paths, CadetPeer::off_sum, CadetPeer::path_dll_length, and CadetPeer::path_heads.

Referenced by recalculate_path_desirability().

Here is the caller graph for this function:

◆ GCP_get_id()

const struct GNUNET_PeerIdentity * GCP_get_id ( struct CadetPeer cp)

Obtain the peer identity for a struct CadetPeer.

Parameters
cpour peer handle
Returns
the peer identity

Definition at line 1130 of file gnunet-service-cadet_peer.c.

1131{
1132 return &cp->pid;
1133}

References CadetPeer::pid.

Referenced by destroy_route(), dir_ready_cb(), GCCH_2s(), GCCH_channel_local_new(), GCPP_2s(), GCT_2s(), GCT_handle_kx(), GCT_handle_kx_auth(), get_next_free_ctn(), GSC_bind(), path_info_iterator(), route_message(), send_create(), and send_kx().

Here is the caller graph for this function:

◆ GCP_iterate_all()

void GCP_iterate_all ( GNUNET_CONTAINER_PeerMapIterator  iter,
void *  cls 
)

Iterate over all known peers.

Parameters
iterIterator.
clsClosure for iter.

Definition at line 1143 of file gnunet-service-cadet_peer.c.

1145{
1147 iter,
1148 cls);
1149}
int GNUNET_CONTAINER_multipeermap_iterate(struct GNUNET_CONTAINER_MultiPeerMap *map, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map.

References GNUNET_CONTAINER_multipeermap_iterate(), and peers.

Referenced by handle_get_peers(), handle_info_tunnels(), and shutdown_rest().

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

◆ GCP_count_paths()

unsigned int GCP_count_paths ( const struct CadetPeer cp)

Count the number of known paths toward the peer.

Parameters
cpPeer to get path info.
Returns
Number of known paths.

Definition at line 1159 of file gnunet-service-cadet_peer.c.

1160{
1161 return cp->num_paths;
1162}

References CadetPeer::num_paths.

Referenced by get_all_peers_iterator().

Here is the caller graph for this function:

◆ GCP_drop_owned_paths()

void GCP_drop_owned_paths ( struct CadetPeer cp)

Drop all paths owned by this peer, and do not allow new ones to be added: We are shutting down.

Parameters
cppeer to drop paths to

Definition at line 794 of file gnunet-service-cadet_peer.c.

795{
796 struct CadetPeerPath *path;
797
799 "Destroying all paths to %s\n",
800 GCP_2s (cp));
801 while (NULL != (path =
803 GCPP_release (path);
805 cp->path_heap = NULL;
806}
void GCPP_release(struct CadetPeerPath *path)
The owning peer of this path is no longer interested in maintaining it, so the path should be discard...
void * GNUNET_CONTAINER_heap_remove_root(struct GNUNET_CONTAINER_Heap *heap)
Remove root of the heap.
void GNUNET_CONTAINER_heap_destroy(struct GNUNET_CONTAINER_Heap *heap)
Destroys the heap.
Information regarding a possible path to reach a peer.

References GCP_2s(), GCPP_release(), GNUNET_CONTAINER_heap_destroy(), GNUNET_CONTAINER_heap_remove_root(), GNUNET_ERROR_TYPE_DEBUG, LOG, and CadetPeer::path_heap.

Referenced by destroy_paths_now().

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

◆ GCP_iterate_paths()

unsigned int GCP_iterate_paths ( struct CadetPeer cp,
GCP_PathIterator  callback,
void *  callback_cls 
)

Iterate over the paths to a peer.

Parameters
cpPeer to get path info.
callbackFunction to call for every path.
callback_clsClosure for callback.
Returns
Number of iterated paths.

Definition at line 1174 of file gnunet-service-cadet_peer.c.

1177{
1178 unsigned int ret = 0;
1179
1181 "Iterating over paths to peer %s%s\n",
1182 GCP_2s (cp),
1183 (NULL == cp->core_mq) ? "" : " including direct link");
1184 if (NULL != cp->core_mq)
1185 {
1186 /* FIXME: this branch seems to duplicate the
1187 i=0 case below (direct link). Leave out!??? -CG */
1188 struct CadetPeerPath *path;
1189
1190 path = GCPP_get_path_from_route (1,
1191 &cp->pid);
1192 ret++;
1193 if (GNUNET_NO ==
1194 callback (callback_cls,
1195 path,
1196 0))
1197 return ret;
1198 }
1199 for (unsigned int i = 0; i < cp->path_dll_length; i++)
1200 {
1201 for (struct CadetPeerPathEntry *pe = cp->path_heads[i];
1202 NULL != pe;
1203 pe = pe->next)
1204 {
1205 ret++;
1206 if (GNUNET_NO ==
1207 callback (callback_cls,
1208 pe->path,
1209 i))
1210 return ret;
1211 }
1212 }
1213 return ret;
1214}
struct CadetPeerPath * GCPP_get_path_from_route(unsigned int path_length, const struct GNUNET_PeerIdentity *pids)
We got an incoming connection, obtain the corresponding path.
struct GNUNET_MQ_Handle * core_mq
Handle for core transmissions.

References CadetPeer::core_mq, GCP_2s(), GCPP_get_path_from_route(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, LOG, CadetPeerPathEntry::next, CadetPeer::path_dll_length, CadetPeer::path_heads, CadetPeer::pid, and ret.

Referenced by maintain_connections_cb().

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

◆ GCP_iterate_indirect_paths()

unsigned int GCP_iterate_indirect_paths ( struct CadetPeer cp,
GCP_PathIterator  callback,
void *  callback_cls 
)

Iterate over the paths to a peer without direct link.

Parameters
cpPeer to get path info.
callbackFunction to call for every path.
callback_clsClosure for callback.
Returns
Number of iterated paths.

Definition at line 1226 of file gnunet-service-cadet_peer.c.

1229{
1230 unsigned int ret = 0;
1231
1233 "Iterating over paths to peer %s without direct link\n",
1234 GCP_2s (cp));
1235 for (unsigned int i = 1; i < cp->path_dll_length; i++)
1236 {
1237 for (struct CadetPeerPathEntry *pe = cp->path_heads[i];
1238 NULL != pe;
1239 pe = pe->next)
1240 {
1241 ret++;
1242 if (GNUNET_NO ==
1243 callback (callback_cls,
1244 pe->path,
1245 i))
1246 return ret;
1247 }
1248 }
1249 return ret;
1250}

References GCP_2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, LOG, CadetPeerPathEntry::next, CadetPeer::path_dll_length, CadetPeer::path_heads, and ret.

Referenced by handle_show_path().

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

◆ GCP_iterate_paths_at()

unsigned int GCP_iterate_paths_at ( struct CadetPeer cp,
unsigned int  dist,
GCP_PathIterator  callback,
void *  callback_cls 
)

Iterate over the paths to peer where peer is at distance dist from us.

Parameters
cpPeer to get path info.
distdesired distance of peer to us on the path
callbackFunction to call for every path.
callback_clsClosure for callback.
Returns
Number of iterated paths.

Definition at line 1254 of file gnunet-service-cadet_peer.c.

1258{
1259 unsigned int ret = 0;
1260
1261 if (dist >= cp->path_dll_length)
1262 {
1264 "Asked to look for paths at distance %u, but maximum for me is < %u\n",
1265 dist,
1266 cp->path_dll_length);
1267 return 0;
1268 }
1269 for (struct CadetPeerPathEntry *pe = cp->path_heads[dist];
1270 NULL != pe;
1271 pe = pe->next)
1272 {
1273 if (GNUNET_NO ==
1274 callback (callback_cls,
1275 pe->path,
1276 dist))
1277 return ret;
1278 ret++;
1279 }
1280 return ret;
1281}

References GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, LOG, CadetPeerPathEntry::next, CadetPeer::path_dll_length, CadetPeer::path_heads, and ret.

Referenced by GCPP_get_path_from_route(), and GCPP_try_path_from_dht().

Here is the caller graph for this function:

◆ GCP_path_entry_remove()

void GCP_path_entry_remove ( struct CadetPeer cp,
struct CadetPeerPathEntry entry,
unsigned int  off 
)

Remove an entry from the DLL of all of the paths that this peer is on.

Parameters
cppeer to modify
entryan entry on a path
offoffset of this peer on the path

Definition at line 877 of file gnunet-service-cadet_peer.c.

880{
882 "Removing knowledge about peer %s beging on path %s at offset %u\n",
883 GCP_2s (cp),
884 GCPP_2s (entry->path),
885 off);
887 cp->path_tails[off],
888 entry);
889 GNUNET_assert (0 < cp->num_paths);
890 cp->off_sum -= off;
891 cp->num_paths--;
892 if ((NULL == cp->core_mq) &&
893 (NULL != cp->t) &&
894 (NULL == cp->search_h) &&
896 cp->search_h
897 = GCD_search (&cp->pid);
898 if (NULL == cp->destroy_task)
899 {
900 /* paths changed, we might now be ready for destruction, check again */
902 }
903}
struct GCD_search_handle * GCD_search(const struct GNUNET_PeerIdentity *peer_id)
Search DHT for paths to peeR_id.
const char * GCPP_2s(struct CadetPeerPath *path)
Convert a path to a human-readable string.
static void consider_peer_destroy(struct CadetPeer *cp)
This peer may no longer be needed, consider cleaning it up.
#define DESIRED_CONNECTIONS_PER_TUNNEL
How many connections would we like to have per tunnel?
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
struct CadetPeerPath * path
Path this entry belongs to.
struct GCD_search_handle * search_h
Handle to stop the DHT search for paths to this peer.
struct GNUNET_SCHEDULER_Task * destroy_task
Task to destroy this entry.
struct CadetTunnel * t
Tunnel to this peer, if any.
struct CadetPeerPathEntry ** path_tails
Array of DLL of paths traversing the peer, organized by the offset of the peer on the larger path.

References consider_peer_destroy(), CadetPeer::core_mq, DESIRED_CONNECTIONS_PER_TUNNEL, CadetPeer::destroy_task, GCD_search(), GCP_2s(), GCPP_2s(), GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, LOG, CadetPeer::num_paths, CadetPeer::off_sum, CadetPeerPathEntry::path, CadetPeer::path_heads, CadetPeer::path_tails, CadetPeer::pid, CadetPeer::search_h, and CadetPeer::t.

Referenced by attach_path(), and GCPP_release().

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

◆ GCP_path_entry_add()

void GCP_path_entry_add ( struct CadetPeer cp,
struct CadetPeerPathEntry entry,
unsigned int  off 
)

Add an entry to the DLL of all of the paths that this peer is on.

Parameters
cppeer to modify
entryan entry on a path
offoffset of this peer on the path

Definition at line 817 of file gnunet-service-cadet_peer.c.

820{
822 off));
824 "Discovered that peer %s is on path %s at offset %u\n",
825 GCP_2s (cp),
826 GCPP_2s (entry->path),
827 off);
828 if (off >= cp->path_dll_length)
829 {
830 unsigned int len = cp->path_dll_length;
831
833 len,
834 off + 4);
836 cp->path_dll_length,
837 off + 4);
838 }
840 cp->path_tails[off],
841 entry);
842 cp->off_sum += off;
843 cp->num_paths++;
844
845 /* If we have a tunnel to this peer, tell the tunnel that there is a
846 new path available. */
847 if (NULL != cp->t)
848 GCT_consider_path (cp->t,
849 entry->path,
850 off);
851
852 if ((NULL != cp->search_h) &&
853 (DESIRED_CONNECTIONS_PER_TUNNEL <= cp->num_paths))
854 {
855 /* Now I have enough paths, stop search */
857 cp->search_h = NULL;
858 }
859 if (NULL != cp->destroy_task)
860 {
861 /* paths changed, this resets the destroy timeout counter
862 and aborts a destroy task that may no longer be valid
863 to have (as we now have more paths via this peer). */
865 }
866}
void GCD_search_stop(struct GCD_search_handle *h)
Stop DHT search started with GCD_search().
struct CadetPeer * GCPP_get_peer_at_offset(struct CadetPeerPath *path, unsigned int off)
Obtain the peer at offset off in path.
void GCT_consider_path(struct CadetTunnel *t, struct CadetPeerPath *p, unsigned int off)
Consider using the path p for the tunnel t.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
#define GNUNET_array_grow(arr, size, tsize)
Grow a well-typed (!) array.

References consider_peer_destroy(), CadetPeer::destroy_task, GCD_search_stop(), GCP_2s(), GCPP_2s(), GCPP_get_peer_at_offset(), GCT_consider_path(), GNUNET_array_grow, GNUNET_assert, GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, LOG, CadetPeer::num_paths, CadetPeer::off_sum, CadetPeerPathEntry::path, CadetPeer::path_dll_length, CadetPeer::path_heads, CadetPeer::path_tails, CadetPeer::search_h, and CadetPeer::t.

Referenced by extend_path(), GCPP_get_path_from_route(), and GCPP_try_path_from_dht().

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

◆ GCP_get_tunnel()

struct CadetTunnel * GCP_get_tunnel ( struct CadetPeer cp,
int  create 
)

Get the tunnel towards a peer.

Parameters
cpPeer to get from.
createGNUNET_YES to create a tunnel if we do not have one
Returns
Tunnel towards peer.

Definition at line 1292 of file gnunet-service-cadet_peer.c.

1294{
1295 if (NULL == cp)
1296 return NULL;
1297 if ((NULL != cp->t) ||
1298 (GNUNET_NO == create))
1299 return cp->t;
1300 cp->t = GCT_create_tunnel (cp);
1302 return cp->t;
1303}
static void consider_peer_activate(struct CadetPeer *cp)
This peer is now on more "active" duty, activate processes related to it.
struct CadetTunnel * GCT_create_tunnel(struct CadetPeer *destination)
Create a tunnel to destination.

References consider_peer_activate(), create, GCT_create_tunnel(), GNUNET_NO, and CadetPeer::t.

Referenced by destroy_tunnels_now(), GCCH_channel_local_new(), get_all_peers_iterator(), get_all_tunnels_iterator(), handle_connection_create(), and send_create().

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

◆ GCP_drop_tunnel()

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.

Parameters
cpthe peer affected
tthe dead tunnel

Definition at line 1365 of file gnunet-service-cadet_peer.c.

1367{
1369 "Dropping tunnel %s to peer %s\n",
1370 GCT_2s (t),
1371 GCP_2s (cp));
1372 GNUNET_assert (cp->t == t);
1373 cp->t = NULL;
1375}
const char * GCT_2s(const struct CadetTunnel *t)
Get the static string for the peer this tunnel is directed.
static struct GNUNET_SCHEDULER_Task * t
Main task.

References consider_peer_destroy(), GCP_2s(), GCT_2s(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, LOG, t, and CadetPeer::t.

Referenced by destroy_tunnel().

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

◆ GCP_attach_path()

struct GNUNET_CONTAINER_HeapNode * GCP_attach_path ( struct CadetPeer cp,
struct CadetPeerPath path,
unsigned int  off,
int  force 
)

Try adding a path to this cp.

If the peer already has plenty of paths, return NULL.

Parameters
cppeer to which the path leads to
patha path looking for an owner; may not be fully initialized yet!
offoffset of cp in path
forceforce attaching the path
Returns
NULL if this peer does not care to become a new owner, otherwise the node in the peer's path heap for the path.

Definition at line 943 of file gnunet-service-cadet_peer.c.

947{
949 struct CadetPeerPath *root;
950 GNUNET_CONTAINER_HeapCostType root_desirability;
951 struct GNUNET_CONTAINER_HeapNode *hn;
952
953 GNUNET_assert (off == GCPP_get_length (path) - 1);
955 off));
956 if (NULL == cp->path_heap)
957 {
958 /* #GCP_drop_owned_paths() was already called, we cannot take new ones! */
959 GNUNET_assert (GNUNET_NO == force);
960 return NULL;
961 }
962 desirability = GCPP_get_desirability (path);
963 if (GNUNET_NO == force)
964 {
965 /* FIXME: desirability is not yet initialized; tricky! */
966 if (GNUNET_NO ==
968 (void **) &root,
969 &root_desirability))
970 {
971 root = NULL;
972 root_desirability = 0;
973 }
974
976 (desirability < root_desirability))
977 {
979 "Decided to not attach path %s to peer %s due to undesirability\n",
980 GCPP_2s (path),
981 GCP_2s (cp));
982 return NULL;
983 }
984 }
985
987 "Attaching path %s to peer %s (%s)\n",
988 GCPP_2s (path),
989 GCP_2s (cp),
990 (GNUNET_NO == force) ? "desirable" : "forced");
991
992 /* Yes, we'd like to add this path, add to our heap */
994 path,
995 desirability);
996
997 /* Consider maybe dropping other paths because of the new one */
1000 (NULL != cp->heap_cleanup_task))
1002 cp);
1003 return hn;
1004}
unsigned int GCPP_get_length(struct CadetPeerPath *path)
Return the length of the path.
GNUNET_CONTAINER_HeapCostType GCPP_get_desirability(const struct CadetPeerPath *path)
Return how much we like keeping the path.
static void path_heap_cleanup(void *cls)
Prune down the number of paths to this peer, we seem to have way too many.
struct GNUNET_CONTAINER_HeapNode * GNUNET_CONTAINER_heap_insert(struct GNUNET_CONTAINER_Heap *heap, void *element, GNUNET_CONTAINER_HeapCostType cost)
Inserts a new element into the heap.
unsigned int GNUNET_CONTAINER_heap_get_size(const struct GNUNET_CONTAINER_Heap *heap)
Get the current size of the heap.
uint64_t GNUNET_CONTAINER_HeapCostType
Cost by which elements in a heap can be ordered.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_heap_peek2(const struct GNUNET_CONTAINER_Heap *heap, void **element, GNUNET_CONTAINER_HeapCostType *cost)
Get element and cost stored at the root of heap.
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:1305
struct GNUNET_SCHEDULER_Task * heap_cleanup_task
Task to clean up path_heap asynchronously.

References DESIRED_CONNECTIONS_PER_TUNNEL, GCP_2s(), GCPP_2s(), GCPP_get_desirability(), GCPP_get_length(), GCPP_get_peer_at_offset(), GNUNET_assert, GNUNET_CONTAINER_heap_get_size(), GNUNET_CONTAINER_heap_insert(), GNUNET_CONTAINER_heap_peek2(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_SCHEDULER_add_now(), CadetPeer::heap_cleanup_task, LOG, CadetPeer::num_paths, CadetPeer::path_heap, and path_heap_cleanup().

Referenced by attach_path(), extend_path(), and GCPP_get_path_from_route().

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

◆ GCP_detach_path()

void GCP_detach_path ( struct CadetPeer cp,
struct CadetPeerPath path,
struct GNUNET_CONTAINER_HeapNode hn 
)

This peer can no longer own path as the path has been extended and a peer further down the line is now the new owner.

Parameters
cpold owner of the path
pathpath where the ownership is lost
hnnote in cp's path heap that must be deleted

Definition at line 1017 of file gnunet-service-cadet_peer.c.

1020{
1022 "Detaching path %s from peer %s\n",
1023 GCPP_2s (path),
1024 GCP_2s (cp));
1025 GNUNET_assert (path ==
1027}
void * GNUNET_CONTAINER_heap_remove_node(struct GNUNET_CONTAINER_HeapNode *node)
Removes a node from the heap.

References GCP_2s(), GCPP_2s(), GNUNET_assert, GNUNET_CONTAINER_heap_remove_node(), GNUNET_ERROR_TYPE_DEBUG, and LOG.

Referenced by extend_path().

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

◆ GCP_add_connection()

void GCP_add_connection ( struct CadetPeer cp,
struct CadetConnection cc 
)

Add a connection to this cp.

Parameters
cppeer via which the connection goes
ccthe connection to add

Definition at line 1037 of file gnunet-service-cadet_peer.c.

1039{
1041 "Adding %s to peer %s\n",
1042 GCC_2s (cc),
1043 GCP_2s (cp));
1046 &GCC_get_id (
1047 cc)->connection_of_tunnel,
1048 cc,
1050 if (NULL != cp->destroy_task)
1051 {
1053 cp->destroy_task = NULL;
1054 }
1055}
const char * GCC_2s(const struct CadetConnection *cc)
Get a (static) string for a connection.
const struct GNUNET_CADET_ConnectionTunnelIdentifier * GCC_get_id(struct CadetConnection *cc)
Obtain unique ID for the connection.
enum GNUNET_GenericReturnValue GNUNET_CONTAINER_multishortmap_put(struct GNUNET_CONTAINER_MultiShortmap *map, const struct GNUNET_ShortHashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
@ GNUNET_OK
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:981

References CadetPeer::connections, CadetPeer::destroy_task, GCC_2s(), GCC_get_id(), GCP_2s(), GNUNET_assert, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multishortmap_put(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_OK, GNUNET_SCHEDULER_cancel(), and LOG.

Referenced by connection_create().

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

◆ GCP_remove_connection()

void GCP_remove_connection ( struct CadetPeer cp,
struct CadetConnection cc 
)

Remove a connection that went via this cp.

Parameters
cppeer via which the connection went
ccthe connection to remove

Definition at line 1065 of file gnunet-service-cadet_peer.c.

1067{
1069 "Removing connection %s from peer %s\n",
1070 GCC_2s (cc),
1071 GCP_2s (cp));
1074 &GCC_get_id (
1075 cc)->
1076 connection_of_tunnel,
1077 cc));
1079}
int GNUNET_CONTAINER_multishortmap_remove(struct GNUNET_CONTAINER_MultiShortmap *map, const struct GNUNET_ShortHashCode *key, const void *value)
Remove the given key-value pair from the map.

References CadetPeer::connections, consider_peer_destroy(), GCC_2s(), GCC_get_id(), GCP_2s(), GNUNET_assert, GNUNET_CONTAINER_multishortmap_remove(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_YES, and LOG.

Referenced by GCC_destroy().

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

◆ GCP_set_hello()

void GCP_set_hello ( struct CadetPeer cp,
const struct GNUNET_MessageHeader hello 
)

We got a HELLO for a cp, remember it, and possibly trigger adequate actions (like trying to connect).

Parameters
cpthe peer we got a HELLO for
hellothe HELLO to remember

Definition at line 1307 of file gnunet-service-cadet_peer.c.

1309{
1311 uint16_t size = ntohs (hello->size);
1312
1314 "Got %u byte HELLO for peer %s\n",
1315 (unsigned int) size,
1316 GCP_2s (cp));
1317 if (NULL != cp->hello)
1318 {
1320
1321 struct GNUNET_TIME_Absolute new_hello_exp =
1323 struct GNUNET_TIME_Absolute old_hello_exp =
1325 ->hello);
1326
1327 if (GNUNET_TIME_absolute_cmp (new_hello_exp, >, now) &&
1328 GNUNET_TIME_absolute_cmp (new_hello_exp, >, old_hello_exp))
1329 {
1330 GNUNET_free (cp->hello);
1331 cp->hello = GNUNET_malloc (size);
1332 GNUNET_memcpy (cp->hello, hello, size);
1333 }
1334 else
1335 {
1336 return;
1337 }
1338 }
1339 else
1340 {
1341 cp->hello = GNUNET_memdup (hello,
1342 size);
1343 }
1344 if (NULL != cp->ash)
1346 bw.value__ = 0;
1347 cp->ash
1349 &cp->pid,
1351 bw);
1352 /* New HELLO means cp's destruction time may change... */
1354}
struct GNUNET_TRANSPORT_ApplicationHandle * transport
Handle to Transport service.
struct GNUNET_TRANSPORT_ApplicationSuggestHandle * GNUNET_TRANSPORT_application_suggest(struct GNUNET_TRANSPORT_ApplicationHandle *ch, const struct GNUNET_PeerIdentity *peer, enum GNUNET_MQ_PriorityPreferences pk, struct GNUNET_BANDWIDTH_Value32NBO bw)
An application would like TRANSPORT to connect to a peer.
void GNUNET_TRANSPORT_application_suggest_cancel(struct GNUNET_TRANSPORT_ApplicationSuggestHandle *sh)
We no longer care about being connected to a peer.
struct GNUNET_TIME_Absolute GNUNET_HELLO_builder_get_expiration_time(const struct GNUNET_MessageHeader *msg)
Get the expiration time for this HELLO.
Definition: hello-uri.c:470
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format.
#define GNUNET_malloc(size)
Wrapper around malloc.
#define GNUNET_memdup(buf, size)
Allocate and initialize a block of memory.
@ GNUNET_MQ_PRIO_BEST_EFFORT
Best-effort traffic (e.g.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_get(void)
Get the current time.
Definition: time.c:111
#define GNUNET_TIME_absolute_cmp(t1, op, t2)
Compare two absolute times.
static unsigned int size
Size of the "table".
Definition: peer.c:68
struct GNUNET_MessageHeader * hello
Hello message of the peer.
struct GNUNET_TRANSPORT_ApplicationSuggestHandle * ash
Transport suggest handle.
32-bit bandwidth used for network exchange by GNUnet, in bytes per second.
Time for absolute times used by GNUnet, in microseconds.

References CadetPeer::ash, consider_peer_destroy(), GCP_2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_HELLO_builder_get_expiration_time(), GNUNET_malloc, GNUNET_memcpy, GNUNET_memdup, GNUNET_MQ_PRIO_BEST_EFFORT, GNUNET_TIME_absolute_cmp, GNUNET_TIME_absolute_get(), GNUNET_TRANSPORT_application_suggest(), GNUNET_TRANSPORT_application_suggest_cancel(), CadetPeer::hello, LOG, CadetPeer::pid, GNUNET_MessageHeader::size, size, transport, and GNUNET_BANDWIDTH_Value32NBO::value__.

Referenced by dht_get_id_handler(), and got_hello().

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

◆ GCP_destroy_all_peers()

void GCP_destroy_all_peers ( void  )

Clean up all entries about all peers.

Must only be called after all tunnels, CORE-connections and connections are down.

Definition at line 777 of file gnunet-service-cadet_peer.c.

778{
780 "Destroying all peers now\n");
783 NULL);
784}
static int destroy_iterator_cb(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Function called to destroy a peer now.

References destroy_iterator_cb(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_ERROR_TYPE_DEBUG, LOG, and peers.

Referenced by shutdown_rest().

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

◆ GCP_request_mq()

struct GCP_MessageQueueManager * GCP_request_mq ( struct CadetPeer cp,
GCP_MessageQueueNotificationCallback  cb,
void *  cb_cls 
)

Start message queue change notifications.

Will create a new slot to manage the message queue to the given cp.

Parameters
cppeer to notify for
cbfunction to call if mq becomes available or unavailable
cb_clsclosure for cb
Returns
handle to cancel request
Parameters
cppeer to notify for
cbfunction to call if mq becomes available or unavailable
cb_clsclosure for cb
Returns
handle to cancel request

Definition at line 1400 of file gnunet-service-cadet_peer.c.

1403{
1404 struct GCP_MessageQueueManager *mqm;
1405
1406 mqm = GNUNET_new (struct GCP_MessageQueueManager);
1407 mqm->cb = cb;
1408 mqm->cb_cls = cb_cls;
1409 mqm->cp = cp;
1411 cp->mqm_tail,
1412 mqm);
1414 "Creating MQM %p for peer %s\n",
1415 mqm,
1416 GCP_2s (cp));
1417 if (NULL != cp->core_mq)
1418 cb (cb_cls,
1419 GNUNET_YES);
1420 return mqm;
1421}
struct GCP_MessageQueueManager * mqm_tail
Notifications to call when core_mq changes.
struct GCP_MessageQueueManager * mqm_head
Notifications to call when core_mq changes.
Data structure used to track whom we have to notify about changes to our message queue.
struct CadetPeer * cp
The peer this is for.
GCP_MessageQueueNotificationCallback cb
Function to call with updated message queue object.

References GCP_MessageQueueManager::cb, GCP_MessageQueueManager::cb_cls, CadetPeer::core_mq, GCP_MessageQueueManager::cp, GCP_2s(), GNUNET_CONTAINER_DLL_insert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_new, GNUNET_YES, LOG, CadetPeer::mqm_head, and CadetPeer::mqm_tail.

Referenced by connection_create(), and dir_init().

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

◆ GCP_has_core_connection()

int GCP_has_core_connection ( struct CadetPeer cp)

Test if cp has a core-level connection.

Parameters
cppeer to test
Returns
GNUNET_YES if cp has a core-level connection

Definition at line 1385 of file gnunet-service-cadet_peer.c.

1386{
1387 return (NULL != cp->core_mq) ? GNUNET_YES : GNUNET_NO;
1388}

References CadetPeer::core_mq, GNUNET_NO, and GNUNET_YES.

Referenced by handle_connection_create().

Here is the caller graph for this function:

◆ GCP_send()

void GCP_send ( struct GCP_MessageQueueManager mqm,
struct GNUNET_MQ_Envelope env 
)

Send the message in env via a mqm.

Must only be called at most once after the respective GCP_MessageQueueNotificationCallback was called with available set to GNUNET_YES, and not after the callback was called with available set to GNUNET_NO or GNUNET_SYSERR.

Parameters
mqmmessage queue manager for the transmission
envenvelope with the message to send; must NOT yet have a GNUNET_MQ_notify_sent() callback attached to it

Send the message in env via a mqm.

Parameters
mqmthe message queue manager to use for transmission
envenvelope with the message to send; must NOT yet have a GNUNET_MQ_notify_sent() callback attached to it

Definition at line 719 of file gnunet-service-cadet_peer.c.

721{
722 struct CadetPeer *cp = mqm->cp;
723
724 GNUNET_assert (NULL != env);
726 "Queueing message to peer %s in MQM %p\n",
727 GCP_2s (cp),
728 mqm);
729 GNUNET_assert (NULL != cp->core_mq);
730 GNUNET_assert (NULL == mqm->env);
733 cp);
734 mqm->env = env;
735 cp->mqm_ready_counter++;
736 if (mqm != cp->mqm_ready_ptr)
737 cp->mqm_ready_ptr = cp->mqm_head;
738 if (1 == cp->mqm_ready_counter)
739 cp->mqm_ready_ptr = mqm;
740 if (0 != GNUNET_MQ_get_length (cp->core_mq))
741 return;
742 send_next_ready (cp);
743}
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
static void mqm_send_done(void *cls)
Function called when CORE took one of the messages from a message queue manager and transmitted it.
static void send_next_ready(struct CadetPeer *cp)
Find the next ready message in the queue (starting the search from the cp->mqm_ready_ptr) and if poss...
unsigned int GNUNET_MQ_get_length(struct GNUNET_MQ_Handle *mq)
Obtain the current length of the message queue.
Definition: mq.c:293
void GNUNET_MQ_notify_sent(struct GNUNET_MQ_Envelope *ev, GNUNET_SCHEDULER_TaskCallback cb, void *cb_cls)
Call a callback once the envelope has been sent, that is, sending it can not be canceled anymore.
Definition: mq.c:638
unsigned int mqm_ready_counter
Number of message queue managers of this peer that have a message in waiting.
struct GCP_MessageQueueManager * mqm_ready_ptr
Pointer to first "ready" entry in mqm_head.
struct GNUNET_MQ_Envelope * env
Envelope this manager would like to transmit once it is its turn.

References CadetPeer::core_mq, GCP_MessageQueueManager::cp, env, GCP_MessageQueueManager::env, GCP_2s(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_MQ_get_length(), GNUNET_MQ_notify_sent(), LOG, CadetPeer::mqm_head, CadetPeer::mqm_ready_counter, CadetPeer::mqm_ready_ptr, mqm_send_done(), and send_next_ready().

Referenced by dir_ready_cb(), GCC_transmit(), route_message(), send_create(), and send_create_ack().

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

◆ GCP_send_ooo()

void GCP_send_ooo ( struct CadetPeer cp,
struct GNUNET_MQ_Envelope env 
)

Send the message in env to cp, overriding queueing logic.

This function should only be used to send error messages outside of flow and congestion control, similar to ICMP. Note that the envelope may be silently discarded as well.

Parameters
cppeer to send the message to
envenvelope with the message to send

Definition at line 1477 of file gnunet-service-cadet_peer.c.

1479{
1481 "Sending message to %s out of management\n",
1482 GCP_2s (cp));
1483 if (NULL == cp->core_mq)
1484 {
1486 return;
1487 }
1489 {
1491 return;
1492 }
1495 cp);
1497 env);
1498}
#define MAX_OOO_QUEUE_SIZE
Queue size when we start dropping OOO messages.
void GNUNET_MQ_send(struct GNUNET_MQ_Handle *mq, struct GNUNET_MQ_Envelope *ev)
Send a message with the given message queue.
Definition: mq.c:304
void GNUNET_MQ_discard(struct GNUNET_MQ_Envelope *mqm)
Discard the message queue message, free all allocated resources.
Definition: mq.c:285

References CadetPeer::core_mq, env, GCP_2s(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_MQ_discard(), GNUNET_MQ_get_length(), GNUNET_MQ_notify_sent(), GNUNET_MQ_send(), LOG, MAX_OOO_QUEUE_SIZE, and mqm_send_done().

Referenced by route_message(), and send_broken_without_mqm().

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

◆ GCP_request_mq_cancel()

void GCP_request_mq_cancel ( struct GCP_MessageQueueManager mqm,
struct GNUNET_MQ_Envelope last_env 
)

Stops message queue change notifications and sends a last message.

In practice, this is implemented by sending that last_env message immediately (if any), ignoring queue order.

Parameters
mqmhandle matching request to cancel
last_envfinal message to transmit, or NULL

Stops message queue change notifications and sends a last message.

Parameters
mqmhandle matching request to cancel
last_envfinal message to transmit, or NULL

Definition at line 1431 of file gnunet-service-cadet_peer.c.

1433{
1434 struct CadetPeer *cp = mqm->cp;
1435
1437 "Destroying MQM %p for peer %s%s\n",
1438 mqm,
1439 GCP_2s (cp),
1440 (NULL == last_env) ? "" : " with last ditch transmission");
1441 if (NULL != mqm->env)
1442 GNUNET_MQ_discard (mqm->env);
1443 if (NULL != last_env)
1444 {
1445 if (NULL != cp->core_mq)
1446 {
1447 GNUNET_MQ_notify_sent (last_env,
1449 cp);
1451 last_env);
1452 }
1453 else
1454 {
1455 GNUNET_MQ_discard (last_env);
1456 }
1457 }
1458 if (cp->mqm_ready_ptr == mqm)
1459 cp->mqm_ready_ptr = mqm->next;
1461 cp->mqm_tail,
1462 mqm);
1463 GNUNET_free (mqm);
1464}
struct GCP_MessageQueueManager * next
Kept in a DLL.

References CadetPeer::core_mq, GCP_MessageQueueManager::cp, GCP_MessageQueueManager::env, GCP_2s(), GNUNET_CONTAINER_DLL_remove, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_MQ_discard(), GNUNET_MQ_notify_sent(), GNUNET_MQ_send(), LOG, CadetPeer::mqm_head, CadetPeer::mqm_ready_ptr, mqm_send_done(), CadetPeer::mqm_tail, and GCP_MessageQueueManager::next.

Referenced by destroy_direction(), GCC_destroy(), GCC_destroy_without_tunnel(), and send_broken().

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

◆ GCP_set_mq()

void GCP_set_mq ( struct CadetPeer cp,
struct GNUNET_MQ_Handle mq 
)

Set the message queue to mq for peer cp and notify watchers.

Parameters
cppeer to modify
mqmessage queue to set (can be NULL)

Definition at line 513 of file gnunet-service-cadet_peer.c.

515{
517 "Message queue for peer %s is now %p\n",
518 GCP_2s (cp),
519 mq);
520 cp->core_mq = mq;
521 for (struct GCP_MessageQueueManager *mqm = cp->mqm_head, *next;
522 NULL != mqm;
523 mqm = next)
524 {
525 /* Save next pointer in case mqm gets freed by the callback */
526 next = mqm->next;
527 if (NULL == mq)
528 {
529 if (NULL != mqm->env)
530 {
531 GNUNET_MQ_discard (mqm->env);
532 mqm->env = NULL;
533 mqm->cb (mqm->cb_cls,
535 }
536 else
537 {
538 mqm->cb (mqm->cb_cls,
539 GNUNET_NO);
540 }
541 }
542 else
543 {
544 GNUNET_assert (NULL == mqm->env);
545 mqm->cb (mqm->cb_cls,
546 GNUNET_YES);
547 }
548 }
549 if ((NULL != mq) ||
550 (NULL != cp->t))
552 else
554
555 if ((NULL != mq) &&
556 (NULL != cp->t))
557 {
558 /* have a new, direct path to the target, notify tunnel */
559 struct CadetPeerPath *path;
560
561 path = GCPP_get_path_from_route (1,
562 &cp->pid);
563 GCT_consider_path (cp->t,
564 path,
565 0);
566 }
567}
struct GNUNET_MQ_Handle * mq
Definition: 003.c:5
@ GNUNET_SYSERR

References consider_peer_activate(), consider_peer_destroy(), CadetPeer::core_mq, GCP_2s(), GCPP_get_path_from_route(), GCT_consider_path(), GNUNET_assert, GNUNET_ERROR_TYPE_DEBUG, GNUNET_MQ_discard(), GNUNET_NO, GNUNET_SYSERR, GNUNET_YES, LOG, mq, CadetPeer::mqm_head, CadetPeer::pid, and CadetPeer::t.

Referenced by core_connect_cb(), and core_disconnect_cb().

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

◆ GCP_check_monotime_sig()

int GCP_check_monotime_sig ( struct CadetPeer peer,
const struct GNUNET_CADET_ConnectionCreateMessage msg 
)

Checking the signature for a monotime of a GNUNET_CADET_ConnectionCreateMessage.

Parameters
peerThe peer that signed the monotime value.
msgThe GNUNET_CADET_ConnectionCreateMessage with the monotime value.
Returns
GNUNET_OK if the signature is good, GNUNET_SYSERR if not.

Definition at line 1532 of file gnunet-service-cadet_peer.c.

1534{
1535 struct CadetConnectionCreatePS cp = { .purpose.purpose = htonl (
1537 .purpose.size = htonl (sizeof(cp)),
1538 .monotonic_time = msg->monotime};
1539
1540 if (GNUNET_OK !=
1543 &cp,
1544 &msg->monotime_sig,
1545 &peer->pid.public_key))
1546 {
1547 GNUNET_break_op (0);
1548 return GNUNET_SYSERR;
1549 }
1550 return GNUNET_OK;
1551}
struct GNUNET_MessageHeader * msg
Definition: 005.c:2
#define GNUNET_CRYPTO_eddsa_verify(purp, ps, sig, pub)
Verify EdDSA signature.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
#define GNUNET_SIGNATURE_PURPOSE_CADET_CONNECTION_INITIATOR
Signature by a peer that like to create a connection.
Purpose for the signature of a monotime.
struct GNUNET_CRYPTO_EccSignaturePurpose purpose
Purpose is GNUNET_SIGNATURE_PURPOSE_CADET_CONNECTION_INITIATOR.
uint32_t purpose
What does this signature vouch for? This must contain a GNUNET_SIGNATURE_PURPOSE_XXX constant (from g...
struct GNUNET_CRYPTO_EddsaPublicKey public_key

References GNUNET_break_op, GNUNET_CRYPTO_eddsa_verify, GNUNET_OK, GNUNET_SIGNATURE_PURPOSE_CADET_CONNECTION_INITIATOR, GNUNET_SYSERR, msg, CadetPeer::pid, GNUNET_PeerIdentity::public_key, GNUNET_CRYPTO_EccSignaturePurpose::purpose, and CadetConnectionCreatePS::purpose.

Referenced by handle_connection_create().

Here is the caller graph for this function:

◆ GCP_check_and_update_monotime()

int GCP_check_and_update_monotime ( struct CadetPeer peer,
struct GNUNET_TIME_AbsoluteNBO  monotime 
)

Checking if a monotime value is newer than the last monotime value received from a peer.

If the time value is newer it will be stored at the peer.

Parameters
peerThe peer we received a new time value from.
monotimeTime value we check against the last time value we received from a peer.
Returns
GNUNET_YES if monotime is newer than the last received time value, GNUNET_NO if monotime is not newer.

Definition at line 1509 of file gnunet-service-cadet_peer.c.

1511{
1512
1513 struct GNUNET_TIME_Absolute mt = GNUNET_TIME_absolute_ntoh (monotime);
1514
1516 {
1517 peer->last_connection_create = mt;
1518 return GNUNET_YES;
1519 }
1520 return GNUNET_NO;
1521}
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_ntoh(struct GNUNET_TIME_AbsoluteNBO a)
Convert absolute time from network byte order.
Definition: time.c:737
struct GNUNET_TIME_Absolute last_connection_create
Last time we heard from this peer (currently not used!)
uint64_t abs_value_us
The actual value.

References GNUNET_TIME_Absolute::abs_value_us, GNUNET_NO, GNUNET_TIME_absolute_ntoh(), GNUNET_YES, and CadetPeer::last_connection_create.

Referenced by handle_connection_create().

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