|
libdht
|
Search node. More...
#include <node.h>
Data Fields | |
| unsigned char | id [20] |
| Node identifier. | |
| struct sockaddr_storage | addr |
| Node address. | |
| socklen_t | addrlen |
| Length of addr field. | |
| struct timeval | reply_time |
| Query reply time. | |
| struct timeval | next_query |
| When to send next query. | |
| int | queried |
| Number of queries sent with no reply. | |
| unsigned char * | token |
| Storage token. | |
| size_t | token_len |
| Length of token string. | |
| struct search_node * | next |
| Next node in the list. | |
| struct sockaddr_storage * | peers |
| Array of peer addresses. | |
| struct bvalue * | v |
| value received in reply to get query | |
| int | seq |
| v's sequence number | |
| size_t | peer_count |
| Number of entries in peers array. | |
| int | error |
| Error code if node query failed. | |
| unsigned char | k [32] |
| ed25519 public key of stored value | |
| unsigned char | sig [64] |
| signature of stored value | |
Search node.
This structure is allocated by the node for each node encountered in the course of a DHT search. Elements are chained together and sorted by increasing distance with the search target.
1.8.11
