Misc. typos

Found via `codespell -i 3 -w --skip="./debian/po" -I ../mariadb-server-word-whitelist.txt  ./cmake/ ./debian/ ./Docs/ ./include/ ./man/ ./plugin/ ./strings/`

Docs/README-wsrep

@@ -366,7 +366,7 @@ wsrep_forced_binlog_format=none
    format, regardless of what the client session has specified in binlog_format.
    Valid choices for wsrep_forced_binlog_format are: ROW, STATEMENT, MIXED and
    special value NONE, meaning that there is no forced binlog format in effect.
-   This variable was intruduced to support STATEMENT format replication during
+   This variable was introduced to support STATEMENT format replication during
    rolling schema upgrade processing. However, in most cases ROW replication 
    is valid for asymmetrict schema replication.
 

Docs/myisam.txt

@@ -95,7 +95,7 @@ Zero if the create is successful. Non-zero if an error occurs.
 
 HA_WRONG_CREATE_OPTION
  means that some of the arguments was wrong.
-appart from the above one can get any unix error that one can get from open(), write() or close().
+apart from the above one can get any unix error that one can get from open(), write() or close().
 
 #.#.4 Examples
 
@@ -169,7 +169,7 @@ The function parameter can be:
 HA_EXTRA_QUICK=1			Optimize for speed 
 HA_EXTRA_RESET=2			Reset database to after open 
 HA_EXTRA_CACHE=3			Cash record in HA_rrnd() 
-HA_EXTRA_NO_CACHE=4			End cacheing of records (def) 
+HA_EXTRA_NO_CACHE=4			End caching of records (def) 
 HA_EXTRA_NO_READCHECK=5		No readcheck on update 
 HA_EXTRA_READCHECK=6			Use readcheck (def) 
 HA_EXTRA_KEYREAD=7			Read only key to database 
@@ -335,7 +335,7 @@ int mi_rfirst(MI_INFO *mip , byte *buf, int inx)
 #.#.1 Description
 
 Reads the first row in the MyISAM file according to the specified index.
-If one want's to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
+If one wants to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
 
 mip is an MI_INFO pointer to the open handle.
 buf is the record buffer that will contain the row.
@@ -364,7 +364,7 @@ int mi_rkey(MI_INFO *mip, byte *buf, int inx, const byte *key, uint key_len, enu
 #.#.1 Description
 
 Reads the next row after the last row read, using the current index. 
-If one want's to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
+If one wants to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
 
 mip is an MI_INFO pointer to the open handle.
 buf is the record buffer that will contain the row.
@@ -397,7 +397,7 @@ int mi_rlast(MI_INFO *mip , byte *buf, int inx)
 #.#.1 Description
 
 Reads the last row in the MyISAM file according to the specified index.
-If one want's to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
+If one wants to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
 mip is an MI_INFO pointer to the open handle.
 buf is a pointer to the record buffer that will contain the row.
 Inx is the index (key) number, which must be the same as currently selected.
@@ -425,7 +425,7 @@ int mi_rnext(MI_INFO *mip , byte *buf, int inx )
 #.#.1 Description
 
 Reads the next row after the last row read, using the current index. 
-If one want's to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
+If one wants to read rows in physical sequences, then one should instead use mi_scan() or mi_rrnd().
 
 mip is an MI_INFO pointer to the open handle.
 buf is the record buffer that will contain the row.
@@ -520,7 +520,7 @@ int mi_rsame(MI_INFO *mip, byte *buf, int inx)
 
 Reads the current row to get its latest contents. This is useful to refresh the record buffer in case someone else has changed it.
 If inx is negative it reads by position. If inx is >= 0 it reads by key.
-With mi_rsame() one can switch to use any other index for the current row. This is good if you have a user application that lets the user do 'read-next' on a row.  In this case, if the user want's to start scanning on another index, one simply has to do a mi_rsame() on the new index to activate this.
+With mi_rsame() one can switch to use any other index for the current row. This is good if you have a user application that lets the user do 'read-next' on a row.  In this case, if the user wants to start scanning on another index, one simply has to do a mi_rsame() on the new index to activate this.
 
 mip is an MI_INFO pointer to the open handle.
 buf is the record buffer that will contain the row.
@@ -677,7 +677,7 @@ Zero if successful. Non-zero if an error occurred.
 HA_ERR_FOUND_DUPP_KEY
 A record already existed with a unique key same as this new record.
 HA_ERR_RECORD_FILE_FULL
-The error is given if you hit a system limit or if you try to create more rows in a table that you reserverd room for with mi_create().
+The error is given if you hit a system limit or if you try to create more rows in a table that you reserved room for with mi_create().
 ENOSPC
 The disk is full.
 EACCES
@@ -770,7 +770,7 @@ uint _mi_make_key( MI_INFO *mip, uint keynr, uchar *key, const char *record, my_
 Construct a key string for the given index, from the provided record buffer.
 ??? When packed records are used ...
 This is an internal function, not for use by applications. Monty says: "This can't be used to create an external key for an application from your record."
-See mi_make_application_key() for a similar function that is useable by applications.
+See mi_make_application_key() for a similar function that is usable by applications.
 
 The parameters are:
 A MI_INFO pointer mip.
@@ -872,7 +872,7 @@ HEAP tables only exists in memory so they are lost if `mysqld' is taken down or
 
 The *MySQL* internal HEAP tables uses 100% dynamic hashing without overflow areas and don't have problems with delete. 
 
-You can only access things by equality using a index (usually by the `=' operator) whith a heap table. 
+You can only access things by equality using a index (usually by the `=' operator) with a heap table. 
 The downside with HEAPS are: 
   1. You need enough extra memory for all HEAP tables that you want to use at the same time. 
   2. You can't search on a part of a index. 

Docs/sp-imp-spec.txt

@@ -294,15 +294,15 @@
 
     - Detecting and parsing a FUNCTION invocation
 
-      The existance of UDFs are checked during the lexical analysis (in
+      The existence of UDFs are checked during the lexical analysis (in
       sql_lex.cc:find_keyword()). This has the drawback that they must
-      exist before they are refered to, which was ok before SPs existed,
+      exist before they are referred to, which was ok before SPs existed,
       but then it becomes a problem. The first implementation of SP FUNCTIONs
       will work the same way, but this should be fixed a.s.a.p. (This will
       required some reworking of the way UDFs are handled, which is why it's
       not done from the start.)
       For the time being, a FUNCTION is detected the same way, and returns
-      the token SP_FUNC. During the parsing we only check for the *existance*
+      the token SP_FUNC. During the parsing we only check for the *existence*
       of the function, we don't parse it, since wa can't call the parser
       recursively.
 
@@ -329,7 +329,7 @@
       of the mysql.proc table during a query execution, but this it not
       possible at the present.
 
-      So, the solution is to collect the names of the refered FUNCTIONs during
+      So, the solution is to collect the names of the referred FUNCTIONs during
       parsing in the lex.
       Then, before doing anything else in mysql_execute_command(), read all
       functions from the database an keep them in the THD, where the function
@@ -390,7 +390,7 @@
     a method in the THD's sp_rcontext (if there is one). If a handler is
     found, this is recorded in the context and the routine returns without
     sending the error message.
-    The exectution loop (sp_head::execute()) checks for this after each
+    The execution loop (sp_head::execute()) checks for this after each
     statement and invokes the handler that has been found. If several
     errors or warnings occurs during one statement, only the first is
     caught, the rest are ignored.
@@ -402,7 +402,7 @@
     Calling and returning from a CONTINUE handler poses some special
     problems. Since we need to return to the point after its invocation,
     we push the return location on a stack in the sp_rcontext (this is
-    done by the exectution loop). The handler then ends with a special
+    done by the execution loop). The handler then ends with a special
     instruction, sp_instr_hreturn, which returns to this location.
 
     CONTINUE handlers have one additional problem: They are parsed at
@@ -546,7 +546,7 @@
 
     Unfortunately, we cannot use alternative 1 for the time being, as most
     of the data structures to be cached (lex and items) are not reentrant
-    and thread-safe. (Things are modifed at execution, we have THD pointers
+    and thread-safe. (Things are modified at execution, we have THD pointers
     stored everywhere, etc.)
     This leaves us with alternative 2, one cache per thread; or actually
     two, since we keep FUNCTIONs and PROCEDUREs in separate caches.

cmake/dtrace_prelink.cmake

@@ -34,7 +34,7 @@ ENDMACRO()
 IF(TYPE STREQUAL "MERGE")
   # Rerun dtrace on objects that are already in static libraries.
   # Object paths are stored in text files named 'dtrace_objects'
-  # in the input directores. We have to copy the objects into temp.
+  # in the input directories. We have to copy the objects into temp.
   # directory, as running dtrace -G on original files will change
   # timestamps and cause rebuilds or the libraries / excessive 
   # relink

cmake/libutils.cmake

@@ -151,7 +151,7 @@ MACRO(MERGE_STATIC_LIBS TARGET OUTPUT_NAME LIBS_TO_MERGE)
       IF(LIB_TYPE STREQUAL "STATIC_LIBRARY")
         SET(STATIC_LIBS ${STATIC_LIBS} ${LIB_LOCATION})
         ADD_DEPENDENCIES(${TARGET} ${LIB})
-        # Extract dependend OS libraries
+        # Extract dependent OS libraries
         GET_DEPENDEND_OS_LIBS(${LIB} LIB_OSLIBS)
         LIST(APPEND OSLIBS ${LIB_OSLIBS})
       ELSE()

cmake/mysql_version.cmake

@@ -95,7 +95,7 @@ SET(CPACK_PACKAGE_CONTACT "MariaDB Developers <maria-developers@lists.launchpad.
 SET(CPACK_PACKAGE_VENDOR "MariaDB Foundation")
 SET(CPACK_SOURCE_GENERATOR "TGZ")
 
-# Defintions for windows version resources
+# Definitions for windows version resources
 SET(PRODUCTNAME "MariaDB Server")
 SET(COMPANYNAME ${CPACK_PACKAGE_VENDOR})
 

dbug/dbug.c

@@ -315,7 +315,7 @@ static void DbugVfprintf(FILE *stream, const char* format, va_list args);
 
 #undef EXISTS
 #if !defined(HAVE_ACCESS)
-#define EXISTS(pathname) (FALSE)        /* Assume no existance */
+#define EXISTS(pathname) (FALSE)        /* Assume no existence */
 #define Writable(name) (TRUE)
 #else
 #define EXISTS(pathname)         (access(pathname, F_OK) == 0)
@@ -2180,7 +2180,7 @@ static BOOLEAN Writable(const char *pathname)
 
 /*
   flush dbug-stream, free mutex lock & wait delay
-  This is because some systems (MSDOS!!) dosn't flush fileheader
+  This is because some systems (MSDOS!!) doesn't flush fileheader
   and dbug-file isn't readable after a system crash !!
 */
 

debian/additions/innotop/changelog.innotop

@@ -77,7 +77,7 @@ Changelog for innotop:
    * remove cxn from $meta->{group_by} if there's only one connection displayed
    * fix for issue 19 - cxn column won't become visible when viewing two 
      connections after having viewed one connection
-   * supress errors resulting from the addition of a 'BACKGROUND THREAD' 
+   * suppress errors resulting from the addition of a 'BACKGROUND THREAD' 
      section in the output of 'show innodb status' 
    * possible fix for issue 22 - Useless use of a constant in void context
    * small change to set_to_tbl() around hiding the cxn column if there 

debian/additions/innotop/innotop

@@ -4657,7 +4657,7 @@ my %stmt_maker_for = (
       my $sth;
       eval { # This can fail if the table doesn't exist, INFORMATION_SCHEMA doesn't exist, etc.
          my $cols = $dbh->selectall_arrayref(q{SHOW /*innotop*/ COLUMNS FROM INFORMATION_SCHEMA.PROCESSLIST LIKE 'TIME_MS'});
-         if ( @$cols ) { # The TIME_MS colum exists
+         if ( @$cols ) { # The TIME_MS column exists
             $sth = $dbh->prepare(q{SELECT /*innotop*/ ID, USER, HOST, DB, COMMAND, CASE WHEN TIME_MS/1000 > 365*86400 THEN TIME ELSE TIME_MS/1000 END AS TIME, STATE, INFO FROM INFORMATION_SCHEMA.PROCESSLIST});
          }
       };
@@ -11653,7 +11653,7 @@ show you something like this:
  pages_modified     Dirty Pages  Pages modified (dirty  IB_bp_pages_m
  buf_pool_hit_rate  Hit Rate     Buffer pool hit rate   IB_bp_buf_poo
  total_mem_alloc    Memory       Total memory allocate  IB_bp_total_m
- add_pool_alloc     Add'l Pool   Additonal pool alloca  IB_bp_add_poo
+ add_pool_alloc     Add'l Pool   Additional pool alloca  IB_bp_add_poo
 
 The first line shows which table you're editing, and reminds you again to press
 '?' for a list of key mappings.  The rest is a tabular representation of the

debian/additions/innotop/innotop.1

@@ -1678,7 +1678,7 @@ show you something like this:
 \& pages_modified     Dirty Pages  Pages modified (dirty  IB_bp_pages_m
 \& buf_pool_hit_rate  Hit Rate     Buffer pool hit rate   IB_bp_buf_poo
 \& total_mem_alloc    Memory       Total memory allocate  IB_bp_total_m
-\& add_pool_alloc     Add\*(Aql Pool   Additonal pool alloca  IB_bp_add_poo
+\& add_pool_alloc     Add\*(Aql Pool   Additional pool alloca  IB_bp_add_poo
 .Ve
 .PP
 The first line shows which table you're editing, and reminds you again to press

debian/copyright

@@ -5,7 +5,7 @@ The Debian package of MySQL was first debianzed on 1997-04-12 by Christian
 Schwarz <schwarz@debian.org> and ist maintained since 1999-04-20 by
 Christian Hammers <ch@debian.org>.
 
-The MariaDB packages were initally made by http://ourdelta.org/, and
+The MariaDB packages were initially made by http://ourdelta.org/, and
 are now managed by the MariaDB development team,
 maria-developers@lists.launchpad.net
 

debian/mariadb-server-10.3.README.Debian

@@ -40,7 +40,7 @@ https://mariadb.com/kb
 * PASSWORDS:
 ============
 It is strongly recommended you create an admin users for your database
-adminstration needs.
+administration needs.
 
 If your local unix account is the one you want to have local super user
 access on your database with you can create the following account that will

include/json_lib.h

@@ -312,7 +312,7 @@ typedef const int *json_level_t;
 int json_skip_to_level(json_engine_t *j, int level);
 
 /*
-  json_skip_level() works as above with just current structre.
+  json_skip_level() works as above with just current structure.
   So it gets to the end of the current JSON array or object.
 */
 #define json_skip_level(json_engine) \

include/m_ctype.h

@@ -48,7 +48,7 @@ extern "C" {
 /*
   On i386 we store Unicode->CS conversion tables for
   some character sets using Big-endian order,
-  to copy two bytes at onces.
+  to copy two bytes at once.
   This gives some performance improvement.
 */
 #ifdef __i386__
@@ -376,7 +376,7 @@ typedef size_t (*my_charset_conv_case)(CHARSET_INFO *,
   A structure to return the statistics of a native string copying,
   when no Unicode conversion is involved.
 
-  The stucture is OK to be uninitialized before calling a copying routine.
+  The structure is OK to be uninitialized before calling a copying routine.
   A copying routine must populate the structure as follows:
     - m_source_end_pos must be set by to a non-NULL value
       in the range of the input string.
@@ -517,7 +517,7 @@ struct my_charset_handler_st
   /**
     Write a character to the target string, using its native code.
     For Unicode character sets (utf8, ucs2, utf16, utf16le, utf32, filename)
-    native codes are equvalent to Unicode code points.
+    native codes are equivalent to Unicode code points.
     For 8bit character sets the native code is just the byte value.
     For Asian characters sets:
     - MB1 native code is just the byte value (e.g. on the ASCII range)
@@ -964,7 +964,7 @@ uint32 my_convert_using_func(char *to, size_t to_length, CHARSET_INFO *to_cs,
   Bad byte sequences as well as characters that cannot be
   encoded in the destination character set are replaced to '?'.
   Not more than "nchars" characters are copied.
-  Conversion statistics is returnd in "status" and is set as follows:
+  Conversion statistics is returned in "status" and is set as follows:
   - status->m_native_copy_status.m_source_end_pos - to the position
     between (src) and (src+src_length), where the function stopped reading
     the source string.

include/m_string.h

@@ -14,8 +14,8 @@
    along with this program; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA */
 
-/* There may be prolems include all of theese. Try to test in
-   configure with ones are needed? */
+/* There may be problems included in all of these. Try to test in
+   configure which ones are needed? */
 
 /*  This is needed for the definitions of strchr... on solaris */
 

include/my_base.h

@@ -270,7 +270,7 @@ enum ha_base_keytype {
 #define HA_UNIQUE_CHECK		256U	/* Check the key for uniqueness */
 #define HA_SPATIAL		1024U   /* For spatial search */
 #define HA_NULL_ARE_EQUAL	2048U	/* NULL in key are cmp as equal */
-#define HA_GENERATED_KEY	8192U	/* Automaticly generated key */
+#define HA_GENERATED_KEY	8192U	/* Automatically generated key */
 
         /* The combination of the above can be used for key type comparison. */
 #define HA_KEYFLAG_MASK (HA_NOSAME | HA_PACK_KEY | HA_AUTO_KEY | \

include/my_bit.h

@@ -45,7 +45,7 @@ Count bits in 32bit integer
   http://graphics.stanford.edu/~seander/bithacks.html
   under "Counting bits set, in parallel"
 
- (Orignal code public domain).
+ (Original code public domain).
 */
 static inline uint my_count_bits_uint32(uint32 v)
 {
@@ -77,7 +77,7 @@ static inline uint my_count_bits(ulonglong x)
   NOTES
     Algorithm by Sean Anderson, according to:
     http://graphics.stanford.edu/~seander/bithacks.html
-    (Orignal code public domain)
+    (Original code public domain)
 
     Comments shows how this works with 01100000000000000000000000001011
 */

include/my_dbug.h

@@ -211,7 +211,7 @@ void debug_sync_point(const char* lock_name, uint lock_timeout);
 }
 /*
   DBUG_LOG() was initially intended for InnoDB. To be able to use it elsewhere
-  one should #include <sstream>. We intentially avoid including it here to save
+  one should #include <sstream>. We intentionally avoid including it here to save
   compilation time.
 */
 # ifdef DBUG_OFF

include/my_dir.h

@@ -50,7 +50,7 @@ extern "C" {
 #define MY_S_ISREG(m)	(((m) & MY_S_IFMT) == MY_S_IFREG)
 #define MY_S_ISFIFO(m)	(((m) & MY_S_IFMT) == MY_S_IFIFO)
 
-/* Ensure these dosn't clash with anything in my_sys.h */
+/* Ensure these doesn't clash with anything in my_sys.h */
 #define MY_WANT_SORT     8192   /* my_lib; sort files */
 #define MY_WANT_STAT	16384	/* my_lib; stat files */
 #define MY_DONT_SORT        0
@@ -63,7 +63,7 @@ typedef struct my_stat
 {
   dev_t		st_dev;		/* major & minor device numbers */
   ino_t		st_ino;		/* inode number */
-  ushort	st_mode;	/* file permissons (& suid sgid .. bits) */
+  ushort	st_mode;	/* file permissions (& suid sgid .. bits) */
   short		st_nlink;	/* number of links to file */
   ushort	st_uid;		/* user id */
   ushort	st_gid;		/* group id */
@@ -79,7 +79,7 @@ typedef struct my_stat
 #if(_MSC_VER)
 #define MY_STAT struct _stati64 /* 64 bit file size */
 #else
-#define MY_STAT struct stat	/* Orginal struct have what we need */
+#define MY_STAT struct stat	/* Original struct has what we need */
 #endif
 
 #endif /* USE_MY_STAT_STRUCT */

include/my_global.h

@@ -460,7 +460,7 @@ extern "C" int madvise(void *addr, size_t len, int behav);
 #define UNINIT_VAR(x) x
 #endif
 
-/* This is only to be used when reseting variables in a class constructor */
+/* This is only to be used when resetting variables in a class constructor */
 #if defined(_lint) || defined(FORCE_INIT_OF_VARS)
 #define LINT_INIT(x) x= 0
 #else
@@ -553,7 +553,7 @@ C_MODE_START
 typedef int	(*qsort_cmp)(const void *,const void *);
 typedef int	(*qsort_cmp2)(void*, const void *,const void *);
 C_MODE_END
-#define qsort_t RETQSORTTYPE	/* Broken GCC cant handle typedef !!!! */
+#define qsort_t RETQSORTTYPE	/* Broken GCC can't handle typedef !!!! */
 #ifdef HAVE_SYS_SOCKET_H
 #include <sys/socket.h>
 #endif

include/my_net.h

@@ -15,7 +15,7 @@
 
 /*
   This file is also used to make handling of sockets and ioctl()
-  portable accross systems.
+  portable across systems.
 
 */