Fixed some typos, courtesy of codespell

src/libstrongswan/bio/bio_reader.h

@@ -142,7 +142,7 @@ struct bio_reader_t {
 	 * Read a chunk of len bytes from the end of the buffer, reduce remaining.
 	 *
 	 * @param len		number of bytes to read
-	 * @param res		ponter to result, not cloned
+	 * @param res		pointer to result, not cloned
 	 * @return			TRUE if data read successfully
 	 */
 	bool (*read_data_end)(bio_reader_t *this, uint32_t len, chunk_t *res);

src/libstrongswan/credentials/auth_cfg.h

@@ -141,7 +141,7 @@ extern enum_name_t *auth_rule_names;
  * RFC4739 defines multiple authentication rounds. This class defines such
  * a round from a configuration perspective, either for the local or the remote
  * peer. Local configs are called "rulesets". They define how we authenticate.
- * Remote peer configs are called "constraits". They define what is needed to
+ * Remote peer configs are called "constraints". They define what is needed to
  * complete the authentication round successfully.
  *
  * @verbatim

src/libstrongswan/credentials/certificates/certificate_printer.h

@@ -62,7 +62,7 @@ struct certificate_printer_t {
  *
  * @param f				file where print output is directed to (usually stdout)
  * @param detailed		print more detailed certificate information
- * @param utc			print time inforamtion in UTC
+ * @param utc			print time information in UTC
  */
 certificate_printer_t* certificate_printer_create(FILE *f, bool detailed,
 												  bool utc);

src/libstrongswan/crypto/crypto_factory.h

@@ -177,7 +177,7 @@ struct crypto_factory_t {
 	 * Register a crypter constructor.
 	 *
 	 * @param algo			algorithm to constructor
-	 * @param key size		key size to peform benchmarking for
+	 * @param key size		key size to perform benchmarking for
 	 * @param plugin_name	plugin that registered this algorithm
 	 * @param create		constructor function for that algorithm
 	 * @return				TRUE if registered, FALSE if test vector failed
@@ -204,7 +204,7 @@ struct crypto_factory_t {
 	 * Register a aead constructor.
 	 *
 	 * @param algo			algorithm to constructor
-	 * @param key size		key size to peform benchmarking for
+	 * @param key size		key size to perform benchmarking for
 	 * @param plugin_name	plugin that registered this algorithm
 	 * @param create		constructor function for that algorithm
 	 * @return				TRUE if registered, FALSE if test vector failed

src/libstrongswan/plugins/gcm/gcm_aead.c

@@ -62,7 +62,7 @@ struct private_gcm_aead_t {
 };
 
 /**
- * Find a suiteable word size and network order conversion functions
+ * Find a suitable word size and network order conversion functions
  */
 #if ULONG_MAX == 18446744073709551615UL && defined(htobe64)
 #	define htobeword htobe64

src/libstrongswan/plugins/newhope/newhope_ke.c

@@ -306,7 +306,7 @@ METHOD(diffie_hellman_t, get_my_public_value, bool,
 		rng = lib->crypto->create_rng(lib->crypto, RNG_STRONG);
 		if (!rng)
 		{
-			DBG1(DBG_LIB, "could not instatiate random source");
+			DBG1(DBG_LIB, "could not instantiate random source");
 			return FALSE;
 		}
 		if (!rng->get_bytes(rng, seed_len, a_seed.ptr))
@@ -463,7 +463,7 @@ METHOD(diffie_hellman_t, set_other_public_value, bool,
 		rng = lib->crypto->create_rng(lib->crypto, RNG_STRONG);
 		if (!rng)
 		{
-			DBG1(DBG_LIB, "could not instatiate random source");
+			DBG1(DBG_LIB, "could not instantiate random source");
 			goto end;
 		}
 		if (!rng->get_bytes(rng, seed_len, noise_seed.ptr))

src/libstrongswan/plugins/ntru/ntru_drbg.h

@@ -71,7 +71,7 @@ struct ntru_drbg_t {
 };
 
 /**
- * Create and instantiate a new DRBG objet.
+ * Create and instantiate a new DRBG object.
  *
  * @param strength		security strength in bits
  * @param pers_str		personalization string

src/libstrongswan/plugins/ntru/ntru_poly.h

@@ -49,7 +49,7 @@ struct ntru_poly_t {
 	void (*get_array)(ntru_poly_t *this, uint16_t *array);
 
 	/**
-	 * Multiply polynomial a with ntru_poly_t object b having sparse coeffients
+	 * Multiply polynomial a with ntru_poly_t object b having sparse coefficients
 	 * to form result polynomial c = a * b
 	 *
 	 * @param a			input polynomial a

src/libstrongswan/selectors/traffic_selector.h

@@ -395,7 +395,7 @@ traffic_selector_t *traffic_selector_create_from_subnet(
  * greater or equal to 256 they are assumed to be type and code as defined
  * for traffic_selector_t.
  *
- * @param protocol		upper layer protocl to allow
+ * @param protocol		upper layer protocol to allow
  * @param from_port		start of allowed port range
  * @param to_port		end of range
  * @return

src/libstrongswan/settings/settings_lexer.l

@@ -29,7 +29,7 @@ static void include_files(parser_helper_t *ctx);
 /* use start conditions stack */
 %option stack
 
-/* do not declare unneded functions */
+/* do not declare unneeded functions */
 %option noinput noyywrap
 
 /* don't use global variables, and interact properly with bison */

src/libstrongswan/tests/suites/test_printf.c

@@ -204,7 +204,7 @@ Suite *printf_suite_create()
 	tcase_add_test(tc, test_printf_err);
 	suite_add_tcase(s, tc);
 
-	tc = tcase_create("unsiged");
+	tc = tcase_create("unsigned");
 	tcase_add_test(tc, test_printf_unsigned);
 	suite_add_tcase(s, tc);
 

src/libstrongswan/threading/windows/mutex.c

@@ -112,7 +112,7 @@ METHOD(condvar_t, timed_wait, bool,
 	thread_set_active_condvar(&this->cv);
 
 	/* while a CriticalSection is recursive, waiting in a condvar releases
-	 * only one mutex. So release (and reaquire) all locks except the last. */
+	 * only one mutex. So release (and reacquire) all locks except the last. */
 	times = mutex->times;
 	while (mutex->times-- > 1)
 	{