GNUnet 0.28.0-dev.2-27-gc87478450
 
Loading...
Searching...
No Matches
gnunet-service-dht_neighbours.h File Reference

GNUnet DHT routing code. More...

Include dependency graph for gnunet-service-dht_neighbours.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef void(* GDS_PutOperationCallback) (void *cls, enum GNUNET_GenericReturnValue forwarded)
 

Functions

struct PeerInfoGDS_NEIGHBOURS_lookup_peer (const struct GNUNET_PeerIdentity *target)
 Lookup peer by peer's identity.
 
void GDS_NEIGHBOURS_handle_put (const struct GNUNET_DATACACHE_Block *bd, uint16_t desired_replication_level, uint16_t hop_count, struct GNUNET_CONTAINER_BloomFilter *bf, GDS_PutOperationCallback cb, void *cb_cls)
 Perform a PUT operation.
 
enum GNUNET_GenericReturnValue GDS_NEIGHBOURS_handle_get (enum GNUNET_BLOCK_Type type, enum GNUNET_DHT_RouteOption options, uint16_t desired_replication_level, uint16_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.
 
void GDS_NEIGHBOURS_handle_reply (struct PeerInfo *pi, const struct GNUNET_DATACACHE_Block *bd, const struct GNUNET_HashCode *query_hash, unsigned int get_path_length, const struct GNUNET_DHT_PathElement *get_path, GNUNET_SCHEDULER_TaskCallback cb, void *cb_cls)
 Handle a reply (route to origin).
 
enum GNUNET_GenericReturnValue 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.
 
void GDS_try_connect (void *cls, const struct GNUNET_PeerIdentity *pid, const char *uri)
 Callback function used to extract URIs from a builder.
 
void GDS_u_connect (void *cls, struct GNUNET_DHTU_Target *target, const struct GNUNET_PeerIdentity *pid, void **ctx)
 Function to call when we connect to a peer and can henceforth transmit to that peer.
 
void GDS_u_disconnect (void *ctx)
 Function to call when we disconnected from a peer and can henceforth cannot transmit to that peer anymore.
 
void GDS_u_receive (void *cls, void **tctx, void **sctx, const void *message, size_t message_size)
 Function to call when we receive a message.
 
void GDS_NEIGHBOURS_broadcast (const struct GNUNET_MessageHeader *msg)
 Send msg to all peers in our buckets.
 
enum GNUNET_GenericReturnValue GDS_NEIGHBOURS_init (void)
 Initialize neighbours subsystem.
 
void GDS_NEIGHBOURS_done (void)
 Shutdown neighbours subsystem.
 
const struct GNUNET_PeerIdentityGDS_NEIGHBOURS_get_id (void)
 Get the ID of the local node.
 

Detailed Description

GNUnet DHT routing code.

Author
Christian Grothoff
Nathan Evans

Definition in file gnunet-service-dht_neighbours.h.

Typedef Documentation

◆ GDS_PutOperationCallback

typedef void(* GDS_PutOperationCallback) (void *cls, enum GNUNET_GenericReturnValue forwarded)

Definition at line 40 of file gnunet-service-dht_neighbours.h.

Function Documentation

◆ GDS_NEIGHBOURS_lookup_peer()

struct PeerInfo * GDS_NEIGHBOURS_lookup_peer ( const struct GNUNET_PeerIdentity target)

Lookup peer by peer's identity.

Parameters
targetpeer to look up
Returns
NULL if we are not connected to target

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

1549{
1551 target);
1552}
static struct GNUNET_CONTAINER_MultiPeerMap * all_connected_peers
Hash map of all CORE-connected peers, for easy removal from k_buckets on disconnect.
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.

References all_connected_peers, and GNUNET_CONTAINER_multipeermap_get().

Referenced by process().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_handle_put()

void GDS_NEIGHBOURS_handle_put ( const struct GNUNET_DATACACHE_Block bd,
uint16_t  desired_replication_level,
uint16_t  hop_count,
struct GNUNET_CONTAINER_BloomFilter bf,
GDS_PutOperationCallback  cb,
void *  cb_cls 
)

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
bddata about the block
desired_replication_leveldesired replication level
hop_counthow many hops has this message traversed so far
bfBloom filter of peers this PUT has already traversed
Returns
GNUNET_OK if the request was forwarded, GNUNET_NO if not

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

1306{
1307 const struct GNUNET_PeerIdentity *my_identity;
1308 const struct GNUNET_HashCode *my_identity_hash;
1309 struct GDS_RoutingPutCallbackData gds_routing;
1310 size_t msize;
1311 enum GNUNET_DHT_RouteOption ro = bd->ro;
1312 unsigned int put_path_length = bd->put_path_length;
1313 const struct GNUNET_DHT_PathElement *put_path = bd->put_path;
1314 bool truncated = (0 != (bd->ro & GNUNET_DHT_RO_TRUNCATED));
1315 const struct GNUNET_PeerIdentity *trunc_peer
1316 = truncated
1317 ? &bd->trunc_peer
1318 : NULL;
1319 struct GNUNET_PeerIdentity trunc_peer_out;
1321
1323 my_identity_hash = GNUNET_PILS_get_identity_hash (GDS_pils);
1324 GNUNET_assert (NULL != my_identity);
1325
1328 bd->ro, &ro,
1329 bd->expiration_time,
1330 bd->data, bd->data_size,
1331 put_path, put_path_length,
1332 &put_path_length,
1333 trunc_peer,
1334 &trunc_peer_out,
1335 &truncated);
1336 if (truncated)
1337 trunc_peer = &trunc_peer_out;
1338 /* Path may have been truncated by the call above */
1340 "Adding myself (%s) to PUT bloomfilter for %s with RO(%s/%s)\n",
1342 GNUNET_h2s (&bd->key),
1343 (bd->ro & GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE) ? "x" : "-",
1344 (bd->ro & GNUNET_DHT_RO_RECORD_ROUTE) ? "R" : "-");
1345
1346 /* if we got a HELLO, consider it for our own routing table */
1347 hello_check (bd);
1348 GNUNET_assert ((NULL != bf) && (NULL != my_identity_hash));
1349 GNUNET_CONTAINER_bloomfilter_add (bf, my_identity_hash);
1351 "# PUT requests routed",
1352 1,
1353 GNUNET_NO);
1354 if (GNUNET_OK != ret)
1355 {
1356 if (cb)
1357 cb (cb_cls, ret);
1358 return;
1359 }
1360 gds_routing.target_count
1361 = get_target_peers (&bd->key,
1362 bf,
1363 hop_count,
1364 desired_replication_level,
1365 &(gds_routing.targets));
1366 if (0 == gds_routing.target_count)
1367 {
1369 "Routing PUT for %s terminates after %u hops at %s\n",
1370 GNUNET_h2s (&bd->key),
1371 (unsigned int) hop_count,
1373 if (cb)
1374 cb (cb_cls, GNUNET_NO);
1375 if (gds_routing.targets)
1376 GNUNET_free (gds_routing.targets);
1377 return;
1378 }
1379 GNUNET_memcpy (&(gds_routing.key), &(bd->key),
1380 sizeof (gds_routing.key));
1381 for (unsigned int i = 0; i < gds_routing.target_count; i++)
1382 {
1383 struct PeerInfo *target = gds_routing.targets[i];
1384
1386 &target->phash);
1387 }
1388
1389 gds_routing.queued = GNUNET_new (unsigned int);
1390 *(gds_routing.queued) = 0;
1391
1392 gds_routing.cb = cb;
1393 gds_routing.cb_cls = cb_cls;
1394
1395 for (unsigned int i = 0; i < gds_routing.target_count; i++)
1396 {
1397 struct PeerInfo *target = gds_routing.targets[i];
1398 struct PeerPutMessage *ppm;
1399 char buf[msize] GNUNET_ALIGN;
1400
1401 gds_routing.index = i;
1402
1403 ppm = (struct PeerPutMessage *) buf;
1404 GDS_helper_make_put_message (ppm, msize,
1405 NULL,
1406 &target->id,
1407 &target->phash,
1408 bf,
1409 &bd->key,
1410 ro,
1411 bd->type,
1412 bd->expiration_time,
1413 bd->data, bd->data_size,
1414 put_path, put_path_length,
1415 hop_count,
1417 trunc_peer,
1419 sizeof (gds_routing),
1420 &gds_routing);
1421 }
1422}
bool GDS_helper_make_put_message(struct PeerPutMessage *ppm, size_t msize, const struct GNUNET_CRYPTO_EddsaPrivateKey *sk, const struct GNUNET_PeerIdentity *target, const struct GNUNET_HashCode *target_hash, const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *block_key, enum GNUNET_DHT_RouteOption ro, enum GNUNET_BLOCK_Type block_type, struct GNUNET_TIME_Absolute block_expiration_time, const uint8_t *block_data, size_t block_data_len, const struct GNUNET_DHT_PathElement *put_path, unsigned int put_path_len, size_t hop_count, uint32_t desired_replication_level, const struct GNUNET_PeerIdentity *trunc_peer, GDS_HelperMsgCallback cb, size_t cb_data_size, void *cb_data)
Definition dht_helper.c:326
enum GNUNET_GenericReturnValue GDS_helper_put_message_get_size(size_t *msize_out, const struct GNUNET_PeerIdentity *my_identity, enum GNUNET_DHT_RouteOption ro_in, enum GNUNET_DHT_RouteOption *ro_out, struct GNUNET_TIME_Absolute block_expiration_time, const uint8_t *block_data, size_t block_data_len, const struct GNUNET_DHT_PathElement *put_path_in, unsigned int put_path_len_in, unsigned int *put_path_len_out, const struct GNUNET_PeerIdentity *trunc_peer, struct GNUNET_PeerIdentity *trunc_peer_out, bool *truncated)
Definition dht_helper.c:96
struct GNUNET_PILS_Handle * GDS_pils
Handle for the pils service.
static int ret
Final status code.
Definition gnunet-arm.c:93
static struct GNUNET_PeerIdentity my_identity
Identity of this peer.
struct GNUNET_STATISTICS_Handle * GDS_stats
Handle for the statistics service.
static bool cb_routing_put_message(void *cls, size_t msize, struct PeerPutMessage *ppm)
static unsigned int get_target_peers(const struct GNUNET_HashCode *key, struct GNUNET_CONTAINER_BloomFilter *bloom, uint16_t hop_count, uint16_t target_replication, struct PeerInfo ***targets)
Compute the set of peers that the given request should be forwarded to.
static void hello_check(const struct GNUNET_DATACACHE_Block *bd)
If we got a HELLO, consider it for our own routing table.
const struct GNUNET_HashCode * GNUNET_PILS_get_identity_hash(const struct GNUNET_PILS_Handle *handle)
Return the hash of the current peer identity from a given handle.
Definition pils_api.c:736
const struct GNUNET_PeerIdentity * GNUNET_PILS_get_identity(const struct GNUNET_PILS_Handle *handle)
Return the current peer identity of a given handle.
Definition pils_api.c:727
void GNUNET_CONTAINER_bloomfilter_add(struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Add an element to the filter.
GNUNET_DHT_RouteOption
Options for routing.
@ GNUNET_DHT_RO_TRUNCATED
Flag set if the path was truncated.
@ GNUNET_DHT_RO_RECORD_ROUTE
We should keep track of the route that the message took in the P2P network.
@ GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE
Each peer along the way should process the request (otherwise only peers locally closest to the key w...
#define GNUNET_log(kind,...)
#define GNUNET_ALIGN
gcc-ism to force alignment; we use this to align char-arrays that may then be cast to 'struct's.
#define GNUNET_memcpy(dst, src, n)
Call memcpy() but check for n being 0 first.
GNUNET_GenericReturnValue
Named constants for return values.
@ GNUNET_OK
@ GNUNET_NO
const char * GNUNET_i2s(const struct GNUNET_PeerIdentity *pid)
Convert a peer identity to a string (for printing debug messages).
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
const char * GNUNET_h2s(const struct GNUNET_HashCode *hc)
Convert a hash value to a string (for printing debug messages).
@ GNUNET_ERROR_TYPE_DEBUG
#define GNUNET_new(type)
Allocate a struct or union of the given type.
#define GNUNET_free(ptr)
Wrapper around free.
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
const struct GNUNET_DHT_PathElement * put_path
PUT path taken by the block, array of peer identities.
enum GNUNET_BLOCK_Type type
Type of the block.
const void * data
Actual block data.
enum GNUNET_DHT_RouteOption ro
Options for routing for the block.
struct GNUNET_PeerIdentity trunc_peer
If the path was truncated, this is the peer ID at which the path was truncated.
struct GNUNET_HashCode key
Key of the block.
size_t data_size
Number of bytes in data.
unsigned int put_path_length
Length of the put_path array.
struct GNUNET_TIME_Absolute expiration_time
When does the block expire?
A (signed) path tracking a block's flow through the DHT is represented by an array of path elements,...
A 512-bit hashcode.
The identity of the host (wraps the signing key of the peer).
Entry for a peer in a bucket.
struct GNUNET_PeerIdentity id
What is the identity of the peer?
struct GNUNET_HashCode phash
Hash of id.
P2P PUT message.
Definition dht.h:429
uint16_t desired_replication_level
Replication level for this message.
Definition dht.h:453
uint16_t hop_count
Hop count.
Definition dht.h:448
uint16_t put_path_length
Length of the PUT path that follows (if tracked).
Definition dht.h:458

References GDS_RoutingPutCallbackData::cb, GDS_RoutingPutCallbackData::cb_cls, cb_routing_put_message(), GNUNET_DATACACHE_Block::data, GNUNET_DATACACHE_Block::data_size, PeerPutMessage::desired_replication_level, GNUNET_DATACACHE_Block::expiration_time, GDS_helper_make_put_message(), GDS_helper_put_message_get_size(), GDS_pils, GDS_stats, get_target_peers(), GNUNET_ALIGN, GNUNET_assert, GNUNET_CONTAINER_bloomfilter_add(), GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE, GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_DHT_RO_TRUNCATED, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_memcpy, GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_PILS_get_identity(), GNUNET_PILS_get_identity_hash(), GNUNET_STATISTICS_update(), hello_check(), PeerPutMessage::hop_count, PeerInfo::id, GDS_RoutingPutCallbackData::index, GNUNET_DATACACHE_Block::key, GDS_RoutingPutCallbackData::key, my_identity, PeerInfo::phash, GNUNET_DATACACHE_Block::put_path, GNUNET_DATACACHE_Block::put_path_length, PeerPutMessage::put_path_length, GDS_RoutingPutCallbackData::queued, ret, GNUNET_DATACACHE_Block::ro, GDS_RoutingPutCallbackData::target_count, GDS_RoutingPutCallbackData::targets, GNUNET_DATACACHE_Block::trunc_peer, and GNUNET_DATACACHE_Block::type.

Referenced by handle_dht_local_put(), and handle_dht_p2p_put().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_handle_get()

enum GNUNET_GenericReturnValue GDS_NEIGHBOURS_handle_get ( enum GNUNET_BLOCK_Type  type,
enum GNUNET_DHT_RouteOption  options,
uint16_t  desired_replication_level,
uint16_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
bgblock group to filter replies
peer_bffilter for peers not to select (again, updated)
Returns
GNUNET_OK if the request was forwarded, GNUNET_NO if not

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

1435{
1436 const struct GNUNET_PeerIdentity *my_identity;
1437 const struct GNUNET_HashCode *my_identity_hash;
1438 unsigned int target_count;
1439 struct PeerInfo **targets;
1440 size_t msize;
1441 size_t result_filter_size;
1442 void *result_filter;
1443
1445 my_identity_hash = GNUNET_PILS_get_identity_hash (GDS_pils);
1446
1447 if (NULL == my_identity_hash)
1448 return GNUNET_NO;
1449
1450 GNUNET_assert (NULL != peer_bf);
1452 "# GET requests routed",
1453 1,
1454 GNUNET_NO);
1455 target_count = get_target_peers (key,
1456 peer_bf,
1457 hop_count,
1458 desired_replication_level,
1459 &targets);
1461 "Adding myself (%s) to GET bloomfilter for %s with RO(%s/%s)\n",
1463 GNUNET_h2s (key),
1465 (options & GNUNET_DHT_RO_RECORD_ROUTE) ? "R" : "-");
1466 GNUNET_assert (NULL != my_identity_hash);
1467 GNUNET_CONTAINER_bloomfilter_add (peer_bf, my_identity_hash);
1468 if (0 == target_count)
1469 {
1471 "Routing GET for %s terminates after %u hops at %s\n",
1472 GNUNET_h2s (key),
1473 (unsigned int) hop_count,
1475 return GNUNET_NO;
1476 }
1477 if (GNUNET_OK !=
1479 &result_filter,
1480 &result_filter_size))
1481 {
1482 result_filter = NULL;
1483 result_filter_size = 0;
1484 }
1485 msize = xquery_size + result_filter_size;
1486 if (msize + sizeof(struct PeerGetMessage) >= GNUNET_MAX_MESSAGE_SIZE)
1487 {
1488 GNUNET_break (0);
1489 GNUNET_free (result_filter);
1490 GNUNET_free (targets);
1491 return GNUNET_NO;
1492 }
1493 /* update BF */
1494 for (unsigned int i = 0; i < target_count; i++)
1495 {
1496 struct PeerInfo *target = targets[i];
1497
1499 &target->phash);
1500 }
1501 /* forward request */
1502 for (unsigned int i = 0; i < target_count; i++)
1503 {
1504 struct PeerInfo *target = targets[i];
1505 struct PeerGetMessage *pgm;
1506 char buf[sizeof (*pgm) + msize] GNUNET_ALIGN;
1507 char *rf;
1508
1510 "Routing GET for %s after %u hops to %s\n",
1511 GNUNET_h2s (key),
1512 (unsigned int) hop_count,
1513 GNUNET_i2s (&target->id));
1514 pgm = (struct PeerGetMessage *) buf;
1516 pgm->header.size = htons (sizeof (buf));
1517 pgm->type = htonl (type);
1518 pgm->options = htons (options);
1519 pgm->hop_count = htons (hop_count + 1);
1521 pgm->result_filter_size = htons ((uint16_t) result_filter_size);
1524 pgm->bloomfilter,
1526 pgm->key = *key;
1527 rf = (char *) &pgm[1];
1528 GNUNET_memcpy (rf,
1529 result_filter,
1532 xquery,
1533 xquery_size);
1534 do_send (target,
1535 &pgm->header);
1536 }
1538 "# GET messages queued for transmission",
1539 target_count,
1540 GNUNET_NO);
1541 GNUNET_free (targets);
1542 GNUNET_free (result_filter);
1543 return (0 < target_count) ? GNUNET_OK : GNUNET_NO;
1544}
struct GNUNET_GETOPT_CommandLineOption options[]
Definition 002.c:5
#define DHT_BLOOM_SIZE
Size of the bloom filter the DHT uses to filter peers.
Definition dht.h:34
struct GNUNET_HashCode key
The key used in the DHT.
static uint32_t type
Type string converted to DNS type value.
static void do_send(struct PeerInfo *pi, const struct GNUNET_MessageHeader *msg)
Send msg to pi.
#define GNUNET_MAX_MESSAGE_SIZE
Largest supported message (to be precise, one byte more than the largest possible message,...
enum GNUNET_GenericReturnValue GNUNET_BLOCK_group_serialize(struct GNUNET_BLOCK_Group *bg, void **raw_data, size_t *raw_data_size)
Serialize state of a block group.
Definition block.c:177
enum GNUNET_GenericReturnValue 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.
uint16_t type
The type of the message (GNUNET_MESSAGE_TYPE_XXXX), in big-endian format.
uint16_t size
The length of the struct (in bytes, including the length field itself), in big-endian format.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_GET
Peer tries to find data in DHT.
uint16_t result_filter_size
Size of the result filter.
char bloomfilter[128]
Bloomfilter (for peer identities) to stop circular routes.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_GET.
uint16_t desired_replication_level
Desired replication level for this request.
uint16_t options
Processing options.
struct GNUNET_HashCode key
The key we are looking for.
uint32_t type
Desired content type.

References PeerGetMessage::bloomfilter, PeerGetMessage::desired_replication_level, DHT_BLOOM_SIZE, do_send(), GDS_pils, GDS_stats, get_target_peers(), GNUNET_ALIGN, GNUNET_assert, GNUNET_BLOCK_group_serialize(), GNUNET_break, GNUNET_CONTAINER_bloomfilter_add(), GNUNET_CONTAINER_bloomfilter_get_raw_data(), GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE, GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_ERROR_TYPE_DEBUG, GNUNET_free, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_MAX_MESSAGE_SIZE, GNUNET_memcpy, GNUNET_MESSAGE_TYPE_DHT_P2P_GET, GNUNET_NO, GNUNET_OK, GNUNET_PILS_get_identity(), GNUNET_PILS_get_identity_hash(), GNUNET_STATISTICS_update(), PeerGetMessage::header, PeerGetMessage::hop_count, PeerInfo::id, key, PeerGetMessage::key, my_identity, options, PeerGetMessage::options, PeerInfo::phash, PeerGetMessage::result_filter_size, GNUNET_MessageHeader::size, type, GNUNET_MessageHeader::type, and PeerGetMessage::type.

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

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 ( struct PeerInfo pi,
const struct GNUNET_DATACACHE_Block bd,
const struct GNUNET_HashCode query_hash,
unsigned int  get_path_length,
const struct GNUNET_DHT_PathElement get_path,
GNUNET_SCHEDULER_TaskCallback  cb,
void *  cb_cls 
)

Handle a reply (route to origin).

Only forwards the reply back to other peers waiting for it. Does not do local caching or forwarding to local clients.

Parameters
pineighbour that should receive the block
bddetails about the reply
query_hashquery that was used for the request
get_path_lengthnumber of entries in put_path
get_pathpeers this reply has traversed so far (if tracked)
Returns
true on success

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

1676{
1677 struct GNUNET_DHT_PathElement *paths;
1678 size_t msize;
1679 unsigned int ppl = bd->put_path_length;
1680 const struct GNUNET_DHT_PathElement *put_path = bd->put_path;
1681 enum GNUNET_DHT_RouteOption ro = bd->ro;
1682 bool truncated = (0 != (ro & GNUNET_DHT_RO_TRUNCATED));
1683 const struct GNUNET_PeerIdentity *trunc_peer
1684 = truncated
1685 ? &bd->trunc_peer
1686 : NULL;
1687 bool tracking = (0 != (ro & GNUNET_DHT_RO_RECORD_ROUTE));
1688#if SANITY_CHECKS > 1
1689 const struct GNUNET_PeerIdentity *my_identity;
1690 unsigned int failure_offset;
1691
1693 GNUNET_assert (NULL != my_identity);
1694
1695 failure_offset
1697 bd->data_size,
1698 bd->expiration_time,
1699 trunc_peer,
1700 put_path,
1701 ppl,
1702 get_path,
1703 get_path_length,
1704 my_identity);
1705 if (0 != failure_offset)
1706 {
1707 GNUNET_assert (failure_offset <= ppl + get_path_length);
1708 GNUNET_break_op (0);
1709 if (failure_offset < ppl)
1710 {
1711 trunc_peer = &put_path[failure_offset - 1].pred;
1712 put_path += failure_offset;
1713 ppl -= failure_offset;
1714 truncated = true;
1716 }
1717 else
1718 {
1719 failure_offset -= ppl;
1720 if (0 == failure_offset)
1721 trunc_peer = &put_path[ppl - 1].pred;
1722 else
1723 trunc_peer = &get_path[failure_offset - 1].pred;
1724 ppl = 0;
1725 put_path = NULL;
1726 truncated = true;
1728 get_path += failure_offset;
1729 get_path_length -= failure_offset;
1730 }
1731 }
1732#endif
1733 msize = bd->data_size + sizeof (struct PeerResultMessage);
1734 if (msize > GNUNET_MAX_MESSAGE_SIZE)
1735 {
1736 GNUNET_break_op (0);
1737 safe_neighbours_callback (cb_cls, cb, false);
1738 return;
1739 }
1740 if (truncated)
1741 msize += sizeof (struct GNUNET_PeerIdentity);
1742 if (tracking)
1743 msize += sizeof (struct GNUNET_CRYPTO_EddsaSignature);
1744 if (msize < bd->data_size)
1745 {
1746 GNUNET_break_op (0);
1747 safe_neighbours_callback (cb_cls, cb, false);
1748 return;
1749 }
1750 if ( (GNUNET_MAX_MESSAGE_SIZE - msize)
1751 / sizeof(struct GNUNET_DHT_PathElement)
1752 < (get_path_length + ppl) )
1753 {
1754 get_path_length = 0;
1755 ppl = 0;
1756 }
1757 if ( (get_path_length > UINT16_MAX) ||
1758 (ppl > UINT16_MAX) )
1759 {
1760 GNUNET_break (0);
1761 get_path_length = 0;
1762 ppl = 0;
1763 }
1764 msize += (get_path_length + ppl)
1765 * sizeof(struct GNUNET_DHT_PathElement);
1767 "Forwarding reply for key %s to peer %s\n",
1768 GNUNET_h2s (query_hash),
1769 GNUNET_i2s (&pi->id));
1771 "# RESULT messages queued for transmission",
1772 1,
1773 GNUNET_NO);
1774 {
1775 struct PeerResultMessage *prm;
1776 char buf[msize] GNUNET_ALIGN;
1777
1778 prm = (struct PeerResultMessage *) buf;
1780 prm->header.size = htons (sizeof (buf));
1781 prm->type = htonl ((uint32_t) bd->type);
1782 prm->reserved = htons (0);
1783 prm->options = htons ((uint16_t) ro);
1784 prm->put_path_length = htons ((uint16_t) ppl);
1785 prm->get_path_length = htons ((uint16_t) get_path_length);
1787 prm->key = *query_hash;
1788 if (truncated)
1789 {
1790 void *tgt = &prm[1];
1791
1792 GNUNET_memcpy (tgt,
1793 trunc_peer,
1794 sizeof (struct GNUNET_PeerIdentity));
1795 paths = (struct GNUNET_DHT_PathElement *)
1796 (tgt + sizeof (struct GNUNET_PeerIdentity));
1797 }
1798 else
1799 {
1800 paths = (struct GNUNET_DHT_PathElement *) &prm[1];
1801 }
1802 if (NULL != put_path)
1803 {
1804 GNUNET_memcpy (paths,
1805 put_path,
1806 ppl * sizeof(struct GNUNET_DHT_PathElement));
1807 }
1808 else
1809 {
1810 GNUNET_assert (0 == ppl);
1811 }
1812 if (NULL != get_path)
1813 {
1814 GNUNET_memcpy (&paths[ppl],
1815 get_path,
1816 get_path_length * sizeof(struct GNUNET_DHT_PathElement));
1817 }
1818 else
1819 {
1820 GNUNET_assert (0 == get_path_length);
1821 }
1822 if (tracking)
1823 {
1824 struct GDS_NeighboursReply reply;
1825 const struct GNUNET_PeerIdentity *pred;
1826
1827 reply.pi = pi;
1828 GNUNET_memcpy (&reply.bd, bd, sizeof (reply.bd));
1829 reply.block_data = GNUNET_memdup (bd->data, bd->data_size);
1830 reply.put_path = GNUNET_memdup (bd->put_path,
1831 sizeof (struct GNUNET_DHT_PathElement)
1832 * bd->put_path_length);
1833
1834 reply.bd.data = reply.block_data;
1835 reply.bd.put_path = reply.put_path;
1836
1837 reply.buf = GNUNET_memdup (buf, msize);
1838 reply.prm = (struct PeerResultMessage*) reply.buf;
1839 reply.paths = (struct GNUNET_DHT_PathElement*) (reply.buf + (buf - (const
1840 char*)
1841 paths));
1842
1843 if (trunc_peer)
1844 {
1845 reply.trunc_peer_is_null = false;
1846 GNUNET_memcpy (&reply.trunc_peer_id, trunc_peer,
1847 sizeof (reply.trunc_peer_id));
1848 }
1849 else
1850 {
1851 reply.trunc_peer_is_null = true;
1852 }
1853
1854 reply.cb = cb;
1855 reply.cb_cls = cb_cls;
1856
1857 if (ppl + get_path_length > 0)
1858 pred = &paths[ppl + get_path_length - 1].pred;
1859 else if (truncated)
1860 pred = trunc_peer;
1861 else
1862 pred = NULL; /* we are first! */
1863 /* Note that the last signature in 'paths' was not initialized before,
1864 so this is crucial to avoid sending garbage. */
1866 bd->data_size,
1867 NULL,
1868 bd->expiration_time,
1869 pred,
1870 &pi->id,
1872 sizeof (reply),
1873 &reply);
1874 }
1875 else
1876 {
1877 void *data;
1878 data = &prm[1];
1880 bd->data,
1881 bd->data_size);
1882 do_send (pi,
1883 &prm->header);
1884 safe_neighbours_callback (cb_cls, cb, true);
1885 return;
1886 }
1887 }
1888}
bool GDS_helper_sign_path(const void *data, size_t data_size, const struct GNUNET_CRYPTO_EddsaPrivateKey *sk, struct GNUNET_TIME_Absolute exp_time, const struct GNUNET_PeerIdentity *pred, const struct GNUNET_PeerIdentity *succ, GDS_HelperCallback cb, size_t cb_data_size, void *cb_data)
Sign that we are routing a message from pred to succ.
Definition dht_helper.c:226
static char * data
The data to insert into the dht.
static size_t data_size
Number of bytes in data.
static void safe_neighbours_callback(void *cls, GNUNET_SCHEDULER_TaskCallback cb, bool success)
static bool cb_path_signed(void *cls, const struct GNUNET_CRYPTO_EddsaSignature *sig)
unsigned int GNUNET_DHT_verify_path(const void *data, size_t data_size, struct GNUNET_TIME_Absolute exp_time, const struct GNUNET_PeerIdentity *trunc_peer, const struct GNUNET_DHT_PathElement *put_path, unsigned int put_path_len, const struct GNUNET_DHT_PathElement *get_path, unsigned int get_path_len, const struct GNUNET_PeerIdentity *me)
Verify signatures on a path consisting of put_path and get_path in reverse order (starting at the las...
Definition dht_api.c:1354
#define GNUNET_break_op(cond)
Use this for assertion violations caused by other peers (i.e.
#define GNUNET_memdup(buf, size)
Allocate and initialize a block of memory.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT
Data is returned to peer from DHT.
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition time.c:636
an ECC signature using EdDSA.
struct GNUNET_PeerIdentity pred
Previous peer on the path (matches "pred" in the signed field).
uint16_t get_path_length
Length of the GET path that follows (if tracked).
uint16_t options
Message options, actually an 'enum GNUNET_DHT_RouteOption' value in NBO.
struct GNUNET_HashCode key
The key of the corresponding GET request.
struct GNUNET_MessageHeader header
Type: GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT.
uint16_t put_path_length
Length of the PUT path that follows (if tracked).
struct GNUNET_TIME_AbsoluteNBO expiration_time
When does the content expire?

References GDS_NeighboursReply::bd, GDS_NeighboursReply::block_data, GDS_NeighboursReply::buf, GDS_NeighboursReply::cb, GDS_NeighboursReply::cb_cls, cb_path_signed(), data, GNUNET_DATACACHE_Block::data, data_size, GNUNET_DATACACHE_Block::data_size, do_send(), GNUNET_DATACACHE_Block::expiration_time, PeerResultMessage::expiration_time, GDS_helper_sign_path(), GDS_pils, GDS_stats, PeerResultMessage::get_path_length, GNUNET_ALIGN, GNUNET_assert, GNUNET_break, GNUNET_break_op, GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_DHT_RO_TRUNCATED, GNUNET_DHT_verify_path(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_i2s(), GNUNET_log, GNUNET_MAX_MESSAGE_SIZE, GNUNET_memcpy, GNUNET_memdup, GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT, GNUNET_NO, GNUNET_PILS_get_identity(), GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_hton(), PeerResultMessage::header, PeerInfo::id, PeerResultMessage::key, my_identity, PeerResultMessage::options, GDS_NeighboursReply::paths, GDS_NeighboursReply::pi, GNUNET_DHT_PathElement::pred, GDS_NeighboursReply::prm, GNUNET_DATACACHE_Block::put_path, GDS_NeighboursReply::put_path, GNUNET_DATACACHE_Block::put_path_length, PeerResultMessage::put_path_length, PeerResultMessage::reserved, GNUNET_DATACACHE_Block::ro, safe_neighbours_callback(), GNUNET_MessageHeader::size, GNUNET_DATACACHE_Block::trunc_peer, GDS_NeighboursReply::trunc_peer_id, GDS_NeighboursReply::trunc_peer_is_null, GNUNET_MessageHeader::type, GNUNET_DATACACHE_Block::type, and PeerResultMessage::type.

Referenced by handle_find_local_hello(), handle_find_my_hello(), handle_local_result(), and process().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_am_closest_peer()

enum GNUNET_GenericReturnValue 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 867 of file gnunet-service-dht_neighbours.c.

869{
870 const struct GNUNET_HashCode *my_identity_hash;
871 int delta;
872 my_identity_hash = GNUNET_PILS_get_identity_hash (GDS_pils);
873 GNUNET_assert (NULL != my_identity_hash);
874 if (0 == GNUNET_memcmp (my_identity_hash, key))
875 return GNUNET_YES;
876 for (int bucket_num = find_bucket (key);
877 bucket_num < closest_bucket;
878 bucket_num++)
879 {
880 unsigned int count = 0;
881 GNUNET_assert (bucket_num >= 0);
882 for (struct PeerInfo *pos = k_buckets[bucket_num].head;
883 NULL != pos;
884 pos = pos->next)
885 {
886 if (count >= bucket_size)
887 break; /* we only consider first #bucket_size entries per bucket */
888 count++;
889 if ( (NULL != bloom) &&
890 (GNUNET_YES ==
892 &pos->phash)) )
893 continue; /* Ignore filtered peers */
894 /* All peers in this bucket must be closer than us, as
895 they mismatch with our PID on the pivotal bit. So
896 because an unfiltered peer exists, we are not the
897 closest. */
898 delta = GNUNET_CRYPTO_hash_xorcmp (&pos->phash,
899 my_identity_hash,
900 key);
901 switch (delta)
902 {
903 case -1: /* pos closer */
904 return GNUNET_NO;
905 case 0: /* identical, impossible! */
906 GNUNET_assert (0);
907 break;
908 case 1: /* I am closer */
909 break;
910 }
911 }
912 }
913 /* No closer (unfiltered) peers found; we must be the closest! */
914 return GNUNET_YES;
915}
static int find_bucket(const struct GNUNET_HashCode *hc)
Find the optimal bucket for this key.
static unsigned int bucket_size
Maximum size for each bucket.
static unsigned int closest_bucket
The lowest currently used bucket, initially 0 (for 0-bits matching bucket).
static struct PeerBucket k_buckets[sizeof(struct GNUNET_HashCode) *8]
The buckets.
bool GNUNET_CONTAINER_bloomfilter_test(const struct GNUNET_CONTAINER_BloomFilter *bf, const struct GNUNET_HashCode *e)
Test if an element is in the filter.
int GNUNET_CRYPTO_hash_xorcmp(const struct GNUNET_HashCode *h1, const struct GNUNET_HashCode *h2, const struct GNUNET_HashCode *target)
Find out which of the two GNUNET_CRYPTO_hash codes is closer to target in the XOR metric (Kademlia).
#define GNUNET_memcmp(a, b)
Compare memory in a and b, where both must be of the same pointer type.
@ GNUNET_YES
static struct GNUNET_TIME_Relative delta
Definition speedup.c:36

References bucket_size, closest_bucket, delta, find_bucket(), GDS_pils, GNUNET_assert, GNUNET_CONTAINER_bloomfilter_test(), GNUNET_CRYPTO_hash_xorcmp(), GNUNET_memcmp, GNUNET_NO, GNUNET_PILS_get_identity_hash(), GNUNET_YES, k_buckets, and key.

Referenced by handle_dht_local_put(), handle_dht_p2p_get(), and handle_dht_p2p_put().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_try_connect()

void GDS_try_connect ( void *  cls,
const struct GNUNET_PeerIdentity pid,
const char *  uri 
)

Callback function used to extract URIs from a builder.

Called when we should consider connecting to a peer.

Parameters
clsclosure
pidpointing to a struct GNUNET_PeerIdentity *
urione of the URIs

Called when we should consider connecting to a peer.

Parameters
clsclosure pointing to a struct GNUNET_PeerIdentity *
urione of the URIs

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

3060{
3061 const struct GNUNET_PeerIdentity *my_identity;
3062 struct GNUNET_HashCode phash;
3063 int peer_bucket;
3064 struct PeerBucket *bucket;
3065 (void) cls;
3066
3068 GNUNET_assert (NULL != my_identity);
3069
3070 if (0 == GNUNET_memcmp (my_identity, pid))
3071 {
3073 "Got a HELLO for my own PID, ignoring it\n");
3074 return; /* that's us! */
3075 }
3077 sizeof(*pid),
3078 &phash);
3079 peer_bucket = find_bucket (&phash);
3080 GNUNET_assert ( (peer_bucket >= 0) &&
3081 ((unsigned int) peer_bucket < MAX_BUCKETS));
3082 bucket = &k_buckets[peer_bucket];
3083 for (struct PeerInfo *pi = bucket->head;
3084 NULL != pi;
3085 pi = pi->next)
3086 if (0 ==
3087 GNUNET_memcmp (&pi->id,
3088 pid))
3089 {
3090 /* already connected */
3092 uri);
3093 return;
3094 }
3095 if (bucket->peers_size >= bucket_size)
3096 return; /* do not care */
3098 "Discovered peer %s at %s suitable for bucket %d (%u/%u), trying to connect\n",
3099 GNUNET_i2s (pid),
3100 uri,
3101 peer_bucket,
3102 bucket->peers_size,
3103 bucket_size);
3104 /* new peer that we like! */
3106 uri);
3107}
static struct GNUNET_FS_Uri * uri
Value of URI provided on command-line (when not publishing a file but just creating UBlocks to refer ...
void GDS_u_try_connect(const struct GNUNET_PeerIdentity *pid, const char *address)
Ask all underlays to connect to peer pid at address.
#define MAX_BUCKETS
How many buckets will we allow in total.
static struct GNUNET_PeerIdentity pid
Identity of the peer we transmit to / connect to.
void GNUNET_CRYPTO_hash(const void *block, size_t size, struct GNUNET_HashCode *ret)
Compute hash of a given block.
Definition crypto_hash.c:40
@ GNUNET_ERROR_TYPE_INFO
Peers are grouped into buckets.
struct PeerInfo * head
Head of DLL.
unsigned int peers_size
Number of peers in the bucket.

References bucket_size, find_bucket(), GDS_pils, GDS_u_try_connect(), GNUNET_assert, GNUNET_CRYPTO_hash(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_i2s(), GNUNET_log, GNUNET_memcmp, GNUNET_PILS_get_identity(), PeerBucket::head, k_buckets, MAX_BUCKETS, my_identity, PeerBucket::peers_size, pid, and uri.

Referenced by handle_dht_local_hello_offer(), and hello_check().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_u_connect()

void GDS_u_connect ( void *  cls,
struct GNUNET_DHTU_Target target,
const struct GNUNET_PeerIdentity pid,
void **  ctx 
)

Function to call when we connect to a peer and can henceforth transmit to that peer.

Parameters
clsthe closure, must be a struct GDS_Underlay
targethandle to the target, pointer will remain valid until disconnect_cb is called
pidpeer identity, pointer will remain valid until disconnect_cb is called
[out]ctxstorage space for DHT to use in association with this target

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

659{
660 const struct GNUNET_PeerIdentity *my_identity;
661 struct GDS_Underlay *u = cls;
662 struct PeerInfo *pi;
663 struct PeerBucket *bucket;
664 bool do_hold = false;
665
667 GNUNET_assert (NULL != my_identity);
668
669 /* Check for connect to self message */
670 if (0 == GNUNET_memcmp (my_identity, pid))
671 return;
673 "Connected to peer %s\n",
674 GNUNET_i2s (pid));
676 pid);
677 if (NULL == pi)
678 {
680 "# peers connected",
681 1,
682 GNUNET_NO);
683 pi = GNUNET_new (struct PeerInfo);
684 pi->id = *pid;
686 sizeof(*pid),
687 &pi->phash);
688 pi->peer_bucket = find_bucket (&pi->phash);
689 GNUNET_assert ( (pi->peer_bucket >= 0) &&
690 ((unsigned int) pi->peer_bucket < MAX_BUCKETS));
691 bucket = &k_buckets[pi->peer_bucket];
693 bucket->tail,
694 pi);
695 bucket->peers_size++;
697 (unsigned int) pi->peer_bucket + 1);
700 &pi->id,
701 pi,
703 if (bucket->peers_size <= bucket_size)
704 {
706 do_hold = true;
707 }
710 {
711 /* got a first connection, good time to start with FIND PEER requests... */
714 NULL);
715 }
716 }
717 {
718 struct Target *t;
719
720 t = GNUNET_new (struct Target);
721 t->u = u;
722 t->utarget = target;
723 t->pi = pi;
725 pi->t_tail,
726 t);
727 *ctx = t;
728
729 }
730 if (do_hold)
731 update_hold (bucket);
732}
static mp_limb_t u[(((256)+GMP_NUMB_BITS - 1)/GMP_NUMB_BITS)]
static struct GNUNET_FS_Handle * ctx
static struct GNUNET_SCHEDULER_Task * t
Main task.
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 int disable_try_connect
Option for testing that disables the 'connect' function of the DHT.
static unsigned int newly_found_peers
How many peers have we added since we sent out our last find peer request?
static struct GNUNET_SCHEDULER_Task * find_peer_task
Task that sends FIND PEER requests.
static void update_hold(struct PeerBucket *bucket)
The list of the first bucket_size peers of bucket changed.
#define GNUNET_CONTAINER_DLL_insert_tail(head, tail, element)
Insert an element at the tail of a DLL.
#define GNUNET_CONTAINER_DLL_insert(head, tail, element)
Insert an element at the head of a DLL.
unsigned int GNUNET_CONTAINER_multipeermap_size(const struct GNUNET_CONTAINER_MultiPeerMap *map)
Get the number of key-value pairs in the map.
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.
@ GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY
There must only be one value per key; storing a value should fail if a value under the same key alrea...
#define GNUNET_MAX(a, b)
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:1310
Information we keep per underlay.
struct PeerInfo * tail
Tail of DLL.
struct Target * t_tail
Tail of DLL of targets for this peer.
int peer_bucket
Which bucket is this peer in?
struct Target * t_head
Head of DLL of targets for this peer.
List of targets that we can use to reach this peer.
struct PeerInfo * pi
Peer this is a target for.

References all_connected_peers, bucket_size, closest_bucket, ctx, disable_try_connect, find_bucket(), find_peer_task, GDS_pils, GDS_stats, GNUNET_assert, GNUNET_CONTAINER_DLL_insert, 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_PILS_get_identity(), GNUNET_SCHEDULER_add_now(), GNUNET_STATISTICS_update(), GNUNET_YES, PeerBucket::head, PeerInfo::id, k_buckets, MAX_BUCKETS, my_identity, newly_found_peers, PeerInfo::peer_bucket, PeerBucket::peers_size, PeerInfo::phash, Target::pi, pid, send_find_peer_message(), t, PeerInfo::t_head, PeerInfo::t_tail, PeerBucket::tail, u, and update_hold().

Referenced by load_underlay().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_u_disconnect()

void GDS_u_disconnect ( void *  ctx)

Function to call when we disconnected from a peer and can henceforth cannot transmit to that peer anymore.

Parameters
[in]ctxstorage space used by the DHT in association with this target

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

737{
738 struct Target *t = ctx;
739 struct PeerInfo *pi;
740 struct PeerBucket *bucket;
741 bool was_held = false;
742
743 /* Check for disconnect from self message (on shutdown) */
744 if (NULL == t)
745 return;
746 pi = t->pi;
748 pi->t_tail,
749 t);
750 if (NULL != t->ph)
751 {
752 GDS_u_drop (t->u,
753 t->ph);
754 t->ph = NULL;
755 was_held = true;
756 }
757 if (t->load > 0)
758 {
759 t->dropped = true;
760 t->pi = NULL;
761 }
762 else
763 {
764 GNUNET_free (t);
765 }
766 if (NULL != pi->t_head)
767 return; /* got other connections still */
769 "Disconnected from peer %s\n",
770 GNUNET_i2s (&pi->id));
772 "# peers connected",
773 -1,
774 GNUNET_NO);
777 &pi->id,
778 pi));
781 {
783 find_peer_task = NULL;
784 }
785 GNUNET_assert (pi->peer_bucket >= 0);
786 bucket = &k_buckets[pi->peer_bucket];
788 bucket->tail,
789 pi);
790 GNUNET_assert (bucket->peers_size > 0);
791 bucket->peers_size--;
792 if ( (was_held) &&
793 (bucket->peers_size >= bucket_size - 1) )
794 update_hold (bucket);
795 while ( (closest_bucket > 0) &&
798 GNUNET_free (pi->hello);
799 GNUNET_free (pi);
800}
void GDS_u_drop(struct GDS_Underlay *u, struct GNUNET_DHTU_PreferenceHandle *ph)
Drop a hold ph from underlay u.
#define GNUNET_CONTAINER_DLL_remove(head, tail, element)
Remove an element from a DLL.
enum GNUNET_GenericReturnValue 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_SCHEDULER_cancel(struct GNUNET_SCHEDULER_Task *task)
Cancel the task with the specified identifier.
Definition scheduler.c:986
void * hello
Block with a HELLO of this peer.

References all_connected_peers, bucket_size, closest_bucket, ctx, disable_try_connect, find_peer_task, GDS_stats, GDS_u_drop(), 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, PeerInfo::hello, PeerInfo::id, k_buckets, PeerInfo::peer_bucket, PeerBucket::peers_size, t, PeerInfo::t_head, PeerInfo::t_tail, PeerBucket::tail, and update_hold().

Referenced by load_underlay().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_u_receive()

void GDS_u_receive ( void *  cls,
void **  tctx,
void **  sctx,
const void *  message,
size_t  message_size 
)

Function to call when we receive a message.

Parameters
clsthe closure
[in,out]tctxctx of target address where we received the message from
[in,out]sctxctx of our own source address at which we received the message
messagethe message we received
message_sizenumber of bytes in message

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

2993{
2994 struct Target *t = *tctx;
2995 struct GNUNET_MQ_MessageHandler core_handlers[] = {
2996 GNUNET_MQ_hd_var_size (dht_p2p_get,
2998 struct PeerGetMessage,
2999 t),
3000 GNUNET_MQ_hd_var_size (dht_p2p_put,
3002 struct PeerPutMessage,
3003 t),
3004 GNUNET_MQ_hd_var_size (dht_p2p_result,
3006 struct PeerResultMessage,
3007 t),
3008 GNUNET_MQ_hd_var_size (dht_p2p_hello,
3010 struct GNUNET_MessageHeader,
3011 t),
3013 };
3014 const struct GNUNET_MessageHeader *mh = message;
3015
3016 (void) cls; /* the 'struct GDS_Underlay' */
3017 (void) sctx; /* our receiver address */
3018 if (NULL == t)
3019 {
3020 /* Received message claiming to originate from myself?
3021 Ignore! */
3022 GNUNET_break_op (0);
3023 return;
3024 }
3025 if (message_size < sizeof (*mh))
3026 {
3027 GNUNET_break_op (0);
3028 return;
3029 }
3030 if (message_size != ntohs (mh->size))
3031 {
3032 GNUNET_break_op (0);
3033 return;
3034 }
3036 "Handling message of type %u from peer %s\n",
3037 ntohs (mh->type),
3038 GNUNET_i2s (&t->pi->id));
3039 if (GNUNET_OK !=
3040 GNUNET_MQ_handle_message (core_handlers,
3041 mh))
3042 {
3043 GNUNET_break_op (0);
3044 return;
3045 }
3046}
static struct GNUNET_CADET_Handle * mh
Cadet handle.
#define GNUNET_MQ_handler_end()
End-marker for the handlers array.
#define GNUNET_MQ_hd_var_size(name, code, str, ctx)
enum GNUNET_GenericReturnValue GNUNET_MQ_handle_message(const struct GNUNET_MQ_MessageHandler *handlers, const struct GNUNET_MessageHeader *mh)
Call the message message handler that was registered for the type of the given message in the given h...
Definition mq.c:205
#define GNUNET_MESSAGE_TYPE_DHT_P2P_HELLO
HELLO advertising a neighbours addresses.
#define GNUNET_MESSAGE_TYPE_DHT_P2P_PUT
Peer is storing data in DHT.
Message handler for a specific message type.
Header for all communications.

References GNUNET_break_op, GNUNET_ERROR_TYPE_DEBUG, GNUNET_i2s(), GNUNET_log, GNUNET_MESSAGE_TYPE_DHT_P2P_GET, GNUNET_MESSAGE_TYPE_DHT_P2P_HELLO, GNUNET_MESSAGE_TYPE_DHT_P2P_PUT, GNUNET_MESSAGE_TYPE_DHT_P2P_RESULT, GNUNET_MQ_handle_message(), GNUNET_MQ_handler_end, GNUNET_MQ_hd_var_size, GNUNET_OK, mh, and t.

Referenced by load_underlay().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_broadcast()

void GDS_NEIGHBOURS_broadcast ( const struct GNUNET_MessageHeader msg)

Send msg to all peers in our buckets.

Parameters
msgmessage to broadcast

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

3117{
3118 for (unsigned int bc = 0; bc<closest_bucket; bc++)
3119 {
3120 struct PeerBucket *bucket = &k_buckets[bc];
3121 unsigned int count = 0;
3122
3123 for (struct PeerInfo *pos = bucket->head;
3124 NULL != pos;
3125 pos = pos->next)
3126 {
3127 if (count >= bucket_size)
3128 break; /* we only consider first #bucket_size entries per bucket */
3129 count++;
3130 do_send (pos,
3131 msg);
3132 }
3133 }
3134}
struct GNUNET_MessageHeader * msg
Definition 005.c:2

References bucket_size, closest_bucket, do_send(), PeerBucket::head, k_buckets, and msg.

Referenced by pid_change_cb().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_init()

enum GNUNET_GenericReturnValue GDS_NEIGHBOURS_init ( void  )

Initialize neighbours subsystem.

Returns
GNUNET_OK on success, GNUNET_SYSERR on error

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

3139{
3140
3141 unsigned long long temp_config_num;
3142
3145 "DHT",
3146 "DISABLE_TRY_CONNECT");
3147 if (GNUNET_OK ==
3149 "DHT",
3150 "bucket_size",
3151 &temp_config_num))
3152 bucket_size = (unsigned int) temp_config_num;
3155 "DHT",
3156 "CACHE_RESULTS");
3158 GNUNET_YES);
3159 return GNUNET_OK;
3160}
const struct GNUNET_CONFIGURATION_Handle * GDS_cfg
Configuration we use.
static int cache_results
Do we cache all results that we are routing in the local datacache?
enum GNUNET_GenericReturnValue 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.
enum GNUNET_GenericReturnValue 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".
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).

References all_connected_peers, bucket_size, cache_results, disable_try_connect, GDS_cfg, GNUNET_CONFIGURATION_get_value_number(), GNUNET_CONFIGURATION_get_value_yesno(), GNUNET_CONTAINER_multipeermap_create(), GNUNET_OK, and GNUNET_YES.

Referenced by run().

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 3164 of file gnunet-service-dht_neighbours.c.

3165{
3166 if (NULL == all_connected_peers)
3167 return;
3168 GNUNET_assert (0 ==
3171 all_connected_peers = NULL;
3172 GNUNET_assert (NULL == find_peer_task);
3173}
void GNUNET_CONTAINER_multipeermap_destroy(struct GNUNET_CONTAINER_MultiPeerMap *map)
Destroy a hash map.

References all_connected_peers, find_peer_task, GNUNET_assert, GNUNET_CONTAINER_multipeermap_destroy(), and GNUNET_CONTAINER_multipeermap_size().

Referenced by shutdown_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ GDS_NEIGHBOURS_get_id()

const struct GNUNET_PeerIdentity * GDS_NEIGHBOURS_get_id ( void  )

Get the ID of the local node.

Returns
identity of the local node

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

3178{
3180}

References GDS_pils, and GNUNET_PILS_get_identity().

Here is the call graph for this function: