Typos found by codespell

Signed-off-by: Dimitri Papadopoulos <3350651-DimitriPapadopoulos@users.noreply.gitlab.com>
This commit is contained in:
Dimitri Papadopoulos
2021-09-09 12:31:39 +02:00
committed by Nikos Mavrogiannopoulos
parent d8d19837d9
commit 81df79a95b
87 changed files with 111 additions and 110 deletions

View File

@@ -280,7 +280,7 @@ static uint32_t hashlittle( const void *key, size_t length, uint32_t *val2 )
* rest of the string. Every machine with memory protection I've seen
* does it on word boundaries, so is OK with this. But VALGRIND will
* still catch it and complain. The masking trick does make the hash
* noticably faster for short strings (like English words).
* noticeably faster for short strings (like English words).
*
* Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
*/
@@ -457,7 +457,7 @@ static uint32_t hashbig( const void *key, size_t length, uint32_t *val2)
* rest of the string. Every machine with memory protection I've seen
* does it on word boundaries, so is OK with this. But VALGRIND will
* still catch it and complain. The masking trick does make the hash
* noticably faster for short strings (like English words).
* noticeably faster for short strings (like English words).
*
* Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
*/

View File

@@ -35,7 +35,7 @@
* #include <stdio.h>
* #include <string.h>
*
* // Simple demonstration: idential strings will have the same hash, but
* // Simple demonstration: identical strings will have the same hash, but
* // two different strings will probably not.
* int main(int argc, char *argv[])
* {
@@ -164,7 +164,7 @@ static inline uint32_t hash_string(const char *string)
* #include <stdio.h>
* #include <string.h>
*
* // Simple demonstration: idential strings will have the same hash, but
* // Simple demonstration: identical strings will have the same hash, but
* // two different strings will probably not.
* int main(int argc, char *argv[])
* {

View File

@@ -377,7 +377,7 @@ static inline const void *list_tail_(const struct list_head *h, size_t off)
/**
* list_for_each_off - iterate through a list of memory regions.
* @h: the list_head
* @i: the pointer to a memory region wich contains list node data.
* @i: the pointer to a memory region which contains list node data.
* @off: offset(relative to @i) at which list node data resides.
*
* This is a low-level wrapper to iterate @i over the entire list, used to
@@ -385,12 +385,12 @@ static inline const void *list_tail_(const struct list_head *h, size_t off)
* so you can break and continue as normal.
*
* WARNING! Being the low-level macro that it is, this wrapper doesn't know
* nor care about the type of @i. The only assumtion made is that @i points
* nor care about the type of @i. The only assumption made is that @i points
* to a chunk of memory that at some @offset, relative to @i, contains a
* properly filled `struct node_list' which in turn contains pointers to
* memory chunks and it's turtles all the way down. Whith all that in mind
* memory chunks and it's turtles all the way down. With all that in mind
* remember that given the wrong pointer/offset couple this macro will
* happilly churn all you memory untill SEGFAULT stops it, in other words
* happilly churn all you memory until SEGFAULT stops it, in other words
* caveat emptor.
*
* It is worth mentioning that one of legitimate use-cases for that wrapper
@@ -413,7 +413,7 @@ static inline const void *list_tail_(const struct list_head *h, size_t off)
* list_for_each_safe_off - iterate through a list of memory regions, maybe
* during deletion
* @h: the list_head
* @i: the pointer to a memory region wich contains list node data.
* @i: the pointer to a memory region which contains list node data.
* @nxt: the structure containing the list_node
* @off: offset(relative to @i) at which list node data resides.
*

View File

@@ -621,7 +621,7 @@ static inline int talloc_unreference(const void *context, const void *ptr)
/*
remove a specific parent context from a pointer. This is a more
controlled varient of talloc_free()
controlled variant of talloc_free()
*/
int talloc_unlink(const void *context, void *ptr)
{

View File

@@ -950,7 +950,7 @@ void *talloc_autofree_context(void);
* talloc_get_size - get the requested size of an allocation
* @ctx: the talloc pointer whose allocation to measure.
*
* This function lets you know the amount of memory alloced so far by this
* This function lets you know the amount of memory allocated so far by this
* context. It does NOT account for subcontext memory.
*
* See Also:

View File

@@ -1839,7 +1839,7 @@ reexecute:
/* 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
@@ -1950,7 +1950,7 @@ reexecute:
&& 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.
*/
@@ -2444,7 +2444,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:

View File

@@ -54,7 +54,7 @@ typedef unsigned __int64 uint64_t;
# define HTTP_PARSER_STRICT 1
#endif
/* Maximium header size allowed. If the macro is not defined
/* Maximum header size allowed. If the macro is not defined
* before including this header then the default is used. To
* change the maximum header size, define the macro in the build
* environment (e.g. -DHTTP_MAX_HEADER_SIZE=<value>). To remove
@@ -79,7 +79,7 @@ typedef struct http_parser_settings http_parser_settings;
* chunked' headers that indicate the presence of a body.
*
* Returning `2` from on_headers_complete will tell parser that it should not
* expect neither a body nor any futher responses on this connection. This is
* expect neither a body nor any further responses on this connection. This is
* useful for handling responses to a CONNECT request which may not contain
* `Upgrade` or `Connection: upgrade` headers.
*

View File

@@ -396,7 +396,7 @@ const char* script, *next_script = NULL;
return ERR_WAIT_FOR_SCRIPT;
} else {
/* we don't add a specific handler for SCRIPT_CONNECT and SCRIPT_HOST_UPDATE
* childs. We rely on libev's child reaping of unwatched children.
* children. We rely on libev's child reaping of unwatched children.
*/
return 0;
}

View File

@@ -7,7 +7,7 @@
/**
* hex_decode - Unpack a hex string.
* @str: the hexidecimal string
* @str: the hexadecimal string
* @slen: the length of @str
* @buf: the buffer to write the data into
* @bufsize: the length of @buf

View File

@@ -83,7 +83,7 @@ char *geo_lookup(const char *ip, char *buf, unsigned buf_size)
MMDB_lookup_result_s result =
pMMDB_lookup_string(&mmdb, ip, &gai_error, &mmdb_error);
if (MMDB_SUCCESS == mmdb_error) {
/* If the lookup was successfull and an entry was found */
/* If the lookup was successful and an entry was found */
if (result.found_entry) {
memset(&entry_data, 0,
sizeof(MMDB_entry_data_s));
@@ -117,7 +117,7 @@ char *geo_lookup(const char *ip, char *buf, unsigned buf_size)
MMDB_lookup_result_s result =
pMMDB_lookup_string(&mmdb, ip, &gai_error, &mmdb_error);
if (MMDB_SUCCESS == mmdb_error) {
/* If the lookup was successfull and an entry was found */
/* If the lookup was successful and an entry was found */
if (result.found_entry) {
memset(&entry_data, 0,
sizeof(MMDB_entry_data_s));

View File

@@ -276,7 +276,7 @@ static int handle_exit_cmd(CONN_TYPE * conn, const char *arg, cmd_params_st *par
exit(0);
}
/* checks whether an input command of type " list users" maches
/* checks whether an input command of type " list users" matches
* the given cmd (e.g., "list users"). If yes it executes func() and returns true.
*/
static

View File

@@ -54,7 +54,7 @@
#define CO_USE_SIGCONTEXT
/*
* Use this in conjuction with CO_USE_SIGCONTEXT to use the sigaltstack
* Use this in conjunction with CO_USE_SIGCONTEXT to use the sigaltstack
* environment (suggested when CO_USE_SIGCONTEXT is defined).
*/
#if defined(HAVE_SIGALTSTACK)

View File

@@ -97,7 +97,7 @@ cothread_ctx *co_get_thread_ctx(void)
#else
/*
* On Unix, we use pthread. Sligthly more complicated ...
* On Unix, we use pthread. Slightly more complicated ...
*/
#include <pthread.h>

View File

@@ -209,7 +209,7 @@ void expire_client_entry(sec_mod_st *sec, client_entry_st * e)
del_client_entry(sec, e);
} else {
now = time(0);
/* We intentionally don't close the session immediatelly on
/* We intentionally don't close the session immediately on
* REASON_USER_DISCONNECT, as some anyconect clients
* explicitly disconnect with the intention to reconnect
* seconds later. */

View File

@@ -1056,7 +1056,7 @@ void sec_mod_server(void *main_pool, void *config_pool, struct list_head *vconfi
}
/* we use two fds for communication with main. The synchronous is for
* ping-pong communication which each request is answered immediated. The
* ping-pong communication where each request is answered immediately. The
* async is for messages sent back and forth in no particular order */
if (FD_ISSET(cmd_fd_sync, &rd_set)) {
ret = serve_request_main(sec, cmd_fd_sync, buffer, buffer_size);

View File

@@ -44,8 +44,8 @@ typedef struct sec_mod_st {
tls_sess_db_st tls_db;
uint64_t auth_failures; /* auth failures since the last update (SECM_CLI_STATS) we sent to main */
uint32_t max_auth_time; /* the maximum time spent in (sucessful) authentication */
uint32_t avg_auth_time; /* the average time spent in (sucessful) authentication */
uint32_t max_auth_time; /* the maximum time spent in (successful) authentication */
uint32_t avg_auth_time; /* the average time spent in (successful) authentication */
uint32_t total_authentications; /* successful authentications: to calculate the average above */
time_t last_stats_reset;
const uint8_t hmac_key[HMAC_DIGEST_SIZE];

View File

@@ -27,7 +27,7 @@
# if defined(__linux__)
# include <sys/prctl.h>
/* This sets the proccess title as shown in top, but not in ps (*@#%@).
/* This sets the process title as shown in top, but not in ps (*@#%@).
* To change the ps name in Linux, one needs to do master black magic
* trickery (see util-linux setproctitle).
*/

View File

@@ -874,7 +874,7 @@ int get_cert_info(worker_st * ws)
return -1;
}
/* this is superflous. Verification has already been performed
/* this is superfluous. Verification has already been performed
* during handshake. */
cert = gnutls_certificate_get_peers(ws->session, &ncerts);