GNUnet  0.10.x
Data Structures | Macros | Functions | Variables
gnunet-service-dht_neighbours.c File Reference

GNUnet DHT service's bucket and neighbour management code. More...

#include "platform.h"
#include "gnunet_util_lib.h"
#include "gnunet_block_lib.h"
#include "gnunet_hello_lib.h"
#include "gnunet_constants.h"
#include "gnunet_protocols.h"
#include "gnunet_nse_service.h"
#include "gnunet_ats_service.h"
#include "gnunet_core_service.h"
#include "gnunet_datacache_lib.h"
#include "gnunet_transport_service.h"
#include "gnunet_dht_service.h"
#include "gnunet_statistics_service.h"
#include "gnunet-service-dht.h"
#include "gnunet-service-dht_datacache.h"
#include "gnunet-service-dht_hello.h"
#include "gnunet-service-dht_neighbours.h"
#include "gnunet-service-dht_nse.h"
#include "gnunet-service-dht_routing.h"
#include "dht.h"
Include dependency graph for gnunet-service-dht_neighbours.c:

Go to the source code of this file.

Data Structures

struct  PeerPutMessage
 P2P PUT message. More...
 
struct  PeerResultMessage
 P2P Result message. More...
 
struct  PeerGetMessage
 P2P GET message. More...
 
struct  PeerInfo
 Entry for a peer in a bucket. More...
 
struct  PeerBucket
 Peers are grouped into buckets. More...
 
struct  ConnectInfo
 Information about a peer that we would like to connect to. More...
 

Macros

#define LOG_TRAFFIC(kind, ...)   GNUNET_log_from(kind, "dht-traffic", __VA_ARGS__)
 
#define SANITY_CHECKS   1
 Enable slow sanity checks to debug issues. More...
 
#define MAX_BUCKETS   sizeof(struct GNUNET_HashCode) * 8
 How many buckets will we allow total. More...
 
#define DEFAULT_BUCKET_SIZE   8
 What is the maximum number of peers in a given bucket. More...
 
#define FIND_PEER_REPLICATION_LEVEL   4
 Desired replication level for FIND PEER requests. More...
 
#define MAXIMUM_REPLICATION_LEVEL   16
 Maximum allowed replication level for all requests. More...
 
#define MAXIMUM_PENDING_PER_PEER   64
 Maximum allowed number of pending messages per peer. More...
 
#define DHT_MINIMUM_FIND_PEER_INTERVAL   GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30)
 How long at least to wait before sending another find peer request. More...
 
#define DHT_MAXIMUM_FIND_PEER_INTERVAL   GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 10)
 How long at most to wait before sending another find peer request. More...
 
#define GET_TIMEOUT   GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 2)
 How long at most to wait for transmission of a GET request to another peer? More...
 

Functions

static int find_bucket (const struct GNUNET_HashCode *hc)
 Find the optimal bucket for this key. More...
 
static void offer_hello_done (void *cls)
 Function called when GNUNET_TRANSPORT_offer_hello() is done. More...
 
static int free_connect_info (void *cls, const struct GNUNET_PeerIdentity *peer, void *value)
 Function called for all entries in all_desired_peers to clean up. More...
 
static void try_connect (const struct GNUNET_PeerIdentity *pid, const struct GNUNET_MessageHeader *h)
 Consider if we want to connect to a given peer, and if so let ATS know. More...
 
static int update_desire_strength (void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
 Function called for each peer in all_desired_peers during update_connect_preferences() if we have reason to adjust the strength of our desire to keep connections to certain peers. More...
 
static void update_connect_preferences ()
 Update our preferences for connectivity as given to ATS. More...
 
static int add_known_to_bloom (void *cls, const struct GNUNET_PeerIdentity *key, void *value)
 Add each of the peers we already know to the bloom filter of the request so that we don't get duplicate HELLOs. More...
 
static void send_find_peer_message (void *cls)
 Task to send a find peer message for our own peer identifier so that we can find the closest peers in the network to ourselves and attempt to connect to them. More...
 
static void * handle_core_connect (void *cls, const struct GNUNET_PeerIdentity *peer, struct GNUNET_MQ_Handle *mq)
 Method called whenever a peer connects. More...
 
static void handle_core_disconnect (void *cls, const struct GNUNET_PeerIdentity *peer, void *internal_cls)
 Method called whenever a peer disconnects. More...
 
static unsigned int get_forward_count (uint32_t hop_count, uint32_t target_replication)
 To how many peers should we (on average) forward the request to obtain the desired target_replication count (on average). More...
 
static unsigned int get_distance (const struct GNUNET_HashCode *target, const struct GNUNET_HashCode *have)
 Compute the distance between have and target as a 32-bit value. More...
 
int GDS_am_closest_peer (const struct GNUNET_HashCode *key, const struct GNUNET_CONTAINER_BloomFilter *bloom)
 Check whether my identity is closer than any known peers. More...
 
static struct PeerInfoselect_peer (const struct GNUNET_HashCode *key, const struct GNUNET_CONTAINER_BloomFilter *bloom, uint32_t hops)
 Select a peer from the routing table that would be a good routing destination for sending a message for "key". More...
 
static unsigned int get_target_peers (const struct GNUNET_HashCode *key, struct GNUNET_CONTAINER_BloomFilter *bloom, uint32_t hop_count, uint32_t target_replication, struct PeerInfo ***targets)
 Compute the set of peers that the given request should be forwarded to. More...
 
int GDS_NEIGHBOURS_handle_put (enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint32_t desired_replication_level, struct GNUNET_TIME_Absolute expiration_time, uint32_t hop_count, struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *key, unsigned int put_path_length, struct GNUNET_PeerIdentity *put_path, const void *data, size_t data_size)
 Perform a PUT operation. More...
 
int GDS_NEIGHBOURS_handle_get (enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint32_t desired_replication_level, uint32_t hop_count, const struct GNUNET_HashCode *key, const void *xquery, size_t xquery_size, struct GNUNET_BLOCK_Group *bg, struct GNUNET_CONTAINER_BloomFilter *peer_bf)
 Perform a GET operation. More...
 
void GDS_NEIGHBOURS_handle_reply (const struct GNUNET_PeerIdentity *target, enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
 Handle a reply (route to origin). More...
 
static void core_init (void *cls, const struct GNUNET_PeerIdentity *identity)
 To be called on core init/fail. More...
 
static int check_dht_p2p_put (void *cls, const struct PeerPutMessage *put)
 Check validity of a p2p put request. More...
 
static void handle_dht_p2p_put (void *cls, const struct PeerPutMessage *put)
 Core handler for p2p put requests. More...
 
static void handle_find_peer (const struct GNUNET_PeerIdentity *sender, const struct GNUNET_HashCode *key, struct GNUNET_BLOCK_Group *bg)
 We have received a FIND PEER request. More...
 
static void handle_local_result (void *cls, enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
 Handle a result from local datacache for a GET operation. More...
 
static int check_dht_p2p_get (void *cls, const struct PeerGetMessage *get)
 Check validity of p2p get request. More...
 
static void handle_dht_p2p_get (void *cls, const struct PeerGetMessage *get)
 Core handler for p2p get requests. More...
 
static int check_dht_p2p_result (void *cls, const struct PeerResultMessage *prm)
 Check validity of p2p result message. More...
 
static void process_reply_with_path (struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
 Process a reply, after the get_path has been updated. More...
 
static void handle_dht_p2p_result (void *cls, const struct PeerResultMessage *prm)
 Core handler for p2p result messages. More...
 
int GDS_NEIGHBOURS_init ()
 Initialize neighbours subsystem. More...
 
void GDS_NEIGHBOURS_done ()
 Shutdown neighbours subsystem. More...
 
struct GNUNET_PeerIdentityGDS_NEIGHBOURS_get_id ()
 Get the ID of the local node. More...
 

Variables

struct GNUNET_TIME_Relative hello_expiration
 Hello address expiration. More...
 
static int cache_results
 Do we cache all results that we are routing in the local datacache? More...
 
static int log_route_details_stderr
 Should routing details be logged to stderr (for debugging)? More...
 
static unsigned int closest_bucket
 The lowest currently used bucket, initially 0 (for 0-bits matching bucket). More...
 
static unsigned int newly_found_peers
 How many peers have we added since we sent out our last find peer request? More...
 
static int disable_try_connect
 Option for testing that disables the 'connect' function of the DHT. More...
 
static struct PeerBucket k_buckets [sizeof(struct GNUNET_HashCode) *8]
 The buckets. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapall_connected_peers
 Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect. More...
 
static struct GNUNET_CONTAINER_MultiPeerMapall_desired_peers
 Hash map of all peers we would like to be connected to. More...
 
static unsigned int bucket_size = 8
 Maximum size for each bucket. More...
 
static struct GNUNET_SCHEDULER_Taskfind_peer_task
 Task that sends FIND PEER requests. More...
 
static struct GNUNET_PeerIdentity my_identity
 Identity of this peer. More...
 
struct GNUNET_HashCode my_identity_hash
 Hash of the identity of this peer. More...
 
static struct GNUNET_CORE_Handlecore_api
 Handle to CORE. More...
 
static struct GNUNET_ATS_ConnectivityHandleats_ch
 Handle to ATS connectivity. More...
 

Detailed Description

GNUnet DHT service's bucket and neighbour management code.

Author
Christian Grothoff
Nathan Evans

Definition in file gnunet-service-dht_neighbours.c.

Macro Definition Documentation

◆ LOG_TRAFFIC

#define LOG_TRAFFIC (   kind,
  ... 
)    GNUNET_log_from(kind, "dht-traffic", __VA_ARGS__)

◆ SANITY_CHECKS

#define SANITY_CHECKS   1

Enable slow sanity checks to debug issues.

Definition at line 54 of file gnunet-service-dht_neighbours.c.

◆ MAX_BUCKETS

#define MAX_BUCKETS   sizeof(struct GNUNET_HashCode) * 8

How many buckets will we allow total.

Definition at line 59 of file gnunet-service-dht_neighbours.c.

Referenced by find_bucket(), and handle_core_connect().

◆ DEFAULT_BUCKET_SIZE

#define DEFAULT_BUCKET_SIZE   8

What is the maximum number of peers in a given bucket.

Definition at line 64 of file gnunet-service-dht_neighbours.c.

◆ FIND_PEER_REPLICATION_LEVEL

#define FIND_PEER_REPLICATION_LEVEL   4

Desired replication level for FIND PEER requests.

Definition at line 69 of file gnunet-service-dht_neighbours.c.

Referenced by send_find_peer_message().

◆ MAXIMUM_REPLICATION_LEVEL

#define MAXIMUM_REPLICATION_LEVEL   16

Maximum allowed replication level for all requests.

Definition at line 74 of file gnunet-service-dht_neighbours.c.

Referenced by get_forward_count().

◆ MAXIMUM_PENDING_PER_PEER

#define MAXIMUM_PENDING_PER_PEER   64

Maximum allowed number of pending messages per peer.

Definition at line 79 of file gnunet-service-dht_neighbours.c.

Referenced by GDS_NEIGHBOURS_handle_get(), GDS_NEIGHBOURS_handle_put(), and GDS_NEIGHBOURS_handle_reply().

◆ DHT_MINIMUM_FIND_PEER_INTERVAL

#define DHT_MINIMUM_FIND_PEER_INTERVAL   GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 30)

How long at least to wait before sending another find peer request.

Definition at line 84 of file gnunet-service-dht_neighbours.c.

Referenced by send_find_peer_message().

◆ DHT_MAXIMUM_FIND_PEER_INTERVAL

#define DHT_MAXIMUM_FIND_PEER_INTERVAL   GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_MINUTES, 10)

How long at most to wait before sending another find peer request.

Definition at line 89 of file gnunet-service-dht_neighbours.c.

Referenced by send_find_peer_message().

◆ GET_TIMEOUT

How long at most to wait for transmission of a GET request to another peer?

Definition at line 94 of file gnunet-service-dht_neighbours.c.

Function Documentation

◆ find_bucket()

static int find_bucket ( const struct GNUNET_HashCode hc)
static

Find the optimal bucket for this key.

Parameters
hcthe hashcode to compare our identity to
Returns
the proper bucket index, or GNUNET_SYSERR on error (same hashcode)

Definition at line 417 of file gnunet-service-dht_neighbours.c.

References GNUNET_break, GNUNET_CRYPTO_hash_matching_bits(), GNUNET_SYSERR, MAX_BUCKETS, and my_identity_hash.

Referenced by GDS_am_closest_peer(), handle_core_connect(), handle_find_peer(), and try_connect().

418 {
419  unsigned int bits;
420 
422  if (bits == MAX_BUCKETS)
423  {
424  /* How can all bits match? Got my own ID? */
425  GNUNET_break(0);
426  return GNUNET_SYSERR;
427  }
428  return MAX_BUCKETS - bits - 1;
429 }
unsigned int GNUNET_CRYPTO_hash_matching_bits(const struct GNUNET_HashCode *first, const struct GNUNET_HashCode *second)
Determine how many low order bits match in two struct GNUNET_HashCodes.
Definition: crypto_hash.c:256
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
#define MAX_BUCKETS
How many buckets will we allow total.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
Here is the call graph for this function:
Here is the caller graph for this function:

◆ offer_hello_done()

static void offer_hello_done ( void *  cls)
static

Function called when GNUNET_TRANSPORT_offer_hello() is done.

Clean up the "oh" field in the cls

Parameters
clsa struct ConnectInfo

Definition at line 439 of file gnunet-service-dht_neighbours.c.

References ConnectInfo::oh.

Referenced by try_connect().

440 {
441  struct ConnectInfo *ci = cls;
442 
443  ci->oh = NULL;
444 }
struct GNUNET_TRANSPORT_OfferHelloHandle * oh
Handle to active HELLO offer operation, or NULL.
Information about a peer that we would like to connect to.
Here is the caller graph for this function:

◆ free_connect_info()

static int free_connect_info ( void *  cls,
const struct GNUNET_PeerIdentity peer,
void *  value 
)
static

Function called for all entries in all_desired_peers to clean up.

Parameters
clsNULL
peerpeer the entry is for
valuethe value to remove
Returns
GNUNET_YES

Definition at line 456 of file gnunet-service-dht_neighbours.c.

References GNUNET_assert, GNUNET_ATS_connectivity_suggest_cancel(), GNUNET_CONTAINER_multipeermap_remove(), GNUNET_free, GNUNET_TRANSPORT_offer_hello_cancel(), GNUNET_YES, ConnectInfo::oh, ConnectInfo::sh, and value.

Referenced by GDS_NEIGHBOURS_done(), and try_connect().

459 {
460  struct ConnectInfo *ci = value;
461 
462  (void)cls;
465  peer,
466  ci));
467  if (NULL != ci->sh)
468  {
470  ci->sh = NULL;
471  }
472  if (NULL != ci->oh)
473  {
475  ci->oh = NULL;
476  }
477  GNUNET_free(ci);
478  return GNUNET_YES;
479 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
int GNUNET_CONTAINER_multipeermap_remove(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, const void *value)
Remove the given key-value pair from the map.
void GNUNET_ATS_connectivity_suggest_cancel(struct GNUNET_ATS_ConnectivitySuggestHandle *sh)
We no longer care about being connected to a peer.
struct GNUNET_TRANSPORT_OfferHelloHandle * oh
Handle to active HELLO offer operation, or NULL.
static char * value
Value of the record to add/remove.
Information about a peer that we would like to connect to.
void GNUNET_TRANSPORT_offer_hello_cancel(struct GNUNET_TRANSPORT_OfferHelloHandle *ohh)
Cancel the request to transport to offer the HELLO message.
struct GNUNET_ATS_ConnectivitySuggestHandle * sh
Handle to active connectivity suggestion operation, or NULL.
static struct GNUNET_CONTAINER_MultiPeerMap * all_desired_peers
Hash map of all peers we would like to be connected to.
#define GNUNET_YES
Definition: gnunet_common.h:77
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ try_connect()

static void try_connect ( const struct GNUNET_PeerIdentity pid,
const struct GNUNET_MessageHeader h 
)
static

Consider if we want to connect to a given peer, and if so let ATS know.

If applicable, the HELLO is offered to the TRANSPORT service.

Parameters
pidpeer to consider connectivity requirements for
ha HELLO message, or NULL

Definition at line 491 of file gnunet-service-dht_neighbours.c.

References bucket_size, find_bucket(), free_connect_info(), GDS_cfg, GNUNET_assert, GNUNET_ATS_connectivity_suggest(), GNUNET_ATS_connectivity_suggest_cancel(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_contains(), GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CRYPTO_hash(), GNUNET_new, GNUNET_OK, GNUNET_TRANSPORT_offer_hello(), GNUNET_TRANSPORT_offer_hello_cancel(), GNUNET_YES, k_buckets, offer_hello_done(), ConnectInfo::oh, PeerBucket::peers_size, ConnectInfo::sh, and ConnectInfo::strength.

Referenced by handle_dht_p2p_result(), and update_desire_strength().

493 {
494  int bucket;
495  struct GNUNET_HashCode pid_hash;
496  struct ConnectInfo *ci;
497  uint32_t strength;
498 
499  GNUNET_CRYPTO_hash(pid,
500  sizeof(struct GNUNET_PeerIdentity),
501  &pid_hash);
502  bucket = find_bucket(&pid_hash);
503  if (bucket < 0)
504  return; /* self? */
506  pid);
507 
508  if (k_buckets[bucket].peers_size < bucket_size)
509  strength = (bucket_size - k_buckets[bucket].peers_size) * bucket;
510  else
511  strength = bucket; /* minimum value of connectivity */
512  if (GNUNET_YES ==
514  pid))
515  strength *= 2; /* double for connected peers */
516  else if (k_buckets[bucket].peers_size > bucket_size)
517  strength = 0; /* bucket full, we really do not care about more */
518 
519  if ((0 == strength) &&
520  (NULL != ci))
521  {
522  /* release request */
524  free_connect_info(NULL,
525  pid,
526  ci));
527  return;
528  }
529  if (NULL == ci)
530  {
531  ci = GNUNET_new(struct ConnectInfo);
534  pid,
535  ci,
537  }
538  if ((NULL != ci->oh) &&
539  (NULL != h))
541  if (NULL != h)
543  h,
545  ci);
546  if ((NULL != ci->sh) &&
547  (ci->strength != strength))
549  if (ci->strength != strength)
551  pid,
552  strength);
553  ci->strength = strength;
554 }
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static int find_bucket(const struct GNUNET_HashCode *hc)
Find the optimal bucket for this key.
unsigned int peers_size
Number of peers in the bucket.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
#define GNUNET_new(type)
Allocate a struct or union of the given type.
void GNUNET_ATS_connectivity_suggest_cancel(struct GNUNET_ATS_ConnectivitySuggestHandle *sh)
We no longer care about being connected to a peer.
struct GNUNET_ATS_ConnectivitySuggestHandle * GNUNET_ATS_connectivity_suggest(struct GNUNET_ATS_ConnectivityHandle *ch, const struct GNUNET_PeerIdentity *peer, uint32_t strength)
We would like to receive address suggestions for a peer.
static int free_connect_info(void *cls, const struct GNUNET_PeerIdentity *peer, void *value)
Function called for all entries in all_desired_peers to clean up.
struct GNUNET_TRANSPORT_OfferHelloHandle * oh
Handle to active HELLO offer operation, or NULL.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:44
Information about a peer that we would like to connect to.
A 512-bit hashcode.
void GNUNET_TRANSPORT_offer_hello_cancel(struct GNUNET_TRANSPORT_OfferHelloHandle *ohh)
Cancel the request to transport to offer the HELLO message.
struct GNUNET_ATS_ConnectivitySuggestHandle * sh
Handle to active connectivity suggestion operation, or NULL.
There must only be one value per key; storing a value should fail if a value under the same key alrea...
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
uint32_t strength
How much would we like to connect to this peer?
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.
The identity of the host (wraps the signing key of the peer).
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_TRANSPORT_OfferHelloHandle * GNUNET_TRANSPORT_offer_hello(const struct GNUNET_CONFIGURATION_Handle *cfg, const struct GNUNET_MessageHeader *hello, GNUNET_SCHEDULER_TaskCallback cont, void *cont_cls)
Offer the transport service the HELLO of another peer.
static struct GNUNET_ATS_ConnectivityHandle * ats_ch
Handle to ATS connectivity.
static unsigned int bucket_size
Maximum size for each bucket.
static struct GNUNET_CONTAINER_MultiPeerMap * all_desired_peers
Hash map of all peers we would like to be connected to.
#define GNUNET_YES
Definition: gnunet_common.h:77
const struct GNUNET_CONFIGURATION_Handle * GDS_cfg
Configuration we use.
int GNUNET_CONTAINER_multipeermap_contains(const struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key)
Check if the map contains any value under the given key (including values that are NULL)...
static void offer_hello_done(void *cls)
Function called when GNUNET_TRANSPORT_offer_hello() is done.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_desire_strength()

static int update_desire_strength ( void *  cls,
const struct GNUNET_PeerIdentity pid,
void *  value 
)
static

Function called for each peer in all_desired_peers during update_connect_preferences() if we have reason to adjust the strength of our desire to keep connections to certain peers.

Calls try_connect() to update the calculations for the given pid.

Parameters
clsNULL
pidpeer to update
valueunused
Returns
GNUNET_YES (continue to iterate)

Definition at line 570 of file gnunet-service-dht_neighbours.c.

References GNUNET_YES, and try_connect().

Referenced by update_connect_preferences().

573 {
574  (void)cls;
575  (void)value;
576  try_connect(pid,
577  NULL);
578  return GNUNET_YES;
579 }
static char * value
Value of the record to add/remove.
static void try_connect(const struct GNUNET_PeerIdentity *pid, const struct GNUNET_MessageHeader *h)
Consider if we want to connect to a given peer, and if so let ATS know.
#define GNUNET_YES
Definition: gnunet_common.h:77
Here is the call graph for this function:
Here is the caller graph for this function:

◆ update_connect_preferences()

static void update_connect_preferences ( )
static

Update our preferences for connectivity as given to ATS.

Parameters
clsthe struct PeerInfo of the peer
tcscheduler context.

Definition at line 589 of file gnunet-service-dht_neighbours.c.

References GNUNET_CONTAINER_multipeermap_iterate(), and update_desire_strength().

Referenced by handle_core_connect(), and handle_core_disconnect().

590 {
593  NULL);
594 }
static int update_desire_strength(void *cls, const struct GNUNET_PeerIdentity *pid, void *value)
Function called for each peer in all_desired_peers during update_connect_preferences() if we have rea...
int GNUNET_CONTAINER_multipeermap_iterate(struct GNUNET_CONTAINER_MultiPeerMap *map, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map.
static struct GNUNET_CONTAINER_MultiPeerMap * all_desired_peers
Hash map of all peers we would like to be connected to.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ add_known_to_bloom()

static int add_known_to_bloom ( void *  cls,
const struct GNUNET_PeerIdentity key,
void *  value 
)
static

Add each of the peers we already know to the bloom filter of the request so that we don't get duplicate HELLOs.

Parameters
clsthe struct GNUNET_BLOCK_Group
keypeer identity to add to the bloom filter
valuevalue the peer information (unused)
Returns
GNUNET_YES (we should continue to iterate)

Definition at line 607 of file gnunet-service-dht_neighbours.c.

References GNUNET_BLOCK_group_set_seen(), GNUNET_CRYPTO_hash(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, and GNUNET_YES.

Referenced by send_find_peer_message().

610 {
611  struct GNUNET_BLOCK_Group *bg = cls;
612  struct GNUNET_HashCode key_hash;
613 
614  (void)cls;
615  (void)value;
616  GNUNET_CRYPTO_hash(key,
617  sizeof(struct GNUNET_PeerIdentity),
618  &key_hash);
620  &key_hash,
621  1);
623  "Adding known peer (%s) to bloomfilter for FIND PEER\n",
624  GNUNET_i2s(key));
625  return GNUNET_YES;
626 }
static char * value
Value of the record to add/remove.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:44
A 512-bit hashcode.
The identity of the host (wraps the signing key of the peer).
#define GNUNET_log(kind,...)
Block group data.
#define GNUNET_YES
Definition: gnunet_common.h:77
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
int GNUNET_BLOCK_group_set_seen(struct GNUNET_BLOCK_Group *bg, const struct GNUNET_HashCode *seen_results, unsigned int seen_results_count)
Update block group to filter out the given results.
Definition: block.c:408
Here is the call graph for this function:
Here is the caller graph for this function:

◆ send_find_peer_message()

static void send_find_peer_message ( void *  cls)
static

Task to send a find peer message for our own peer identifier so that we can find the closest peers in the network to ourselves and attempt to connect to them.

Parameters
clsclosure for this task

Definition at line 637 of file gnunet-service-dht_neighbours.c.

References add_known_to_bloom(), bucket_size, DHT_BLOOM_SIZE, DHT_MAXIMUM_FIND_PEER_INTERVAL, DHT_MINIMUM_FIND_PEER_INTERVAL, FIND_PEER_REPLICATION_LEVEL, GDS_block_context, GDS_NEIGHBOURS_handle_get(), GDS_stats, gettext_noop, GNUNET_assert, GNUNET_BLOCK_group_create(), GNUNET_BLOCK_group_destroy(), GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_CONSTANTS_BLOOMFILTER_K, GNUNET_CONTAINER_bloomfilter_free(), GNUNET_CONTAINER_bloomfilter_init(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_CRYPTO_random_u64(), GNUNET_DHT_RO_FIND_PEER, GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_NO, GNUNET_SCHEDULER_add_delayed(), GNUNET_STATISTICS_update(), GNUNET_TIME_UNIT_MINUTES, my_identity_hash, newly_found_peers, and GNUNET_TIME_Relative::rel_value_us.

Referenced by handle_core_connect().

638 {
639  struct GNUNET_TIME_Relative next_send_time;
640  struct GNUNET_BLOCK_Group *bg;
641  struct GNUNET_CONTAINER_BloomFilter *peer_bf;
642 
643  (void)cls;
644  find_peer_task = NULL;
646  {
647  /* If we are finding many peers already, no need to send out our request right now! */
651  NULL);
652  newly_found_peers = 0;
653  return;
654  }
658  UINT32_MAX),
659  NULL,
660  0,
661  "filter-size",
663  NULL);
666  bg);
668  gettext_noop("# FIND PEER messages initiated"),
669  1,
670  GNUNET_NO);
671  peer_bf
675  // FIXME: pass priority!?
679  0,
681  NULL,
682  0,
683  bg,
684  peer_bf);
687  /* schedule next round */
688  next_send_time.rel_value_us =
689  DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value_us +
691  DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value_us /
692  (newly_found_peers + 1));
693  newly_found_peers = 0;
694  GNUNET_assert(NULL == find_peer_task);
696  GNUNET_SCHEDULER_add_delayed(next_send_time,
698  NULL);
699 }
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_init(const char *data, size_t size, unsigned int k)
Create a Bloom filter from raw bits.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
We should keep track of the route that the message took in the P2P network.
#define DHT_MINIMUM_FIND_PEER_INTERVAL
How long at least to wait before sending another find peer request.
uint64_t GNUNET_CRYPTO_random_u64(enum GNUNET_CRYPTO_Quality mode, uint64_t max)
Random on unsigned 64-bit values.
#define GNUNET_TIME_UNIT_MINUTES
One minute.
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition: dht.h:34
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_CONSTANTS_BLOOMFILTER_K
K-value that must be used for the bloom filters in &#39;GET&#39; queries.
static struct GNUNET_SCHEDULER_Task * find_peer_task
Task that sends FIND PEER requests.
#define GNUNET_NO
Definition: gnunet_common.h:78
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static unsigned int newly_found_peers
How many peers have we added since we sent out our last find peer request?
#define FIND_PEER_REPLICATION_LEVEL
Desired replication level for FIND PEER requests.
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
static int add_known_to_bloom(void *cls, const struct GNUNET_PeerIdentity *key, void *value)
Add each of the peers we already know to the bloom filter of the request so that we don&#39;t get duplica...
#define DHT_MAXIMUM_FIND_PEER_INTERVAL
How long at most to wait before sending another find peer request.
struct GNUNET_BLOCK_Context * GDS_block_context
Our handle to the BLOCK library.
struct GNUNET_SCHEDULER_Task * GNUNET_SCHEDULER_add_delayed(struct GNUNET_TIME_Relative delay, GNUNET_SCHEDULER_TaskCallback task, void *task_cls)
Schedule a new task to be run with a specified delay.
Definition: scheduler.c:1237
This is a &#39;FIND-PEER&#39; request, so approximate results are fine.
Type of a block that contains a HELLO for a peer (for DHT and CADET find-peer operations).
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
struct GNUNET_BLOCK_Group * GNUNET_BLOCK_group_create(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, uint32_t nonce, const void *raw_data, size_t raw_data_size,...)
Create a new block group.
Definition: block.c:288
int GDS_NEIGHBOURS_handle_get(enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint32_t desired_replication_level, uint32_t hop_count, const struct GNUNET_HashCode *key, const void *xquery, size_t xquery_size, struct GNUNET_BLOCK_Group *bg, struct GNUNET_CONTAINER_BloomFilter *peer_bf)
Perform a GET operation.
int GNUNET_CONTAINER_multipeermap_iterate(struct GNUNET_CONTAINER_MultiPeerMap *map, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map.
static void send_find_peer_message(void *cls)
Task to send a find peer message for our own peer identifier so that we can find the closest peers in...
Block group data.
static unsigned int bucket_size
Maximum size for each bucket.
void GNUNET_CONTAINER_bloomfilter_free(struct GNUNET_CONTAINER_BloomFilter *bf)
Free the space associcated with a filter in memory, flush to drive if needed (do not free the space o...
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
Time for relative time used by GNUnet, in microseconds.
void GNUNET_BLOCK_group_destroy(struct GNUNET_BLOCK_Group *bg)
Destroy resources used by a block group.
Definition: block.c:204
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_core_connect()

static void* handle_core_connect ( void *  cls,
const struct GNUNET_PeerIdentity peer,
struct GNUNET_MQ_Handle mq 
)
static

Method called whenever a peer connects.

Parameters
clsclosure
peerpeer identity this notification is about
mqmessage queue for sending messages to peer
Returns
our struct PeerInfo for peer

Definition at line 711 of file gnunet-service-dht_neighbours.c.

References bucket_size, closest_bucket, disable_try_connect, find_bucket(), GDS_stats, gettext_noop, GNUNET_assert, GNUNET_CONTAINER_DLL_insert_tail, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY, GNUNET_CONTAINER_multipeermap_get(), GNUNET_CONTAINER_multipeermap_put(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_CRYPTO_hash(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MAX, GNUNET_memcmp, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_SCHEDULER_add_now(), GNUNET_STATISTICS_update(), GNUNET_YES, PeerBucket::head, PeerInfo::id, k_buckets, MAX_BUCKETS, mq, PeerInfo::mq, my_identity, newly_found_peers, peer, PeerInfo::peer_bucket, PeerBucket::peers_size, PeerInfo::phash, pi, send_find_peer_message(), PeerBucket::tail, and update_connect_preferences().

Referenced by GDS_NEIGHBOURS_init().

714 {
715  struct PeerInfo *pi;
716 
717  (void)cls;
718  /* Check for connect to self message */
719  if (0 == GNUNET_memcmp(&my_identity,
720  peer))
721  return NULL;
723  "Connected to %s\n",
724  GNUNET_i2s(peer));
727  peer));
729  gettext_noop("# peers connected"),
730  1,
731  GNUNET_NO);
732  pi = GNUNET_new(struct PeerInfo);
733  pi->id = peer;
734  pi->mq = mq;
735  GNUNET_CRYPTO_hash(peer,
736  sizeof(struct GNUNET_PeerIdentity),
737  &pi->phash);
738  pi->peer_bucket = find_bucket(&pi->phash);
739  GNUNET_assert((pi->peer_bucket >= 0) &&
740  ((unsigned int)pi->peer_bucket < MAX_BUCKETS));
743  pi);
746  (unsigned int)pi->peer_bucket);
749  pi->id,
750  pi,
752  if ((pi->peer_bucket > 0) &&
754  {
757  }
760  {
761  /* got a first connection, good time to start with FIND PEER requests... */
762  GNUNET_assert(NULL == find_peer_task);
764  NULL);
765  }
766  return pi;
767 }
static unsigned int closest_bucket
The lowest currently used bucket, initially 0 (for 0-bits matching bucket).
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
static void update_connect_preferences()
Update our preferences for connectivity as given to ATS.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static struct GNUNET_SCHEDULER_Task * find_peer_task
Task that sends FIND PEER requests.
struct PeerInfo * head
Head of DLL.
static int find_bucket(const struct GNUNET_HashCode *hc)
Find the optimal bucket for this key.
unsigned int peers_size
Number of peers in the bucket.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
struct GNUNET_HashCode phash
Hash of id.
#define GNUNET_new(type)
Allocate a struct or union of the given type.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static struct GNUNET_PEERINFO_Handle * pi
Handle to peerinfo service.
static unsigned int newly_found_peers
How many peers have we added since we sent out our last find peer request?
static int disable_try_connect
Option for testing that disables the &#39;connect&#39; function of the DHT.
int peer_bucket
Which bucket is this peer in?
#define MAX_BUCKETS
How many buckets will we allow total.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:44
#define GNUNET_MAX(a, b)
Definition: gnunet_common.h:82
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:1264
struct PeerInfo * tail
Tail of DLL.
There must only be one value per key; storing a value should fail if a value under the same key alrea...
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
Entry for a peer in a bucket.
#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element)
Insert an element at the tail of a DLL.
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
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.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
The identity of the host (wraps the signing key of the peer).
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
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_MQ_Handle * mq
Definition: 003.c:5
#define GNUNET_log(kind,...)
static void send_find_peer_message(void *cls)
Task to send a find peer message for our own peer identifier so that we can find the closest peers in...
static unsigned int bucket_size
Maximum size for each bucket.
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
struct GNUNET_MQ_Handle * mq
Handle for sending messages to this peer.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_core_disconnect()

static void handle_core_disconnect ( void *  cls,
const struct GNUNET_PeerIdentity peer,
void *  internal_cls 
)
static

Method called whenever a peer disconnects.

Parameters
clsclosure
peerpeer identity this notification is about
internal_clsour struct PeerInfo for peer

Definition at line 778 of file gnunet-service-dht_neighbours.c.

References bucket_size, closest_bucket, disable_try_connect, GDS_stats, gettext_noop, GNUNET_assert, GNUNET_CONTAINER_DLL_remove, GNUNET_CONTAINER_multipeermap_remove(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_SCHEDULER_cancel(), GNUNET_STATISTICS_update(), GNUNET_YES, PeerBucket::head, k_buckets, PeerInfo::peer_bucket, PeerBucket::peers_size, PeerBucket::tail, and update_connect_preferences().

Referenced by GDS_NEIGHBOURS_init().

781 {
782  struct PeerInfo *to_remove = internal_cls;
783 
784  (void)cls;
785  /* Check for disconnect from self message */
786  if (NULL == to_remove)
787  return;
789  "Disconnected %s\n",
790  GNUNET_i2s(peer));
792  gettext_noop("# peers connected"),
793  -1,
794  GNUNET_NO);
797  peer,
798  to_remove));
801  {
803  find_peer_task = NULL;
804  }
805  GNUNET_assert(to_remove->peer_bucket >= 0);
807  k_buckets[to_remove->peer_bucket].tail,
808  to_remove);
810  k_buckets[to_remove->peer_bucket].peers_size--;
811  while ((closest_bucket > 0) &&
812  (0 == k_buckets[to_remove->peer_bucket].peers_size))
813  closest_bucket--;
814  if (k_buckets[to_remove->peer_bucket].peers_size < bucket_size)
816  GNUNET_free(to_remove);
817 }
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
static unsigned int closest_bucket
The lowest currently used bucket, initially 0 (for 0-bits matching bucket).
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
static void update_connect_preferences()
Update our preferences for connectivity as given to ATS.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static struct GNUNET_SCHEDULER_Task * find_peer_task
Task that sends FIND PEER requests.
struct PeerInfo * head
Head of DLL.
int GNUNET_CONTAINER_multipeermap_remove(struct GNUNET_CONTAINER_MultiPeerMap *map, const struct GNUNET_PeerIdentity *key, const void *value)
Remove the given key-value pair from the map.
unsigned int peers_size
Number of peers in the bucket.
#define GNUNET_NO
Definition: gnunet_common.h:78
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static int disable_try_connect
Option for testing that disables the &#39;connect&#39; function of the DHT.
int peer_bucket
Which bucket is this peer in?
struct PeerInfo * tail
Tail of DLL.
Entry for a peer in a bucket.
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
#define GNUNET_log(kind,...)
static unsigned int bucket_size
Maximum size for each bucket.
#define GNUNET_YES
Definition: gnunet_common.h:77
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
void * GNUNET_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition: scheduler.c:956
Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_forward_count()

static unsigned int get_forward_count ( uint32_t  hop_count,
uint32_t  target_replication 
)
static

To how many peers should we (on average) forward the request to obtain the desired target_replication count (on average).

Parameters
hop_countnumber of hops the message has traversed
target_replicationthe number of total paths desired
Returns
Some number of peers to forward the message to

Definition at line 829 of file gnunet-service-dht_neighbours.c.

References GDS_NSE_get(), GDS_stats, gettext_noop, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_MIN, GNUNET_NO, GNUNET_STATISTICS_update(), PeerPutMessage::hop_count, and MAXIMUM_REPLICATION_LEVEL.

Referenced by get_target_peers().

831 {
832  uint32_t random_value;
833  uint32_t forward_count;
834  float target_value;
835 
836  if (hop_count > GDS_NSE_get() * 4.0)
837  {
838  /* forcefully terminate */
840  gettext_noop("# requests TTL-dropped"),
841  1, GNUNET_NO);
842  return 0;
843  }
844  if (hop_count > GDS_NSE_get() * 2.0)
845  {
846  /* Once we have reached our ideal number of hops, only forward to 1 peer */
847  return 1;
848  }
849  /* bound by system-wide maximum */
850  target_replication =
851  GNUNET_MIN(MAXIMUM_REPLICATION_LEVEL, target_replication);
852  target_value =
853  1 + (target_replication - 1.0) / (GDS_NSE_get() +
854  ((float)(target_replication - 1.0) *
855  hop_count));
856  /* Set forward count to floor of target_value */
857  forward_count = (uint32_t)target_value;
858  /* Subtract forward_count (floor) from target_value (yields value between 0 and 1) */
859  target_value = target_value - forward_count;
860  random_value =
862  if (random_value < (target_value * UINT32_MAX))
863  forward_count++;
864  return forward_count;
865 }
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
#define GNUNET_NO
Definition: gnunet_common.h:78
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:80
#define MAXIMUM_REPLICATION_LEVEL
Maximum allowed replication level for all requests.
double GDS_NSE_get()
Return the log of the current network size estimate.
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_distance()

static unsigned int get_distance ( const struct GNUNET_HashCode target,
const struct GNUNET_HashCode have 
)
static

Compute the distance between have and target as a 32-bit value.

Differences in the lower bits must count stronger than differences in the higher bits.

Parameters
target
have
Returns
0 if have==target, otherwise a number that is larger as the distance between the two hash codes increases

Definition at line 880 of file gnunet-service-dht_neighbours.c.

References GNUNET_CRYPTO_hash_get_bit(), and GNUNET_CRYPTO_hash_matching_bits().

Referenced by select_peer().

882 {
883  unsigned int bucket;
884  unsigned int msb;
885  unsigned int lsb;
886  unsigned int i;
887 
888  /* We have to represent the distance between two 2^9 (=512)-bit
889  * numbers as a 2^5 (=32)-bit number with "0" being used for the
890  * two numbers being identical; furthermore, we need to
891  * guarantee that a difference in the number of matching
892  * bits is always represented in the result.
893  *
894  * We use 2^32/2^9 numerical values to distinguish between
895  * hash codes that have the same LSB bit distance and
896  * use the highest 2^9 bits of the result to signify the
897  * number of (mis)matching LSB bits; if we have 0 matching
898  * and hence 512 mismatching LSB bits we return -1 (since
899  * 512 itself cannot be represented with 9 bits) */
900 
901  /* first, calculate the most significant 9 bits of our
902  * result, aka the number of LSBs */
903  bucket = GNUNET_CRYPTO_hash_matching_bits(target,
904  have);
905  /* bucket is now a value between 0 and 512 */
906  if (bucket == 512)
907  return 0; /* perfect match */
908  if (bucket == 0)
909  return (unsigned int)-1; /* LSB differs; use max (if we did the bit-shifting
910  * below, we'd end up with max+1 (overflow)) */
911 
912  /* calculate the most significant bits of the final result */
913  msb = (512 - bucket) << (32 - 9);
914  /* calculate the 32-9 least significant bits of the final result by
915  * looking at the differences in the 32-9 bits following the
916  * mismatching bit at 'bucket' */
917  lsb = 0;
918  for (i = bucket + 1;
919  (i < sizeof(struct GNUNET_HashCode) * 8) && (i < bucket + 1 + 32 - 9); i++)
920  {
921  if (GNUNET_CRYPTO_hash_get_bit(target, i) !=
923  lsb |= (1 << (bucket + 32 - 9 - i)); /* first bit set will be 10,
924  * last bit set will be 31 -- if
925  * i does not reach 512 first... */
926  }
927  return msb | lsb;
928 }
unsigned int GNUNET_CRYPTO_hash_matching_bits(const struct GNUNET_HashCode *first, const struct GNUNET_HashCode *second)
Determine how many low order bits match in two struct GNUNET_HashCodes.
Definition: crypto_hash.c:256
A 512-bit hashcode.
int GNUNET_CRYPTO_hash_get_bit(const struct GNUNET_HashCode *code, unsigned int bit)
Obtain a bit from a hashcode.
Definition: crypto_hash.c:236
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_am_closest_peer()

int GDS_am_closest_peer ( const struct GNUNET_HashCode key,
const struct GNUNET_CONTAINER_BloomFilter bloom 
)

Check whether my identity is closer than any known peers.

If a non-null bloomfilter is given, check if this is the closest peer that hasn't already been routed to.

Parameters
keyhash code to check closeness to
bloombloomfilter, exclude these entries from the decision
Returns
GNUNET_YES if node location is closest, GNUNET_NO otherwise.

Definition at line 942 of file gnunet-service-dht_neighbours.c.

References GNUNET_HashCode::bits, find_bucket(), GNUNET_assert, GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_hash_matching_bits(), GNUNET_memcmp, GNUNET_NO, GNUNET_YES, PeerBucket::head, k_buckets, my_identity_hash, PeerInfo::next, and PeerInfo::phash.

Referenced by handle_dht_p2p_get(), and handle_dht_p2p_put().

944 {
945  int bits;
946  int other_bits;
947  int bucket_num;
948  struct PeerInfo *pos;
949 
951  key))
952  return GNUNET_YES;
953  bucket_num = find_bucket(key);
954  GNUNET_assert(bucket_num >= 0);
956  key);
957  pos = k_buckets[bucket_num].head;
958  while (NULL != pos)
959  {
960  if ((NULL != bloom) &&
961  (GNUNET_YES ==
963  &pos->phash)))
964  {
965  pos = pos->next;
966  continue; /* Skip already checked entries */
967  }
968  other_bits = GNUNET_CRYPTO_hash_matching_bits(&pos->phash,
969  key);
970  if (other_bits > bits)
971  return GNUNET_NO;
972  if (other_bits == bits) /* We match the same number of bits */
973  return GNUNET_YES;
974  pos = pos->next;
975  }
976  /* No peers closer, we are the closest! */
977  return GNUNET_YES;
978 }
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
struct PeerInfo * next
Next peer entry (DLL)
unsigned int GNUNET_CRYPTO_hash_matching_bits(const struct GNUNET_HashCode *first, const struct GNUNET_HashCode *second)
Determine how many low order bits match in two struct GNUNET_HashCodes.
Definition: crypto_hash.c:256
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct PeerInfo * head
Head of DLL.
static int find_bucket(const struct GNUNET_HashCode *hc)
Find the optimal bucket for this key.
#define GNUNET_NO
Definition: gnunet_common.h:78
struct GNUNET_HashCode phash
Hash of id.
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
Entry for a peer in a bucket.
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
#define GNUNET_YES
Definition: gnunet_common.h:77
uint32_t bits[512/8/sizeof(uint32_t)]
Here is the call graph for this function:
Here is the caller graph for this function:

◆ select_peer()

static struct PeerInfo* select_peer ( const struct GNUNET_HashCode key,
const struct GNUNET_CONTAINER_BloomFilter bloom,
uint32_t  hops 
)
static

Select a peer from the routing table that would be a good routing destination for sending a message for "key".

The resulting peer must not be in the set of blocked peers.

Note that we should not ALWAYS select the closest peer to the target, peers further away from the target should be chosen with exponentially declining probability.

FIXME: double-check that this is fine

Parameters
keythe key we are selecting a peer to route to
blooma bloomfilter containing entries this request has seen already
hopshow many hops has this message traversed thus far
Returns
Peer to route to, or NULL on error

Definition at line 999 of file gnunet-service-dht_neighbours.c.

References bucket_size, closest_bucket, GDS_NSE_get(), GDS_stats, get_distance(), gettext_noop, GNUNET_break, GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_YES, head, PeerBucket::head, PeerInfo::id, k_buckets, PeerInfo::next, and PeerInfo::phash.

Referenced by get_target_peers().

1002 {
1003  unsigned int bc;
1004  unsigned int count;
1005  unsigned int selected;
1006  struct PeerInfo *pos;
1007  unsigned int dist;
1008  unsigned int smallest_distance;
1009  struct PeerInfo *chosen;
1010 
1011  if (hops >= GDS_NSE_get())
1012  {
1013  /* greedy selection (closest peer that is not in bloomfilter) */
1014  smallest_distance = UINT_MAX;
1015  chosen = NULL;
1016  for (bc = 0; bc <= closest_bucket; bc++)
1017  {
1018  pos = k_buckets[bc].head;
1019  count = 0;
1020  while ((pos != NULL) && (count < bucket_size))
1021  {
1022  if ((NULL == bloom) ||
1023  (GNUNET_NO ==
1025  &pos->phash)))
1026  {
1027  dist = get_distance(key,
1028  &pos->phash);
1029  if (dist < smallest_distance)
1030  {
1031  chosen = pos;
1032  smallest_distance = dist;
1033  }
1034  }
1035  else
1036  {
1038  "Excluded peer `%s' due to BF match in greedy routing for %s\n",
1039  GNUNET_i2s(pos->id),
1040  GNUNET_h2s(key));
1042  gettext_noop("# Peers excluded from routing due to Bloomfilter"),
1043  1,
1044  GNUNET_NO);
1045  dist = get_distance(key,
1046  &pos->phash);
1047  if (dist < smallest_distance)
1048  {
1049  chosen = NULL;
1050  smallest_distance = dist;
1051  }
1052  }
1053  count++;
1054  pos = pos->next;
1055  }
1056  }
1057  if (NULL == chosen)
1059  gettext_noop("# Peer selection failed"),
1060  1,
1061  GNUNET_NO);
1062  else
1064  "Selected peer `%s' in greedy routing for %s\n",
1065  GNUNET_i2s(chosen->id),
1066  GNUNET_h2s(key));
1067  return chosen;
1068  }
1069 
1070  /* select "random" peer */
1071  /* count number of peers that are available and not filtered */
1072  count = 0;
1073  for (bc = 0; bc <= closest_bucket; bc++)
1074  {
1075  pos = k_buckets[bc].head;
1076  while ((NULL != pos) && (count < bucket_size))
1077  {
1078  if ((NULL != bloom) &&
1079  (GNUNET_YES ==
1081  &pos->phash)))
1082  {
1084  gettext_noop
1085  ("# Peers excluded from routing due to Bloomfilter"),
1086  1, GNUNET_NO);
1088  "Excluded peer `%s' due to BF match in random routing for %s\n",
1089  GNUNET_i2s(pos->id),
1090  GNUNET_h2s(key));
1091  pos = pos->next;
1092  continue; /* Ignore bloomfiltered peers */
1093  }
1094  count++;
1095  pos = pos->next;
1096  }
1097  }
1098  if (0 == count) /* No peers to select from! */
1099  {
1101  gettext_noop("# Peer selection failed"), 1,
1102  GNUNET_NO);
1103  return NULL;
1104  }
1105  /* Now actually choose a peer */
1107  count);
1108  count = 0;
1109  for (bc = 0; bc <= closest_bucket; bc++)
1110  {
1111  for (pos = k_buckets[bc].head; ((pos != NULL) && (count < bucket_size)); pos = pos->next)
1112  {
1113  if ((bloom != NULL) &&
1114  (GNUNET_YES ==
1116  &pos->phash)))
1117  {
1118  continue; /* Ignore bloomfiltered peers */
1119  }
1120  if (0 == selected--)
1121  {
1123  "Selected peer `%s' in random routing for %s\n",
1124  GNUNET_i2s(pos->id),
1125  GNUNET_h2s(key));
1126  return pos;
1127  }
1128  }
1129  }
1130  GNUNET_break(0);
1131  return NULL;
1132 }
static unsigned int closest_bucket
The lowest currently used bucket, initially 0 (for 0-bits matching bucket).
static unsigned int get_distance(const struct GNUNET_HashCode *target, const struct GNUNET_HashCode *have)
Compute the distance between have and target as a 32-bit value.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
struct PeerInfo * next
Next peer entry (DLL)
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
struct PeerInfo * head
Head of DLL.
#define GNUNET_NO
Definition: gnunet_common.h:78
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
struct GNUNET_HashCode phash
Hash of id.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
Entry for a peer in a bucket.
static struct PendingResolutions * head
Head of list of pending resolution requests.
Definition: gnunet-ats.c:228
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
#define GNUNET_log(kind,...)
static unsigned int bucket_size
Maximum size for each bucket.
#define GNUNET_YES
Definition: gnunet_common.h:77
double GDS_NSE_get()
Return the log of the current network size estimate.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_target_peers()

static unsigned int get_target_peers ( const struct GNUNET_HashCode key,
struct GNUNET_CONTAINER_BloomFilter bloom,
uint32_t  hop_count,
uint32_t  target_replication,
struct PeerInfo ***  targets 
)
static

Compute the set of peers that the given request should be forwarded to.

Parameters
keyrouting key
bloombloom filter excluding peers as targets, all selected peers will be added to the bloom filter
hop_countnumber of hops the request has traversed so far
target_replicationdesired number of replicas
targetswhere to store an array of target peers (to be free'd by the caller)
Returns
number of peers returned in 'targets'.

Definition at line 1149 of file gnunet-service-dht_neighbours.c.

References get_forward_count(), GNUNET_assert, GNUNET_break, GNUNET_CONTAINER_bloomfilter_add(), GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CONTAINER_multipeermap_size(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_log, GNUNET_new_array, GNUNET_NO, PeerInfo::phash, ret, and select_peer().

Referenced by GDS_NEIGHBOURS_handle_get(), and GDS_NEIGHBOURS_handle_put().

1154 {
1155  unsigned int ret;
1156  unsigned int off;
1157  struct PeerInfo **rtargets;
1158  struct PeerInfo *nxt;
1159 
1160  GNUNET_assert(NULL != bloom);
1161  ret = get_forward_count(hop_count,
1162  target_replication);
1163  if (0 == ret)
1164  {
1165  *targets = NULL;
1166  return 0;
1167  }
1168  rtargets = GNUNET_new_array(ret,
1169  struct PeerInfo *);
1170  for (off = 0; off < ret; off++)
1171  {
1172  nxt = select_peer(key,
1173  bloom,
1174  hop_count);
1175  if (NULL == nxt)
1176  break;
1177  rtargets[off] = nxt;
1180  &nxt->phash));
1182  &nxt->phash);
1183  }
1185  "Selected %u/%u peers at hop %u for %s (target was %u)\n",
1186  off,
1188  (unsigned int)hop_count,
1189  GNUNET_h2s(key),
1190  ret);
1191  if (0 == off)
1192  {
1193  GNUNET_free(rtargets);
1194  *targets = NULL;
1195  return 0;
1196  }
1197  *targets = rtargets;
1199  "Forwarding query `%s' to %u peers (goal was %u peers)\n",
1200  GNUNET_h2s(key),
1201  off,
1202  ret);
1203  return off;
1204 }
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
static struct PeerInfo * select_peer(const struct GNUNET_HashCode *key, const struct GNUNET_CONTAINER_BloomFilter *bloom, uint32_t hops)
Select a peer from the routing table that would be a good routing destination for sending a message f...
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_NO
Definition: gnunet_common.h:78
static unsigned int get_forward_count(uint32_t hop_count, uint32_t target_replication)
To how many peers should we (on average) forward the request to obtain the desired target_replication...
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
struct GNUNET_HashCode phash
Hash of id.
static int ret
Final status code.
Definition: gnunet-arm.c:89
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
#define GNUNET_new_array(n, type)
Allocate a size n array with structs or unions of the given type.
Entry for a peer in a bucket.
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
#define GNUNET_log(kind,...)
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_handle_put()

int GDS_NEIGHBOURS_handle_put ( enum GNUNET_BLOCK_Type  type,
enum GNUNET_DHT_RouteOption  options,
uint32_t  desired_replication_level,
struct GNUNET_TIME_Absolute  expiration_time,
uint32_t  hop_count,
struct GNUNET_CONTAINER_BloomFilter bf,
const struct GNUNET_HashCode key,
unsigned int  put_path_length,
struct GNUNET_PeerIdentity put_path,
const void *  data,
size_t  data_size 
)

Perform a PUT operation.

Forwards the given request to other peers. Does not store the data locally. Does not give the data to local clients. May do nothing if this is the only peer in the network (or if we are the closest peer in the network).

Parameters
typetype of the block
optionsrouting options
desired_replication_leveldesired replication count
expiration_timewhen does the content expire
hop_counthow many hops has this message traversed so far
bfBloom filter of peers this PUT has already traversed
keykey for the content
put_path_lengthnumber of entries in put_path
put_pathpeers this request has traversed so far (if tracked)
datapayload to store
data_sizenumber of bytes in data
Returns
GNUNET_OK if the request was forwarded, GNUNET_NO if not

Definition at line 1228 of file gnunet-service-dht_neighbours.c.

References PeerPutMessage::bloomfilter, data_size, PeerPutMessage::desired_replication_level, DHT_BLOOM_SIZE, env, PeerPutMessage::expiration_time, GDS_stats, get_target_peers(), gettext_noop, GNUNET_assert, GNUNET_break, GNUNET_CONSTANTS_MAX_ENCRYPTED_MESSAGE_SIZE, GNUNET_CONTAINER_bloomfilter_add(), GNUNET_CONTAINER_bloomfilter_get_raw_data(), GNUNET_CONTAINER_bloomfilter_test(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_DHT_P2P_PUT, GNUNET_MQ_get_length(), GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_hton(), GNUNET_YES, PeerPutMessage::hop_count, PeerInfo::id, PeerPutMessage::key, MAXIMUM_PENDING_PER_PEER, PeerInfo::mq, my_identity, my_identity_hash, PeerPutMessage::options, PeerInfo::phash, PeerPutMessage::put_path_length, and PeerPutMessage::type.

Referenced by handle_dht_local_put(), and handle_dht_p2p_put().

1239 {
1240  unsigned int target_count;
1241  unsigned int i;
1242  struct PeerInfo **targets;
1243  struct PeerInfo *target;
1244  size_t msize;
1245  struct GNUNET_MQ_Envelope *env;
1246  struct PeerPutMessage *ppm;
1247  struct GNUNET_PeerIdentity *pp;
1248  unsigned int skip_count;
1249 
1250  GNUNET_assert(NULL != bf);
1252  "Adding myself (%s) to PUT bloomfilter for %s\n",
1254  GNUNET_h2s(key));
1256  &my_identity_hash);
1258  gettext_noop("# PUT requests routed"),
1259  1,
1260  GNUNET_NO);
1261  target_count
1262  = get_target_peers(key,
1263  bf,
1264  hop_count,
1265  desired_replication_level,
1266  &targets);
1267  if (0 == target_count)
1268  {
1270  "Routing PUT for %s terminates after %u hops at %s\n",
1271  GNUNET_h2s(key),
1272  (unsigned int)hop_count,
1274  return GNUNET_NO;
1275  }
1276  msize = put_path_length * sizeof(struct GNUNET_PeerIdentity) + data_size;
1277  if (msize + sizeof(struct PeerPutMessage)
1279  {
1280  put_path_length = 0;
1281  msize = data_size;
1282  }
1283  if (msize + sizeof(struct PeerPutMessage)
1285  {
1286  GNUNET_break(0);
1287  GNUNET_free(targets);
1288  return GNUNET_NO;
1289  }
1291  gettext_noop("# PUT messages queued for transmission"),
1292  target_count,
1293  GNUNET_NO);
1294  skip_count = 0;
1295  for (i = 0; i < target_count; i++)
1296  {
1297  target = targets[i];
1299  {
1300  /* skip */
1302  gettext_noop("# P2P messages dropped due to full queue"),
1303  1,
1304  GNUNET_NO);
1305  skip_count++;
1306  continue;
1307  }
1309  "Routing PUT for %s after %u hops to %s\n",
1310  GNUNET_h2s(key),
1311  (unsigned int)hop_count,
1312  GNUNET_i2s(target->id));
1313  env = GNUNET_MQ_msg_extra(ppm,
1314  msize,
1316  ppm->options = htonl(options);
1317  ppm->type = htonl(type);
1318  ppm->hop_count = htonl(hop_count + 1);
1319  ppm->desired_replication_level = htonl(desired_replication_level);
1320  ppm->put_path_length = htonl(put_path_length);
1321  ppm->expiration_time = GNUNET_TIME_absolute_hton(expiration_time);
1324  &target->phash));
1327  ppm->bloomfilter,
1328  DHT_BLOOM_SIZE));
1329  ppm->key = *key;
1330  pp = (struct GNUNET_PeerIdentity *)&ppm[1];
1331  GNUNET_memcpy(pp,
1332  put_path,
1333  sizeof(struct GNUNET_PeerIdentity) * put_path_length);
1334  GNUNET_memcpy(&pp[put_path_length],
1335  data,
1336  data_size);
1337  GNUNET_MQ_send(target->mq,
1338  env);
1339  }
1340  GNUNET_free(targets);
1341  return (skip_count < target_count) ? GNUNET_OK : GNUNET_NO;
1342 }
char bloomfilter[128]
Bloomfilter (for peer identities) to stop circular routes.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
struct GNUNET_GETOPT_CommandLineOption options[]
Definition: 002.c:5
#define MAXIMUM_PENDING_PER_PEER
Maximum allowed number of pending messages per peer.
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition: dht.h:34
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
struct GNUNET_HashCode phash
Hash of id.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_CONSTANTS_MAX_ENCRYPTED_MESSAGE_SIZE
What is the maximum size for encrypted messages? Note that this number imposes a clear limit on the m...
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
#define GNUNET_MQ_msg_extra(mvar, esize, type)
Allocate an envelope, with extra space allocated after the space needed by the message struct...
Definition: gnunet_mq_lib.h:52
struct GNUNET_HashCode key
The key we are storing under.
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
unsigned int GNUNET_MQ_get_length(struct GNUNET_MQ_Handle *mq)
Obtain the current length of the message queue.
Definition: mq.c:333
uint32_t hop_count
Hop count.
uint32_t desired_replication_level
Replication level for this message.
struct GNUNET_TIME_AbsoluteNBO expiration_time
When does the content expire?
struct GNUNET_HashCode key
The key used in the DHT.
Entry for a peer in a bucket.
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
int GNUNET_CONTAINER_bloomfilter_get_raw_data(const struct GNUNET_CONTAINER_BloomFilter *bf, char *data, size_t size)
Copy the raw data of this Bloom filter into the given data array.
uint32_t options
Processing options.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
The identity of the host (wraps the signing key of the peer).
uint32_t type
Content type.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
#define GNUNET_log(kind,...)
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
#define GNUNET_YES
Definition: gnunet_common.h:77
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:351
struct GNUNET_MQ_Handle * mq
Handle for sending messages to this peer.
static unsigned int get_target_peers(const struct GNUNET_HashCode *key, struct GNUNET_CONTAINER_BloomFilter *bloom, uint32_t hop_count, uint32_t target_replication, struct PeerInfo ***targets)
Compute the set of peers that the given request should be forwarded to.
uint32_t data
The data value.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_PUT
Peer is storing data in DHT.
static size_t data_size
Number of bytes in data.
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition: time.c:655
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_handle_get()

int GDS_NEIGHBOURS_handle_get ( enum GNUNET_BLOCK_Type  type,
enum GNUNET_DHT_RouteOption  options,
uint32_t  desired_replication_level,
uint32_t  hop_count,
const struct GNUNET_HashCode key,
const void *  xquery,
size_t  xquery_size,
struct GNUNET_BLOCK_Group bg,
struct GNUNET_CONTAINER_BloomFilter peer_bf 
)

Perform a GET operation.

Forwards the given request to other peers. Does not lookup the key locally. May do nothing if this is the only peer in the network (or if we are the closest peer in the network).

Parameters
typetype of the block
optionsrouting options
desired_replication_leveldesired replication count
hop_counthow many hops did this request traverse so far?
keykey for the content
xqueryextended query
xquery_sizenumber of bytes in xquery
bggroup to use for filtering replies
peer_bffilter for peers not to select (again)
Returns
GNUNET_OK if the request was forwarded, GNUNET_NO if not

Definition at line 1363 of file gnunet-service-dht_neighbours.c.

References PeerGetMessage::bf_mutator, PeerGetMessage::bloomfilter, PeerGetMessage::desired_replication_level, DHT_BLOOM_SIZE, env, GDS_stats, get_target_peers(), gettext_noop, GNUNET_assert, GNUNET_BLOCK_group_serialize(), GNUNET_break, GNUNET_CONTAINER_bloomfilter_add(), GNUNET_CONTAINER_bloomfilter_get_raw_data(), GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_free_non_null, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_MAX_MESSAGE_SIZE, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_DHT_P2P_GET, GNUNET_MQ_get_length(), GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_YES, PeerGetMessage::hop_count, PeerInfo::id, PeerPutMessage::key, PeerGetMessage::key, MAXIMUM_PENDING_PER_PEER, PeerInfo::mq, my_identity, my_identity_hash, PeerGetMessage::options, PeerInfo::phash, PeerGetMessage::type, and PeerGetMessage::xquery_size.

Referenced by handle_dht_p2p_get(), send_find_peer_message(), and transmit_request().

1372 {
1373  unsigned int target_count;
1374  struct PeerInfo **targets;
1375  struct PeerInfo *target;
1376  struct GNUNET_MQ_Envelope *env;
1377  size_t msize;
1378  struct PeerGetMessage *pgm;
1379  char *xq;
1380  size_t reply_bf_size;
1381  void *reply_bf;
1382  unsigned int skip_count;
1383  uint32_t bf_nonce;
1384 
1385  GNUNET_assert(NULL != peer_bf);
1387  gettext_noop("# GET requests routed"),
1388  1,
1389  GNUNET_NO);
1390  target_count = get_target_peers(key,
1391  peer_bf,
1392  hop_count,
1394  &targets);
1396  "Adding myself (%s) to GET bloomfilter for %s\n",
1398  GNUNET_h2s(key));
1400  &my_identity_hash);
1401  if (0 == target_count)
1402  {
1404  "Routing GET for %s terminates after %u hops at %s\n",
1405  GNUNET_h2s(key),
1406  (unsigned int)hop_count,
1408  return GNUNET_NO;
1409  }
1410  if (GNUNET_OK !=
1412  &bf_nonce,
1413  &reply_bf,
1414  &reply_bf_size))
1415  {
1416  reply_bf = NULL;
1417  reply_bf_size = 0;
1419  UINT32_MAX);
1420  }
1421  msize = xquery_size + reply_bf_size;
1422  if (msize + sizeof(struct PeerGetMessage) >= GNUNET_MAX_MESSAGE_SIZE)
1423  {
1424  GNUNET_break(0);
1425  GNUNET_free_non_null(reply_bf);
1426  GNUNET_free(targets);
1427  return GNUNET_NO;
1428  }
1430  gettext_noop("# GET messages queued for transmission"),
1431  target_count,
1432  GNUNET_NO);
1433  /* forward request */
1434  skip_count = 0;
1435  for (unsigned int i = 0; i < target_count; i++)
1436  {
1437  target = targets[i];
1439  {
1440  /* skip */
1442  gettext_noop("# P2P messages dropped due to full queue"),
1443  1, GNUNET_NO);
1444  skip_count++;
1445  continue;
1446  }
1448  "Routing GET for %s after %u hops to %s\n",
1449  GNUNET_h2s(key),
1450  (unsigned int)hop_count,
1451  GNUNET_i2s(target->id));
1452  env = GNUNET_MQ_msg_extra(pgm,
1453  msize,
1455  pgm->options = htonl(options);
1456  pgm->type = htonl(type);
1457  pgm->hop_count = htonl(hop_count + 1);
1459  pgm->xquery_size = htonl(xquery_size);
1460  pgm->bf_mutator = bf_nonce;
1463  &target->phash));
1466  pgm->bloomfilter,
1467  DHT_BLOOM_SIZE));
1468  pgm->key = *key;
1469  xq = (char *)&pgm[1];
1470  GNUNET_memcpy(xq,
1471  xquery,
1472  xquery_size);
1474  reply_bf,
1475  reply_bf_size);
1476  GNUNET_MQ_send(target->mq,
1477  env);
1478  }
1479  GNUNET_free(targets);
1480  GNUNET_free_non_null(reply_bf);
1481  return (skip_count < target_count) ? GNUNET_OK : GNUNET_NO;
1482 }
uint32_t type
Desired content type.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
uint32_t hop_count
Hop count.
struct GNUNET_GETOPT_CommandLineOption options[]
Definition: 002.c:5
#define MAXIMUM_PENDING_PER_PEER
Maximum allowed number of pending messages per peer.
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition: dht.h:34
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
#define GNUNET_free_non_null(ptr)
Free the memory pointed to by ptr if ptr is not NULL.
struct GNUNET_HashCode phash
Hash of id.
uint32_t options
Processing options.
struct GNUNET_HashCode key
The key we are looking for.
char bloomfilter[128]
Bloomfilter (for peer identities) to stop circular routes.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
uint32_t desired_replication_level
Desired replication level for this request.
#define GNUNET_MQ_msg_extra(mvar, esize, type)
Allocate an envelope, with extra space allocated after the space needed by the message struct...
Definition: gnunet_mq_lib.h:52
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
unsigned int GNUNET_MQ_get_length(struct GNUNET_MQ_Handle *mq)
Obtain the current length of the message queue.
Definition: mq.c:333
int GNUNET_BLOCK_group_serialize(struct GNUNET_BLOCK_Group *bg, uint32_t *nonce, void **raw_data, size_t *raw_data_size)
Serialize state of a block group.
Definition: block.c:179
#define GNUNET_MESSAGE_TYPE_DHT_P2P_GET
Peer tries to find data in DHT.
uint32_t bf_mutator
Bloomfilter mutator.
struct GNUNET_HashCode key
The key used in the DHT.
Entry for a peer in a bucket.
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
int GNUNET_CONTAINER_bloomfilter_get_raw_data(const struct GNUNET_CONTAINER_BloomFilter *bf, char *data, size_t size)
Copy the raw data of this Bloom filter into the given data array.
#define GNUNET_MAX_MESSAGE_SIZE
Largest supported message (to be precise, one byte more than the largest possible message...
uint32_t xquery_size
Size of the extended query.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
#define GNUNET_log(kind,...)
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
#define GNUNET_YES
Definition: gnunet_common.h:77
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:351
struct GNUNET_MQ_Handle * mq
Handle for sending messages to this peer.
static unsigned int get_target_peers(const struct GNUNET_HashCode *key, struct GNUNET_CONTAINER_BloomFilter *bloom, uint32_t hop_count, uint32_t target_replication, struct PeerInfo ***targets)
Compute the set of peers that the given request should be forwarded to.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_handle_reply()

void GDS_NEIGHBOURS_handle_reply ( const struct GNUNET_PeerIdentity target,
enum GNUNET_BLOCK_Type  type,
struct GNUNET_TIME_Absolute  expiration_time,
const struct GNUNET_HashCode key,
unsigned int  put_path_length,
const struct GNUNET_PeerIdentity put_path,
unsigned int  get_path_length,
const struct GNUNET_PeerIdentity get_path,
const void *  data,
size_t  data_size 
)

Handle a reply (route to origin).

Only forwards the reply back to the given peer. Does not do local caching or forwarding to local clients.

Parameters
targetneighbour that should receive the block (if still connected)
typetype of the block
expiration_timewhen does the content expire
keykey for the content
put_path_lengthnumber of entries in put_path
put_pathpeers the original PUT traversed (if tracked)
get_path_lengthnumber of entries in get_path
get_pathpeers this reply has traversed so far (if tracked)
datapayload of the reply
data_sizenumber of bytes in data

Definition at line 1502 of file gnunet-service-dht_neighbours.c.

References env, PeerResultMessage::expiration_time, GDS_stats, PeerResultMessage::get_path_length, gettext_noop, GNUNET_break, GNUNET_CONTAINER_multipeermap_get(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_MAX_MESSAGE_SIZE, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT, GNUNET_MQ_get_length(), GNUNET_MQ_msg_extra, GNUNET_MQ_send(), GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_hton(), PeerPutMessage::key, PeerResultMessage::key, MAXIMUM_PENDING_PER_PEER, PeerInfo::mq, pi, PeerPutMessage::put_path_length, PeerResultMessage::put_path_length, and PeerResultMessage::type.

Referenced by handle_find_peer(), handle_local_result(), and process().

1512 {
1513  struct PeerInfo *pi;
1514  struct GNUNET_MQ_Envelope *env;
1515  size_t msize;
1516  struct PeerResultMessage *prm;
1517  struct GNUNET_PeerIdentity *paths;
1518 
1519  msize = data_size + (get_path_length + put_path_length) *
1520  sizeof(struct GNUNET_PeerIdentity);
1521  if ((msize + sizeof(struct PeerResultMessage) >= GNUNET_MAX_MESSAGE_SIZE) ||
1522  (get_path_length >
1523  GNUNET_MAX_MESSAGE_SIZE / sizeof(struct GNUNET_PeerIdentity)) ||
1524  (put_path_length >
1525  GNUNET_MAX_MESSAGE_SIZE / sizeof(struct GNUNET_PeerIdentity)) ||
1527  {
1528  GNUNET_break(0);
1529  return;
1530  }
1532  target);
1533  if (NULL == pi)
1534  {
1535  /* peer disconnected in the meantime, drop reply */
1537  "No matching peer for reply for key %s\n",
1538  GNUNET_h2s(key));
1539  return;
1540  }
1542  {
1543  /* skip */
1545  gettext_noop("# P2P messages dropped due to full queue"),
1546  1,
1547  GNUNET_NO);
1549  "Peer queue full, ignoring reply for key %s\n",
1550  GNUNET_h2s(key));
1551  return;
1552  }
1553 
1555  "Forwarding reply for key %s to peer %s\n",
1556  GNUNET_h2s(key),
1557  GNUNET_i2s(target));
1559  gettext_noop
1560  ("# RESULT messages queued for transmission"), 1,
1561  GNUNET_NO);
1562  env = GNUNET_MQ_msg_extra(prm,
1563  msize,
1565  prm->type = htonl(type);
1566  prm->put_path_length = htonl(put_path_length);
1567  prm->get_path_length = htonl(get_path_length);
1568  prm->expiration_time = GNUNET_TIME_absolute_hton(expiration_time);
1569  prm->key = *key;
1570  paths = (struct GNUNET_PeerIdentity *)&prm[1];
1571  GNUNET_memcpy(paths,
1572  put_path,
1573  put_path_length * sizeof(struct GNUNET_PeerIdentity));
1574  GNUNET_memcpy(&paths[put_path_length],
1575  get_path,
1576  get_path_length * sizeof(struct GNUNET_PeerIdentity));
1577  GNUNET_memcpy(&paths[put_path_length + get_path_length],
1578  data,
1579  data_size);
1580  GNUNET_MQ_send(pi->mq,
1581  env);
1582 }
uint32_t type
Content type.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
#define MAXIMUM_PENDING_PER_PEER
Maximum allowed number of pending messages per peer.
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
uint32_t get_path_length
Length of the GET path that follows (if tracked).
#define GNUNET_NO
Definition: gnunet_common.h:78
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
static struct GNUNET_PEERINFO_Handle * pi
Handle to peerinfo service.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
#define GNUNET_MQ_msg_extra(mvar, esize, type)
Allocate an envelope, with extra space allocated after the space needed by the message struct...
Definition: gnunet_mq_lib.h:52
unsigned int GNUNET_MQ_get_length(struct GNUNET_MQ_Handle *mq)
Obtain the current length of the message queue.
Definition: mq.c:333
struct GNUNET_HashCode key
The key used in the DHT.
Entry for a peer in a bucket.
struct GNUNET_MQ_Envelope * env
Definition: 005.c:1
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
#define GNUNET_MAX_MESSAGE_SIZE
Largest supported message (to be precise, one byte more than the largest possible message...
struct GNUNET_TIME_AbsoluteNBO expiration_time
When does the content expire?
The identity of the host (wraps the signing key of the peer).
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.
#define GNUNET_log(kind,...)
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
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:351
struct GNUNET_MQ_Handle * mq
Handle for sending messages to this peer.
uint32_t data
The data value.
static size_t data_size
Number of bytes in data.
struct GNUNET_HashCode key
The key of the corresponding GET request.
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition: time.c:655
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT
Data is returned to peer from DHT.
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ core_init()

static void core_init ( void *  cls,
const struct GNUNET_PeerIdentity identity 
)
static

To be called on core init/fail.

Parameters
clsservice closure
identitythe public identity of this peer

Definition at line 1592 of file gnunet-service-dht_neighbours.c.

References GDS_service, GNUNET_CRYPTO_hash(), GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_SERVICE_resume(), identity, my_identity, and my_identity_hash.

Referenced by GDS_NEIGHBOURS_init().

1594 {
1595  (void)cls;
1597  "CORE called, I am %s\n",
1598  GNUNET_i2s(identity));
1599  my_identity = *identity;
1600  GNUNET_CRYPTO_hash(identity,
1601  sizeof(struct GNUNET_PeerIdentity),
1602  &my_identity_hash);
1604 }
void GNUNET_SERVICE_resume(struct GNUNET_SERVICE_Handle *sh)
Resume accepting connections from the listen socket.
Definition: service.c:2185
struct GNUNET_SERVICE_Handle * GDS_service
Handle for the service.
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition: crypto_hash.c:44
static struct GNUNET_IDENTITY_Handle * identity
Which namespace do we publish to? NULL if we do not publish to a namespace.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
The identity of the host (wraps the signing key of the peer).
#define GNUNET_log(kind,...)
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_dht_p2p_put()

static int check_dht_p2p_put ( void *  cls,
const struct PeerPutMessage put 
)
static

Check validity of a p2p put request.

Parameters
clsclosure with the struct PeerInfo of the sender
messagemessage
Returns
GNUNET_OK if the message is valid

Definition at line 1615 of file gnunet-service-dht_neighbours.c.

References GNUNET_break_op, GNUNET_MAX_MESSAGE_SIZE, GNUNET_OK, GNUNET_SYSERR, PeerPutMessage::header, PeerPutMessage::put_path_length, and GNUNET_MessageHeader::size.

1617 {
1618  uint32_t putlen;
1619  uint16_t msize;
1620 
1621  (void)cls;
1622  msize = ntohs(put->header.size);
1623  putlen = ntohl(put->put_path_length);
1624  if ((msize <
1625  sizeof(struct PeerPutMessage) +
1626  putlen * sizeof(struct GNUNET_PeerIdentity)) ||
1627  (putlen >
1628  GNUNET_MAX_MESSAGE_SIZE / sizeof(struct GNUNET_PeerIdentity)))
1629  {
1630  GNUNET_break_op(0);
1631  return GNUNET_SYSERR;
1632  }
1633  return GNUNET_OK;
1634 }
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_PUT.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
#define GNUNET_MAX_MESSAGE_SIZE
Largest supported message (to be precise, one byte more than the largest possible message...
The identity of the host (wraps the signing key of the peer).

◆ handle_dht_p2p_put()

static void handle_dht_p2p_put ( void *  cls,
const struct PeerPutMessage put 
)
static

Core handler for p2p put requests.

Parameters
clsclosure with the struct PeerInfo of the sender
messagemessage

Definition at line 1644 of file gnunet-service-dht_neighbours.c.

References PeerPutMessage::bloomfilter, PeerPutMessage::desired_replication_level, DHT_BLOOM_SIZE, PeerPutMessage::expiration_time, GDS_am_closest_peer(), GDS_block_context, GDS_CLIENTS_handle_reply(), GDS_CLIENTS_process_put(), GDS_DATACACHE_handle_put(), GDS_NEIGHBOURS_handle_put(), GDS_stats, gettext_noop, GNUNET_BLOCK_EO_NONE, GNUNET_BLOCK_evaluate(), GNUNET_BLOCK_EVALUATION_OK_DUPLICATE, GNUNET_BLOCK_EVALUATION_OK_LAST, GNUNET_BLOCK_EVALUATION_OK_MORE, GNUNET_BLOCK_EVALUATION_REQUEST_INVALID, GNUNET_BLOCK_EVALUATION_REQUEST_VALID, GNUNET_BLOCK_EVALUATION_RESULT_INVALID, GNUNET_BLOCK_EVALUATION_RESULT_IRRELEVANT, GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED, GNUNET_BLOCK_get_key(), GNUNET_BLOCK_TYPE_REGEX, GNUNET_break, GNUNET_break_op, GNUNET_CONSTANTS_BLOOMFILTER_K, GNUNET_CONTAINER_bloomfilter_free(), GNUNET_CONTAINER_bloomfilter_init(), GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_hash_matching_bits(), GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE, GNUNET_DHT_RO_LAST_HOP, GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_WARNING, GNUNET_free, GNUNET_h2s(), GNUNET_h2s_full(), GNUNET_i2s(), GNUNET_log, GNUNET_memcpy, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_strdup, GNUNET_STRINGS_pp2s(), GNUNET_SYSERR, GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_ntoh(), GNUNET_YES, PeerPutMessage::header, PeerPutMessage::hop_count, PeerInfo::id, PeerPutMessage::key, log_route_details_stderr, LOG_TRAFFIC, my_identity, my_identity_hash, PeerPutMessage::options, payload, peer, PeerInfo::phash, PeerPutMessage::put_path_length, GNUNET_MessageHeader::size, and PeerPutMessage::type.

1646 {
1647  struct PeerInfo *peer = cls;
1648  const struct GNUNET_PeerIdentity *put_path;
1649  const void *payload;
1650  uint32_t putlen;
1651  uint16_t msize;
1652  size_t payload_size;
1654  struct GNUNET_CONTAINER_BloomFilter *bf;
1655  struct GNUNET_HashCode test_key;
1656  int forwarded;
1657  struct GNUNET_TIME_Absolute exp_time;
1658 
1659  exp_time = GNUNET_TIME_absolute_ntoh(put->expiration_time);
1660  if (0 == GNUNET_TIME_absolute_get_remaining(exp_time).rel_value_us)
1661  {
1663  gettext_noop("# Expired PUTs discarded"),
1664  1,
1665  GNUNET_NO);
1666  return;
1667  }
1668  msize = ntohs(put->header.size);
1669  putlen = ntohl(put->put_path_length);
1671  gettext_noop("# P2P PUT requests received"),
1672  1,
1673  GNUNET_NO);
1675  gettext_noop("# P2P PUT bytes received"),
1676  msize,
1677  GNUNET_NO);
1678  put_path = (const struct GNUNET_PeerIdentity *)&put[1];
1679  payload = &put_path[putlen];
1680  options = ntohl(put->options);
1681  payload_size = msize - (sizeof(struct PeerPutMessage) +
1682  putlen * sizeof(struct GNUNET_PeerIdentity));
1683 
1685  "PUT for `%s' from %s\n",
1686  GNUNET_h2s(&put->key),
1687  GNUNET_i2s(peer->id));
1689  {
1690  char *tmp;
1691  char *pp;
1692 
1693  pp = GNUNET_STRINGS_pp2s(put_path,
1694  putlen);
1697  "R5N PUT %s: %s->%s (%u, %u=>%u, PP: %s)\n",
1698  GNUNET_h2s(&put->key),
1699  GNUNET_i2s(peer->id),
1700  tmp,
1701  ntohl(put->hop_count),
1703  &put->key),
1705  &put->key),
1706  pp);
1707  GNUNET_free(pp);
1708  GNUNET_free(tmp);
1709  }
1710  switch (GNUNET_BLOCK_get_key
1712  ntohl(put->type),
1713  payload,
1714  payload_size,
1715  &test_key))
1716  {
1717  case GNUNET_YES:
1718  if (0 != memcmp(&test_key,
1719  &put->key,
1720  sizeof(struct GNUNET_HashCode)))
1721  {
1722  char *put_s = GNUNET_strdup(GNUNET_h2s_full(&put->key));
1723 
1724  GNUNET_break_op(0);
1726  "PUT with key `%s' for block with key %s\n",
1727  put_s,
1728  GNUNET_h2s_full(&test_key));
1729  GNUNET_free(put_s);
1730  return;
1731  }
1732  break;
1733 
1734  case GNUNET_NO:
1735  GNUNET_break_op(0);
1736  return;
1737 
1738  case GNUNET_SYSERR:
1739  /* cannot verify, good luck */
1740  break;
1741  }
1742  if (ntohl(put->type) == GNUNET_BLOCK_TYPE_REGEX) /* FIXME: do for all tpyes */
1743  {
1745  ntohl(put->type),
1746  NULL, /* query group */
1748  NULL, /* query */
1749  NULL, 0, /* xquery */
1750  payload,
1751  payload_size))
1752  {
1755  break;
1756 
1763  default:
1764  GNUNET_break_op(0);
1765  return;
1766  }
1767  }
1768 
1774  &peer->phash));
1775  {
1776  struct GNUNET_PeerIdentity pp[putlen + 1];
1777 
1778  /* extend 'put path' by sender */
1779  if (0 != (options & GNUNET_DHT_RO_RECORD_ROUTE))
1780  {
1781 #if SANITY_CHECKS
1782  for (unsigned int i = 0; i <= putlen; i++)
1783  {
1784  for (unsigned int j = 0; j < i; j++)
1785  {
1786  GNUNET_break(0 != memcmp(&pp[i],
1787  &pp[j],
1788  sizeof(struct GNUNET_PeerIdentity)));
1789  }
1790  GNUNET_break(0 != memcmp(&pp[i],
1791  peer->id,
1792  sizeof(struct GNUNET_PeerIdentity)));
1793  }
1794 #endif
1795  GNUNET_memcpy(pp,
1796  put_path,
1797  putlen * sizeof(struct GNUNET_PeerIdentity));
1798  pp[putlen] = *peer->id;
1799  putlen++;
1800  }
1801  else
1802  putlen = 0;
1803 
1804  /* give to local clients */
1805  GDS_CLIENTS_handle_reply(exp_time,
1806  &put->key,
1807  0,
1808  NULL,
1809  putlen,
1810  pp,
1811  ntohl(put->type),
1812  payload_size,
1813  payload);
1814  /* store locally */
1815  if ((0 != (options & GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE)) ||
1816  (GDS_am_closest_peer(&put->key, bf)))
1817  GDS_DATACACHE_handle_put(exp_time,
1818  &put->key,
1819  putlen,
1820  pp,
1821  ntohl(put->type),
1822  payload_size,
1823  payload);
1824  /* route to other peers */
1825  forwarded = GDS_NEIGHBOURS_handle_put(ntohl(put->type),
1826  options,
1827  ntohl(put->desired_replication_level),
1828  exp_time,
1829  ntohl(put->hop_count),
1830  bf,
1831  &put->key,
1832  putlen,
1833  pp,
1834  payload,
1835  payload_size);
1836  /* notify monitoring clients */
1837  GDS_CLIENTS_process_put(options
1838  | ((GNUNET_OK == forwarded)
1840  : 0),
1841  ntohl(put->type),
1842  ntohl(put->hop_count),
1843  ntohl(put->desired_replication_level),
1844  putlen, pp,
1845  exp_time,
1846  &put->key,
1847  payload,
1848  payload_size);
1849  }
1851 }
Block does not match query (invalid result)
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_init(const char *data, size_t size, unsigned int k)
Create a Bloom filter from raw bits.
char bloomfilter[128]
Bloomfilter (for peer identities) to stop circular routes.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
We should keep track of the route that the message took in the P2P network.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_ntoh(struct GNUNET_TIME_AbsoluteNBO a)
Convert absolute time from network byte order.
Definition: time.c:671
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
struct GNUNET_GETOPT_CommandLineOption options[]
Definition: 002.c:5
unsigned int GNUNET_CRYPTO_hash_matching_bits(const struct GNUNET_HashCode *first, const struct GNUNET_HashCode *second)
Determine how many low order bits match in two struct GNUNET_HashCodes.
Definition: crypto_hash.c:256
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition: dht.h:34
#define GNUNET_CONSTANTS_BLOOMFILTER_K
K-value that must be used for the bloom filters in &#39;GET&#39; queries.
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
Block does not match xquery (valid result, not relevant for the request)
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
struct GNUNET_HashCode phash
Hash of id.
Default behavior.
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
void GDS_CLIENTS_process_put(uint32_t options, enum GNUNET_BLOCK_Type type, uint32_t hop_count, uint32_t desired_replication_level, unsigned int path_length, const struct GNUNET_PeerIdentity *path, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const void *data, size_t size)
Check if some client is monitoring PUT messages and notify them in that case.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
int GNUNET_BLOCK_get_key(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, const void *block, size_t block_size, struct GNUNET_HashCode *key)
Function called to obtain the key for a block.
Definition: block.c:377
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
struct GNUNET_BLOCK_Context * GDS_block_context
Our handle to the BLOCK library.
Flag given to monitors if this was the last hop for a GET/PUT.
struct GNUNET_HashCode key
The key we are storing under.
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
Valid result, but suppressed because it is a duplicate.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
char * GNUNET_STRINGS_pp2s(const struct GNUNET_PeerIdentity *pids, unsigned int num_pids)
Convert a peer path to a human-readable string.
Definition: strings.c:100
enum GNUNET_BLOCK_EvaluationResult GNUNET_BLOCK_evaluate(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, struct GNUNET_BLOCK_Group *group, enum GNUNET_BLOCK_EvaluationOptions eo, const struct GNUNET_HashCode *query, const void *xquery, size_t xquery_size, const void *reply_block, size_t reply_block_size)
Function called to validate a reply or a request.
Definition: block.c:337
void GDS_DATACACHE_handle_put(struct GNUNET_TIME_Absolute expiration, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
Handle a datum we&#39;ve received from another peer.
int GDS_am_closest_peer(const struct GNUNET_HashCode *key, const struct GNUNET_CONTAINER_BloomFilter *bloom)
Check whether my identity is closer than any known peers.
Last possible valid result.
uint32_t hop_count
Hop count.
A 512-bit hashcode.
GNUNET_DHT_RouteOption
Options for routing.
uint32_t desired_replication_level
Replication level for this message.
struct GNUNET_TIME_AbsoluteNBO expiration_time
When does the content expire?
Valid result, and there may be more.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_PUT.
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
Entry for a peer in a bucket.
const char * GNUNET_h2s_full(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
static unsigned long long payload
How much data are we currently storing in the database?
Specified block type not supported by this plugin.
uint32_t options
Processing options.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
The identity of the host (wraps the signing key of the peer).
uint32_t type
Content type.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
Query format does not match block type (invalid query).
#define GNUNET_log(kind,...)
#define LOG_TRAFFIC(kind,...)
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_remaining(struct GNUNET_TIME_Absolute future)
Given a timestamp in the future, how much time remains until then?
Definition: time.c:331
Time for absolute times used by GNUnet, in microseconds.
#define GNUNET_YES
Definition: gnunet_common.h:77
static int log_route_details_stderr
Should routing details be logged to stderr (for debugging)?
Block to store a cadet regex state.
Query is valid, no reply given.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
void GNUNET_CONTAINER_bloomfilter_free(struct GNUNET_CONTAINER_BloomFilter *bf)
Free the space associcated with a filter in memory, flush to drive if needed (do not free the space o...
Each peer along the way should look at &#39;enc&#39; (otherwise only the k-peers closest to the key should lo...
void GDS_CLIENTS_handle_reply(struct GNUNET_TIME_Absolute expiration, const struct GNUNET_HashCode *key, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
Handle a reply we&#39;ve received from another peer.
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
int GDS_NEIGHBOURS_handle_put(enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint32_t desired_replication_level, struct GNUNET_TIME_Absolute expiration_time, uint32_t hop_count, struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *key, unsigned int put_path_length, struct GNUNET_PeerIdentity *put_path, const void *data, size_t data_size)
Perform a PUT operation.
Here is the call graph for this function:

◆ handle_find_peer()

static void handle_find_peer ( const struct GNUNET_PeerIdentity sender,
const struct GNUNET_HashCode key,
struct GNUNET_BLOCK_Group bg 
)
static

We have received a FIND PEER request.

Send matching HELLOs back.

Parameters
sendersender of the FIND PEER request
keypeers close to this key are desired
bggroup for filtering peers

Definition at line 1863 of file gnunet-service-dht_neighbours.c.

References closest_bucket, find_bucket(), GDS_block_context, GDS_HELLO_get(), GDS_my_hello, GDS_NEIGHBOURS_handle_reply(), GDS_stats, gettext_noop, GNUNET_assert, GNUNET_BLOCK_EO_LOCAL_SKIP_CRYPTO, GNUNET_BLOCK_evaluate(), GNUNET_BLOCK_EVALUATION_OK_MORE, GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_break, GNUNET_CONSTANTS_HELLO_ADDRESS_EXPIRATION, GNUNET_CRYPTO_QUALITY_WEAK, GNUNET_CRYPTO_random_u32(), GNUNET_HELLO_size(), GNUNET_MIN, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_TIME_relative_to_absolute(), PeerBucket::head, hello_expiration, PeerInfo::id, k_buckets, my_identity_hash, PeerInfo::next, peer, PeerBucket::peers_size, and PeerInfo::phash.

Referenced by handle_dht_p2p_get().

1866 {
1867  int bucket_idx;
1868  struct PeerBucket *bucket;
1869  struct PeerInfo *peer;
1870  unsigned int choice;
1871  const struct GNUNET_HELLO_Message *hello;
1872  size_t hello_size;
1873 
1874  /* first, check about our own HELLO */
1875  if (NULL != GDS_my_hello)
1876  {
1877  hello_size = GNUNET_HELLO_size((const struct GNUNET_HELLO_Message *)GDS_my_hello);
1878  GNUNET_break(hello_size >= sizeof(struct GNUNET_MessageHeader));
1882  bg,
1885  NULL, 0,
1886  GDS_my_hello,
1887  hello_size))
1888  {
1892  key,
1893  0,
1894  NULL,
1895  0,
1896  NULL,
1897  GDS_my_hello,
1898  hello_size);
1899  }
1900  else
1901  {
1903  gettext_noop("# FIND PEER requests ignored due to Bloomfilter"),
1904  1,
1905  GNUNET_NO);
1906  }
1907  }
1908  else
1909  {
1911  gettext_noop("# FIND PEER requests ignored due to lack of HELLO"),
1912  1,
1913  GNUNET_NO);
1914  }
1915 
1916  /* then, also consider sending a random HELLO from the closest bucket */
1917  if (0 == memcmp(&my_identity_hash,
1918  key,
1919  sizeof(struct GNUNET_HashCode)))
1920  bucket_idx = closest_bucket;
1921  else
1922  bucket_idx = GNUNET_MIN((int)closest_bucket,
1923  find_bucket(key));
1924  if (bucket_idx < 0)
1925  return;
1926  bucket = &k_buckets[bucket_idx];
1927  if (bucket->peers_size == 0)
1928  return;
1930  bucket->peers_size);
1931  peer = bucket->head;
1932  while (choice > 0)
1933  {
1934  GNUNET_assert(NULL != peer);
1935  peer = peer->next;
1936  choice--;
1937  }
1938  choice = bucket->peers_size;
1939  do
1940  {
1941  peer = peer->next;
1942  if (0 == choice--)
1943  return; /* no non-masked peer available */
1944  if (NULL == peer)
1945  peer = bucket->head;
1946  hello = GDS_HELLO_get(peer->id);
1947  }
1948  while ((NULL == hello) ||
1952  bg,
1954  &peer->phash,
1955  NULL, 0,
1956  hello,
1957  (hello_size = GNUNET_HELLO_size(hello)))));
1962  key,
1963  0,
1964  NULL,
1965  0,
1966  NULL,
1967  hello,
1968  hello_size);
1969 }
static unsigned int closest_bucket
The lowest currently used bucket, initially 0 (for 0-bits matching bucket).
struct GNUNET_MessageHeader * GDS_my_hello
Our HELLO.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
A HELLO message is used to exchange information about transports with other peers.
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
struct PeerInfo * next
Next peer entry (DLL)
struct GNUNET_TIME_Absolute GNUNET_TIME_relative_to_absolute(struct GNUNET_TIME_Relative rel)
Convert relative time to an absolute time in the future.
Definition: time.c:246
uint32_t GNUNET_CRYPTO_random_u32(enum GNUNET_CRYPTO_Quality mode, uint32_t i)
Produce a random value.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
struct PeerInfo * head
Head of DLL.
static int find_bucket(const struct GNUNET_HashCode *hc)
Find the optimal bucket for this key.
#define GNUNET_CONSTANTS_HELLO_ADDRESS_EXPIRATION
After how long do we expire an address in a HELLO that we just validated? This value is also used for...
unsigned int peers_size
Number of peers in the bucket.
#define GNUNET_NO
Definition: gnunet_common.h:78
struct GNUNET_HashCode phash
Hash of id.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
struct GNUNET_BLOCK_Context * GDS_block_context
Our handle to the BLOCK library.
enum GNUNET_BLOCK_EvaluationResult GNUNET_BLOCK_evaluate(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, struct GNUNET_BLOCK_Group *group, enum GNUNET_BLOCK_EvaluationOptions eo, const struct GNUNET_HashCode *query, const void *xquery, size_t xquery_size, const void *reply_block, size_t reply_block_size)
Function called to validate a reply or a request.
Definition: block.c:337
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:80
Type of a block that contains a HELLO for a peer (for DHT and CADET find-peer operations).
A 512-bit hashcode.
The block is obtained from the local database, skip cryptographic checks.
Peers are grouped into buckets.
Valid result, and there may be more.
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
Entry for a peer in a bucket.
struct GNUNET_TIME_Relative hello_expiration
Hello address expiration.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
const struct GNUNET_HELLO_Message * GDS_HELLO_get(const struct GNUNET_PeerIdentity *peer)
Obtain a peer&#39;s HELLO if available.
uint16_t GNUNET_HELLO_size(const struct GNUNET_HELLO_Message *hello)
Return the size of the given HELLO message.
Definition: hello.c:643
Header for all communications.
void GDS_NEIGHBOURS_handle_reply(const struct GNUNET_PeerIdentity *target, enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
Handle a reply (route to origin).
No good quality of the operation is needed (i.e., random numbers can be pseudo-random).
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_local_result()

static void handle_local_result ( void *  cls,
enum GNUNET_BLOCK_Type  type,
struct GNUNET_TIME_Absolute  expiration_time,
const struct GNUNET_HashCode key,
unsigned int  put_path_length,
const struct GNUNET_PeerIdentity put_path,
unsigned int  get_path_length,
const struct GNUNET_PeerIdentity get_path,
const void *  data,
size_t  data_size 
)
static

Handle a result from local datacache for a GET operation.

Parameters
clsthe struct PeerInfo for which this is a reply
typetype of the block
expiration_timewhen does the content expire
keykey for the content
put_path_lengthnumber of entries in put_path
put_pathpeers the original PUT traversed (if tracked)
get_path_lengthnumber of entries in get_path
get_pathpeers this reply has traversed so far (if tracked)
datapayload of the reply
data_sizenumber of bytes in data

Definition at line 1987 of file gnunet-service-dht_neighbours.c.

References GDS_NEIGHBOURS_handle_reply(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_log, GNUNET_STRINGS_pp2s(), PeerInfo::id, and peer.

Referenced by handle_dht_p2p_get().

1997 {
1998  struct PeerInfo *peer = cls;
1999  char *pp;
2000 
2001  pp = GNUNET_STRINGS_pp2s(put_path,
2002  put_path_length);
2004  "Found local result for %s (PP: %s)\n",
2005  GNUNET_h2s(key),
2006  pp);
2007  GNUNET_free(pp);
2009  type,
2010  expiration_time,
2011  key,
2012  put_path_length, put_path,
2013  get_path_length, get_path,
2014  data, data_size);
2015 }
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
char * GNUNET_STRINGS_pp2s(const struct GNUNET_PeerIdentity *pids, unsigned int num_pids)
Convert a peer path to a human-readable string.
Definition: strings.c:100
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
Entry for a peer in a bucket.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
#define GNUNET_log(kind,...)
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
uint32_t data
The data value.
static size_t data_size
Number of bytes in data.
void GDS_NEIGHBOURS_handle_reply(const struct GNUNET_PeerIdentity *target, enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
Handle a reply (route to origin).
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ check_dht_p2p_get()

static int check_dht_p2p_get ( void *  cls,
const struct PeerGetMessage get 
)
static

Check validity of p2p get request.

Parameters
clsclosure with the struct PeerInfo of the sender
getthe message
Returns
GNUNET_OK if the message is well-formed

Definition at line 2026 of file gnunet-service-dht_neighbours.c.

References GNUNET_break_op, GNUNET_OK, and GNUNET_SYSERR.

2028 {
2029  uint32_t xquery_size;
2030  uint16_t msize;
2031 
2032  (void)cls;
2033  msize = ntohs(get->header.size);
2034  xquery_size = ntohl(get->xquery_size);
2035  if (msize < sizeof(struct PeerGetMessage) + xquery_size)
2036  {
2037  GNUNET_break_op(0);
2038  return GNUNET_SYSERR;
2039  }
2040  return GNUNET_OK;
2041 }
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_GET.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
uint32_t xquery_size
Size of the extended query.

◆ handle_dht_p2p_get()

static void handle_dht_p2p_get ( void *  cls,
const struct PeerGetMessage get 
)
static

Core handler for p2p get requests.

Parameters
clsclosure with the struct PeerInfo of the sender
getthe message

Definition at line 2051 of file gnunet-service-dht_neighbours.c.

References DHT_BLOOM_SIZE, GDS_am_closest_peer(), GDS_block_context, GDS_CLIENTS_process_get(), GDS_DATACACHE_handle_get(), GDS_NEIGHBOURS_handle_get(), GDS_ROUTING_add(), GDS_stats, gettext_noop, GNUNET_BLOCK_EO_NONE, GNUNET_BLOCK_evaluate(), GNUNET_BLOCK_EVALUATION_OK_LAST, GNUNET_BLOCK_EVALUATION_REQUEST_VALID, GNUNET_BLOCK_EVALUATION_TYPE_NOT_SUPPORTED, GNUNET_BLOCK_group_create(), GNUNET_break_op, GNUNET_CONSTANTS_BLOOMFILTER_K, GNUNET_CONTAINER_bloomfilter_free(), GNUNET_CONTAINER_bloomfilter_init(), GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_hash_matching_bits(), GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE, GNUNET_DHT_RO_FIND_PEER, GNUNET_DHT_RO_LAST_HOP, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_strdup, GNUNET_YES, handle_find_peer(), handle_local_result(), PeerInfo::id, log_route_details_stderr, LOG_TRAFFIC, my_identity, my_identity_hash, PeerPutMessage::options, peer, PeerInfo::phash, and PeerPutMessage::type.

2053 {
2054  struct PeerInfo *peer = cls;
2055  uint32_t xquery_size;
2056  size_t reply_bf_size;
2057  uint16_t msize;
2058  enum GNUNET_BLOCK_Type type;
2061  struct GNUNET_BLOCK_Group *bg;
2062  struct GNUNET_CONTAINER_BloomFilter *peer_bf;
2063  const char *xquery;
2064  int forwarded;
2065 
2066  /* parse and validate message */
2067  msize = ntohs(get->header.size);
2068  xquery_size = ntohl(get->xquery_size);
2069  reply_bf_size = msize - (sizeof(struct PeerGetMessage) + xquery_size);
2070  type = ntohl(get->type);
2071  options = ntohl(get->options);
2072  xquery = (const char *)&get[1];
2074  gettext_noop("# P2P GET requests received"),
2075  1,
2076  GNUNET_NO);
2078  gettext_noop("# P2P GET bytes received"),
2079  msize,
2080  GNUNET_NO);
2082  {
2083  char *tmp;
2084 
2087  "R5N GET %s: %s->%s (%u, %u=>%u) xq: %.*s\n",
2088  GNUNET_h2s(&get->key),
2089  GNUNET_i2s(peer->id),
2090  tmp,
2091  ntohl(get->hop_count),
2093  &get->key),
2095  &get->key),
2096  ntohl(get->xquery_size),
2097  xquery);
2098  GNUNET_free(tmp);
2099  }
2100  eval
2102  type,
2103  NULL,
2105  &get->key,
2106  xquery,
2107  xquery_size,
2108  NULL,
2109  0);
2111  {
2112  /* request invalid or block type not supported */
2114  return;
2115  }
2121  &peer->phash));
2123  type,
2124  get->bf_mutator,
2125  &xquery[xquery_size],
2126  reply_bf_size,
2127  "filter-size",
2128  reply_bf_size,
2129  NULL);
2131  "GET for %s at %s after %u hops\n",
2132  GNUNET_h2s(&get->key),
2134  (unsigned int)ntohl(get->hop_count));
2135  /* local lookup (this may update the reply_bf) */
2136  if ((0 != (options & GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE)) ||
2137  (GDS_am_closest_peer(&get->key,
2138  peer_bf)))
2139  {
2140  if ((0 != (options & GNUNET_DHT_RO_FIND_PEER)))
2141  {
2143  gettext_noop("# P2P FIND PEER requests processed"),
2144  1,
2145  GNUNET_NO);
2146  handle_find_peer(peer->id,
2147  &get->key,
2148  bg);
2149  }
2150  else
2151  {
2152  eval = GDS_DATACACHE_handle_get(&get->key,
2153  type,
2154  xquery,
2155  xquery_size,
2156  bg,
2158  peer);
2159  }
2160  }
2161  else
2162  {
2164  gettext_noop("# P2P GET requests ONLY routed"),
2165  1,
2166  GNUNET_NO);
2167  }
2168 
2169  /* remember request for routing replies */
2170  GDS_ROUTING_add(peer->id,
2171  type,
2172  bg, /* bg now owned by routing, but valid at least until end of this function! */
2173  options,
2174  &get->key,
2175  xquery,
2176  xquery_size);
2177 
2178  /* P2P forwarding */
2179  forwarded = GNUNET_NO;
2180  if (eval != GNUNET_BLOCK_EVALUATION_OK_LAST)
2181  forwarded = GDS_NEIGHBOURS_handle_get(type,
2182  options,
2183  ntohl(get->desired_replication_level),
2184  ntohl(get->hop_count),
2185  &get->key,
2186  xquery,
2187  xquery_size,
2188  bg,
2189  peer_bf);
2190  GDS_CLIENTS_process_get(options
2191  | (GNUNET_OK == forwarded)
2192  ? GNUNET_DHT_RO_LAST_HOP : 0,
2193  type,
2194  ntohl(get->hop_count),
2195  ntohl(get->desired_replication_level),
2196  0,
2197  NULL,
2198  &get->key);
2199 
2200  /* clean up; note that 'bg' is owned by routing now! */
2202 }
struct GNUNET_CONTAINER_BloomFilter * GNUNET_CONTAINER_bloomfilter_init(const char *data, size_t size, unsigned int k)
Create a Bloom filter from raw bits.
uint32_t type
Desired content type.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_GET.
uint32_t hop_count
Hop count.
struct GNUNET_GETOPT_CommandLineOption options[]
Definition: 002.c:5
GNUNET_BLOCK_Type
Blocks in the datastore and the datacache must have a unique type.
unsigned int GNUNET_CRYPTO_hash_matching_bits(const struct GNUNET_HashCode *first, const struct GNUNET_HashCode *second)
Determine how many low order bits match in two struct GNUNET_HashCodes.
Definition: crypto_hash.c:256
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition: dht.h:34
#define GNUNET_CONSTANTS_BLOOMFILTER_K
K-value that must be used for the bloom filters in &#39;GET&#39; queries.
static void handle_find_peer(const struct GNUNET_PeerIdentity *sender, const struct GNUNET_HashCode *key, struct GNUNET_BLOCK_Group *bg)
We have received a FIND PEER request.
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
struct GNUNET_HashCode phash
Hash of id.
uint32_t options
Processing options.
struct GNUNET_HashCode key
The key we are looking for.
Default behavior.
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
char bloomfilter[128]
Bloomfilter (for peer identities) to stop circular routes.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
void GDS_CLIENTS_process_get(uint32_t options, enum GNUNET_BLOCK_Type type, uint32_t hop_count, uint32_t desired_replication_level, unsigned int path_length, const struct GNUNET_PeerIdentity *path, const struct GNUNET_HashCode *key)
Check if some client is monitoring GET messages and notify them in that case.
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
struct GNUNET_HashCode my_identity_hash
Hash of the identity of this peer.
uint32_t desired_replication_level
Desired replication level for this request.
struct GNUNET_BLOCK_Context * GDS_block_context
Our handle to the BLOCK library.
Flag given to monitors if this was the last hop for a GET/PUT.
This is a &#39;FIND-PEER&#39; request, so approximate results are fine.
int GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
enum GNUNET_BLOCK_EvaluationResult GNUNET_BLOCK_evaluate(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, struct GNUNET_BLOCK_Group *group, enum GNUNET_BLOCK_EvaluationOptions eo, const struct GNUNET_HashCode *query, const void *xquery, size_t xquery_size, const void *reply_block, size_t reply_block_size)
Function called to validate a reply or a request.
Definition: block.c:337
int GDS_am_closest_peer(const struct GNUNET_HashCode *key, const struct GNUNET_CONTAINER_BloomFilter *bloom)
Check whether my identity is closer than any known peers.
Last possible valid result.
GNUNET_DHT_RouteOption
Options for routing.
static void handle_local_result(void *cls, enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
Handle a result from local datacache for a GET operation.
uint32_t bf_mutator
Bloomfilter mutator.
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
Entry for a peer in a bucket.
GNUNET_BLOCK_EvaluationResult
Possible ways for how a block may relate to a query.
struct GNUNET_BLOCK_Group * GNUNET_BLOCK_group_create(struct GNUNET_BLOCK_Context *ctx, enum GNUNET_BLOCK_Type type, uint32_t nonce, const void *raw_data, size_t raw_data_size,...)
Create a new block group.
Definition: block.c:288
uint32_t xquery_size
Size of the extended query.
int GDS_NEIGHBOURS_handle_get(enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint32_t desired_replication_level, uint32_t hop_count, const struct GNUNET_HashCode *key, const void *xquery, size_t xquery_size, struct GNUNET_BLOCK_Group *bg, struct GNUNET_CONTAINER_BloomFilter *peer_bf)
Perform a GET operation.
Specified block type not supported by this plugin.
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
#define GNUNET_log(kind,...)
Block group data.
#define LOG_TRAFFIC(kind,...)
enum GNUNET_BLOCK_EvaluationResult GDS_DATACACHE_handle_get(const struct GNUNET_HashCode *key, enum GNUNET_BLOCK_Type type, const void *xquery, size_t xquery_size, struct GNUNET_BLOCK_Group *bg, GDS_DATACACHE_GetCallback gc, void *gc_cls)
Handle a GET request we&#39;ve received from another peer.
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
void GDS_ROUTING_add(const struct GNUNET_PeerIdentity *sender, enum GNUNET_BLOCK_Type type, struct GNUNET_BLOCK_Group *bg, enum GNUNET_DHT_RouteOption options, const struct GNUNET_HashCode *key, const void *xquery, size_t xquery_size)
Add a new entry to our routing table.
#define GNUNET_YES
Definition: gnunet_common.h:77
static int log_route_details_stderr
Should routing details be logged to stderr (for debugging)?
Query is valid, no reply given.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
void GNUNET_CONTAINER_bloomfilter_free(struct GNUNET_CONTAINER_BloomFilter *bf)
Free the space associcated with a filter in memory, flush to drive if needed (do not free the space o...
Each peer along the way should look at &#39;enc&#39; (otherwise only the k-peers closest to the key should lo...
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:

◆ check_dht_p2p_result()

static int check_dht_p2p_result ( void *  cls,
const struct PeerResultMessage prm 
)
static

Check validity of p2p result message.

Parameters
clsclosure
messagemessage
Returns
GNUNET_YES if the message is well-formed

Definition at line 2213 of file gnunet-service-dht_neighbours.c.

References PeerResultMessage::get_path_length, GNUNET_break_op, GNUNET_MAX_MESSAGE_SIZE, GNUNET_OK, GNUNET_SYSERR, PeerResultMessage::header, PeerPutMessage::put_path_length, PeerResultMessage::put_path_length, and GNUNET_MessageHeader::size.

2215 {
2216  uint32_t get_path_length;
2217  uint32_t put_path_length;
2218  uint16_t msize;
2219 
2220  (void)cls;
2221  msize = ntohs(prm->header.size);
2222  put_path_length = ntohl(prm->put_path_length);
2223  get_path_length = ntohl(prm->get_path_length);
2224  if ((msize <
2225  sizeof(struct PeerResultMessage) + (get_path_length +
2226  put_path_length) *
2227  sizeof(struct GNUNET_PeerIdentity)) ||
2228  (get_path_length >
2229  GNUNET_MAX_MESSAGE_SIZE / sizeof(struct GNUNET_PeerIdentity)) ||
2230  (put_path_length >
2231  GNUNET_MAX_MESSAGE_SIZE / sizeof(struct GNUNET_PeerIdentity)))
2232  {
2233  GNUNET_break_op(0);
2234  return GNUNET_SYSERR;
2235  }
2236  return GNUNET_OK;
2237 }
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
uint32_t get_path_length
Length of the GET path that follows (if tracked).
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
#define GNUNET_MAX_MESSAGE_SIZE
Largest supported message (to be precise, one byte more than the largest possible message...
The identity of the host (wraps the signing key of the peer).

◆ process_reply_with_path()

static void process_reply_with_path ( struct GNUNET_TIME_Absolute  expiration_time,
const struct GNUNET_HashCode key,
unsigned int  get_path_length,
const struct GNUNET_PeerIdentity get_path,
unsigned int  put_path_length,
const struct GNUNET_PeerIdentity put_path,
enum GNUNET_BLOCK_Type  type,
size_t  data_size,
const void *  data 
)
static

Process a reply, after the get_path has been updated.

Parameters
expiration_timewhen does the reply expire
keykey matching the query
get_path_lengthnumber of entries in get_path
get_pathpath the reply has taken
put_path_lengthnumber of entries in put_path
put_pathpath the PUT has taken
typetype of the block
data_sizenumber of bytes in data
datapayload of the reply

Definition at line 2254 of file gnunet-service-dht_neighbours.c.

References cache_results, GDS_CLIENTS_handle_reply(), GDS_CLIENTS_process_get_resp(), GDS_DATACACHE_handle_put(), GDS_ROUTING_process(), GNUNET_memcpy, and GNUNET_YES.

Referenced by handle_dht_p2p_result().

2263 {
2264  /* forward to local clients */
2265  GDS_CLIENTS_handle_reply(expiration_time,
2266  key,
2267  get_path_length,
2268  get_path,
2269  put_path_length,
2270  put_path,
2271  type,
2272  data_size,
2273  data);
2275  get_path,
2276  get_path_length,
2277  put_path,
2278  put_path_length,
2279  expiration_time,
2280  key,
2281  data,
2282  data_size);
2283  if (GNUNET_YES == cache_results)
2284  {
2285  struct GNUNET_PeerIdentity xput_path[get_path_length + 1 + put_path_length];
2286 
2287  GNUNET_memcpy(xput_path,
2288  put_path,
2289  put_path_length * sizeof(struct GNUNET_PeerIdentity));
2290  GNUNET_memcpy(&xput_path[put_path_length],
2291  get_path,
2292  get_path_length * sizeof(struct GNUNET_PeerIdentity));
2293 
2294  GDS_DATACACHE_handle_put(expiration_time,
2295  key,
2296  get_path_length + put_path_length,
2297  xput_path,
2298  type,
2299  data_size,
2300  data);
2301  }
2302  /* forward to other peers */
2304  expiration_time,
2305  key,
2306  put_path_length,
2307  put_path,
2308  get_path_length,
2309  get_path,
2310  data,
2311  data_size);
2312 }
static int cache_results
Do we cache all results that we are routing in the local datacache?
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
void GDS_DATACACHE_handle_put(struct GNUNET_TIME_Absolute expiration, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
Handle a datum we&#39;ve received from another peer.
void GDS_CLIENTS_process_get_resp(enum GNUNET_BLOCK_Type type, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const void *data, size_t size)
Check if some client is monitoring GET RESP messages and notify them in that case.
void GDS_ROUTING_process(enum GNUNET_BLOCK_Type type, struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, const void *data, size_t data_size)
Handle a reply (route to origin).
The identity of the host (wraps the signing key of the peer).
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
#define GNUNET_YES
Definition: gnunet_common.h:77
uint32_t data
The data value.
static size_t data_size
Number of bytes in data.
void GDS_CLIENTS_handle_reply(struct GNUNET_TIME_Absolute expiration, const struct GNUNET_HashCode *key, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
Handle a reply we&#39;ve received from another peer.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ handle_dht_p2p_result()

static void handle_dht_p2p_result ( void *  cls,
const struct PeerResultMessage prm 
)
static

Core handler for p2p result messages.

Parameters
clsclosure
messagemessage

Definition at line 2322 of file gnunet-service-dht_neighbours.c.

References data, data_size, disable_try_connect, PeerResultMessage::expiration_time, GDS_stats, PeerResultMessage::get_path_length, gettext_noop, GNUNET_BLOCK_TYPE_DHT_HELLO, GNUNET_break_op, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_HELLO_get_id(), GNUNET_i2s(), GNUNET_memcpy, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_strdup, GNUNET_STRINGS_pp2s(), GNUNET_TIME_absolute_get_remaining(), GNUNET_TIME_absolute_ntoh(), GNUNET_YES, h, PeerResultMessage::header, PeerInfo::id, PeerResultMessage::key, log_route_details_stderr, LOG_TRAFFIC, my_identity, peer, process_reply_with_path(), PeerPutMessage::put_path_length, PeerResultMessage::put_path_length, GNUNET_MessageHeader::size, try_connect(), PeerPutMessage::type, and PeerResultMessage::type.

2324 {
2325  struct PeerInfo *peer = cls;
2326  const struct GNUNET_PeerIdentity *put_path;
2327  const struct GNUNET_PeerIdentity *get_path;
2328  const void *data;
2329  uint32_t get_path_length;
2330  uint32_t put_path_length;
2331  uint16_t msize;
2332  size_t data_size;
2333  enum GNUNET_BLOCK_Type type;
2334  struct GNUNET_TIME_Absolute exp_time;
2335 
2336  /* parse and validate message */
2337  exp_time = GNUNET_TIME_absolute_ntoh(prm->expiration_time);
2338  if (0 == GNUNET_TIME_absolute_get_remaining(exp_time).rel_value_us)
2339  {
2341  gettext_noop("# Expired results discarded"),
2342  1,
2343  GNUNET_NO);
2344  return;
2345  }
2346  msize = ntohs(prm->header.size);
2347  put_path_length = ntohl(prm->put_path_length);
2348  get_path_length = ntohl(prm->get_path_length);
2349  put_path = (const struct GNUNET_PeerIdentity *)&prm[1];
2350  get_path = &put_path[put_path_length];
2351  type = ntohl(prm->type);
2352  data = (const void *)&get_path[get_path_length];
2353  data_size = msize - (sizeof(struct PeerResultMessage) +
2354  (get_path_length +
2355  put_path_length) * sizeof(struct GNUNET_PeerIdentity));
2357  gettext_noop("# P2P RESULTS received"),
2358  1,
2359  GNUNET_NO);
2361  gettext_noop("# P2P RESULT bytes received"),
2362  msize,
2363  GNUNET_NO);
2365  {
2366  char *tmp;
2367  char *pp;
2368  char *gp;
2369 
2370  gp = GNUNET_STRINGS_pp2s(get_path,
2371  get_path_length);
2372  pp = GNUNET_STRINGS_pp2s(put_path,
2373  put_path_length);
2376  "R5N RESULT %s: %s->%s (GP: %s, PP: %s)\n",
2377  GNUNET_h2s(&prm->key),
2378  GNUNET_i2s(peer->id),
2379  tmp,
2380  gp,
2381  pp);
2382  GNUNET_free(gp);
2383  GNUNET_free(pp);
2384  GNUNET_free(tmp);
2385  }
2386  /* if we got a HELLO, consider it for our own routing table */
2387  if (GNUNET_BLOCK_TYPE_DHT_HELLO == type)
2388  {
2389  const struct GNUNET_MessageHeader *h;
2390  struct GNUNET_PeerIdentity pid;
2391 
2392  /* Should be a HELLO, validate and consider using it! */
2393  if (data_size < sizeof(struct GNUNET_HELLO_Message))
2394  {
2395  GNUNET_break_op(0);
2396  return;
2397  }
2398  h = data;
2399  if (data_size != ntohs(h->size))
2400  {
2401  GNUNET_break_op(0);
2402  return;
2403  }
2404  if (GNUNET_OK !=
2405  GNUNET_HELLO_get_id((const struct GNUNET_HELLO_Message *)h,
2406  &pid))
2407  {
2408  GNUNET_break_op(0);
2409  return;
2410  }
2411  if ((GNUNET_YES != disable_try_connect) &&
2412  (0 != memcmp(&my_identity,
2413  &pid,
2414  sizeof(struct GNUNET_PeerIdentity))))
2415  try_connect(&pid,
2416  h);
2417  }
2418 
2419  /* First, check if 'peer' is already on the path, and if
2420  so, truncate it instead of expanding. */
2421  for (unsigned int i = 0; i <= get_path_length; i++)
2422  if (0 == memcmp(&get_path[i],
2423  peer->id,
2424  sizeof(struct GNUNET_PeerIdentity)))
2425  {
2426  process_reply_with_path(exp_time,
2427  &prm->key,
2428  i,
2429  get_path,
2430  put_path_length,
2431  put_path,
2432  type,
2433  data_size,
2434  data);
2435  return;
2436  }
2437 
2438  /* Need to append 'peer' to 'get_path' (normal case) */
2439  {
2440  struct GNUNET_PeerIdentity xget_path[get_path_length + 1];
2441 
2442  GNUNET_memcpy(xget_path,
2443  get_path,
2444  get_path_length * sizeof(struct GNUNET_PeerIdentity));
2445  xget_path[get_path_length] = *peer->id;
2446 
2447  process_reply_with_path(exp_time,
2448  &prm->key,
2449  get_path_length + 1,
2450  xget_path,
2451  put_path_length,
2452  put_path,
2453  type,
2454  data_size,
2455  data);
2456  }
2457 }
int GNUNET_HELLO_get_id(const struct GNUNET_HELLO_Message *hello, struct GNUNET_PeerIdentity *peer)
Get the peer identity from a HELLO message.
Definition: hello.c:662
uint32_t type
Content type.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
A HELLO message is used to exchange information about transports with other peers.
struct GNUNET_TIME_Absolute GNUNET_TIME_absolute_ntoh(struct GNUNET_TIME_AbsoluteNBO a)
Convert absolute time from network byte order.
Definition: time.c:671
GNUNET_BLOCK_Type
Blocks in the datastore and the datacache must have a unique type.
uint32_t put_path_length
Length of the PUT path that follows (if tracked).
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
uint32_t get_path_length
Length of the GET path that follows (if tracked).
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format...
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:94
static int disable_try_connect
Option for testing that disables the &#39;connect&#39; function of the DHT.
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
char * GNUNET_STRINGS_pp2s(const struct GNUNET_PeerIdentity *pids, unsigned int num_pids)
Convert a peer path to a human-readable string.
Definition: strings.c:100
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT.
Type of a block that contains a HELLO for a peer (for DHT and CADET find-peer operations).
struct GNUNET_TESTBED_Peer * peer
The peer associated with this model.
Entry for a peer in a bucket.
static void process_reply_with_path(struct GNUNET_TIME_Absolute expiration_time, const struct GNUNET_HashCode *key, unsigned int get_path_length, const struct GNUNET_PeerIdentity *get_path, unsigned int put_path_length, const struct GNUNET_PeerIdentity *put_path, enum GNUNET_BLOCK_Type type, size_t data_size, const void *data)
Process a reply, after the get_path has been updated.
struct GNUNET_TIME_AbsoluteNBO expiration_time
When does the content expire?
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
The identity of the host (wraps the signing key of the peer).
const struct GNUNET_PeerIdentity * id
What is the identity of the peer?
static void try_connect(const struct GNUNET_PeerIdentity *pid, const struct GNUNET_MessageHeader *h)
Consider if we want to connect to a given peer, and if so let ATS know.
#define LOG_TRAFFIC(kind,...)
struct GNUNET_TIME_Relative GNUNET_TIME_absolute_get_remaining(struct GNUNET_TIME_Absolute future)
Given a timestamp in the future, how much time remains until then?
Definition: time.c:331
enum GNUNET_TESTBED_UnderlayLinkModelType type
the type of this model
Header for all communications.
Time for absolute times used by GNUnet, in microseconds.
#define GNUNET_YES
Definition: gnunet_common.h:77
static int log_route_details_stderr
Should routing details be logged to stderr (for debugging)?
static struct GNUNET_PeerIdentity pid
Identity of the peer we transmit to / connect to.
uint32_t data
The data value.
static size_t data_size
Number of bytes in data.
struct GNUNET_HashCode key
The key of the corresponding GET request.
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define GNUNET_free(ptr)
Wrapper around free.
#define gettext_noop(String)
Definition: gettext.h:69
Here is the call graph for this function:

◆ GDS_NEIGHBOURS_init()

int GDS_NEIGHBOURS_init ( void  )

Initialize neighbours subsystem.

Returns
GNUNET_OK on success, GNUNET_SYSERR on error

Definition at line 2466 of file gnunet-service-dht_neighbours.c.

References bucket_size, cache_results, core_init(), disable_try_connect, GDS_cfg, getenv(), GNUNET_ATS_connectivity_init(), GNUNET_CONFIGURATION_get_value_number(), GNUNET_CONFIGURATION_get_value_yesno(), GNUNET_CONTAINER_multipeermap_create(), GNUNET_CORE_connect(), GNUNET_MESSAGE_TYPE_DHT_P2P_GET, GNUNET_MESSAGE_TYPE_DHT_P2P_PUT, GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT, GNUNET_MQ_handler_end, GNUNET_MQ_hd_var_size, GNUNET_NO, GNUNET_OK, GNUNET_SYSERR, GNUNET_YES, handle_core_connect(), handle_core_disconnect(), and log_route_details_stderr.

Referenced by run().

2467 {
2468  struct GNUNET_MQ_MessageHandler core_handlers[] = {
2469  GNUNET_MQ_hd_var_size(dht_p2p_get,
2471  struct PeerGetMessage,
2472  NULL),
2473  GNUNET_MQ_hd_var_size(dht_p2p_put,
2475  struct PeerPutMessage,
2476  NULL),
2477  GNUNET_MQ_hd_var_size(dht_p2p_result,
2479  struct PeerResultMessage,
2480  NULL),
2482  };
2483  unsigned long long temp_config_num;
2484 
2487  "DHT",
2488  "DISABLE_TRY_CONNECT");
2489  if (GNUNET_OK ==
2491  "DHT",
2492  "bucket_size",
2493  &temp_config_num))
2494  bucket_size = (unsigned int)temp_config_num;
2497  "DHT",
2498  "CACHE_RESULTS");
2499 
2501  (NULL != getenv("GNUNET_DHT_ROUTE_DEBUG")) ? GNUNET_YES : GNUNET_NO;
2504  NULL,
2505  &core_init,
2508  core_handlers);
2509  if (NULL == core_api)
2510  return GNUNET_SYSERR;
2512  GNUNET_YES);
2514  GNUNET_NO);
2515  return GNUNET_OK;
2516 }
int GNUNET_CONFIGURATION_get_value_number(const struct GNUNET_CONFIGURATION_Handle *cfg, const char *section, const char *option, unsigned long long *number)
Get a configuration value that should be a number.
static int cache_results
Do we cache all results that we are routing in the local datacache?
#define GNUNET_NO
Definition: gnunet_common.h:78
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:75
static void core_init(void *cls, const struct GNUNET_PeerIdentity *identity)
To be called on core init/fail.
struct GNUNET_CONTAINER_MultiPeerMap * GNUNET_CONTAINER_multipeermap_create(unsigned int len, int do_not_copy_keys)
Create a multi peer map (hash map for public keys of peers).
static int disable_try_connect
Option for testing that disables the &#39;connect&#39; function of the DHT.
#define GNUNET_MQ_hd_var_size(name, code, str, ctx)
Message handler for a specific message type.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_GET
Peer tries to find data in DHT.
#define GNUNET_SYSERR
Definition: gnunet_common.h:76
struct GNUNET_CORE_Handle * GNUNET_CORE_connect(const struct GNUNET_CONFIGURATION_Handle *cfg, void *cls, GNUNET_CORE_StartupCallback init, GNUNET_CORE_ConnectEventHandler connects, GNUNET_CORE_DisconnectEventHandler disconnects, const struct GNUNET_MQ_MessageHandler *handlers)
Connect to the core service.
Definition: core_api.c:690
char * getenv()
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
static struct GNUNET_CORE_Handle * core_api
Handle to CORE.
struct GNUNET_ATS_ConnectivityHandle * GNUNET_ATS_connectivity_init(const struct GNUNET_CONFIGURATION_Handle *cfg)
Initialize the ATS connectivity suggestion client handle.
static struct GNUNET_ATS_ConnectivityHandle * ats_ch
Handle to ATS connectivity.
static void handle_core_disconnect(void *cls, const struct GNUNET_PeerIdentity *peer, void *internal_cls)
Method called whenever a peer disconnects.
static unsigned int bucket_size
Maximum size for each bucket.
static struct GNUNET_CONTAINER_MultiPeerMap * all_desired_peers
Hash map of all peers we would like to be connected to.
#define GNUNET_YES
Definition: gnunet_common.h:77
static int log_route_details_stderr
Should routing details be logged to stderr (for debugging)?
const struct GNUNET_CONFIGURATION_Handle * GDS_cfg
Configuration we use.
int GNUNET_CONFIGURATION_get_value_yesno(const struct GNUNET_CONFIGURATION_Handle *cfg, const char *section, const char *option)
Get a configuration value that should be in a set of "YES" or "NO".
#define GNUNET_MESSAGE_TYPE_DHT_P2P_PUT
Peer is storing data in DHT.
static void * handle_core_connect(void *cls, const struct GNUNET_PeerIdentity *peer, struct GNUNET_MQ_Handle *mq)
Method called whenever a peer connects.
#define GNUNET_MQ_handler_end()
End-marker for the handlers array.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT
Data is returned to peer from DHT.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_done()

void GDS_NEIGHBOURS_done ( void  )

Shutdown neighbours subsystem.

Definition at line 2523 of file gnunet-service-dht_neighbours.c.

References free_connect_info(), GNUNET_assert, GNUNET_ATS_connectivity_done(), GNUNET_CONTAINER_multipeermap_destroy(), GNUNET_CONTAINER_multipeermap_iterate(), GNUNET_CONTAINER_multipeermap_size(), and GNUNET_CORE_disconnect().

Referenced by shutdown_task().

2524 {
2525  if (NULL == core_api)
2526  return;
2528  core_api = NULL;
2529  GNUNET_assert(0 ==
2532  all_connected_peers = NULL;
2535  NULL);
2537  all_desired_peers = NULL;
2539  ats_ch = NULL;
2540  GNUNET_assert(NULL == find_peer_task);
2541 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static struct GNUNET_SCHEDULER_Task * find_peer_task
Task that sends FIND PEER requests.
void GNUNET_CONTAINER_multipeermap_destroy(struct GNUNET_CONTAINER_MultiPeerMap *map)
Destroy a hash map.
static int free_connect_info(void *cls, const struct GNUNET_PeerIdentity *peer, void *value)
Function called for all entries in all_desired_peers to clean up.
void GNUNET_CORE_disconnect(struct GNUNET_CORE_Handle *handle)
Disconnect from the core service.
Definition: core_api.c:728
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
static struct GNUNET_CORE_Handle * core_api
Handle to CORE.
int GNUNET_CONTAINER_multipeermap_iterate(struct GNUNET_CONTAINER_MultiPeerMap *map, GNUNET_CONTAINER_PeerMapIterator it, void *it_cls)
Iterate over all entries in the map.
static struct GNUNET_ATS_ConnectivityHandle * ats_ch
Handle to ATS connectivity.
static struct GNUNET_CONTAINER_MultiPeerMap * all_desired_peers
Hash map of all peers we would like to be connected to.
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
void GNUNET_ATS_connectivity_done(struct GNUNET_ATS_ConnectivityHandle *ch)
Client is done with ATS connectivity management, release resources.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_get_id()

struct GNUNET_PeerIdentity* GDS_NEIGHBOURS_get_id ( void  )

Get the ID of the local node.

Returns
identity of the local node

Definition at line 2550 of file gnunet-service-dht_neighbours.c.

References my_identity.

Referenced by handle_dht_local_get(), and handle_dht_local_put().

2551 {
2552  return &my_identity;
2553 }
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
Here is the caller graph for this function:

Variable Documentation

◆ hello_expiration

struct GNUNET_TIME_Relative hello_expiration

Hello address expiration.

Definition at line 55 of file gnunet-service-dht.c.

Referenced by handle_find_peer().

◆ cache_results

int cache_results
static

Do we cache all results that we are routing in the local datacache?

Definition at line 338 of file gnunet-service-dht_neighbours.c.

Referenced by GDS_NEIGHBOURS_init(), and process_reply_with_path().

◆ log_route_details_stderr

int log_route_details_stderr
static

Should routing details be logged to stderr (for debugging)?

Definition at line 343 of file gnunet-service-dht_neighbours.c.

Referenced by GDS_NEIGHBOURS_init(), handle_dht_p2p_get(), handle_dht_p2p_put(), and handle_dht_p2p_result().

◆ closest_bucket

unsigned int closest_bucket
static

The lowest currently used bucket, initially 0 (for 0-bits matching bucket).

Definition at line 348 of file gnunet-service-dht_neighbours.c.

Referenced by handle_core_connect(), handle_core_disconnect(), handle_find_peer(), and select_peer().

◆ newly_found_peers

unsigned int newly_found_peers
static

How many peers have we added since we sent out our last find peer request?

Definition at line 354 of file gnunet-service-dht_neighbours.c.

Referenced by handle_core_connect(), and send_find_peer_message().

◆ disable_try_connect

int disable_try_connect
static

Option for testing that disables the 'connect' function of the DHT.

Definition at line 359 of file gnunet-service-dht_neighbours.c.

Referenced by GDS_NEIGHBOURS_init(), handle_core_connect(), handle_core_disconnect(), and handle_dht_p2p_result().

◆ k_buckets

struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
static

The buckets.

Array of size MAX_BUCKETS. Offset 0 means 0 bits matching.

Definition at line 364 of file gnunet-service-dht_neighbours.c.

Referenced by GDS_am_closest_peer(), handle_core_connect(), handle_core_disconnect(), handle_find_peer(), select_peer(), and try_connect().

◆ all_connected_peers

struct GNUNET_CONTAINER_MultiPeerMap* all_connected_peers
static

Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.

Values are of type struct PeerInfo.

Definition at line 370 of file gnunet-service-dht_neighbours.c.

◆ all_desired_peers

struct GNUNET_CONTAINER_MultiPeerMap* all_desired_peers
static

Hash map of all peers we would like to be connected to.

Values are of type struct ConnectInfo.

Definition at line 376 of file gnunet-service-dht_neighbours.c.

◆ bucket_size

unsigned int bucket_size = 8
static

◆ find_peer_task

struct GNUNET_SCHEDULER_Task* find_peer_task
static

Task that sends FIND PEER requests.

Definition at line 386 of file gnunet-service-dht_neighbours.c.

◆ my_identity

struct GNUNET_PeerIdentity my_identity
static

◆ my_identity_hash

struct GNUNET_HashCode my_identity_hash

◆ core_api

struct GNUNET_CORE_Handle* core_api
static

Handle to CORE.

Definition at line 401 of file gnunet-service-dht_neighbours.c.

◆ ats_ch

struct GNUNET_ATS_ConnectivityHandle* ats_ch
static

Handle to ATS connectivity.

Definition at line 406 of file gnunet-service-dht_neighbours.c.