Fix typos in C comments inside sql/

Author: qobood

sql/authors.h

@@ -51,7 +51,7 @@ struct show_table_authors_st show_table_authors[]= {
  "Query Cache (4.0), Subqueries (4.1), Views (5.0)" },
  { "Timour Katchaounov", "Sofia , Bulgaria", "Optimizer"},
  { "Kristian Nielsen", "Copenhagen, Denmark",
- "Replication, Async client prototocol, General buildbot stuff" },
+ "Replication, Async client protocol, General buildbot stuff" },
  { "Alexander (Bar) Barkov", "Izhevsk, Russia",
  "Unicode and character sets" },
  { "Alexey Botchkov (Holyfoot)", "Izhevsk, Russia",

sql/ddl_log.cc

@@ -876,7 +876,7 @@ static bool ddl_log_increment_phase_no_lock(uint entry_pos)
  else
  {
  /*
- Trying to deativate an execute entry or already deactive entry.
+ Trying to deactivate an execute entry or already deactive entry.
  This should not happen
  */
  DBUG_ASSERT(0);
@@ -1017,7 +1017,7 @@ static void ddl_log_to_binary_log(THD *thd, String *query)
  table name to the query
 
  When we log, we always log all found tables and views at the same time. This
- is done to simply the exceute code as otherwise we would have to keep
+ is done to simply execute the code as otherwise we would have to keep
  information of what was logged.
 */
 
@@ -1505,7 +1505,7 @@ static int ddl_log_execute_action(THD *thd, MEM_ROOT *mem_root,
  case DDL_RENAME_PHASE_STAT:
  /*
  Stat tables must be updated last so that we can handle a rename of
- a stat table. For now we just rememeber that we have to update it
+ a stat table. For now we just remember that we have to update it
  */
  update_flags(ddl_log_entry->entry_pos, DDL_LOG_FLAG_UPDATE_STAT);
  ddl_log_entry->flags|= DDL_LOG_FLAG_UPDATE_STAT;
@@ -2543,7 +2543,7 @@ bool ddl_log_write_entry(DDL_LOG_ENTRY *ddl_log_entry,
  @brief Write or update execute entry in the ddl log.
 
  @details An execute entry points to the first entry that should
- be excuted during recovery. In some cases it's only written once,
+ be executed during recovery. In some cases it's only written once,
  in other cases it's updated for each log entry to point to the new
  header for the list.
 

sql/debug.h

@@ -23,7 +23,7 @@
  functionality.
 */
 
-/* debug_crash_here() functionallity.
+/* debug_crash_here() functionality.
  See mysql_test/suite/atomic/create_table.test for an example of how it
  can be used
 */

sql/derived_handler.h

@@ -73,7 +73,7 @@ class derived_handler
  */
  virtual int next_row()= 0;
 
- /* End prodicing rows */
+ /* End producing rows */
  virtual int end_scan()=0;
 
  /* Report errors */

sql/derror.cc

@@ -18,7 +18,7 @@
  @file
 
  @brief
- Read language depeneded messagefile
+ Read language depended messagefile
 */
 
 #include "mariadb.h"

sql/event_data_objects.cc

@@ -519,7 +519,7 @@ Event_queue_element::load_from_row(THD *thd, TABLE *table)
  else
  expression= 0;
  /*
- If neigher STARTS and ENDS is set, then both fields are empty.
+ If neither STARTS and ENDS is set, then both fields are empty.
  Hence, if ET_FIELD_EXECUTE_AT is empty there is an error.
  */
  execute_at_null= table->field[ET_FIELD_EXECUTE_AT]->is_null();

sql/event_scheduler.cc

@@ -167,7 +167,7 @@ deinit_event_thread(THD *thd)
  thd The THD of the thread. Has to be allocated by the caller.
 
  NOTES
- 1. The host of the thead is my_localhost
+ 1. The host of the thread is my_localhost
  2. thd->net is initted with NULL - no communication.
 */
 

sql/field.cc

@@ -85,7 +85,7 @@ bool Field::marked_for_write_or_computed() const
  Rules for merging different types of fields in UNION
 
  NOTE: to avoid 256*256 table, gap in table types numeration is skipped
- following #defines describe that gap and how to canculate number of fields
+ following #defines describe that gap and how to calculate number of fields
  and index of field in this array.
 */
 const int FIELDTYPE_TEAR_FROM= (MYSQL_TYPE_BIT + 1);
@@ -8573,7 +8573,7 @@ void Field_varstring::hash_not_null(Hasher *hasher)
  @param[in] from data to compress
  @param[in] length from length
  @param[in] max_length truncate `from' to this length
- @param[out] out_length compessed data length
+ @param[out] out_length compressed data length
  @param[in] cs from character set
  @param[in] nchars copy no more than "nchars" characters
 
@@ -9989,8 +9989,8 @@ Field_enum::can_optimize_range_or_keypart_ref(const Item_bool_func *cond,
  3 - first (high) bit of 'c'
  2 - second bit of 'c'
  1 - third bit of 'c'
- 0 - forth bit of 'c'
- 2 7 - firth bit of 'c'
+ 0 - fourth bit of 'c'
+ 2 7 - fifth bit of 'c'
  6 - null bit for 'd'
  3 - 6 four bytes for 'a'
  7 - 8 two bytes for 'b'

sql/field.h

@@ -1045,7 +1045,7 @@ class Field: public Value_source
  /**
  Mark unused memory in the field as defined. Mainly used to ensure
  that if we write full field to disk (for example in
- Count_distinct_field::add(), we don't write unitalized data to
+ Count_distinct_field::add(), we don't write uninitialized data to
  disk which would confuse valgrind or MSAN.
  */
  virtual void mark_unused_memory_as_defined() {}
@@ -1786,7 +1786,7 @@ class Field: public Value_source
  /*
  Make a leaf tree when an INT value was stored into a field of INT type,
  and some truncation happened. Tries to adjust the range search condition
- when possible, e.g. "tinytint < 300" -> "tinyint <= 127".
+ when possible, e.g. "tinyint < 300" -> "tinyint <= 127".
  Can also return SEL_ARG_IMPOSSIBLE(), and NULL (not sargable).
  */
  SEL_ARG *stored_field_make_mm_leaf_bounded_int(RANGE_OPT_PARAM *param,

sql/filesort.cc

@@ -339,7 +339,7 @@ SORT_INFO *filesort(THD *thd, TABLE *table, Filesort *filesort,
  if (costs.fastest_sort == PQ_SORT_ALL_FIELDS ||
  costs.fastest_sort == PQ_SORT_ORDER_BY_FIELDS)
  {
- /* We are going to use priorty queue */
+ /* We are going to use priority queue */
  thd->query_plan_flags|= QPLAN_FILESORT_PRIORITY_QUEUE;
  status_var_increment(thd->status_var.filesort_pq_sorts_);
  tracker->incr_pq_used();
@@ -359,7 +359,7 @@ SORT_INFO *filesort(THD *thd, TABLE *table, Filesort *filesort,
  param.res_length= param.ref_length;
  /*
  Add the ref (rowid which is stored last in the sort key) to the sort,
- as we want to retrive rows in id order, if possible.
+ as we want to retrieve rows in id order, if possible.
  */
  param.sort_length+= param.ref_length;
  param.rec_length= param.sort_length;