[Minor] Massive spelling correction

by a bot https://github.com/ka7/misspell_fixer

17 files changed, 46 insertions, 46 deletions

diff --git a/contrib/exim/local_scan.c b/contrib/exim/local_scan.c
index 3277bd879..522750144 100644
--- a/contrib/exim/local_scan.c
+++ b/contrib/exim/local_scan.c
@@ -280,7 +280,7 @@ int GetFiles (char *pInpFile, int local_scan_fd)
 {
     /*
         Returns OK if no errors, else error code.
-        On succesful return, pEnvFile points to Envelope file name and
+        On successful return, pEnvFile points to Envelope file name and
         pInpFile points to Message filename
     */
     int iStatus;
diff --git a/contrib/exim/local_scan.c.in b/contrib/exim/local_scan.c.in
index 68eec62cd..72d2f7988 100644
--- a/contrib/exim/local_scan.c.in
+++ b/contrib/exim/local_scan.c.in
@@ -267,7 +267,7 @@ local_scan(int fd, uschar **return_text)
 	tok_ptr = reply_buf;
 
 	/*
-	 * rspamd can use several metrics, logic implimented here:
+	 * rspamd can use several metrics, logic implemented here:
 	 * if any metric more than reject_score - will reject
 	 * if any metric true - message will be marked as spam
 	 */
diff --git a/contrib/exim/patch-exim-src_spam.c.diff b/contrib/exim/patch-exim-src_spam.c.diff
index de507f0e7..f3ac788d4 100644
--- a/contrib/exim/patch-exim-src_spam.c.diff
+++ b/contrib/exim/patch-exim-src_spam.c.diff
@@ -171,7 +171,7 @@ diff -ru exim-4.70.orig/src/spam.c exim-4.70/src/spam.c
 +  }
  
    /* now send the file */
-   /* spamd sometimes accepts conections but doesn't read data off
+   /* spamd sometimes accepts connections but doesn't read data off
 @@ -304,7 +359,9 @@
    (void)fclose(mbox_file);
  
diff --git a/contrib/exim/patch-exim-src_spam.c.diff.exim-4.85.diff b/contrib/exim/patch-exim-src_spam.c.diff.exim-4.85.diff
index 471865368..0389aeabc 100644
--- a/contrib/exim/patch-exim-src_spam.c.diff.exim-4.85.diff
+++ b/contrib/exim/patch-exim-src_spam.c.diff.exim-4.85.diff
@@ -174,7 +174,7 @@ diff -ru exim-4.85.orig/src/spam.c exim-4.85/src/spam.c
 +  }
  
    /* now send the file */
-   /* spamd sometimes accepts conections but doesn't read data off
+   /* spamd sometimes accepts connections but doesn't read data off
 @@ -349,60 +404,93 @@
    /* reading done */
    (void)close(spamd_sock);
diff --git a/contrib/hiredis/sds.c b/contrib/hiredis/sds.c
index f01247de9..5e7551647 100644
--- a/contrib/hiredis/sds.c
+++ b/contrib/hiredis/sds.c
@@ -161,7 +161,7 @@ sds sdsRemoveFreeSpace(sds s) {
     return sh->buf;
 }
 
-/* Return the total size of the allocation of the specifed sds string,
+/* Return the total size of the allocation of the specified sds string,
  * including:
  * 1) The sds header before the pointer.
  * 2) The string.
diff --git a/contrib/http-parser/http_parser.c b/contrib/http-parser/http_parser.c
index 2984471d4..0e75d964b 100644
--- a/contrib/http-parser/http_parser.c
+++ b/contrib/http-parser/http_parser.c
@@ -1653,7 +1653,7 @@ size_t http_parser_execute (http_parser *parser,
         /* Here we call the headers_complete callback. This is somewhat
          * different than other callbacks because if the user returns 1, we
          * will interpret that as saying that this message has no body. This
-         * is needed for the annoying case of recieving a response to a HEAD
+         * is needed for the annoying case of receiving a response to a HEAD
          * request.
          *
          * We'd like to use CALLBACK_NOTIFY_NOADVANCE() here but we cannot, so
@@ -1733,7 +1733,7 @@ size_t http_parser_execute (http_parser *parser,
             && parser->content_length != ULLONG_MAX);
 
         /* The difference between advancing content_length and p is because
-         * the latter will automaticaly advance on the next loop iteration.
+         * the latter will automatically advance on the next loop iteration.
          * Further, if content_length ends up at 0, we want to see the last
          * byte again for our message complete callback.
          */
@@ -2162,7 +2162,7 @@ http_parser_parse_url(const char *buf, size_t buflen, int is_connect,
       case s_dead:
         return 1;
 
-      /* Skip delimeters */
+      /* Skip delimiters */
       case s_req_schema_slash:
       case s_req_schema_slash_slash:
       case s_req_server_start:
diff --git a/contrib/lc-btrie/btrie.c b/contrib/lc-btrie/btrie.c
index 51357a1d6..fe768fc56 100644
--- a/contrib/lc-btrie/btrie.c
+++ b/contrib/lc-btrie/btrie.c
@@ -168,7 +168,7 @@
  * array of children for that path can be found by counting the number
  * of set bits to the left of that bit.
  *
- * Similary, the internal bitmap has one bit for each binary node
+ * Similarly, the internal bitmap has one bit for each binary node
  * which is internal to the multibit node. To determine whether there
  * is data stored for an internal prefix, one checks the corresponding
  * bit in the internal bitmap. As for extending paths, the index into
@@ -946,7 +946,7 @@ static void coalesce_lc_node(struct btrie *btrie, struct lc_node *node,
 			btrie->n_lc_nodes--;
 		}
 		else {
-			/* can't merge, but can take some of childs bits */
+			/* can't merge, but can take some of children bits */
 			unsigned cshift = lc_shift (end + spare_bits) - lc_shift (end);
 
 			memcpy(node->prefix + shift, child->prefix,
diff --git a/contrib/lgpl/gregex.c b/contrib/lgpl/gregex.c
index 406a63975..864888ad8 100644
--- a/contrib/lgpl/gregex.c
+++ b/contrib/lgpl/gregex.c
@@ -470,7 +470,7 @@ g_match_info_free (GMatchInfo *match_info)
 /**
  * g_match_info_next:
  * @match_info: a #GMatchInfo structure
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Scans for the next match using the same parameters of the previous
  * call to g_regex_match_full() or g_regex_match() that returned
@@ -534,7 +534,7 @@ g_match_info_next (GMatchInfo  *match_info,
       match_info->pos = match_info->offsets[1];
     }
 
-  /* it's possibile to get two identical matches when we are matching
+  /* it's possible to get two identical matches when we are matching
    * empty strings, for instance if the pattern is "(?=[A-Z0-9])" and
    * the string is "RegExTest" we have:
    *  - search at position 0: match from 0 to 0
@@ -661,7 +661,7 @@ g_match_info_is_partial_match (const GMatchInfo *match_info)
  * g_match_info_expand_references:
  * @match_info: a #GMatchInfo or %NULL
  * @string_to_expand: the string to expand
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Returns a new string containing the text in @string_to_expand with
  * references and escape sequences expanded. References refer to the last
@@ -1403,7 +1403,7 @@ g_regex_match (const GRegex      *regex,
  * @match_options: match options
  * @match_info: pointer to location where to store the #GMatchInfo, 
  *   or %NULL if you do not need it
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Scans for a match in string for the pattern in @regex. 
  * The @match_options are combined with the match options specified 
@@ -1534,10 +1534,10 @@ g_regex_match_all (const GRegex      *regex,
  * @match_options: match options
  * @match_info: pointer to location where to store the #GMatchInfo, 
  *   or %NULL if you do not need it
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Using the standard algorithm for regular expression matching only 
- * the longest match in the string is retrieved, it is not possibile 
+ * the longest match in the string is retrieved, it is not possible 
  * to obtain all the available matches. For instance matching
  * "<a> <b> <c>" against the pattern "<.*>" 
  * you get "<a> <b> <c>".
@@ -2402,7 +2402,7 @@ interpolation_list_needs_match (GList *list)
  * @start_position: starting index of the string to match
  * @replacement: text to replace each match with
  * @match_options: options for the match
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Replaces all occurrences of the pattern in @regex with the
  * replacement text. Backreferences of the form '\number' or 
@@ -2514,7 +2514,7 @@ literal_replacement (const GMatchInfo *match_info,
  * @start_position: starting index of the string to match
  * @replacement: text to replace each match with
  * @match_options: options for the match
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Replaces all occurrences of the pattern in @regex with the
  * replacement text. @replacement is replaced literally, to
@@ -2558,7 +2558,7 @@ g_regex_replace_literal (const GRegex      *regex,
  * @match_options: options for the match
  * @eval: a function to call for each match
  * @user_data: user data to pass to the function
- * @error: location to store the error occuring, or %NULL to ignore errors
+ * @error: location to store the error occurring, or %NULL to ignore errors
  *
  * Replaces occurrences of the pattern in regex with the output of 
  * @eval for that occurrence.
diff --git a/contrib/libottery/ottery-internal.h b/contrib/libottery/ottery-internal.h
index 145c5e4a9..2c38a52b0 100644
--- a/contrib/libottery/ottery-internal.h
+++ b/contrib/libottery/ottery-internal.h
@@ -170,7 +170,7 @@ struct ottery_prf {
   unsigned output_len;
   /** Bitmask of CPU flags required to run this PRF. */
   uint32_t required_cpucap;
-  /** Pointer to a function to intialize a state structure for the PRF.
+  /** Pointer to a function to initialize a state structure for the PRF.
    *
    * @param state An object of size at least (state_len) that will
    *     hold the state and any derived values.  It must be aligned to
diff --git a/contrib/libucl/lua_ucl.c b/contrib/libucl/lua_ucl.c
index 0d6cc0830..85f16a237 100644
--- a/contrib/libucl/lua_ucl.c
+++ b/contrib/libucl/lua_ucl.c
@@ -1186,7 +1186,7 @@ lua_ucl_to_config (lua_State *L)
  * - `yaml` - embedded yaml
  *
  * If `var` contains function, they are called during output formatting and if
- * they return string value, then this value is used for ouptut.
+ * they return string value, then this value is used for output.
  * @param {variant} var any sort of lua variable (if userdata then metafield `__to_ucl` is searched for output)
  * @param {string} format any available format
  * @return {string} string representation of `var` in the specific `format`.
diff --git a/contrib/libucl/ucl.h b/contrib/libucl/ucl.h
index ee03334e0..7c069e794 100644
--- a/contrib/libucl/ucl.h
+++ b/contrib/libucl/ucl.h
@@ -108,7 +108,7 @@ typedef enum ucl_error {
 	UCL_EMACRO, /**< Error processing a macro */
 	UCL_EINTERNAL, /**< Internal unclassified error */
 	UCL_ESSL, /**< SSL error */
-	UCL_EMERGE /**< A merge error occured */
+	UCL_EMERGE /**< A merge error occurred */
 } ucl_error_t;
 
 /**
@@ -229,7 +229,7 @@ typedef struct ucl_object_s {
 	const char *key;						/**< Key of an object		*/
 	struct ucl_object_s *next;				/**< Array handle			*/
 	struct ucl_object_s *prev;				/**< Array handle			*/
-	uint32_t keylen;						/**< Lenght of a key		*/
+	uint32_t keylen;						/**< Length of a key		*/
 	uint32_t len;							/**< Size of an object		*/
 	uint32_t ref;							/**< Reference count		*/
 	uint16_t flags;							/**< Object flags			*/
@@ -830,7 +830,7 @@ UCL_EXTERN ucl_object_iter_t ucl_object_iterate_reset (ucl_object_iter_t it,
 		const ucl_object_t *obj);
 
 /**
- * Get the next object from the `obj`. This fucntion iterates over arrays, objects
+ * Get the next object from the `obj`. This function iterates over arrays, objects
  * and implicit arrays
  * @param iter safe iterator
  * @param expand_values expand explicit arrays and objects
@@ -848,7 +848,7 @@ enum ucl_iterate_type {
 };
 
 /**
- * Get the next object from the `obj`. This fucntion iterates over arrays, objects
+ * Get the next object from the `obj`. This function iterates over arrays, objects
  * and implicit arrays if needed
  * @param iter safe iterator
  * @param
@@ -1156,7 +1156,7 @@ UCL_EXTERN const ucl_object_t * ucl_comments_find (const ucl_object_t *comments,
  * Move comment from `from` object to `to` object
  * @param comments comments object
  * @param what source object
- * @param whith destination object
+ * @param with destination object
  * @return `true` if `from` has comment and it has been moved to `to`
  */
 UCL_EXTERN bool ucl_comments_move (ucl_object_t *comments,
@@ -1391,7 +1391,7 @@ enum ucl_schema_error_code {
 struct ucl_schema_error {
 	enum ucl_schema_error_code code;	/**< error code */
 	char msg[128];						/**< error message */
-	const ucl_object_t *obj;			/**< object where error occured */
+	const ucl_object_t *obj;			/**< object where error occurred */
 };
 
 /**
@@ -1399,7 +1399,7 @@ struct ucl_schema_error {
  * @param schema schema object
  * @param obj object to validate
  * @param err error pointer, if this parameter is not NULL and error has been
- * occured, then `err` is filled with the exact error definition.
+ * occurred, then `err` is filled with the exact error definition.
  * @return true if `obj` is valid using `schema`
  */
 UCL_EXTERN bool ucl_object_validate (const ucl_object_t *schema,
@@ -1411,7 +1411,7 @@ UCL_EXTERN bool ucl_object_validate (const ucl_object_t *schema,
  * @param obj object to validate
  * @param root root schema object
  * @param err error pointer, if this parameter is not NULL and error has been
- * occured, then `err` is filled with the exact error definition.
+ * occurred, then `err` is filled with the exact error definition.
  * @return true if `obj` is valid using `schema`
  */
 UCL_EXTERN bool ucl_object_validate_root (const ucl_object_t *schema,
@@ -1427,7 +1427,7 @@ UCL_EXTERN bool ucl_object_validate_root (const ucl_object_t *schema,
  * @param root root schema object
  * @param ext_refs external references (might be modified during validation)
  * @param err error pointer, if this parameter is not NULL and error has been
- * occured, then `err` is filled with the exact error definition.
+ * occurred, then `err` is filled with the exact error definition.
  * @return true if `obj` is valid using `schema`
  */
 UCL_EXTERN bool ucl_object_validate_root_ext (const ucl_object_t *schema,
diff --git a/contrib/libucl/ucl_util.c b/contrib/libucl/ucl_util.c
index 812655d2e..f0ce5b5e3 100644
--- a/contrib/libucl/ucl_util.c
+++ b/contrib/libucl/ucl_util.c
@@ -3070,7 +3070,7 @@ ucl_object_todouble_safe (const ucl_object_t *obj, double *target)
 	}
 	switch (obj->type) {
 	case UCL_INT:
-		*target = obj->value.iv; /* Probaly could cause overflow */
+		*target = obj->value.iv; /* Probably could cause overflow */
 		break;
 	case UCL_FLOAT:
 	case UCL_TIME:
diff --git a/contrib/lpeg/lpcode.c b/contrib/lpeg/lpcode.c
index fbf44feb1..6feefeb43 100644
--- a/contrib/lpeg/lpcode.c
+++ b/contrib/lpeg/lpcode.c
@@ -248,7 +248,7 @@ int fixedlenx (TTree *tree, int count, int len) {
 
 /*
 ** Computes the 'first set' of a pattern.
-** The result is a conservative aproximation:
+** The result is a conservative approximation:
 **   match p ax -> x (for some x) ==> a belongs to first(p)
 ** or
 **   a not in first(p) ==> match p ax -> fail (for all x)
@@ -737,13 +737,13 @@ static void coderuntime (CompileState *compst, TTree *tree, int tt) {
 
 
 /*
-** Repetion; optimizations:
+** Repetition; optimizations:
 ** When pattern is a charset, can use special instruction ISpan.
 ** When pattern is head fail, or if it starts with characters that
 ** are disjoint from what follows the repetions, a simple test
 ** is enough (a fail inside the repetition would backtrack to fail
 ** again in the following pattern, so there is no need for a choice).
-** When 'opt' is true, the repetion can reuse the Choice already
+** When 'opt' is true, the repetition can reuse the Choice already
 ** active in the stack.
 */
 static void coderep (CompileState *compst, TTree *tree, int opt,
@@ -884,7 +884,7 @@ static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2,
 
 
 /*
-** Main code-generation function: dispatch to auxiliar functions
+** Main code-generation function: dispatch to auxiliary functions
 ** according to kind of tree. ('needfollow' should return true
 ** only for consructions that use 'fl'.)
 */
diff --git a/contrib/lpeg/lptree.c b/contrib/lpeg/lptree.c
index bc82ae8da..f1016c3db 100644
--- a/contrib/lpeg/lptree.c
+++ b/contrib/lpeg/lptree.c
@@ -186,7 +186,7 @@ static int ktablelen (lua_State *L, int idx) {
 
 
 /*
-** Concatentate the contents of table 'idx1' into table 'idx2'.
+** Concatenate the contents of table 'idx1' into table 'idx2'.
 ** (Assume that both indices are negative.)
 ** Return the original length of table 'idx2' (or 0, if no
 ** element was added, as there is no need to correct any index).
@@ -484,7 +484,7 @@ static TTree *getpatt (lua_State *L, int idx, int *len) {
 
 
 /*
-** create a new tree, whith a new root and one sibling.
+** create a new tree, with a new root and one sibling.
 ** Sibling must be on the Lua stack, at index 1.
 */
 static TTree *newroot1sib (lua_State *L, int tag) {
@@ -499,7 +499,7 @@ static TTree *newroot1sib (lua_State *L, int tag) {
 
 
 /*
-** create a new tree, whith a new root and 2 siblings.
+** create a new tree, with a new root and 2 siblings.
 ** Siblings must be on the Lua stack, first one at index 1.
 */
 static TTree *newroot2sib (lua_State *L, int tag) {
diff --git a/contrib/mumhash/mum.h b/contrib/mumhash/mum.h
index 6b9fac4a8..c6985a282 100644
--- a/contrib/mumhash/mum.h
+++ b/contrib/mumhash/mum.h
@@ -35,7 +35,7 @@
    Random and Pseudorandom Number Generators for Cryptographic
    Applications (version 2.2.1) with 1000 bitstreams each containing
    1M bits.  MUM hashing is also faster Spooky64 and City64 on small
-   strings (at least upto 512-bit) on Haswell and Power7.  The MUM bulk
+   strings (at least up to 512-bit) on Has well and Power7.  The MUM bulk
    speed (speed on very long data) is bigger than Spooky and City on
    Power7.  On Haswell the bulk speed is bigger than Spooky one and
    close to City speed.  */
@@ -174,7 +174,7 @@ _mum_le (uint64_t v) {
 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
   return _mum_bswap64 (v);
 #else
-#error "Unknown endianess"
+#error "Unknown endianness"
 #endif
 }
 
@@ -185,7 +185,7 @@ _mum_le32 (uint32_t v) {
 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
   return _mum_bswap32 (v);
 #else
-#error "Unknown endianess"
+#error "Unknown endianness"
 #endif
 }
 
@@ -383,7 +383,7 @@ mum_hash64 (uint64_t key, uint64_t seed) {
 }
 
 /* Hash data KEY of length LEN and SEED.  The hash depends on the
-   target endianess and the unroll factor.  */
+   target endianness and the unroll factor.  */
 static inline uint64_t _MUM_INLINE
 mum_hash (const void *key, size_t len, uint64_t seed) {
   return _mum_hash_default (key, len, seed);
diff --git a/contrib/xxhash/xxhash.c b/contrib/xxhash/xxhash.c
index db72061dc..86abd5eab 100644
--- a/contrib/xxhash/xxhash.c
+++ b/contrib/xxhash/xxhash.c
@@ -51,10 +51,10 @@ You can contact the author at :
 // #define XXH_ACCEPT_NULL_INPUT_POINTER 1
 
 // XXH_FORCE_NATIVE_FORMAT :
-// By default, xxHash library provides endian-independant Hash values, based on little-endian convention.
+// By default, xxHash library provides endian-independent Hash values, based on little-endian convention.
 // Results are therefore identical for little-endian and big-endian CPU.
 // This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format.
-// Should endian-independance be of no importance for your application, you may set the #define below to 1.
+// Should endian-independence be of no importance for your application, you may set the #define below to 1.
 // It will improve speed for Big-endian CPU.
 // This option has no impact on Little_Endian CPU.
 #define XXH_FORCE_NATIVE_FORMAT 0
diff --git a/contrib/zstd/cover.c b/contrib/zstd/cover.c
index 1863c8f34..0f9622898 100644
--- a/contrib/zstd/cover.c
+++ b/contrib/zstd/cover.c
@@ -437,7 +437,7 @@ static COVER_segment_t COVER_selectSegment(const COVER_ctx_t *ctx, U32 *freqs,
       U32 *delDmerOcc = COVER_map_at(activeDmers, delDmer);
       activeSegment.begin += 1;
       *delDmerOcc -= 1;
-      /* If this is the last occurence of the dmer, subtract its score */
+      /* If this is the last occurrence of the dmer, subtract its score */
       if (*delDmerOcc == 0) {
         COVER_map_remove(activeDmers, delDmer);
         activeSegment.score -= freqs[delDmer];
@@ -834,7 +834,7 @@ typedef struct COVER_tryParameters_data_s {
 } COVER_tryParameters_data_t;
 
 /**
- * Tries a set of parameters and upates the COVER_best_t with the results.
+ * Tries a set of parameters and updates the COVER_best_t with the results.
  * This function is thread safe if zstd is compiled with multithreaded support.
  * It takes its parameters as an *OWNING* opaque pointer to support threading.
  */