GNUnet  0.10.x
Data Structures | Macros | Functions
regex_internal_dht.c File Reference

library to announce regexes in the network and match strings against published regexes. More...

#include "platform.h"
#include "regex_internal_lib.h"
#include "regex_block_lib.h"
#include "gnunet_dht_service.h"
#include "gnunet_statistics_service.h"
#include "gnunet_constants.h"
#include "gnunet_signatures.h"
Include dependency graph for regex_internal_dht.c:

Go to the source code of this file.

Data Structures

struct  REGEX_INTERNAL_Announcement
 Handle to store cached data about a regex announce. More...
 
struct  RegexSearchContext
 Struct to keep state of running searches that have consumed a part of the inital string. More...
 
struct  Result
 Type of values in dht_get_results. More...
 
struct  REGEX_INTERNAL_Search
 Struct to keep information of searches of services described by a regex using a user-provided string service description. More...
 

Macros

#define LOG(kind, ...)   GNUNET_log_from (kind,"regex-dht",__VA_ARGS__)
 
#define DHT_REPLICATION   5
 DHT replication level to use. More...
 
#define DHT_TTL   GNUNET_TIME_UNIT_HOURS
 DHT record lifetime to use. More...
 
#define DHT_OPT   GNUNET_DHT_RO_DEMULTIPLEX_EVERYWHERE
 DHT options to set. More...
 

Functions

static void regex_iterator (void *cls, const struct GNUNET_HashCode *key, const char *proof, int accepting, unsigned int num_edges, const struct REGEX_BLOCK_Edge *edges)
 Regex callback iterator to store own service description in the DHT. More...
 
struct REGEX_INTERNAL_AnnouncementREGEX_INTERNAL_announce (struct GNUNET_DHT_Handle *dht, const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, const char *regex, uint16_t compression, struct GNUNET_STATISTICS_Handle *stats)
 Announce a regular expression: put all states of the automaton in the DHT. More...
 
void REGEX_INTERNAL_reannounce (struct REGEX_INTERNAL_Announcement *h)
 Announce again a regular expression previously announced. More...
 
void REGEX_INTERNAL_announce_cancel (struct REGEX_INTERNAL_Announcement *h)
 Clear all cached data used by a regex announce. More...
 
static void regex_next_edge (const struct RegexBlock *block, size_t size, struct RegexSearchContext *ctx)
 Jump to the next edge, with the longest matching token. More...
 
static void dht_get_string_accept_handler (void *cls, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, enum GNUNET_BLOCK_Type type, size_t size, const void *data)
 Function to process DHT string to regex matching. More...
 
static void regex_find_path (const struct GNUNET_HashCode *key, struct RegexSearchContext *ctx)
 Find a path to a peer that offers a regex service compatible with a given string. More...
 
static void dht_get_string_handler (void *cls, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, enum GNUNET_BLOCK_Type type, size_t size, const void *data)
 Function to process DHT string to regex matching. More...
 
static int regex_result_iterator (void *cls, const struct GNUNET_HashCode *key, void *value)
 Iterator over found existing cadet regex blocks that match an ongoing search. More...
 
static int regex_edge_iterator (void *cls, const char *token, size_t len, const struct GNUNET_HashCode *key)
 Iterator over edges in a regex block retrieved from the DHT. More...
 
struct REGEX_INTERNAL_SearchREGEX_INTERNAL_search (struct GNUNET_DHT_Handle *dht, const char *string, REGEX_INTERNAL_Found callback, void *callback_cls, struct GNUNET_STATISTICS_Handle *stats)
 Search for a peer offering a regex matching certain string in the DHT. More...
 
static int regex_cancel_dht_get (void *cls, const struct GNUNET_HashCode *key, void *value)
 Iterator over hash map entries to cancel DHT GET requests after a successful connect_by_string. More...
 
static int regex_free_result (void *cls, const struct GNUNET_HashCode *key, void *value)
 Iterator over hash map entries to free CadetRegexBlocks stored during the search for connect_by_string. More...
 
void REGEX_INTERNAL_search_cancel (struct REGEX_INTERNAL_Search *h)
 Cancel an ongoing regex search in the DHT and free all resources. More...
 

Detailed Description

library to announce regexes in the network and match strings against published regexes.

Author
Bartlomiej Polot

Definition in file regex_internal_dht.c.

Macro Definition Documentation

◆ LOG

#define LOG (   kind,
  ... 
)    GNUNET_log_from (kind,"regex-dht",__VA_ARGS__)

◆ DHT_REPLICATION

#define DHT_REPLICATION   5

DHT replication level to use.

Definition at line 40 of file regex_internal_dht.c.

Referenced by regex_find_path(), REGEX_INTERNAL_search(), regex_iterator(), and regex_next_edge().

◆ DHT_TTL

#define DHT_TTL   GNUNET_TIME_UNIT_HOURS

DHT record lifetime to use.

Definition at line 45 of file regex_internal_dht.c.

Referenced by regex_iterator().

◆ DHT_OPT

DHT options to set.

Definition at line 50 of file regex_internal_dht.c.

Referenced by regex_find_path(), REGEX_INTERNAL_search(), regex_iterator(), and regex_next_edge().

Function Documentation

◆ regex_iterator()

static void regex_iterator ( void *  cls,
const struct GNUNET_HashCode key,
const char *  proof,
int  accepting,
unsigned int  num_edges,
const struct REGEX_BLOCK_Edge edges 
)
static

Regex callback iterator to store own service description in the DHT.

Parameters
clsclosure.
keyhash for current state.
proofproof for current state.
acceptingGNUNET_YES if this is an accepting state, GNUNET_NO if not.
num_edgesnumber of edges leaving current state.
edgesedges leaving current state.

Definition at line 96 of file regex_internal_dht.c.

References REGEX_INTERNAL_Announcement::dht, DHT_OPT, DHT_REPLICATION, DHT_TTL, RegexAcceptBlock::expiration_time, GNUNET_assert, GNUNET_BLOCK_TYPE_REGEX, GNUNET_BLOCK_TYPE_REGEX_ACCEPT, GNUNET_CONSTANTS_DHT_MAX_EXPIRATION, GNUNET_CRYPTO_eddsa_key_get_public(), GNUNET_CRYPTO_eddsa_sign(), GNUNET_DHT_put(), GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_ERROR_TYPE_INFO, GNUNET_free, GNUNET_h2s(), GNUNET_NO, GNUNET_OK, GNUNET_SIGNATURE_PURPOSE_REGEX_ACCEPT, GNUNET_STATISTICS_update(), GNUNET_TIME_absolute_hton(), GNUNET_TIME_relative_to_absolute(), GNUNET_YES, h, key, RegexAcceptBlock::key, LOG, RegexBlock::num_edges, RegexAcceptBlock::peer, REGEX_INTERNAL_Announcement::priv, GNUNET_PeerIdentity::public_key, RegexAcceptBlock::purpose, GNUNET_CRYPTO_EccSignaturePurpose::purpose, REGEX_BLOCK_create(), RegexAcceptBlock::signature, size, GNUNET_CRYPTO_EccSignaturePurpose::size, and REGEX_INTERNAL_Announcement::stats.

Referenced by REGEX_INTERNAL_reannounce().

102 {
103  struct REGEX_INTERNAL_Announcement *h = cls;
104  struct RegexBlock *block;
105  size_t size;
106  unsigned int i;
107 
109  "DHT PUT for state %s with proof `%s' and %u edges:\n",
110  GNUNET_h2s (key),
111  proof,
112  num_edges);
113  for (i = 0; i < num_edges; i++)
114  {
116  "Edge %u `%s' towards %s\n",
117  i,
118  edges[i].label,
119  GNUNET_h2s (&edges[i].destination));
120  }
121  if (GNUNET_YES == accepting)
122  {
123  struct RegexAcceptBlock ab;
124 
126  "State %s is accepting, putting own id\n",
127  GNUNET_h2s (key));
128  size = sizeof (struct RegexAcceptBlock);
129  ab.purpose.size = ntohl (sizeof (struct GNUNET_CRYPTO_EccSignaturePurpose) +
130  sizeof (struct GNUNET_TIME_AbsoluteNBO) +
131  sizeof (struct GNUNET_HashCode));
132  ab.purpose.purpose = ntohl (GNUNET_SIGNATURE_PURPOSE_REGEX_ACCEPT);
134  ab.key = *key;
136  &ab.peer.public_key);
139  &ab.purpose,
140  &ab.signature));
141 
142  GNUNET_STATISTICS_update (h->stats, "# regex accepting blocks stored",
143  1, GNUNET_NO);
144  GNUNET_STATISTICS_update (h->stats, "# regex accepting block bytes stored",
145  sizeof (struct RegexAcceptBlock), GNUNET_NO);
146  (void)
147  GNUNET_DHT_put (h->dht, key,
151  size,
152  &ab,
154  NULL, NULL);
155  }
156  block = REGEX_BLOCK_create (proof,
157  num_edges,
158  edges,
159  accepting,
160  &size);
161  if (NULL == block)
162  return;
163  (void) GNUNET_DHT_put (h->dht,
164  key,
166  DHT_OPT,
168  size,
169  block,
171  NULL,
172  NULL);
174  "# regex blocks stored",
175  1,
176  GNUNET_NO);
178  "# regex block bytes stored",
179  size,
180  GNUNET_NO);
181  GNUNET_free (block);
182 }
#define GNUNET_CONSTANTS_DHT_MAX_EXPIRATION
How long do we cache records at most in the DHT?
Block to store a cadet regex accepting state.
#define DHT_REPLICATION
DHT replication level to use.
We should keep track of the route that the message took in the P2P network.
uint16_t num_edges
Number of edges parting from this state.
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
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
Block to announce a regex state.
int GNUNET_CRYPTO_eddsa_sign(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, const struct GNUNET_CRYPTO_EccSignaturePurpose *purpose, struct GNUNET_CRYPTO_EddsaSignature *sig)
EdDSA sign a given block.
Definition: crypto_ecc.c:989
#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).
Block to announce a peer accepting a state.
Definition: block_regex.h:49
void GNUNET_STATISTICS_update(struct GNUNET_STATISTICS_Handle *handle, const char *name, int64_t delta, int make_persistent)
Set statistic value for the peer.
Time for absolute time used by GNUnet, in microseconds and in network byte order. ...
#define DHT_OPT
DHT options to set.
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:94
header of what an ECC signature signs this must be followed by "size - 8" bytes of the actual signed ...
#define DHT_TTL
DHT record lifetime to use.
static uint64_t proof
Definition: gnunet-scrypt.c:41
Handle to store cached data about a regex announce.
A 512-bit hashcode.
struct RegexBlock * REGEX_BLOCK_create(const char *proof, unsigned int num_edges, const struct REGEX_BLOCK_Edge *edges, int accepting, size_t *rsize)
Construct a regex block to be stored in the DHT.
struct GNUNET_HashCode key
The key used in the DHT.
struct GNUNET_DHT_PutHandle * GNUNET_DHT_put(struct GNUNET_DHT_Handle *handle, const struct GNUNET_HashCode *key, uint32_t desired_replication_level, enum GNUNET_DHT_RouteOption options, enum GNUNET_BLOCK_Type type, size_t size, const void *data, struct GNUNET_TIME_Absolute exp, GNUNET_SCHEDULER_TaskCallback cont, void *cont_cls)
Perform a PUT operation storing data in the DHT.
Definition: dht_api.c:971
static unsigned int size
Size of the "table".
Definition: peer.c:67
void GNUNET_CRYPTO_eddsa_key_get_public(const struct GNUNET_CRYPTO_EddsaPrivateKey *priv, struct GNUNET_CRYPTO_EddsaPublicKey *pub)
Extract the public key for the given private key.
Definition: crypto_ecc.c:272
#define GNUNET_SIGNATURE_PURPOSE_REGEX_ACCEPT
Accept state in regex DFA.
#define GNUNET_YES
Definition: gnunet_common.h:80
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
#define LOG(kind,...)
struct GNUNET_DHT_Handle * dht
DHT handle to use, must be initialized externally.
const struct GNUNET_CRYPTO_EddsaPrivateKey * priv
Our private key.
Block to store a cadet regex state.
struct GNUNET_TIME_AbsoluteNBO GNUNET_TIME_absolute_hton(struct GNUNET_TIME_Absolute a)
Convert absolute time to network byte order.
Definition: time.c:654
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ REGEX_INTERNAL_announce()

struct REGEX_INTERNAL_Announcement* REGEX_INTERNAL_announce ( struct GNUNET_DHT_Handle dht,
const struct GNUNET_CRYPTO_EddsaPrivateKey priv,
const char *  regex,
uint16_t  compression,
struct GNUNET_STATISTICS_Handle stats 
)

Announce a regular expression: put all states of the automaton in the DHT.

Does not free resources, must call REGEX_INTERNAL_announce_cancel() for that.

Parameters
dhtAn existing and valid DHT service handle. CANNOT be NULL.
privour private key, must remain valid until the announcement is cancelled
regexRegular expression to announce.
compressionHow many characters per edge can we squeeze?
statsOptional statistics handle to report usage. Can be NULL.
Returns
Handle to reuse o free cached resources. Must be freed by calling REGEX_INTERNAL_announce_cancel().

Definition at line 198 of file regex_internal_dht.c.

References REGEX_INTERNAL_Announcement::dfa, REGEX_INTERNAL_Announcement::dht, GNUNET_assert, GNUNET_new, h, REGEX_INTERNAL_Announcement::priv, REGEX_INTERNAL_Announcement::regex, REGEX_INTERNAL_construct_dfa(), REGEX_INTERNAL_reannounce(), and REGEX_INTERNAL_Announcement::stats.

Referenced by handle_announce(), and reannounce_regex().

203 {
205 
206  GNUNET_assert (NULL != dht);
208  h->regex = regex;
209  h->dht = dht;
210  h->stats = stats;
211  h->priv = priv;
212  h->dfa = REGEX_INTERNAL_construct_dfa (regex, strlen (regex), compression);
214  return h;
215 }
static struct GNUNET_STATISTICS_Handle * stats
Handle for statistics.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
#define GNUNET_new(type)
Allocate a struct or union of the given type.
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:94
Handle to store cached data about a regex announce.
void REGEX_INTERNAL_reannounce(struct REGEX_INTERNAL_Announcement *h)
Announce again a regular expression previously announced.
struct REGEX_INTERNAL_Automaton * REGEX_INTERNAL_construct_dfa(const char *regex, const size_t len, unsigned int max_path_len)
Construct DFA for the given &#39;regex&#39; of length &#39;len&#39;.
const char * regex
Regular expression.
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
struct GNUNET_DHT_Handle * dht
DHT handle to use, must be initialized externally.
const struct GNUNET_CRYPTO_EddsaPrivateKey * priv
Our private key.
static struct GNUNET_DHT_Handle * dht
Handle to the DHT.
struct REGEX_INTERNAL_Automaton * dfa
Automaton representation of the regex (expensive to build).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ REGEX_INTERNAL_reannounce()

void REGEX_INTERNAL_reannounce ( struct REGEX_INTERNAL_Announcement h)

Announce again a regular expression previously announced.

Does use caching to speed up process.

Parameters
hHandle returned by a previous REGEX_INTERNAL_announce call().

Definition at line 225 of file regex_internal_dht.c.

References REGEX_INTERNAL_Announcement::dfa, GNUNET_assert, GNUNET_ERROR_TYPE_INFO, LOG, REGEX_INTERNAL_Announcement::regex, REGEX_INTERNAL_iterate_reachable_edges(), and regex_iterator().

Referenced by reannounce(), reannounce_regex(), and REGEX_INTERNAL_announce().

226 {
227  GNUNET_assert (NULL != h->dfa); /* make sure to call announce first */
229  "REGEX_INTERNAL_reannounce: %s\n",
230  h->regex);
233  h);
234 }
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
static void regex_iterator(void *cls, const struct GNUNET_HashCode *key, const char *proof, int accepting, unsigned int num_edges, const struct REGEX_BLOCK_Edge *edges)
Regex callback iterator to store own service description in the DHT.
const char * regex
Regular expression.
#define LOG(kind,...)
void REGEX_INTERNAL_iterate_reachable_edges(struct REGEX_INTERNAL_Automaton *a, REGEX_INTERNAL_KeyIterator iterator, void *iterator_cls)
Iterate over all edges of automaton &#39;a&#39; that are reachable from a state with a proof of at least GNUN...
struct REGEX_INTERNAL_Automaton * dfa
Automaton representation of the regex (expensive to build).
Here is the call graph for this function:
Here is the caller graph for this function:

◆ REGEX_INTERNAL_announce_cancel()

void REGEX_INTERNAL_announce_cancel ( struct REGEX_INTERNAL_Announcement h)

Clear all cached data used by a regex announce.

Does not close DHT connection.

Parameters
hHandle returned by a previous REGEX_INTERNAL_announce() call.

Definition at line 244 of file regex_internal_dht.c.

References REGEX_INTERNAL_Announcement::dfa, GNUNET_free, and REGEX_INTERNAL_automaton_destroy().

Referenced by client_disconnect_cb(), and shutdown_task().

245 {
247  GNUNET_free (h);
248 }
void REGEX_INTERNAL_automaton_destroy(struct REGEX_INTERNAL_Automaton *a)
Free the memory allocated by constructing the REGEX_INTERNAL_Automaton data structure.
struct REGEX_INTERNAL_Automaton * dfa
Automaton representation of the regex (expensive to build).
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_next_edge()

static void regex_next_edge ( const struct RegexBlock block,
size_t  size,
struct RegexSearchContext ctx 
)
static

Jump to the next edge, with the longest matching token.

Parameters
blockBlock found in the DHT.
sizeSize of the block.
ctxContext of the search.

Definition at line 608 of file regex_internal_dht.c.

References REGEX_INTERNAL_Search::contexts, REGEX_INTERNAL_Search::description, REGEX_INTERNAL_Search::dht, REGEX_INTERNAL_Search::dht_get_handles, REGEX_INTERNAL_Search::dht_get_results, dht_get_string_handler(), DHT_OPT, DHT_REPLICATION, GNUNET_array_append, GNUNET_BLOCK_TYPE_REGEX, GNUNET_break, GNUNET_CONTAINER_multihashmap_contains(), GNUNET_CONTAINER_multihashmap_get_multiple(), GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST, GNUNET_DHT_get_start(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_STATISTICS_update(), GNUNET_YES, RegexSearchContext::hash, RegexSearchContext::info, LOG, RegexSearchContext::longest_match, REGEX_INTERNAL_Search::n_contexts, RegexSearchContext::position, REGEX_BLOCK_iterate(), regex_edge_iterator(), regex_result_iterator(), result, and REGEX_INTERNAL_Search::stats.

Referenced by dht_get_string_handler(), and regex_result_iterator().

611 {
612  struct RegexSearchContext *new_ctx;
613  struct REGEX_INTERNAL_Search *info = ctx->info;
614  struct GNUNET_DHT_GetHandle *get_h;
615  struct GNUNET_HashCode *hash;
616  const char *rest;
617  int result;
618 
619  LOG (GNUNET_ERROR_TYPE_DEBUG, "Next edge\n");
620  /* Find the longest match for the current string position,
621  * among tokens in the given block */
622  ctx->longest_match = 0;
623  result = REGEX_BLOCK_iterate (block, size,
624  &regex_edge_iterator, ctx);
625  GNUNET_break (GNUNET_OK == result);
626 
627  /* Did anything match? */
628  if (0 == ctx->longest_match)
629  {
631  "no match in block\n");
632  return;
633  }
634 
635  hash = &ctx->hash;
636  new_ctx = GNUNET_new (struct RegexSearchContext);
637  new_ctx->info = info;
638  new_ctx->position = ctx->position + ctx->longest_match;
639  GNUNET_array_append (info->contexts, info->n_contexts, new_ctx);
640 
641  /* Check whether we already have a DHT GET running for it */
642  if (GNUNET_YES ==
644  {
646  "GET for %s running, END\n",
647  GNUNET_h2s (hash));
649  hash,
651  new_ctx);
652  return; /* We are already looking for it */
653  }
654 
655  GNUNET_STATISTICS_update (info->stats, "# regex nodes traversed",
656  1, GNUNET_NO);
657 
659  "Following edges at %s for offset %u in `%s'\n",
660  GNUNET_h2s (hash),
661  (unsigned int) ctx->position,
662  info->description);
663  rest = &new_ctx->info->description[new_ctx->position];
664  get_h =
665  GNUNET_DHT_get_start (info->dht, /* handle */
666  GNUNET_BLOCK_TYPE_REGEX, /* type */
667  hash, /* key to search */
668  DHT_REPLICATION, /* replication level */
669  DHT_OPT,
670  rest, /* xquery */
671  strlen (rest) + 1, /* xquery bits */
672  &dht_get_string_handler, new_ctx);
673  if (GNUNET_OK !=
675  hash,
676  get_h,
678  {
679  GNUNET_break (0);
680  return;
681  }
682 }
#define DHT_REPLICATION
DHT replication level to use.
size_t position
Part of the description already consumed by this particular search branch.
int REGEX_BLOCK_iterate(const struct RegexBlock *block, size_t size, REGEX_INTERNAL_EgdeIterator iterator, void *iter_cls)
Iterate over all edges of a block of a regex state.
Struct to keep state of running searches that have consumed a part of the inital string.
#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).
#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.
int GNUNET_CONTAINER_multihashmap_contains(const struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key)
Check if the map contains any value under the given key (including values that are NULL)...
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 DHT_OPT
DHT options to set.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct GNUNET_HashCode hash
Destination hash of the longest match.
static void dht_get_string_handler(void *cls, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, enum GNUNET_BLOCK_Type type, size_t size, const void *data)
Function to process DHT string to regex matching.
, &#39; bother checking if a value already exists (faster than GNUNET_CONTAINER_MULTIHASHMAPOPTION_...
struct REGEX_INTERNAL_Search * info
Information about the search.
static int result
Global testing status.
A 512-bit hashcode.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_results
Results from running DHT GETs, values are of type &#39;struct Result&#39;.
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_DHT_Handle * dht
DHT handle to use, must be initialized externally.
unsigned int n_contexts
Number of contexts (branches/steps in search).
static int regex_edge_iterator(void *cls, const char *token, size_t len, const struct GNUNET_HashCode *key)
Iterator over edges in a regex block retrieved from the DHT.
int GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
Handle to a GET request.
Definition: dht_api.c:80
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
Struct to keep information of searches of services described by a regex using a user-provided string ...
#define GNUNET_array_append(arr, size, element)
Append an element to a list (growing the list by one).
struct GNUNET_DHT_GetHandle * GNUNET_DHT_get_start(struct GNUNET_DHT_Handle *handle, enum GNUNET_BLOCK_Type type, const struct GNUNET_HashCode *key, uint32_t desired_replication_level, enum GNUNET_DHT_RouteOption options, const void *xquery, size_t xquery_size, GNUNET_DHT_GetIterator iter, void *iter_cls)
Perform an asynchronous GET operation on the DHT identified.
Definition: dht_api.c:1072
int GNUNET_CONTAINER_multihashmap_get_multiple(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, GNUNET_CONTAINER_HashMapIterator it, void *it_cls)
Iterate over all entries in the map that match a particular key.
char * description
User provided description of the searched service.
#define GNUNET_YES
Definition: gnunet_common.h:80
#define LOG(kind,...)
Block to store a cadet regex state.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_handles
Running DHT GETs.
unsigned int longest_match
We just want to look for one edge, the longer the better.
struct RegexSearchContext ** contexts
Contexts, for each running DHT GET.
static int regex_result_iterator(void *cls, const struct GNUNET_HashCode *key, void *value)
Iterator over found existing cadet regex blocks that match an ongoing search.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ dht_get_string_accept_handler()

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

Function to process DHT string to regex matching.

Called on each result obtained for the DHT search.

Parameters
clsClosure (search context).
expWhen will this value expire.
keyKey of the result.
get_pathPath of the get request.
get_path_lengthLenght of get_path.
put_pathPath of the put request.
put_path_lengthLength of the put_path.
typeType of the result.
sizeNumber of bytes in data.
dataPointer to the result data.

Definition at line 384 of file regex_internal_dht.c.

References REGEX_INTERNAL_Search::callback, REGEX_INTERNAL_Search::callback_cls, ctx, data, REGEX_INTERNAL_Search::description, GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_NO, GNUNET_STATISTICS_update(), RegexSearchContext::info, LOG, RegexAcceptBlock::peer, and REGEX_INTERNAL_Search::stats.

Referenced by regex_find_path().

392 {
393  const struct RegexAcceptBlock *block = data;
394  struct RegexSearchContext *ctx = cls;
395  struct REGEX_INTERNAL_Search *info = ctx->info;
396 
398  "Regex result accept for %s (key %s)\n",
399  info->description, GNUNET_h2s(key));
400 
402  "# regex accepting blocks found",
403  1, GNUNET_NO);
405  "# regex accepting block bytes found",
406  size, GNUNET_NO);
407  info->callback (info->callback_cls,
408  &block->peer,
409  get_path, get_path_length,
410  put_path, put_path_length);
411 }
Struct to keep state of running searches that have consumed a part of the inital string.
#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).
Block to announce a peer accepting a state.
Definition: block_regex.h:49
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_DNSSTUB_Context * ctx
Context for DNS resolution.
struct GNUNET_PeerIdentity peer
Public key of the peer signing.
Definition: block_regex.h:71
struct REGEX_INTERNAL_Search * info
Information about the search.
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
Struct to keep information of searches of services described by a regex using a user-provided string ...
char * description
User provided description of the searched service.
REGEX_INTERNAL_Found callback
#define LOG(kind,...)
uint32_t data
The data value.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_find_path()

static void regex_find_path ( const struct GNUNET_HashCode key,
struct RegexSearchContext ctx 
)
static

Find a path to a peer that offers a regex service compatible with a given string.

Parameters
keyThe key of the accepting state.
ctxContext containing info about the string, tunnel, etc.

Definition at line 422 of file regex_internal_dht.c.

References REGEX_INTERNAL_Search::dht, REGEX_INTERNAL_Search::dht_get_handles, dht_get_string_accept_handler(), DHT_OPT, DHT_REPLICATION, GNUNET_BLOCK_TYPE_REGEX_ACCEPT, GNUNET_break, GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE, GNUNET_DHT_get_start(), GNUNET_DHT_RO_RECORD_ROUTE, GNUNET_ERROR_TYPE_DEBUG, GNUNET_h2s(), GNUNET_OK, RegexSearchContext::info, LOG, and RegexSearchContext::position.

Referenced by dht_get_string_handler(), and regex_result_iterator().

424 {
425  struct GNUNET_DHT_GetHandle *get_h;
426 
428  "Accept state found, now searching for paths to %s\n",
429  GNUNET_h2s (key),
430  (unsigned int) ctx->position);
431  get_h = GNUNET_DHT_get_start (ctx->info->dht, /* handle */
433  key, /* key to search */
434  DHT_REPLICATION, /* replication level */
436  NULL, /* xquery */ // FIXME BLOOMFILTER
437  0, /* xquery bits */ // FIXME BLOOMFILTER SIZE
441  key,
442  get_h,
444 }
Block to store a cadet regex accepting state.
#define DHT_REPLICATION
DHT replication level to use.
We should keep track of the route that the message took in the P2P network.
size_t position
Part of the description already consumed by this particular search branch.
static void dht_get_string_accept_handler(void *cls, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, enum GNUNET_BLOCK_Type type, size_t size, const void *data)
Function to process DHT string to regex matching.
#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 DHT_OPT
DHT options to set.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
struct REGEX_INTERNAL_Search * info
Information about the search.
struct GNUNET_DHT_Handle * dht
DHT handle to use, must be initialized externally.
int GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
Handle to a GET request.
Definition: dht_api.c:80
Allow multiple values with the same key.
struct GNUNET_DHT_GetHandle * GNUNET_DHT_get_start(struct GNUNET_DHT_Handle *handle, enum GNUNET_BLOCK_Type type, const struct GNUNET_HashCode *key, uint32_t desired_replication_level, enum GNUNET_DHT_RouteOption options, const void *xquery, size_t xquery_size, GNUNET_DHT_GetIterator iter, void *iter_cls)
Perform an asynchronous GET operation on the DHT identified.
Definition: dht_api.c:1072
#define LOG(kind,...)
struct GNUNET_CONTAINER_MultiHashMap * dht_get_handles
Running DHT GETs.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ dht_get_string_handler()

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

Function to process DHT string to regex matching.

Called on each result obtained for the DHT search.

Parameters
clsclosure (search context)
expwhen will this value expire
keykey of the result
get_pathpath of the get request (not used)
get_path_lengthlength of get_path (not used)
put_pathpath of the put request (not used)
put_path_lengthlength of the put_path (not used)
typetype of the result
sizenumber of bytes in data
datapointer to the result data

TODO: re-issue the request after certain time? cancel after X results?

Definition at line 465 of file regex_internal_dht.c.

References ctx, data, Result::data, REGEX_INTERNAL_Search::description, REGEX_INTERNAL_Search::dht_get_results, GNUNET_BLOCK_is_accepting(), GNUNET_break, GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE, GNUNET_ERROR_TYPE_INFO, GNUNET_h2s(), GNUNET_malloc, GNUNET_memcpy, GNUNET_OK, GNUNET_YES, RegexSearchContext::info, len, LOG, RegexSearchContext::position, regex_find_path(), regex_next_edge(), size, and Result::size.

Referenced by REGEX_INTERNAL_search(), and regex_next_edge().

473 {
474  const struct RegexBlock *block = data;
475  struct RegexSearchContext *ctx = cls;
476  struct REGEX_INTERNAL_Search *info = ctx->info;
477  size_t len;
478  struct Result *copy;
479 
481  "DHT GET result for %s (%s)\n",
482  GNUNET_h2s (key), ctx->info->description);
483  copy = GNUNET_malloc (sizeof (struct Result) + size);
484  copy->size = size;
485  copy->data = &copy[1];
486  GNUNET_memcpy (&copy[1], block, size);
489  key, copy,
491  len = strlen (info->description);
492  if (len == ctx->position) // String processed
493  {
494  if (GNUNET_YES == GNUNET_BLOCK_is_accepting (block, size))
495  {
496  regex_find_path (key, ctx);
497  }
498  else
499  {
500  LOG (GNUNET_ERROR_TYPE_INFO, "block not accepting!\n");
501  /* FIXME REGEX this block not successful, wait for more? start timeout? */
502  }
503  return;
504  }
505  regex_next_edge (block, size, ctx);
506 }
GNUNET_NETWORK_STRUCT_END int GNUNET_BLOCK_is_accepting(const struct RegexBlock *block, size_t size)
Test if this block is marked as being an accept state.
const void * data
The raw result data.
size_t position
Part of the description already consumed by this particular search branch.
Block to announce a regex state.
Struct to keep state of running searches that have consumed a part of the inital string.
#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_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
#define GNUNET_memcpy(dst, src, n)
struct REGEX_INTERNAL_Search * info
Information about the search.
Type of values in dht_get_results.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_results
Results from running DHT GETs, values are of type &#39;struct Result&#39;.
static unsigned int size
Size of the "table".
Definition: peer.c:67
int GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
Struct to keep information of searches of services described by a regex using a user-provided string ...
Allow multiple values with the same key.
char * description
User provided description of the searched service.
#define GNUNET_YES
Definition: gnunet_common.h:80
static void regex_next_edge(const struct RegexBlock *block, size_t size, struct RegexSearchContext *ctx)
Jump to the next edge, with the longest matching token.
#define LOG(kind,...)
uint32_t data
The data value.
#define GNUNET_malloc(size)
Wrapper around malloc.
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
size_t size
Number of bytes in data.
static void regex_find_path(const struct GNUNET_HashCode *key, struct RegexSearchContext *ctx)
Find a path to a peer that offers a regex service compatible with a given string. ...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_result_iterator()

static int regex_result_iterator ( void *  cls,
const struct GNUNET_HashCode key,
void *  value 
)
static

Iterator over found existing cadet regex blocks that match an ongoing search.

Parameters
clsClosure (current context)-
keyCurrent key code (key for cached block).
valueValue in the hash map (cached RegexBlock).
Returns
GNUNET_YES: we should always continue to iterate.

Definition at line 518 of file regex_internal_dht.c.

References ctx, Result::data, REGEX_INTERNAL_Search::description, GNUNET_BLOCK_is_accepting(), GNUNET_ERROR_TYPE_DEBUG, GNUNET_ERROR_TYPE_INFO, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_YES, RegexSearchContext::info, LOG, RegexSearchContext::position, regex_find_path(), regex_next_edge(), result, Result::size, REGEX_INTERNAL_Search::stats, and value.

Referenced by regex_next_edge().

521 {
522  struct Result *result = value;
523  const struct RegexBlock *block = result->data;
524  struct RegexSearchContext *ctx = cls;
525 
526  if ( (GNUNET_YES ==
527  GNUNET_BLOCK_is_accepting (block, result->size)) &&
528  (ctx->position == strlen (ctx->info->description)) )
529  {
531  "Found accepting known block\n");
532  regex_find_path (key, ctx);
533  return GNUNET_YES; // We found an accept state!
534  }
536  "* %u, %u, [%u]\n",
537  ctx->position,
538  strlen (ctx->info->description),
539  GNUNET_BLOCK_is_accepting (block, result->size));
540  regex_next_edge (block, result->size, ctx);
541 
542  GNUNET_STATISTICS_update (ctx->info->stats, "# regex cadet blocks iterated",
543  1, GNUNET_NO);
544 
545  return GNUNET_YES;
546 }
GNUNET_NETWORK_STRUCT_END int GNUNET_BLOCK_is_accepting(const struct RegexBlock *block, size_t size)
Test if this block is marked as being an accept state.
const void * data
The raw result data.
size_t position
Part of the description already consumed by this particular search branch.
Block to announce a regex state.
Struct to keep state of running searches that have consumed a part of the inital string.
#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 struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static char * value
Value of the record to add/remove.
struct REGEX_INTERNAL_Search * info
Information about the search.
static int result
Global testing status.
Type of values in dht_get_results.
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
char * description
User provided description of the searched service.
#define GNUNET_YES
Definition: gnunet_common.h:80
static void regex_next_edge(const struct RegexBlock *block, size_t size, struct RegexSearchContext *ctx)
Jump to the next edge, with the longest matching token.
#define LOG(kind,...)
size_t size
Number of bytes in data.
static void regex_find_path(const struct GNUNET_HashCode *key, struct RegexSearchContext *ctx)
Find a path to a peer that offers a regex service compatible with a given string. ...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_edge_iterator()

static int regex_edge_iterator ( void *  cls,
const char *  token,
size_t  len,
const struct GNUNET_HashCode key 
)
static

Iterator over edges in a regex block retrieved from the DHT.

Parameters
clsClosure (context of the search).
tokenToken that follows to next state.
lenLenght of token.
keyHash of next state.
Returns
GNUNET_YES if should keep iterating, GNUNET_NO otherwise.

Definition at line 559 of file regex_internal_dht.c.

References ctx, REGEX_INTERNAL_Search::description, GNUNET_ERROR_TYPE_DEBUG, GNUNET_NO, GNUNET_STATISTICS_update(), GNUNET_YES, RegexSearchContext::hash, RegexSearchContext::info, key, len, LOG, RegexSearchContext::longest_match, RegexSearchContext::position, and REGEX_INTERNAL_Search::stats.

Referenced by regex_next_edge().

563 {
564  struct RegexSearchContext *ctx = cls;
565  struct REGEX_INTERNAL_Search *info = ctx->info;
566  const char *current;
567  size_t current_len;
568 
569  GNUNET_STATISTICS_update (info->stats, "# regex edges iterated",
570  1, GNUNET_NO);
571  current = &info->description[ctx->position];
572  current_len = strlen (info->description) - ctx->position;
573  if (len > current_len)
574  {
575  LOG (GNUNET_ERROR_TYPE_DEBUG, "Token too long, END\n");
576  return GNUNET_YES;
577  }
578  if (0 != strncmp (current, token, len))
579  {
580  LOG (GNUNET_ERROR_TYPE_DEBUG, "Token doesn't match, END\n");
581  return GNUNET_YES;
582  }
583 
584  if (len > ctx->longest_match)
585  {
586  LOG (GNUNET_ERROR_TYPE_DEBUG, "Token is longer, KEEP\n");
587  ctx->longest_match = len;
588  ctx->hash = *key;
589  }
590  else
591  {
592  LOG (GNUNET_ERROR_TYPE_DEBUG, "Token is not longer, IGNORE\n");
593  }
594 
595  LOG (GNUNET_ERROR_TYPE_DEBUG, "* End of regex edge iterator\n");
596  return GNUNET_YES;
597 }
size_t position
Part of the description already consumed by this particular search branch.
Struct to keep state of running searches that have consumed a part of the inital string.
#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 struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
struct GNUNET_HashCode hash
Destination hash of the longest match.
struct REGEX_INTERNAL_Search * info
Information about the search.
struct GNUNET_HashCode key
The key used in the DHT.
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
Struct to keep information of searches of services described by a regex using a user-provided string ...
char * description
User provided description of the searched service.
#define GNUNET_YES
Definition: gnunet_common.h:80
#define LOG(kind,...)
unsigned int longest_match
We just want to look for one edge, the longer the better.
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ REGEX_INTERNAL_search()

struct REGEX_INTERNAL_Search* REGEX_INTERNAL_search ( struct GNUNET_DHT_Handle dht,
const char *  string,
REGEX_INTERNAL_Found  callback,
void *  callback_cls,
struct GNUNET_STATISTICS_Handle stats 
)

Search for a peer offering a regex matching certain string in the DHT.

The search runs until REGEX_INTERNAL_search_cancel() is called, even if results are returned.

Parameters
dhtAn existing and valid DHT service handle.
stringString to match against the regexes in the DHT.
callbackCallback for found peers.
callback_clsClosure for callback.
statsOptional statistics handle to report usage. Can be NULL.
Returns
Handle to stop search and free resources. Must be freed by calling REGEX_INTERNAL_search_cancel().

Definition at line 699 of file regex_internal_dht.c.

References REGEX_INTERNAL_Search::callback, REGEX_INTERNAL_Search::callback_cls, REGEX_INTERNAL_Search::contexts, ctx, REGEX_INTERNAL_Search::description, REGEX_INTERNAL_Announcement::dht, REGEX_INTERNAL_Search::dht, REGEX_INTERNAL_Search::dht_get_handles, REGEX_INTERNAL_Search::dht_get_results, dht_get_string_handler(), DHT_OPT, DHT_REPLICATION, GNUNET_array_append, GNUNET_assert, GNUNET_BLOCK_TYPE_REGEX, GNUNET_break, GNUNET_CONTAINER_multihashmap_create(), GNUNET_CONTAINER_multihashmap_put(), GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST, GNUNET_DHT_get_start(), GNUNET_ERROR_TYPE_INFO, GNUNET_h2s(), GNUNET_new, GNUNET_NO, GNUNET_OK, GNUNET_strdup, h, RegexSearchContext::info, len, LOG, REGEX_INTERNAL_Search::n_contexts, RegexSearchContext::position, REGEX_INTERNAL_get_first_key(), size, REGEX_INTERNAL_Announcement::stats, and REGEX_INTERNAL_Search::stats.

Referenced by dht_connect_cb(), and handle_search().

704 {
705  struct REGEX_INTERNAL_Search *h;
706  struct GNUNET_DHT_GetHandle *get_h;
707  struct RegexSearchContext *ctx;
708  struct GNUNET_HashCode key;
709  size_t size;
710  size_t len;
711 
712  /* Initialize handle */
713  GNUNET_assert (NULL != dht);
714  GNUNET_assert (NULL != callback);
715  h = GNUNET_new (struct REGEX_INTERNAL_Search);
716  h->dht = dht;
717  h->description = GNUNET_strdup (string);
718  h->callback = callback;
719  h->callback_cls = callback_cls;
720  h->stats = stats;
723 
724  /* Initialize context */
725  len = strlen (string);
726  size = REGEX_INTERNAL_get_first_key (string, len, &key);
728  "Initial key for `%s' is %s (based on `%.*s')\n",
729  string,
730  GNUNET_h2s (&key),
731  size,
732  string);
733  ctx = GNUNET_new (struct RegexSearchContext);
734  ctx->position = size;
735  ctx->info = h;
737  h->n_contexts,
738  ctx);
739  /* Start search in DHT */
740  get_h = GNUNET_DHT_get_start (h->dht, /* handle */
741  GNUNET_BLOCK_TYPE_REGEX, /* type */
742  &key, /* key to search */
743  DHT_REPLICATION, /* replication level */
744  DHT_OPT,
745  &h->description[size], /* xquery */
746  // FIXME add BLOOMFILTER to exclude filtered peers
747  len + 1 - size, /* xquery bits */
748  // FIXME add BLOOMFILTER SIZE
749  &dht_get_string_handler, ctx);
750  GNUNET_break (
751  GNUNET_OK ==
753  &key,
754  get_h,
756  );
757 
758  return h;
759 }
static struct GNUNET_STATISTICS_Handle * stats
Handle for statistics.
#define DHT_REPLICATION
DHT replication level to use.
size_t position
Part of the description already consumed by this particular search branch.
size_t REGEX_INTERNAL_get_first_key(const char *input_string, size_t string_len, struct GNUNET_HashCode *key)
Get the first key for the given input_string.
#define GNUNET_assert(cond)
Use this for fatal errors that cannot be handled.
Struct to keep state of running searches that have consumed a part of the inital string.
#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_new(type)
Allocate a struct or union of the given type.
#define GNUNET_strdup(a)
Wrapper around GNUNET_xstrdup_.
#define DHT_OPT
DHT options to set.
#define GNUNET_break(cond)
Use this for internal assertion violations that are not fatal (can be handled) but should not occur...
static struct GNUNET_DNSSTUB_Context * ctx
Context for DNS resolution.
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:94
static void dht_get_string_handler(void *cls, struct GNUNET_TIME_Absolute exp, const struct GNUNET_HashCode *key, const struct GNUNET_PeerIdentity *get_path, unsigned int get_path_length, const struct GNUNET_PeerIdentity *put_path, unsigned int put_path_length, enum GNUNET_BLOCK_Type type, size_t size, const void *data)
Function to process DHT string to regex matching.
, &#39; bother checking if a value already exists (faster than GNUNET_CONTAINER_MULTIHASHMAPOPTION_...
struct REGEX_INTERNAL_Search * info
Information about the search.
A 512-bit hashcode.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_results
Results from running DHT GETs, values are of type &#39;struct Result&#39;.
struct GNUNET_HashCode key
The key used in the DHT.
static unsigned int size
Size of the "table".
Definition: peer.c:67
struct GNUNET_DHT_Handle * dht
DHT handle to use, must be initialized externally.
unsigned int n_contexts
Number of contexts (branches/steps in search).
int GNUNET_CONTAINER_multihashmap_put(struct GNUNET_CONTAINER_MultiHashMap *map, const struct GNUNET_HashCode *key, void *value, enum GNUNET_CONTAINER_MultiHashMapOption opt)
Store a key-value pair in the map.
Handle to a GET request.
Definition: dht_api.c:80
struct GNUNET_STATISTICS_Handle * stats
Optional statistics handle to report usage.
Struct to keep information of searches of services described by a regex using a user-provided string ...
#define GNUNET_array_append(arr, size, element)
Append an element to a list (growing the list by one).
struct GNUNET_DHT_GetHandle * GNUNET_DHT_get_start(struct GNUNET_DHT_Handle *handle, enum GNUNET_BLOCK_Type type, const struct GNUNET_HashCode *key, uint32_t desired_replication_level, enum GNUNET_DHT_RouteOption options, const void *xquery, size_t xquery_size, GNUNET_DHT_GetIterator iter, void *iter_cls)
Perform an asynchronous GET operation on the DHT identified.
Definition: dht_api.c:1072
char * description
User provided description of the searched service.
REGEX_INTERNAL_Found callback
struct GNUNET_CONTAINER_MultiHashMap * GNUNET_CONTAINER_multihashmap_create(unsigned int len, int do_not_copy_keys)
Create a multi hash map.
#define LOG(kind,...)
Block to store a cadet regex state.
static struct GNUNET_DHT_Handle * dht
Handle to the DHT.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_handles
Running DHT GETs.
struct RegexSearchContext ** contexts
Contexts, for each running DHT GET.
uint16_t len
length of data (which is always a uint32_t, but presumably this can be used to specify that fewer byt...
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_cancel_dht_get()

static int regex_cancel_dht_get ( void *  cls,
const struct GNUNET_HashCode key,
void *  value 
)
static

Iterator over hash map entries to cancel DHT GET requests after a successful connect_by_string.

Parameters
clsClosure (unused).
keyCurrent key code (unused).
valueValue in the hash map (get handle).
Returns
GNUNET_YES if we should continue to iterate, GNUNET_NO if not.

Definition at line 773 of file regex_internal_dht.c.

References GNUNET_DHT_get_stop(), GNUNET_YES, h, and value.

Referenced by REGEX_INTERNAL_search_cancel().

776 {
777  struct GNUNET_DHT_GetHandle *h = value;
778 
780  return GNUNET_YES;
781 }
static struct GNUNET_ARM_Handle * h
Connection with ARM.
Definition: gnunet-arm.c:94
static char * value
Value of the record to add/remove.
void GNUNET_DHT_get_stop(struct GNUNET_DHT_GetHandle *get_handle)
Stop async DHT-get.
Definition: dht_api.c:1160
Handle to a GET request.
Definition: dht_api.c:80
#define GNUNET_YES
Definition: gnunet_common.h:80
Here is the call graph for this function:
Here is the caller graph for this function:

◆ regex_free_result()

static int regex_free_result ( void *  cls,
const struct GNUNET_HashCode key,
void *  value 
)
static

Iterator over hash map entries to free CadetRegexBlocks stored during the search for connect_by_string.

Parameters
clsClosure (unused).
keyCurrent key code (unused).
valueCadetRegexBlock in the hash map.
Returns
GNUNET_YES if we should continue to iterate, GNUNET_NO if not.

Definition at line 795 of file regex_internal_dht.c.

References GNUNET_free, and GNUNET_YES.

Referenced by REGEX_INTERNAL_search_cancel().

798 {
799  GNUNET_free (value);
800  return GNUNET_YES;
801 }
static char * value
Value of the record to add/remove.
#define GNUNET_YES
Definition: gnunet_common.h:80
#define GNUNET_free(ptr)
Wrapper around free.
Here is the caller graph for this function:

◆ REGEX_INTERNAL_search_cancel()

void REGEX_INTERNAL_search_cancel ( struct REGEX_INTERNAL_Search h)

Cancel an ongoing regex search in the DHT and free all resources.

Stop search and free all data used by a REGEX_INTERNAL_search() call.

Parameters
hthe search context.

Definition at line 810 of file regex_internal_dht.c.

References REGEX_INTERNAL_Search::contexts, REGEX_INTERNAL_Search::description, REGEX_INTERNAL_Search::dht_get_handles, REGEX_INTERNAL_Search::dht_get_results, GNUNET_CONTAINER_multihashmap_destroy(), GNUNET_CONTAINER_multihashmap_iterate(), GNUNET_free, REGEX_INTERNAL_Search::n_contexts, regex_cancel_dht_get(), and regex_free_result().

Referenced by client_disconnect_cb(), and dht_da().

811 {
812  unsigned int i;
813 
816  &regex_cancel_dht_get, NULL);
818  &regex_free_result, NULL);
821  if (0 < h->n_contexts)
822  {
823  for (i = 0; i < h->n_contexts; i++)
824  GNUNET_free (h->contexts[i]);
825  GNUNET_free (h->contexts);
826  }
827  GNUNET_free (h);
828 }
int GNUNET_CONTAINER_multihashmap_iterate(struct GNUNET_CONTAINER_MultiHashMap *map, GNUNET_CONTAINER_HashMapIterator it, void *it_cls)
Iterate over all entries in the map.
static int regex_free_result(void *cls, const struct GNUNET_HashCode *key, void *value)
Iterator over hash map entries to free CadetRegexBlocks stored during the search for connect_by_strin...
void GNUNET_CONTAINER_multihashmap_destroy(struct GNUNET_CONTAINER_MultiHashMap *map)
Destroy a hash map.
static int regex_cancel_dht_get(void *cls, const struct GNUNET_HashCode *key, void *value)
Iterator over hash map entries to cancel DHT GET requests after a successful connect_by_string.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_results
Results from running DHT GETs, values are of type &#39;struct Result&#39;.
unsigned int n_contexts
Number of contexts (branches/steps in search).
char * description
User provided description of the searched service.
struct GNUNET_CONTAINER_MultiHashMap * dht_get_handles
Running DHT GETs.
struct RegexSearchContext ** contexts
Contexts, for each running DHT GET.
#define GNUNET_free(ptr)
Wrapper around free.
Here is the call graph for this function:
Here is the caller graph for this function: