GNUnet  0.10.x
Data Fields
GNUNET_CADET_PeerListEntry Struct Reference

Information we return per peer. More...

#include <gnunet_cadet_service.h>

Collaboration diagram for GNUNET_CADET_PeerListEntry:
[legend]

Data Fields

struct GNUNET_PeerIdentity peer
 Which peer is the information about? More...
 
int have_tunnel
 Do we have a tunnel to this peer? More...
 
unsigned int n_paths
 Number of disjoint known paths to peer. More...
 
unsigned int best_path_length
 Length of the shortest path (0 = unknown, 1 = ourselves, 2 = direct neighbour). More...
 

Detailed Description

Information we return per peer.

Definition at line 399 of file gnunet_cadet_service.h.

Field Documentation

◆ peer

struct GNUNET_PeerIdentity GNUNET_CADET_PeerListEntry::peer

Which peer is the information about?

Definition at line 404 of file gnunet_cadet_service.h.

Referenced by handle_get_peers(), and peers_callback().

◆ have_tunnel

int GNUNET_CADET_PeerListEntry::have_tunnel

Do we have a tunnel to this peer?

Definition at line 409 of file gnunet_cadet_service.h.

Referenced by handle_get_peers(), and peers_callback().

◆ n_paths

unsigned int GNUNET_CADET_PeerListEntry::n_paths

Number of disjoint known paths to peer.

Definition at line 414 of file gnunet_cadet_service.h.

Referenced by handle_get_peers(), and peers_callback().

◆ best_path_length

unsigned int GNUNET_CADET_PeerListEntry::best_path_length

Length of the shortest path (0 = unknown, 1 = ourselves, 2 = direct neighbour).

Definition at line 419 of file gnunet_cadet_service.h.

Referenced by handle_get_peers().


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