database/mariadb
1
0
Fork 0
mirror of https://github.com/MariaDB/server.git synced 2025-08-08 11:22:35 +03:00
Code Activity

Fix typos in C comments inside sql/

Browse Source
This commit is contained in:
Vasilii Lakhin
2025-03-09 18:19:33 +02:00
committed by Sergey Vojtovich
parent 153778437d
commit 717c12de0e
193 changed files with 746 additions and 746 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
sql/sql_cache.cc
View File

@@ -296,7 +296,7 @@ functions:
cache block by block.
6. Query_cache::resize
- Used to change the available memory used by the query cache. This
will also invalidate the entrie query cache in one free operation.
will also invalidate the entries query cache in one free operation.
7. Query_cache::pack
- Used when a FLUSH QUERY CACHE is issued. This changes the order of
the used memory blocks in physical memory order and move all avail-
@@ -1372,7 +1372,7 @@ void Query_cache::store_query(THD *thd, TABLE_LIST *tables_used)
Testing 'query_cache_size' without a lock here is safe: the thing
we may loose is that the query won't be cached, but we save on
mutex locking in the case when query cache is disabled or the
query is uncachable.
query is uncacheable.
See also a note on double-check locking usage above.
*/
@@ -2560,7 +2560,7 @@ void Query_cache::init()
0x0A LINE FEED
0x0B VERTICAL TAB
0x0C FORM FEED
0x0D CARRIAGE RETUR
0x0D CARRIAGE RETURN
0x20 SPACE
Additionally, only some of the ASCII-compatible character sets
@@ -3587,7 +3587,7 @@ Query_cache::insert_table(THD *thd, size_t key_len, const char *key,
header->set_hashed(hash);
/*
We insert this table without the assumption that it isn't refrenenced by
We insert this table without the assumption that it isn't referenced by
any queries.
*/
header->m_cached_query_count= 0;
@@ -3659,7 +3659,7 @@ Query_cache::allocate_block(size_t len, my_bool not_less, size_t min)
if (len >= MY_MIN(query_cache_size, query_cache_limit))
{
DBUG_PRINT("qcache", ("Query cache hase only %zu memory and limit %zu",
DBUG_PRINT("qcache", ("Query cache has only %zu memory and limit %zu",
query_cache_size, query_cache_limit));
DBUG_RETURN(0); // in any case we don't have such piece of memory
}
@@ -3701,7 +3701,7 @@ Query_cache::get_free_block(size_t len, my_bool not_less, size_t min)
first = list;
uint n = 0;
while ( n < QUERY_CACHE_MEM_BIN_TRY &&
first->length < len) //we don't need irst->next != list
first->length < len) //we don't need first->next != list
{
first=first->next;
n++;
@@ -4172,7 +4172,7 @@ Query_cache::is_cacheable(THD *thd, LEX *lex,
if (thd->in_multi_stmt_transaction_mode() &&
((*tables_type)&HA_CACHE_TBL_TRANSACT))
{
DBUG_PRINT("qcache", ("not in autocommin mode"));
DBUG_PRINT("qcache", ("not in autocommit mode"));
DBUG_RETURN(0);
}
DBUG_PRINT("qcache", ("select is using %d tables", table_count));
@@ -4896,7 +4896,7 @@ my_bool Query_cache::check_integrity(bool locked)
DBUG_PRINT("qcache", ("block %p, type %u...",
block, (uint) block->type));
// Check allignment
// Check alignment
if ((((size_t)block) % ALIGN_SIZE(1)) !=
(((size_t)first_block) % ALIGN_SIZE(1)))
{
@@ -4982,7 +4982,7 @@ my_bool Query_cache::check_integrity(bool locked)
break;
}
case Query_cache_block::RES_INCOMPLETE:
// This type of block can be not lincked yet (in multithread environment)
// This type of block can be not linked yet (in multithread environment)
break;
case Query_cache_block::RES_BEG:
case Query_cache_block::RES_CONT:
@@ -5150,7 +5150,7 @@ my_bool Query_cache::in_blocks(Query_cache_block * point)
if (block != first_block)
{
DBUG_PRINT("error",
("block %p (%p<-->%p) not owned by pysical list",
("block %p (%p<-->%p) not owned by physical list",
block, block->pprev, block->pnext));
return 1;
}
@@ -5163,7 +5163,7 @@ err1:
if (block->pnext->pprev != block)
{
DBUG_PRINT("error",
("block %p in physicel list is incorrect linked, next block %p referred as prev to %p (check from %p)",
("block %p in physical list is incorrect linked, next block %p referred as prev to %p (check from %p)",
block, block->pnext,
block->pnext->pprev,
point));