doc: Fix spelling mistakes

Found with codespell.

Signed-off-by: Alexander Dahl <[email protected]>

README.md

@@ -32,7 +32,7 @@ Well, I am keeping this TODO list here for historical (and funny) reasons. Nowad
 - Encrypted session
 - Memory Management functions
 - Code speed ups
-- Other miscelaneous functions
+- Other miscellaneous functions
 - Win32 port? ( who wants it? )
 
 Changelog

examples/strings/b64.c

@@ -6,7 +6,7 @@
 
 char *example_description()
 {
-	char *desc = "LibCGI examples, str_base64_* functions demostration. <br>";
+	char *desc = "LibCGI examples, str_base64_* functions demonstration. <br>";
 
 	return desc;
 }

examples/strings/htmlentities.c

@@ -5,7 +5,7 @@
 char *example_description()
 {
 	char *desc = ""
-	"LibCGI examples, htmltities() function demostration. <br>"
+	"LibCGI examples, htmltities() function demonstration. <br>"
 	"Type an html code into textarea and then click OK"
 	"";
 

examples/strings/md5.c

@@ -6,7 +6,7 @@
 
 char *example_description()
 {
-	char *desc = "LibCGI examples, md5 function demostration. <br>";
+	char *desc = "LibCGI examples, md5 function demonstration. <br>";
 
 	return desc;
 }

src/base64.c

@@ -1,5 +1,5 @@
 /*
-	LibCGI base64 manipulation functions is extremly based on the work of Bob Tower,
+	LibCGI base64 manipulation functions is extremely based on the work of Bob Tower,
 	from its projec http://base64.sourceforge.net. The functions were a bit modicated.
 	Above is the MIT license from b64.c original code:
 

src/cgi.h

@@ -28,7 +28,7 @@ extern "C" {
 #endif
 
 
-// general purpose linked list. Actualy isn't very portable
+// general purpose linked list. Actually isn't very portable
 // because uses only 'name' and 'value' variables to store data.
 // Problably, in a future release, this will be replaced by
 // another type of struct

src/list.c

@@ -33,7 +33,7 @@ void slist_add(formvars *item, formvars **start, formvars **last)
 {
 	// if *start is empty, then our list is also empty. So, the only
 	// task to do is fill the variables *start and *last with the data pointed by item
-	// *start contains the firts item in the list, and we need *last to know the
+	// *start contains the first item in the list, and we need *last to know the
 	// end of the list
 	if (!*start) {
 		// item->next needs to be NULL, otherwise we never will
@@ -55,7 +55,7 @@ void slist_add(formvars *item, formvars **start, formvars **last)
 	// NULL, or in other words, it will be the end ;0
 	item->next = NULL;
 
-	// Finaly, the actual end of list will contain the new item
+	// Finally, the actual end of list will contain the new item
 	*last = item;
 }
 

src/string.c

@@ -439,8 +439,8 @@ char *str_nreplace(char *src, const char *delim, const char *with, int n)
 /**
 * Replace characteres in a string.
 *  Replace all occourences of *delim on *src with characteres pointed by *with.
-*  The problem with the folowing code is that the function only searches for the
-*  first caracter of *delim, ingoring the rest. Other problem is speed relacioned:
+*  The problem with the following code is that the function only searches for the
+*  first character of *delim, ingoring the rest. Other problem is speed relacioned:
 *  note that the function ever compare the length of *with to do the correct action.
 *  @param src String to parse
 *  @param delim Character to search that will be replaced
@@ -547,7 +547,7 @@ char *strdel(char *s, int start, int count)
 /**
 * Reads an entire line.
 * Reads a line from the file specified by the file pointer passed
-* as parameter. This function is intead to replace the non-portable
+* as parameter. This function is instead to replace the non-portable
 * GNU getline() function.
 *
 * @param s File pointer to the file to read from.