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 428 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().

429 {
430  unsigned int bits;
431 
433  if (bits == MAX_BUCKETS)
434  {
435  /* How can all bits match? Got my own ID? */
436  GNUNET_break (0);
437  return GNUNET_SYSERR;
438  }
439  return MAX_BUCKETS - bits - 1;
440 }
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:79
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 450 of file gnunet-service-dht_neighbours.c.

References ConnectInfo::oh.

Referenced by try_connect().

451 {
452  struct ConnectInfo *ci = cls;
453 
454  ci->oh = NULL;
455 }
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 467 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().

470 {
471  struct ConnectInfo *ci = value;
472 
473  (void) cls;
476  peer,
477  ci));
478  if (NULL != ci->sh)
479  {
481  ci->sh = NULL;
482  }
483  if (NULL != ci->oh)
484  {
486  ci->oh = NULL;
487  }
488  GNUNET_free (ci);
489  return GNUNET_YES;
490 }
#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:80
#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 502 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().

504 {
505  int bucket;
506  struct GNUNET_HashCode pid_hash;
507  struct ConnectInfo *ci;
508  uint32_t strength;
509 
510  GNUNET_CRYPTO_hash (pid,
511  sizeof (struct GNUNET_PeerIdentity),
512  &pid_hash);
513  bucket = find_bucket (&pid_hash);
514  if (bucket < 0)
515  return; /* self? */
517  pid);
518 
519  if (k_buckets[bucket].peers_size < bucket_size)
520  strength = (bucket_size - k_buckets[bucket].peers_size) * bucket;
521  else
522  strength = bucket; /* minimum value of connectivity */
523  if (GNUNET_YES ==
525  pid))
526  strength *= 2; /* double for connected peers */
527  else if (k_buckets[bucket].peers_size > bucket_size)
528  strength = 0; /* bucket full, we really do not care about more */
529 
530  if ( (0 == strength) &&
531  (NULL != ci) )
532  {
533  /* release request */
535  free_connect_info (NULL,
536  pid,
537  ci));
538  return;
539  }
540  if (NULL == ci)
541  {
542  ci = GNUNET_new (struct ConnectInfo);
545  pid,
546  ci,
548  }
549  if ( (NULL != ci->oh) &&
550  (NULL != h) )
552  if (NULL != h)
554  h,
556  ci);
557  if ( (NULL != ci->sh) &&
558  (ci->strength != strength) )
560  if (ci->strength != strength)
562  pid,
563  strength);
564  ci->strength = strength;
565 }
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:78
#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:80
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 581 of file gnunet-service-dht_neighbours.c.

References GNUNET_YES, and try_connect().

Referenced by update_connect_preferences().

584 {
585  (void) cls;
586  (void) value;
587  try_connect (pid,
588  NULL);
589  return GNUNET_YES;
590 }
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:80
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 600 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().

601 {
604  NULL);
605 }
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 618 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().

621 {
622  struct GNUNET_BLOCK_Group *bg = cls;
623  struct GNUNET_HashCode key_hash;
624 
625  (void) cls;
626  (void) value;
627  GNUNET_CRYPTO_hash (key,
628  sizeof (struct GNUNET_PeerIdentity),
629  &key_hash);
631  &key_hash,
632  1);
634  "Adding known peer (%s) to bloomfilter for FIND PEER\n",
635  GNUNET_i2s (key));
636  return GNUNET_YES;
637 }
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:80
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:410
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 648 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().

649 {
650  struct GNUNET_TIME_Relative next_send_time;
651  struct GNUNET_BLOCK_Group *bg;
652  struct GNUNET_CONTAINER_BloomFilter *peer_bf;
653 
654  (void) cls;
655  find_peer_task = NULL;
657  {
658  /* If we are finding many peers already, no need to send out our request right now! */
662  NULL);
663  newly_found_peers = 0;
664  return;
665  }
669  UINT32_MAX),
670  NULL,
671  0,
672  "filter-size",
674  NULL);
677  bg);
679  gettext_noop ("# FIND PEER messages initiated"),
680  1,
681  GNUNET_NO);
682  peer_bf
686  // FIXME: pass priority!?
690  0,
692  NULL,
693  0,
694  bg,
695  peer_bf);
698  /* schedule next round */
699  next_send_time.rel_value_us =
700  DHT_MINIMUM_FIND_PEER_INTERVAL.rel_value_us +
702  DHT_MAXIMUM_FIND_PEER_INTERVAL.rel_value_us /
703  (newly_found_peers + 1));
704  newly_found_peers = 0;
705  GNUNET_assert (NULL == find_peer_task);
707  GNUNET_SCHEDULER_add_delayed (next_send_time,
709  NULL);
710 }
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:81
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:1246
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:290
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:206
#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 722 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().

725 {
726  struct PeerInfo *pi;
727 
728  (void) cls;
729  /* Check for connect to self message */
730  if (0 == GNUNET_memcmp (&my_identity,
731  peer))
732  return NULL;
734  "Connected to %s\n",
735  GNUNET_i2s (peer));
738  peer));
740  gettext_noop ("# peers connected"),
741  1,
742  GNUNET_NO);
743  pi = GNUNET_new (struct PeerInfo);
744  pi->id = peer;
745  pi->mq = mq;
746  GNUNET_CRYPTO_hash (peer,
747  sizeof (struct GNUNET_PeerIdentity),
748  &pi->phash);
749  pi->peer_bucket = find_bucket (&pi->phash);
750  GNUNET_assert ( (pi->peer_bucket >= 0) &&
751  ((unsigned int) pi->peer_bucket < MAX_BUCKETS) );
754  pi);
757  (unsigned int) pi->peer_bucket);
760  pi->id,
761  pi,
763  if ( (pi->peer_bucket > 0) &&
765  {
768  }
771  {
772  /* got a first connection, good time to start with FIND PEER requests... */
773  GNUNET_assert (NULL == find_peer_task);
775  NULL);
776  }
777  return pi;
778 }
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:81
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:78
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:85
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:1273
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:80
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 789 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().

792 {
793  struct PeerInfo *to_remove = internal_cls;
794 
795  (void) cls;
796  /* Check for disconnect from self message */
797  if (NULL == to_remove)
798  return;
800  "Disconnected %s\n",
801  GNUNET_i2s (peer));
803  gettext_noop ("# peers connected"),
804  -1,
805  GNUNET_NO);
808  peer,
809  to_remove));
812  {
814  find_peer_task = NULL;
815  }
816  GNUNET_assert (to_remove->peer_bucket >= 0);
818  k_buckets[to_remove->peer_bucket].tail,
819  to_remove);
820  GNUNET_assert (k_buckets[to_remove->peer_bucket].peers_size > 0);
821  k_buckets[to_remove->peer_bucket].peers_size--;
822  while ( (closest_bucket > 0) &&
823  (0 == k_buckets[to_remove->peer_bucket].peers_size) )
824  closest_bucket--;
825  if (k_buckets[to_remove->peer_bucket].peers_size < bucket_size)
827  GNUNET_free (to_remove);
828 }
#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:81
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:80
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:965
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 840 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().

842 {
843  uint32_t random_value;
844  uint32_t forward_count;
845  float target_value;
846 
847  if (hop_count > GDS_NSE_get () * 4.0)
848  {
849  /* forcefully terminate */
851  gettext_noop ("# requests TTL-dropped"),
852  1, GNUNET_NO);
853  return 0;
854  }
855  if (hop_count > GDS_NSE_get () * 2.0)
856  {
857  /* Once we have reached our ideal number of hops, only forward to 1 peer */
858  return 1;
859  }
860  /* bound by system-wide maximum */
861  target_replication =
862  GNUNET_MIN (MAXIMUM_REPLICATION_LEVEL, target_replication);
863  target_value =
864  1 + (target_replication - 1.0) / (GDS_NSE_get () +
865  ((float) (target_replication - 1.0) *
866  hop_count));
867  /* Set forward count to floor of target_value */
868  forward_count = (uint32_t) target_value;
869  /* Subtract forward_count (floor) from target_value (yields value between 0 and 1) */
870  target_value = target_value - forward_count;
871  random_value =
873  if (random_value < (target_value * UINT32_MAX))
874  forward_count++;
875  return forward_count;
876 }
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:81
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:83
#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 891 of file gnunet-service-dht_neighbours.c.

References GNUNET_CRYPTO_hash_get_bit(), and GNUNET_CRYPTO_hash_matching_bits().

Referenced by select_peer().

893 {
894  unsigned int bucket;
895  unsigned int msb;
896  unsigned int lsb;
897  unsigned int i;
898 
899  /* We have to represent the distance between two 2^9 (=512)-bit
900  * numbers as a 2^5 (=32)-bit number with "0" being used for the
901  * two numbers being identical; furthermore, we need to
902  * guarantee that a difference in the number of matching
903  * bits is always represented in the result.
904  *
905  * We use 2^32/2^9 numerical values to distinguish between
906  * hash codes that have the same LSB bit distance and
907  * use the highest 2^9 bits of the result to signify the
908  * number of (mis)matching LSB bits; if we have 0 matching
909  * and hence 512 mismatching LSB bits we return -1 (since
910  * 512 itself cannot be represented with 9 bits) */
911 
912  /* first, calculate the most significant 9 bits of our
913  * result, aka the number of LSBs */
914  bucket = GNUNET_CRYPTO_hash_matching_bits (target,
915  have);
916  /* bucket is now a value between 0 and 512 */
917  if (bucket == 512)
918  return 0; /* perfect match */
919  if (bucket == 0)
920  return (unsigned int) -1; /* LSB differs; use max (if we did the bit-shifting
921  * below, we'd end up with max+1 (overflow)) */
922 
923  /* calculate the most significant bits of the final result */
924  msb = (512 - bucket) << (32 - 9);
925  /* calculate the 32-9 least significant bits of the final result by
926  * looking at the differences in the 32-9 bits following the
927  * mismatching bit at 'bucket' */
928  lsb = 0;
929  for (i = bucket + 1;
930  (i < sizeof (struct GNUNET_HashCode) * 8) && (i < bucket + 1 + 32 - 9); i++)
931  {
932  if (GNUNET_CRYPTO_hash_get_bit (target, i) !=
933  GNUNET_CRYPTO_hash_get_bit (have, i))
934  lsb |= (1 << (bucket + 32 - 9 - i)); /* first bit set will be 10,
935  * last bit set will be 31 -- if
936  * i does not reach 512 first... */
937  }
938  return msb | lsb;
939 }
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 953 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().

955 {
956  int bits;
957  int other_bits;
958  int bucket_num;
959  struct PeerInfo *pos;
960 
961  if (0 == GNUNET_memcmp (&my_identity_hash,
962  key))
963  return GNUNET_YES;
964  bucket_num = find_bucket (key);
965  GNUNET_assert (bucket_num >= 0);
967  key);
968  pos = k_buckets[bucket_num].head;
969  while (NULL != pos)
970  {
971  if ( (NULL != bloom) &&
972  (GNUNET_YES ==
974  &pos->phash)) )
975  {
976  pos = pos->next;
977  continue; /* Skip already checked entries */
978  }
979  other_bits = GNUNET_CRYPTO_hash_matching_bits (&pos->phash,
980  key);
981  if (other_bits > bits)
982  return GNUNET_NO;
983  if (other_bits == bits) /* We match the same number of bits */
984  return GNUNET_YES;
985  pos = pos->next;
986  }
987  /* No peers closer, we are the closest! */
988  return GNUNET_YES;
989 }
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:81
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:80
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 1010 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().

1013 {
1014  unsigned int bc;
1015  unsigned int count;
1016  unsigned int selected;
1017  struct PeerInfo *pos;
1018  unsigned int dist;
1019  unsigned int smallest_distance;
1020  struct PeerInfo *chosen;
1021 
1022  if (hops >= GDS_NSE_get ())
1023  {
1024  /* greedy selection (closest peer that is not in bloomfilter) */
1025  smallest_distance = UINT_MAX;
1026  chosen = NULL;
1027  for (bc = 0; bc <= closest_bucket; bc++)
1028  {
1029  pos = k_buckets[bc].head;
1030  count = 0;
1031  while ((pos != NULL) && (count < bucket_size))
1032  {
1033  if ( (NULL == bloom) ||
1034  (GNUNET_NO ==
1036  &pos->phash)))
1037  {
1038  dist = get_distance (key,
1039  &pos->phash);
1040  if (dist < smallest_distance)
1041  {
1042  chosen = pos;
1043  smallest_distance = dist;
1044  }
1045  }
1046  else
1047  {
1049  "Excluded peer `%s' due to BF match in greedy routing for %s\n",
1050  GNUNET_i2s (pos->id),
1051  GNUNET_h2s (key));
1053  gettext_noop ("# Peers excluded from routing due to Bloomfilter"),
1054  1,
1055  GNUNET_NO);
1056  dist = get_distance (key,
1057  &pos->phash);
1058  if (dist < smallest_distance)
1059  {
1060  chosen = NULL;
1061  smallest_distance = dist;
1062  }
1063  }
1064  count++;
1065  pos = pos->next;
1066  }
1067  }
1068  if (NULL == chosen)
1070  gettext_noop ("# Peer selection failed"),
1071  1,
1072  GNUNET_NO);
1073  else
1075  "Selected peer `%s' in greedy routing for %s\n",
1076  GNUNET_i2s (chosen->id),
1077  GNUNET_h2s (key));
1078  return chosen;
1079  }
1080 
1081  /* select "random" peer */
1082  /* count number of peers that are available and not filtered */
1083  count = 0;
1084  for (bc = 0; bc <= closest_bucket; bc++)
1085  {
1086  pos = k_buckets[bc].head;
1087  while ( (NULL != pos) && (count < bucket_size) )
1088  {
1089  if ( (NULL != bloom) &&
1090  (GNUNET_YES ==
1092  &pos->phash)) )
1093  {
1095  gettext_noop
1096  ("# Peers excluded from routing due to Bloomfilter"),
1097  1, GNUNET_NO);
1099  "Excluded peer `%s' due to BF match in random routing for %s\n",
1100  GNUNET_i2s (pos->id),
1101  GNUNET_h2s (key));
1102  pos = pos->next;
1103  continue; /* Ignore bloomfiltered peers */
1104  }
1105  count++;
1106  pos = pos->next;
1107  }
1108  }
1109  if (0 == count) /* No peers to select from! */
1110  {
1112  gettext_noop ("# Peer selection failed"), 1,
1113  GNUNET_NO);
1114  return NULL;
1115  }
1116  /* Now actually choose a peer */
1118  count);
1119  count = 0;
1120  for (bc = 0; bc <= closest_bucket; bc++)
1121  {
1122  for (pos = k_buckets[bc].head; ((pos != NULL) && (count < bucket_size)); pos = pos->next)
1123  {
1124  if ((bloom != NULL) &&
1125  (GNUNET_YES ==
1127  &pos->phash)))
1128  {
1129  continue; /* Ignore bloomfiltered peers */
1130  }
1131  if (0 == selected--)
1132  {
1134  "Selected peer `%s' in random routing for %s\n",
1135  GNUNET_i2s (pos->id),
1136  GNUNET_h2s (key));
1137  return pos;
1138  }
1139  }
1140  }
1141  GNUNET_break (0);
1142  return NULL;
1143 }
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:81
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:231
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:80
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 1160 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().

1165 {
1166  unsigned int ret;
1167  unsigned int off;
1168  struct PeerInfo **rtargets;
1169  struct PeerInfo *nxt;
1170 
1171  GNUNET_assert (NULL != bloom);
1172  ret = get_forward_count (hop_count,
1173  target_replication);
1174  if (0 == ret)
1175  {
1176  *targets = NULL;
1177  return 0;
1178  }
1179  rtargets = GNUNET_new_array (ret,
1180  struct PeerInfo *);
1181  for (off = 0; off < ret; off++)
1182  {
1183  nxt = select_peer (key,
1184  bloom,
1185  hop_count);
1186  if (NULL == nxt)
1187  break;
1188  rtargets[off] = nxt;
1191  &nxt->phash));
1193  &nxt->phash);
1194  }
1196  "Selected %u/%u peers at hop %u for %s (target was %u)\n",
1197  off,
1199  (unsigned int) hop_count,
1200  GNUNET_h2s (key),
1201  ret);
1202  if (0 == off)
1203  {
1204  GNUNET_free (rtargets);
1205  *targets = NULL;
1206  return 0;
1207  }
1208  *targets = rtargets;
1210  "Forwarding query `%s' to %u peers (goal was %u peers)\n",
1211  GNUNET_h2s (key),
1212  off,
1213  ret);
1214  return off;
1215 }
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:81
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 1239 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().

1250 {
1251  unsigned int target_count;
1252  unsigned int i;
1253  struct PeerInfo **targets;
1254  struct PeerInfo *target;
1255  size_t msize;
1256  struct GNUNET_MQ_Envelope *env;
1257  struct PeerPutMessage *ppm;
1258  struct GNUNET_PeerIdentity *pp;
1259  unsigned int skip_count;
1260 
1261  GNUNET_assert (NULL != bf);
1263  "Adding myself (%s) to PUT bloomfilter for %s\n",
1265  GNUNET_h2s (key));
1267  &my_identity_hash);
1269  gettext_noop ("# PUT requests routed"),
1270  1,
1271  GNUNET_NO);
1272  target_count
1273  = get_target_peers (key,
1274  bf,
1275  hop_count,
1276  desired_replication_level,
1277  &targets);
1278  if (0 == target_count)
1279  {
1281  "Routing PUT for %s terminates after %u hops at %s\n",
1282  GNUNET_h2s (key),
1283  (unsigned int) hop_count,
1284  GNUNET_i2s (&my_identity));
1285  return GNUNET_NO;
1286  }
1287  msize = put_path_length * sizeof (struct GNUNET_PeerIdentity) + data_size;
1288  if (msize + sizeof (struct PeerPutMessage)
1290  {
1291  put_path_length = 0;
1292  msize = data_size;
1293  }
1294  if (msize + sizeof (struct PeerPutMessage)
1296  {
1297  GNUNET_break (0);
1298  GNUNET_free (targets);
1299  return GNUNET_NO;
1300  }
1302  gettext_noop ("# PUT messages queued for transmission"),
1303  target_count,
1304  GNUNET_NO);
1305  skip_count = 0;
1306  for (i = 0; i < target_count; i++)
1307  {
1308  target = targets[i];
1310  {
1311  /* skip */
1313  gettext_noop ("# P2P messages dropped due to full queue"),
1314  1,
1315  GNUNET_NO);
1316  skip_count++;
1317  continue;
1318  }
1320  "Routing PUT for %s after %u hops to %s\n",
1321  GNUNET_h2s (key),
1322  (unsigned int) hop_count,
1323  GNUNET_i2s (target->id));
1324  env = GNUNET_MQ_msg_extra (ppm,
1325  msize,
1327  ppm->options = htonl (options);
1328  ppm->type = htonl (type);
1329  ppm->hop_count = htonl (hop_count + 1);
1330  ppm->desired_replication_level = htonl (desired_replication_level);
1331  ppm->put_path_length = htonl (put_path_length);
1332  ppm->expiration_time = GNUNET_TIME_absolute_hton (expiration_time);
1335  &target->phash));
1338  ppm->bloomfilter,
1339  DHT_BLOOM_SIZE));
1340  ppm->key = *key;
1341  pp = (struct GNUNET_PeerIdentity *) &ppm[1];
1342  GNUNET_memcpy (pp,
1343  put_path,
1344  sizeof (struct GNUNET_PeerIdentity) * put_path_length);
1345  GNUNET_memcpy (&pp[put_path_length],
1346  data,
1347  data_size);
1348  GNUNET_MQ_send (target->mq,
1349  env);
1350  }
1351  GNUNET_free (targets);
1352  return (skip_count < target_count) ? GNUNET_OK : GNUNET_NO;
1353 }
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_NO
Definition: gnunet_common.h:81
#define GNUNET_OK
Named constants for return values.
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_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.
#define GNUNET_memcpy(dst, src, n)
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:335
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:80
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:353
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:654
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 1374 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().

1383 {
1384  unsigned int target_count;
1385  struct PeerInfo **targets;
1386  struct PeerInfo *target;
1387  struct GNUNET_MQ_Envelope *env;
1388  size_t msize;
1389  struct PeerGetMessage *pgm;
1390  char *xq;
1391  size_t reply_bf_size;
1392  void *reply_bf;
1393  unsigned int skip_count;
1394  uint32_t bf_nonce;
1395 
1396  GNUNET_assert (NULL != peer_bf);
1398  gettext_noop ("# GET requests routed"),
1399  1,
1400  GNUNET_NO);
1401  target_count = get_target_peers (key,
1402  peer_bf,
1403  hop_count,
1405  &targets);
1407  "Adding myself (%s) to GET bloomfilter for %s\n",
1409  GNUNET_h2s (key));
1411  &my_identity_hash);
1412  if (0 == target_count)
1413  {
1415  "Routing GET for %s terminates after %u hops at %s\n",
1416  GNUNET_h2s (key),
1417  (unsigned int) hop_count,
1418  GNUNET_i2s (&my_identity));
1419  return GNUNET_NO;
1420  }
1421  if (GNUNET_OK !=
1423  &bf_nonce,
1424  &reply_bf,
1425  &reply_bf_size))
1426  {
1427  reply_bf = NULL;
1428  reply_bf_size = 0;
1430  UINT32_MAX);
1431  }
1432  msize = xquery_size + reply_bf_size;
1433  if (msize + sizeof (struct PeerGetMessage) >= GNUNET_MAX_MESSAGE_SIZE)
1434  {
1435  GNUNET_break (0);
1436  GNUNET_free_non_null (reply_bf);
1437  GNUNET_free (targets);
1438  return GNUNET_NO;
1439  }
1441  gettext_noop ("# GET messages queued for transmission"),
1442  target_count,
1443  GNUNET_NO);
1444  /* forward request */
1445  skip_count = 0;
1446  for (unsigned int i = 0; i < target_count; i++)
1447  {
1448  target = targets[i];
1450  {
1451  /* skip */
1453  gettext_noop ("# P2P messages dropped due to full queue"),
1454  1, GNUNET_NO);
1455  skip_count++;
1456  continue;
1457  }
1459  "Routing GET for %s after %u hops to %s\n",
1460  GNUNET_h2s (key),
1461  (unsigned int) hop_count,
1462  GNUNET_i2s (target->id));
1463  env = GNUNET_MQ_msg_extra (pgm,
1464  msize,
1466  pgm->options = htonl (options);
1467  pgm->type = htonl (type);
1468  pgm->hop_count = htonl (hop_count + 1);
1470  pgm->xquery_size = htonl (xquery_size);
1471  pgm->bf_mutator = bf_nonce;
1474  &target->phash));
1477  pgm->bloomfilter,
1478  DHT_BLOOM_SIZE));
1479  pgm->key = *key;
1480  xq = (char *) &pgm[1];
1481  GNUNET_memcpy (xq,
1482  xquery,
1483  xquery_size);
1484  GNUNET_memcpy (&xq[xquery_size],
1485  reply_bf,
1486  reply_bf_size);
1487  GNUNET_MQ_send (target->mq,
1488  env);
1489  }
1490  GNUNET_free (targets);
1491  GNUNET_free_non_null (reply_bf);
1492  return (skip_count < target_count) ? GNUNET_OK : GNUNET_NO;
1493 }
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_NO
Definition: gnunet_common.h:81
#define GNUNET_OK
Named constants for return values.
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).
#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
#define GNUNET_memcpy(dst, src, n)
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:335
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:181
#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:80
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:353
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 1513 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().

1523 {
1524  struct PeerInfo *pi;
1525  struct GNUNET_MQ_Envelope *env;
1526  size_t msize;
1527  struct PeerResultMessage *prm;
1528  struct GNUNET_PeerIdentity *paths;
1529 
1530  msize = data_size + (get_path_length + put_path_length) *
1531  sizeof (struct GNUNET_PeerIdentity);
1532  if ((msize + sizeof (struct PeerResultMessage) >= GNUNET_MAX_MESSAGE_SIZE) ||
1533  (get_path_length >
1534  GNUNET_MAX_MESSAGE_SIZE / sizeof (struct GNUNET_PeerIdentity)) ||
1535  (put_path_length >
1536  GNUNET_MAX_MESSAGE_SIZE / sizeof (struct GNUNET_PeerIdentity)) ||
1538  {
1539  GNUNET_break (0);
1540  return;
1541  }
1543  target);
1544  if (NULL == pi)
1545  {
1546  /* peer disconnected in the meantime, drop reply */
1548  "No matching peer for reply for key %s\n",
1549  GNUNET_h2s (key));
1550  return;
1551  }
1553  {
1554  /* skip */
1556  gettext_noop ("# P2P messages dropped due to full queue"),
1557  1,
1558  GNUNET_NO);
1560  "Peer queue full, ignoring reply for key %s\n",
1561  GNUNET_h2s (key));
1562  return;
1563  }
1564 
1566  "Forwarding reply for key %s to peer %s\n",
1567  GNUNET_h2s (key),
1568  GNUNET_i2s (target));
1570  gettext_noop
1571  ("# RESULT messages queued for transmission"), 1,
1572  GNUNET_NO);
1573  env = GNUNET_MQ_msg_extra (prm,
1574  msize,
1576  prm->type = htonl (type);
1577  prm->put_path_length = htonl (put_path_length);
1578  prm->get_path_length = htonl (get_path_length);
1579  prm->expiration_time = GNUNET_TIME_absolute_hton (expiration_time);
1580  prm->key = *key;
1581  paths = (struct GNUNET_PeerIdentity *) &prm[1];
1582  GNUNET_memcpy (paths,
1583  put_path,
1584  put_path_length * sizeof (struct GNUNET_PeerIdentity));
1585  GNUNET_memcpy (&paths[put_path_length],
1586  get_path,
1587  get_path_length * sizeof (struct GNUNET_PeerIdentity));
1588  GNUNET_memcpy (&paths[put_path_length + get_path_length],
1589  data,
1590  data_size);
1591  GNUNET_MQ_send (pi->mq,
1592  env);
1593 }
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).
uint32_t get_path_length
Length of the GET path that follows (if tracked).
#define GNUNET_NO
Definition: gnunet_common.h:81
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
#define GNUNET_memcpy(dst, src, n)
unsigned int GNUNET_MQ_get_length(struct GNUNET_MQ_Handle *mq)
Obtain the current length of the message queue.
Definition: mq.c:335
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:353
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:654
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 1603 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().

1605 {
1606  (void) cls;
1608  "CORE called, I am %s\n",
1609  GNUNET_i2s (identity));
1610  my_identity = *identity;
1611  GNUNET_CRYPTO_hash (identity,
1612  sizeof (struct GNUNET_PeerIdentity),
1613  &my_identity_hash);
1615 }
void GNUNET_SERVICE_resume(struct GNUNET_SERVICE_Handle *sh)
Resume accepting connections from the listen socket.
Definition: service.c:2481
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 1626 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.

1628 {
1629  uint32_t putlen;
1630  uint16_t msize;
1631 
1632  (void) cls;
1633  msize = ntohs (put->header.size);
1634  putlen = ntohl (put->put_path_length);
1635  if ((msize <
1636  sizeof (struct PeerPutMessage) +
1637  putlen * sizeof (struct GNUNET_PeerIdentity)) ||
1638  (putlen >
1639  GNUNET_MAX_MESSAGE_SIZE / sizeof (struct GNUNET_PeerIdentity)))
1640  {
1641  GNUNET_break_op (0);
1642  return GNUNET_SYSERR;
1643  }
1644  return GNUNET_OK;
1645 }
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:78
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:79
#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 1655 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.

1657 {
1658  struct PeerInfo *peer = cls;
1659  const struct GNUNET_PeerIdentity *put_path;
1660  const void *payload;
1661  uint32_t putlen;
1662  uint16_t msize;
1663  size_t payload_size;
1665  struct GNUNET_CONTAINER_BloomFilter *bf;
1666  struct GNUNET_HashCode test_key;
1667  int forwarded;
1668  struct GNUNET_TIME_Absolute exp_time;
1669 
1670  exp_time = GNUNET_TIME_absolute_ntoh (put->expiration_time);
1671  if (0 == GNUNET_TIME_absolute_get_remaining (exp_time).rel_value_us)
1672  {
1674  gettext_noop ("# Expired PUTs discarded"),
1675  1,
1676  GNUNET_NO);
1677  return;
1678  }
1679  msize = ntohs (put->header.size);
1680  putlen = ntohl (put->put_path_length);
1682  gettext_noop ("# P2P PUT requests received"),
1683  1,
1684  GNUNET_NO);
1686  gettext_noop ("# P2P PUT bytes received"),
1687  msize,
1688  GNUNET_NO);
1689  put_path = (const struct GNUNET_PeerIdentity *) &put[1];
1690  payload = &put_path[putlen];
1691  options = ntohl (put->options);
1692  payload_size = msize - (sizeof (struct PeerPutMessage) +
1693  putlen * sizeof (struct GNUNET_PeerIdentity));
1694 
1696  "PUT for `%s' from %s\n",
1697  GNUNET_h2s (&put->key),
1698  GNUNET_i2s (peer->id));
1700  {
1701  char *tmp;
1702  char *pp;
1703 
1704  pp = GNUNET_STRINGS_pp2s (put_path,
1705  putlen);
1708  "R5N PUT %s: %s->%s (%u, %u=>%u, PP: %s)\n",
1709  GNUNET_h2s (&put->key),
1710  GNUNET_i2s (peer->id),
1711  tmp,
1712  ntohl(put->hop_count),
1714  &put->key),
1716  &put->key),
1717  pp);
1718  GNUNET_free (pp);
1719  GNUNET_free (tmp);
1720  }
1721  switch (GNUNET_BLOCK_get_key
1723  ntohl (put->type),
1724  payload,
1725  payload_size,
1726  &test_key))
1727  {
1728  case GNUNET_YES:
1729  if (0 != memcmp (&test_key,
1730  &put->key,
1731  sizeof (struct GNUNET_HashCode)))
1732  {
1733  char *put_s = GNUNET_strdup (GNUNET_h2s_full (&put->key));
1734 
1735  GNUNET_break_op (0);
1737  "PUT with key `%s' for block with key %s\n",
1738  put_s,
1739  GNUNET_h2s_full (&test_key));
1740  GNUNET_free (put_s);
1741  return;
1742  }
1743  break;
1744  case GNUNET_NO:
1745  GNUNET_break_op (0);
1746  return;
1747  case GNUNET_SYSERR:
1748  /* cannot verify, good luck */
1749  break;
1750  }
1751  if (ntohl (put->type) == GNUNET_BLOCK_TYPE_REGEX) /* FIXME: do for all tpyes */
1752  {
1754  ntohl (put->type),
1755  NULL, /* query group */
1757  NULL, /* query */
1758  NULL, 0, /* xquery */
1759  payload,
1760  payload_size))
1761  {
1764  break;
1765 
1772  default:
1773  GNUNET_break_op (0);
1774  return;
1775  }
1776  }
1777 
1783  &peer->phash));
1784  {
1785  struct GNUNET_PeerIdentity pp[putlen + 1];
1786 
1787  /* extend 'put path' by sender */
1788  if (0 != (options & GNUNET_DHT_RO_RECORD_ROUTE))
1789  {
1790 #if SANITY_CHECKS
1791  for (unsigned int i=0;i<=putlen;i++)
1792  {
1793  for (unsigned int j=0;j<i;j++)
1794  {
1795  GNUNET_break (0 != memcmp (&pp[i],
1796  &pp[j],
1797  sizeof (struct GNUNET_PeerIdentity)));
1798  }
1799  GNUNET_break (0 != memcmp (&pp[i],
1800  peer->id,
1801  sizeof (struct GNUNET_PeerIdentity)));
1802  }
1803 #endif
1804  GNUNET_memcpy (pp,
1805  put_path,
1806  putlen * sizeof (struct GNUNET_PeerIdentity));
1807  pp[putlen] = *peer->id;
1808  putlen++;
1809  }
1810  else
1811  putlen = 0;
1812 
1813  /* give to local clients */
1814  GDS_CLIENTS_handle_reply (exp_time,
1815  &put->key,
1816  0,
1817  NULL,
1818  putlen,
1819  pp,
1820  ntohl (put->type),
1821  payload_size,
1822  payload);
1823  /* store locally */
1824  if ((0 != (options & GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE)) ||
1825  (GDS_am_closest_peer (&put->key, bf)))
1826  GDS_DATACACHE_handle_put (exp_time,
1827  &put->key,
1828  putlen,
1829  pp,
1830  ntohl (put->type),
1831  payload_size,
1832  payload);
1833  /* route to other peers */
1834  forwarded = GDS_NEIGHBOURS_handle_put (ntohl (put->type),
1835  options,
1836  ntohl (put->desired_replication_level),
1837  exp_time,
1838  ntohl (put->hop_count),
1839  bf,
1840  &put->key,
1841  putlen,
1842  pp,
1843  payload,
1844  payload_size);
1845  /* notify monitoring clients */
1846  GDS_CLIENTS_process_put (options
1847  | ( (GNUNET_OK == forwarded)
1849  : 0 ),
1850  ntohl (put->type),
1851  ntohl (put->hop_count),
1852  ntohl (put->desired_replication_level),
1853  putlen, pp,
1854  exp_time,
1855  &put->key,
1856  payload,
1857  payload_size);
1858  }
1860 }
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:670
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.
Block does not match xquery (valid result, not relevant for the request)
#define GNUNET_NO
Definition: gnunet_common.h:81
#define GNUNET_OK
Named constants for return values.
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.
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:379
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.
#define GNUNET_memcpy(dst, src, n)
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:99
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:339
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:79
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:80
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 1872 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().

1875 {
1876  int bucket_idx;
1877  struct PeerBucket *bucket;
1878  struct PeerInfo *peer;
1879  unsigned int choice;
1880  const struct GNUNET_HELLO_Message *hello;
1881  size_t hello_size;
1882 
1883  /* first, check about our own HELLO */
1884  if (NULL != GDS_my_hello)
1885  {
1886  hello_size = GNUNET_HELLO_size ((const struct GNUNET_HELLO_Message *) GDS_my_hello);
1887  GNUNET_break (hello_size >= sizeof (struct GNUNET_MessageHeader));
1891  bg,
1894  NULL, 0,
1895  GDS_my_hello,
1896  hello_size))
1897  {
1901  key,
1902  0,
1903  NULL,
1904  0,
1905  NULL,
1906  GDS_my_hello,
1907  hello_size);
1908  }
1909  else
1910  {
1912  gettext_noop ("# FIND PEER requests ignored due to Bloomfilter"),
1913  1,
1914  GNUNET_NO);
1915  }
1916  }
1917  else
1918  {
1920  gettext_noop ("# FIND PEER requests ignored due to lack of HELLO"),
1921  1,
1922  GNUNET_NO);
1923  }
1924 
1925  /* then, also consider sending a random HELLO from the closest bucket */
1926  if (0 == memcmp (&my_identity_hash,
1927  key,
1928  sizeof (struct GNUNET_HashCode)))
1929  bucket_idx = closest_bucket;
1930  else
1931  bucket_idx = GNUNET_MIN ((int) closest_bucket,
1932  find_bucket (key));
1933  if (bucket_idx < 0)
1934  return;
1935  bucket = &k_buckets[bucket_idx];
1936  if (bucket->peers_size == 0)
1937  return;
1939  bucket->peers_size);
1940  peer = bucket->head;
1941  while (choice > 0)
1942  {
1943  GNUNET_assert (NULL != peer);
1944  peer = peer->next;
1945  choice--;
1946  }
1947  choice = bucket->peers_size;
1948  do
1949  {
1950  peer = peer->next;
1951  if (0 == choice--)
1952  return; /* no non-masked peer available */
1953  if (NULL == peer)
1954  peer = bucket->head;
1955  hello = GDS_HELLO_get (peer->id);
1956  } while ( (NULL == hello) ||
1960  bg,
1962  &peer->phash,
1963  NULL, 0,
1964  hello,
1965  (hello_size = GNUNET_HELLO_size (hello)))) );
1970  key,
1971  0,
1972  NULL,
1973  0,
1974  NULL,
1975  hello,
1976  hello_size);
1977 }
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:245
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:81
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:339
#define GNUNET_MIN(a, b)
Definition: gnunet_common.h:83
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:649
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 1995 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().

2005 {
2006  struct PeerInfo *peer = cls;
2007  char *pp;
2008 
2009  pp = GNUNET_STRINGS_pp2s (put_path,
2010  put_path_length);
2012  "Found local result for %s (PP: %s)\n",
2013  GNUNET_h2s (key),
2014  pp);
2015  GNUNET_free (pp);
2017  type,
2018  expiration_time,
2019  key,
2020  put_path_length, put_path,
2021  get_path_length, get_path,
2022  data, data_size);
2023 }
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:99
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 2034 of file gnunet-service-dht_neighbours.c.

References GNUNET_break_op, GNUNET_OK, and GNUNET_SYSERR.

2036 {
2037  uint32_t xquery_size;
2038  uint16_t msize;
2039 
2040  (void) cls;
2041  msize = ntohs (get->header.size);
2042  xquery_size = ntohl (get->xquery_size);
2043  if (msize < sizeof (struct PeerGetMessage) + xquery_size)
2044  {
2045  GNUNET_break_op (0);
2046  return GNUNET_SYSERR;
2047  }
2048  return GNUNET_OK;
2049 }
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_GET.
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:78
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:79
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 2059 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.

2061 {
2062  struct PeerInfo *peer = cls;
2063  uint32_t xquery_size;
2064  size_t reply_bf_size;
2065  uint16_t msize;
2066  enum GNUNET_BLOCK_Type type;
2069  struct GNUNET_BLOCK_Group *bg;
2070  struct GNUNET_CONTAINER_BloomFilter *peer_bf;
2071  const char *xquery;
2072  int forwarded;
2073 
2074  /* parse and validate message */
2075  msize = ntohs (get->header.size);
2076  xquery_size = ntohl (get->xquery_size);
2077  reply_bf_size = msize - (sizeof (struct PeerGetMessage) + xquery_size);
2078  type = ntohl (get->type);
2079  options = ntohl (get->options);
2080  xquery = (const char *) &get[1];
2082  gettext_noop ("# P2P GET requests received"),
2083  1,
2084  GNUNET_NO);
2086  gettext_noop ("# P2P GET bytes received"),
2087  msize,
2088  GNUNET_NO);
2090  {
2091  char *tmp;
2092 
2095  "R5N GET %s: %s->%s (%u, %u=>%u) xq: %.*s\n",
2096  GNUNET_h2s (&get->key),
2097  GNUNET_i2s (peer->id),
2098  tmp,
2099  ntohl(get->hop_count),
2101  &get->key),
2103  &get->key),
2104  ntohl(get->xquery_size),
2105  xquery);
2106  GNUNET_free (tmp);
2107  }
2108  eval
2110  type,
2111  NULL,
2113  &get->key,
2114  xquery,
2115  xquery_size,
2116  NULL,
2117  0);
2119  {
2120  /* request invalid or block type not supported */
2122  return;
2123  }
2129  &peer->phash));
2131  type,
2132  get->bf_mutator,
2133  &xquery[xquery_size],
2134  reply_bf_size,
2135  "filter-size",
2136  reply_bf_size,
2137  NULL);
2139  "GET for %s at %s after %u hops\n",
2140  GNUNET_h2s (&get->key),
2142  (unsigned int) ntohl (get->hop_count));
2143  /* local lookup (this may update the reply_bf) */
2144  if ((0 != (options & GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE)) ||
2145  (GDS_am_closest_peer (&get->key,
2146  peer_bf)))
2147  {
2148  if ((0 != (options & GNUNET_DHT_RO_FIND_PEER)))
2149  {
2151  gettext_noop ("# P2P FIND PEER requests processed"),
2152  1,
2153  GNUNET_NO);
2154  handle_find_peer (peer->id,
2155  &get->key,
2156  bg);
2157  }
2158  else
2159  {
2160  eval = GDS_DATACACHE_handle_get (&get->key,
2161  type,
2162  xquery,
2163  xquery_size,
2164  bg,
2166  peer);
2167  }
2168  }
2169  else
2170  {
2172  gettext_noop ("# P2P GET requests ONLY routed"),
2173  1,
2174  GNUNET_NO);
2175  }
2176 
2177  /* remember request for routing replies */
2178  GDS_ROUTING_add (peer->id,
2179  type,
2180  bg, /* bg now owned by routing, but valid at least until end of this function! */
2181  options,
2182  &get->key,
2183  xquery,
2184  xquery_size);
2185 
2186  /* P2P forwarding */
2187  forwarded = GNUNET_NO;
2188  if (eval != GNUNET_BLOCK_EVALUATION_OK_LAST)
2189  forwarded = GDS_NEIGHBOURS_handle_get (type,
2190  options,
2191  ntohl (get->desired_replication_level),
2192  ntohl (get->hop_count),
2193  &get->key,
2194  xquery,
2195  xquery_size,
2196  bg,
2197  peer_bf);
2198  GDS_CLIENTS_process_get (options
2199  | (GNUNET_OK == forwarded)
2200  ? GNUNET_DHT_RO_LAST_HOP : 0,
2201  type,
2202  ntohl (get->hop_count),
2203  ntohl (get->desired_replication_level),
2204  0,
2205  NULL,
2206  &get->key);
2207 
2208  /* clean up; note that 'bg' is owned by routing now! */
2210 }
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:81
#define GNUNET_OK
Named constants for return values.
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.
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:339
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:290
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:80
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 2221 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.

2223 {
2224  uint32_t get_path_length;
2225  uint32_t put_path_length;
2226  uint16_t msize;
2227 
2228  (void) cls;
2229  msize = ntohs (prm->header.size);
2230  put_path_length = ntohl (prm->put_path_length);
2231  get_path_length = ntohl (prm->get_path_length);
2232  if ((msize <
2233  sizeof (struct PeerResultMessage) + (get_path_length +
2234  put_path_length) *
2235  sizeof (struct GNUNET_PeerIdentity)) ||
2236  (get_path_length >
2237  GNUNET_MAX_MESSAGE_SIZE / sizeof (struct GNUNET_PeerIdentity)) ||
2238  (put_path_length >
2239  GNUNET_MAX_MESSAGE_SIZE / sizeof (struct GNUNET_PeerIdentity)))
2240  {
2241  GNUNET_break_op (0);
2242  return GNUNET_SYSERR;
2243  }
2244  return GNUNET_OK;
2245 }
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:78
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:79
#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 2262 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().

2271 {
2272  /* forward to local clients */
2273  GDS_CLIENTS_handle_reply (expiration_time,
2274  key,
2275  get_path_length,
2276  get_path,
2277  put_path_length,
2278  put_path,
2279  type,
2280  data_size,
2281  data);
2283  get_path,
2284  get_path_length,
2285  put_path,
2286  put_path_length,
2287  expiration_time,
2288  key,
2289  data,
2290  data_size);
2291  if (GNUNET_YES == cache_results)
2292  {
2293  struct GNUNET_PeerIdentity xput_path[get_path_length + 1 + put_path_length];
2294 
2295  GNUNET_memcpy (xput_path,
2296  put_path,
2297  put_path_length * sizeof (struct GNUNET_PeerIdentity));
2298  GNUNET_memcpy (&xput_path[put_path_length],
2299  get_path,
2300  get_path_length * sizeof (struct GNUNET_PeerIdentity));
2301 
2302  GDS_DATACACHE_handle_put (expiration_time,
2303  key,
2304  get_path_length + put_path_length,
2305  xput_path,
2306  type,
2307  data_size,
2308  data);
2309  }
2310  /* forward to other peers */
2312  expiration_time,
2313  key,
2314  put_path_length,
2315  put_path,
2316  get_path_length,
2317  get_path,
2318  data,
2319  data_size);
2320 }
static int cache_results
Do we cache all results that we are routing in the local datacache?
#define GNUNET_memcpy(dst, src, n)
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:80
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 2330 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.

2332 {
2333  struct PeerInfo *peer = cls;
2334  const struct GNUNET_PeerIdentity *put_path;
2335  const struct GNUNET_PeerIdentity *get_path;
2336  const void *data;
2337  uint32_t get_path_length;
2338  uint32_t put_path_length;
2339  uint16_t msize;
2340  size_t data_size;
2341  enum GNUNET_BLOCK_Type type;
2342  struct GNUNET_TIME_Absolute exp_time;
2343 
2344  /* parse and validate message */
2345  exp_time = GNUNET_TIME_absolute_ntoh (prm->expiration_time);
2346  if (0 == GNUNET_TIME_absolute_get_remaining (exp_time).rel_value_us)
2347  {
2349  gettext_noop ("# Expired results discarded"),
2350  1,
2351  GNUNET_NO);
2352  return;
2353  }
2354  msize = ntohs (prm->header.size);
2355  put_path_length = ntohl (prm->put_path_length);
2356  get_path_length = ntohl (prm->get_path_length);
2357  put_path = (const struct GNUNET_PeerIdentity *) &prm[1];
2358  get_path = &put_path[put_path_length];
2359  type = ntohl (prm->type);
2360  data = (const void *) &get_path[get_path_length];
2361  data_size = msize - (sizeof (struct PeerResultMessage) +
2362  (get_path_length +
2363  put_path_length) * sizeof (struct GNUNET_PeerIdentity));
2365  gettext_noop ("# P2P RESULTS received"),
2366  1,
2367  GNUNET_NO);
2369  gettext_noop ("# P2P RESULT bytes received"),
2370  msize,
2371  GNUNET_NO);
2373  {
2374  char *tmp;
2375  char *pp;
2376  char *gp;
2377 
2378  gp = GNUNET_STRINGS_pp2s (get_path,
2379  get_path_length);
2380  pp = GNUNET_STRINGS_pp2s (put_path,
2381  put_path_length);
2384  "R5N RESULT %s: %s->%s (GP: %s, PP: %s)\n",
2385  GNUNET_h2s (&prm->key),
2386  GNUNET_i2s (peer->id),
2387  tmp,
2388  gp,
2389  pp);
2390  GNUNET_free (gp);
2391  GNUNET_free (pp);
2392  GNUNET_free (tmp);
2393  }
2394  /* if we got a HELLO, consider it for our own routing table */
2395  if (GNUNET_BLOCK_TYPE_DHT_HELLO == type)
2396  {
2397  const struct GNUNET_MessageHeader *h;
2398  struct GNUNET_PeerIdentity pid;
2399 
2400  /* Should be a HELLO, validate and consider using it! */
2401  if (data_size < sizeof (struct GNUNET_HELLO_Message))
2402  {
2403  GNUNET_break_op (0);
2404  return;
2405  }
2406  h = data;
2407  if (data_size != ntohs (h->size))
2408  {
2409  GNUNET_break_op (0);
2410  return;
2411  }
2412  if (GNUNET_OK !=
2413  GNUNET_HELLO_get_id ((const struct GNUNET_HELLO_Message *) h,
2414  &pid))
2415  {
2416  GNUNET_break_op (0);
2417  return;
2418  }
2419  if ( (GNUNET_YES != disable_try_connect) &&
2420  (0 != memcmp (&my_identity,
2421  &pid,
2422  sizeof (struct GNUNET_PeerIdentity))) )
2423  try_connect (&pid,
2424  h);
2425  }
2426 
2427  /* First, check if 'peer' is already on the path, and if
2428  so, truncate it instead of expanding. */
2429  for (unsigned int i=0;i<=get_path_length;i++)
2430  if (0 == memcmp (&get_path[i],
2431  peer->id,
2432  sizeof (struct GNUNET_PeerIdentity)))
2433  {
2434  process_reply_with_path (exp_time,
2435  &prm->key,
2436  i,
2437  get_path,
2438  put_path_length,
2439  put_path,
2440  type,
2441  data_size,
2442  data);
2443  return;
2444  }
2445 
2446  /* Need to append 'peer' to 'get_path' (normal case) */
2447  {
2448  struct GNUNET_PeerIdentity xget_path[get_path_length + 1];
2449 
2450  GNUNET_memcpy (xget_path,
2451  get_path,
2452  get_path_length * sizeof (struct GNUNET_PeerIdentity));
2453  xget_path[get_path_length] = *peer->id;
2454 
2455  process_reply_with_path (exp_time,
2456  &prm->key,
2457  get_path_length + 1,
2458  xget_path,
2459  put_path_length,
2460  put_path,
2461  type,
2462  data_size,
2463  data);
2464  }
2465 }
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:668
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:670
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).
uint32_t get_path_length
Length of the GET path that follows (if tracked).
#define GNUNET_NO
Definition: gnunet_common.h:81
#define GNUNET_OK
Named constants for return values.
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).
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_memcpy(dst, src, n)
#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:99
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:80
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 2474 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().

2475 {
2476  struct GNUNET_MQ_MessageHandler core_handlers[] = {
2477  GNUNET_MQ_hd_var_size (dht_p2p_get,
2479  struct PeerGetMessage,
2480  NULL),
2481  GNUNET_MQ_hd_var_size (dht_p2p_put,
2483  struct PeerPutMessage,
2484  NULL),
2485  GNUNET_MQ_hd_var_size (dht_p2p_result,
2487  struct PeerResultMessage,
2488  NULL),
2490  };
2491  unsigned long long temp_config_num;
2492 
2495  "DHT",
2496  "DISABLE_TRY_CONNECT");
2497  if (GNUNET_OK ==
2499  "DHT",
2500  "bucket_size",
2501  &temp_config_num))
2502  bucket_size = (unsigned int) temp_config_num;
2505  "DHT",
2506  "CACHE_RESULTS");
2507 
2509  (NULL != getenv("GNUNET_DHT_ROUTE_DEBUG")) ? GNUNET_YES : GNUNET_NO;
2512  NULL,
2513  &core_init,
2516  core_handlers);
2517  if (NULL == core_api)
2518  return GNUNET_SYSERR;
2520  GNUNET_YES);
2522  GNUNET_NO);
2523  return GNUNET_OK;
2524 }
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:81
#define GNUNET_OK
Named constants for return values.
Definition: gnunet_common.h:78
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:79
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:694
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:80
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 2531 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().

2532 {
2533  if (NULL == core_api)
2534  return;
2536  core_api = NULL;
2537  GNUNET_assert (0 ==
2540  all_connected_peers = NULL;
2543  NULL);
2545  all_desired_peers = NULL;
2547  ats_ch = NULL;
2548  GNUNET_assert (NULL == find_peer_task);
2549 }
#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:732
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 2558 of file gnunet-service-dht_neighbours.c.

References my_identity.

Referenced by handle_dht_local_get(), and handle_dht_local_put().

2559 {
2560  return &my_identity;
2561 }
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 349 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 354 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 359 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 365 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 370 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 375 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 381 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 387 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 397 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 412 of file gnunet-service-dht_neighbours.c.

◆ ats_ch

struct GNUNET_ATS_ConnectivityHandle* ats_ch
static

Handle to ATS connectivity.

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