Information regarding a possible path to reach a peer. More...
Data Fields | |
struct CadetPeerPathEntry ** | entries |
Array of all the peers on the path. More... | |
struct GNUNET_CONTAINER_HeapNode * | hn |
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... | |
Information regarding a possible path to reach a peer.
Definition at line 39 of file gnunet-service-cadet_paths.c.
struct CadetPeerPathEntry** CadetPeerPath::entries |
Array of all the peers on the path.
If hn is non-NULL, the last one is our owner.
Definition at line 45 of file gnunet-service-cadet_paths.c.
Referenced by attach_path(), extend_path(), GCPP_add_connection(), GCPP_del_connection(), GCPP_get_connection(), GCPP_get_path_from_route(), GCPP_get_peer_at_offset(), GCPP_release(), GCPP_try_path_from_dht(), GCPP_update_score(), and recalculate_path_desirability().
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 51 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().
GNUNET_CONTAINER_HeapCostType CadetPeerPath::desirability |
Desirability of the path.
How unique is it for the various peers on it?
Definition at line 57 of file gnunet-service-cadet_paths.c.
Referenced by GCPP_get_desirability(), and recalculate_path_desirability().
unsigned int CadetPeerPath::entries_length |
Length of the entries array.
Definition at line 62 of file gnunet-service-cadet_paths.c.
Referenced by attach_path(), check_match(), extend_path(), GCPP_2s(), GCPP_find_peer(), GCPP_get_length(), GCPP_get_path_from_route(), GCPP_release(), GCPP_try_path_from_dht(), and recalculate_path_desirability().