-fix many more typos

14 files changed, 28 insertions, 28 deletions

diff --git a/src/regex/gnunet-daemon-regexprofiler.c b/src/regex/gnunet-daemon-regexprofiler.c
index d94b5ae46..70301338f 100644
--- a/src/regex/gnunet-daemon-regexprofiler.c
+++ b/src/regex/gnunet-daemon-regexprofiler.c
@@ -21,7 +21,7 @@
 /**
  * @file regex/gnunet-daemon-regexprofiler.c
  * @brief daemon that uses cadet to announce a regular expression. Used in
- * conjunction with gnunet-regex-profiler to announce regexes on serveral peers
+ * conjunction with gnunet-regex-profiler to announce regexes on several peers
  * without the need to explicitly connect to the cadet service running on the
  * peer from within the profiler.
  * @author Maximilian Szengel
diff --git a/src/regex/gnunet-regex-profiler.c b/src/regex/gnunet-regex-profiler.c
index e82e10e3b..90e06cf5f 100644
--- a/src/regex/gnunet-regex-profiler.c
+++ b/src/regex/gnunet-regex-profiler.c
@@ -173,7 +173,7 @@ struct RegexPeer
   struct GNUNET_SCHEDULER_Task *timeout;
 
   /**
-   * Deamon start
+   * Daemon start
    */
   struct GNUNET_TESTBED_Operation *daemon_op;
 };
@@ -718,7 +718,7 @@ find_string (void *cls);
  * @param cls Closure provided in REGEX_INTERNAL_search.
  * @param id Peer providing a regex that matches the string.
  * @param get_path Path of the get request.
- * @param get_path_length Lenght of get_path.
+ * @param get_path_length Length of get_path.
  * @param put_path Path of the put request.
  * @param put_path_length Length of the put_path.
  */
@@ -936,7 +936,7 @@ daemon_started (void *cls,
   else
   {
     GNUNET_log (GNUNET_ERROR_TYPE_INFO,
-                "Deamon %u started successfully\n", peer->id);
+                "Daemon %u started successfully\n", peer->id);
   }
 
   /* Find a peer to look for a string matching the regex announced */
@@ -1027,7 +1027,7 @@ announce_next_regex (void *cls)
 
 /**
  * DHT connect callback. Called when we are connected to the dht service for
- * the peer in 'cls'. If successfull we connect to the stats service of this
+ * the peer in 'cls'. If successful we connect to the stats service of this
  * peer and then try to match the search string of this peer.
  *
  * @param cls internal peer id.
diff --git a/src/regex/gnunet-regex-simulation-profiler.c b/src/regex/gnunet-regex-simulation-profiler.c
index 3d449a04e..ab6d65d58 100644
--- a/src/regex/gnunet-regex-simulation-profiler.c
+++ b/src/regex/gnunet-regex-simulation-profiler.c
@@ -60,7 +60,7 @@ struct ProgressMeter
   unsigned int total;
 
   /**
-   * Intervall for printing percentage.
+   * Interval for printing percentage.
    */
   unsigned int modnum;
 
diff --git a/src/regex/gnunet-service-regex.c b/src/regex/gnunet-service-regex.c
index 19250d427..7a5cc1f05 100644
--- a/src/regex/gnunet-service-regex.c
+++ b/src/regex/gnunet-service-regex.c
@@ -189,7 +189,7 @@ handle_announce (void *cls,
  * @param cls the struct ClientEntry of the client searching
  * @param id Peer providing a regex that matches the string.
  * @param get_path Path of the get request.
- * @param get_path_length Lenght of @a get_path.
+ * @param get_path_length Length of @a get_path.
  * @param put_path Path of the put request.
  * @param put_path_length Length of the @a put_path.
  */
diff --git a/src/regex/perf-regex.c b/src/regex/perf-regex.c
index 6155501f2..aea0c054f 100644
--- a/src/regex/perf-regex.c
+++ b/src/regex/perf-regex.c
@@ -63,7 +63,7 @@ print_edge (void *cls,
 
 
 /**
- * The main function of the regex performace test.
+ * The main function of the regex performance test.
  *
  * Read a set of regex from a file, combine them and create a DFA from the
  * resulting combined regex.
diff --git a/src/regex/plugin_block_regex.c b/src/regex/plugin_block_regex.c
index c087abae9..ad897493f 100644
--- a/src/regex/plugin_block_regex.c
+++ b/src/regex/plugin_block_regex.c
@@ -168,7 +168,7 @@ evaluate_block_regex (void *cls,
     return GNUNET_BLOCK_EVALUATION_RESULT_INVALID;
 
   case GNUNET_NO:
-    /* xquery missmatch, can happen */
+    /* xquery mismatch, can happen */
     return GNUNET_BLOCK_EVALUATION_RESULT_IRRELEVANT;
 
   default:
diff --git a/src/regex/regex_block_lib.c b/src/regex/regex_block_lib.c
index 159e8bf8a..cbfb553ce 100644
--- a/src/regex/regex_block_lib.c
+++ b/src/regex/regex_block_lib.c
@@ -71,7 +71,7 @@ struct RegexBlock
   uint16_t num_edges GNUNET_PACKED;
 
   /**
-   * Nubmer of unique destinations reachable from this state.
+   * Number of unique destinations reachable from this state.
    */
   uint16_t num_destinations GNUNET_PACKED;
 
@@ -158,7 +158,7 @@ struct CheckEdgeContext
  *
  * @param cls Closure, (xquery context).
  * @param token Token that follows to next state.
- * @param len Lenght of token.
+ * @param len Length of token.
  * @param key Hash of next state.
  *
  * @return #GNUNET_YES, to keep iterating
diff --git a/src/regex/regex_internal.c b/src/regex/regex_internal.c
index cd33281e2..aa40851a9 100644
--- a/src/regex/regex_internal.c
+++ b/src/regex/regex_internal.c
@@ -1562,7 +1562,7 @@ automaton_create_proofs_simplify (const struct StringBuffer *R_last_ij,
 
 /**
  * Create proofs for all states in the given automaton. Implementation of the
- * algorithm descriped in chapter 3.2.1 of "Automata Theory, Languages, and
+ * algorithm described in chapter 3.2.1 of "Automata Theory, Languages, and
  * Computation 3rd Edition" by Hopcroft, Motwani and Ullman.
  *
  * Each state in the automaton gets assigned 'proof' and 'hash' (hash of the
@@ -1796,7 +1796,7 @@ dfa_state_create (struct REGEX_INTERNAL_Context *ctx,
 
 /**
  * Move from the given state 's' to the next state on transition 'str'. Consumes
- * as much of the given 'str' as possible (usefull for strided DFAs). On return
+ * as much of the given 'str' as possible (useful for strided DFAs). On return
  * 's' will point to the next state, and the length of the substring used for
  * this transition will be returned. If no transition possible 0 is returned and
  * 's' points to NULL.
@@ -1805,7 +1805,7 @@ dfa_state_create (struct REGEX_INTERNAL_Context *ctx,
  * transition possible)
  * @param str edge label to follow (will match longest common prefix)
  *
- * @return length of the substring comsumed from 'str'
+ * @return length of the substring consumed from 'str'
  */
 static unsigned int
 dfa_move (struct REGEX_INTERNAL_State **s, const char *str)
@@ -3055,7 +3055,7 @@ construct_dfa_states (struct REGEX_INTERNAL_Context *ctx,
  * @param len length of the regular expression.
  * @param max_path_len limit the path compression length to the
  *        given value. If set to 1, no path compression is applied. Set to 0 for
- *        maximal possible path compression (generally not desireable).
+ *        maximal possible path compression (generally not desirable).
  * @return DFA, needs to be freed using REGEX_INTERNAL_automaton_destroy.
  */
 struct REGEX_INTERNAL_Automaton *
@@ -3525,7 +3525,7 @@ REGEX_INTERNAL_iterate_all_edges (struct REGEX_INTERNAL_Automaton *a,
 /**
  * Struct to hold all the relevant state information in the HashMap.
  *
- * Contains the same info as the Regex Iterator parametes except the key,
+ * Contains the same info as the Regex Iterator parameters except the key,
  * which comes directly from the HashMap iterator.
  */
 struct temporal_state_store
diff --git a/src/regex/regex_internal_dht.c b/src/regex/regex_internal_dht.c
index 39d7cd847..3fb74c319 100644
--- a/src/regex/regex_internal_dht.c
+++ b/src/regex/regex_internal_dht.c
@@ -254,7 +254,7 @@ REGEX_INTERNAL_announce_cancel (struct REGEX_INTERNAL_Announcement *h)
 
 /**
  * Struct to keep state of running searches that have consumed a part of
- * the inital string.
+ * the initial string.
  */
 struct RegexSearchContext
 {
@@ -374,7 +374,7 @@ regex_next_edge (const struct RegexBlock *block,
  * @param exp When will this value expire.
  * @param key Key of the result.
  * @param get_path Path of the get request.
- * @param get_path_length Lenght of get_path.
+ * @param get_path_length Length of get_path.
  * @param put_path Path of the put request.
  * @param put_path_length Length of the put_path.
  * @param type Type of the result.
@@ -551,7 +551,7 @@ regex_result_iterator (void *cls,
  *
  * @param cls Closure (context of the search).
  * @param token Token that follows to next state.
- * @param len Lenght of token.
+ * @param len Length of token.
  * @param key Hash of next state.
  * @return #GNUNET_YES if should keep iterating, #GNUNET_NO otherwise.
  */
diff --git a/src/regex/regex_test_lib.c b/src/regex/regex_test_lib.c
index 58cd8dc10..f8d3f993f 100644
--- a/src/regex/regex_test_lib.c
+++ b/src/regex/regex_test_lib.c
@@ -137,7 +137,7 @@ debugctx (struct RegexCombineCtx *ctx, int level)
 
 
 /**
- * Add a single regex to a context, combining with exisiting regex by-prefix.
+ * Add a single regex to a context, combining with existing regex by-prefix.
  *
  * @param ctx Context with 0 or more regexes.
  * @param regex Regex to add.
@@ -378,14 +378,14 @@ regex_add_multiple (struct RegexCombineCtx *ctx,
 
 
 /**
- * Add a single regex to a context, splitting the exisiting state.
+ * Add a single regex to a context, splitting the existing state.
  *
  * We only had a partial match, split existing state, truncate the current node
  * so it only contains the prefix, add suffix(es) as children.
  *
  * @param ctx Context to split.
- * @param len Lenght of ctx->s
- * @param prefix_l Lenght of common prefix of the new regex and @a ctx->s
+ * @param len Length of ctx->s
+ * @param prefix_l Length of common prefix of the new regex and @a ctx->s
  */
 static void
 regex_split (struct RegexCombineCtx *ctx,
@@ -431,7 +431,7 @@ regex_split (struct RegexCombineCtx *ctx,
 
 
 /**
- * Add a single regex to a context, combining with exisiting regex by-prefix.
+ * Add a single regex to a context, combining with existing regex by-prefix.
  *
  * @param ctx Context with 0 or more regexes.
  * @param regex Regex to add.
diff --git a/src/regex/regex_test_random.c b/src/regex/regex_test_random.c
index 02d59f5dc..823563d4d 100644
--- a/src/regex/regex_test_random.c
+++ b/src/regex/regex_test_random.c
@@ -55,7 +55,7 @@ get_random_literal ()
  * @param matching_str (optional) pointer to a string that will contain a string
  *                     that will be matched by the generated regex, if
  *                     'matching_str' pointer was not NULL. Make sure you
- *                     allocated at least rx_length+1 bytes for this sting.
+ *                     allocated at least rx_length+1 bytes for this string.
  *
  * @return NULL if 'rx_length' is 0, a random regex of length 'rx_length', which
  *         needs to be freed, otherwise.
diff --git a/src/regex/test_regex_api.c b/src/regex/test_regex_api.c
index 734fbdbf3..9761e80f9 100644
--- a/src/regex/test_regex_api.c
+++ b/src/regex/test_regex_api.c
@@ -80,7 +80,7 @@ end_badly ()
  * @param cls Closure provided in GNUNET_REGEX_search.
  * @param id Peer providing a regex that matches the string.
  * @param get_path Path of the get request.
- * @param get_path_length Lenght of get_path.
+ * @param get_path_length Length of get_path.
  * @param put_path Path of the put request.
  * @param put_path_length Length of the put_path.
  */
diff --git a/src/regex/test_regex_eval_api.c b/src/regex/test_regex_eval_api.c
index 7cd081269..be3649dbd 100644
--- a/src/regex/test_regex_eval_api.c
+++ b/src/regex/test_regex_eval_api.c
@@ -195,7 +195,7 @@ error:
  * @param rxstr regular expression and strings with expected results to
  *              match against.
  *
- * @return 0 on successfull, non 0 otherwise
+ * @return 0 on successful, non 0 otherwise
  */
 int
 test_automaton (struct REGEX_INTERNAL_Automaton *a, regex_t *rx,
diff --git a/src/regex/test_regex_proofs.c b/src/regex/test_regex_proofs.c
index 8908084b0..289b1183b 100644
--- a/src/regex/test_regex_proofs.c
+++ b/src/regex/test_regex_proofs.c
@@ -78,7 +78,7 @@ test_proof (const char *regex)
  * @param count number of random regular expressions to test.
  * @param rx_length length of the random regular expressions.
  *
- * @return 0 on succes, number of failures otherwise.
+ * @return 0 on success, number of failures otherwise.
  */
 static unsigned int
 test_proofs_random (unsigned int count, size_t rx_length)