GNUnet  0.10.x
Data Fields
CadetPeerPath Struct Reference

Information regarding a possible path to reach a peer. More...

Collaboration diagram for CadetPeerPath:
[legend]

Data Fields

struct CadetPeerPathEntry ** entries
 Array of all the peers on the path. More...
 
struct GNUNET_CONTAINER_HeapNodehn
 Node of this path in the owner's heap. More...
 
GNUNET_CONTAINER_HeapCostType desirability
 Desirability of the path. More...
 
unsigned int entries_length
 Length of the entries array. More...
 

Detailed Description

Information regarding a possible path to reach a peer.

Definition at line 39 of file gnunet-service-cadet_paths.c.

Field Documentation

◆ entries

struct CadetPeerPathEntry** CadetPeerPath::entries

◆ hn

struct GNUNET_CONTAINER_HeapNode* CadetPeerPath::hn

Node of this path in the owner's heap.

Used to update our position in the heap whenever our desirability changes.

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

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

◆ desirability

GNUNET_CONTAINER_HeapCostType CadetPeerPath::desirability

Desirability of the path.

How unique is it for the various peers on it?

Definition at line 58 of file gnunet-service-cadet_paths.c.

Referenced by GCPP_get_desirability(), and recalculate_path_desirability().

◆ entries_length

unsigned int CadetPeerPath::entries_length

The documentation for this struct was generated from the following file: