database/mariadb
1
0
Fork 0
mirror of https://github.com/MariaDB/server.git synced 2025-07-29 05:21:33 +03:00
Code Activity

MDEV-3798: [SHOW] EXPLAIN UPDATE/DELETE

Browse Source 
- Merge with 10.0-base
This commit is contained in:
Sergey Petrunya
2013-10-15 11:51:41 +04:00
parent eb2c6f4513 25d0175fde
commit 1e36cbfa39
71 changed files with 8292 additions and 713 deletions
Download Patch File Download Diff File Expand all files Collapse all files

148
sql/opt_range.cc
View File

@ -861,6 +861,14 @@ class PARAM : public RANGE_OPT_PARAM
{
public:
ha_rows quick_rows[MAX_KEY];
/*
This will collect 'possible keys' based on the range optimization.
Queries with a JOIN object actually use ref optimizer (see add_key_field)
to collect possible_keys. This is used by single table UPDATE/DELETE.
*/
key_map possible_keys;
longlong baseflag;
uint max_key_part, range_count;
@ -2955,6 +2963,8 @@ int SQL_SELECT::test_quick_select(THD *thd, key_map keys_to_use,
read_time= (double) records + scan_time + 1; // Force to use index
else if (read_time <= 2.0 && !force_quick_range)
DBUG_RETURN(0); /* No need for quick select */
possible_keys.clear_all();
DBUG_PRINT("info",("Time to scan table: %g", read_time));
@ -2986,6 +2996,7 @@ int SQL_SELECT::test_quick_select(THD *thd, key_map keys_to_use,
param.using_real_indexes= TRUE;
param.remove_jump_scans= TRUE;
param.force_default_mrr= ordered_output;
param.possible_keys.clear_all();
thd->no_errors=1; // Don't warn about NULL
init_sql_alloc(&alloc, thd->variables.range_alloc_block_size, 0,
@ -3197,6 +3208,7 @@ int SQL_SELECT::test_quick_select(THD *thd, key_map keys_to_use,
quick= NULL;
}
}
possible_keys= param.possible_keys;
free_mem:
free_root(&alloc,MYF(0)); // Return memory & allocator
@ -3204,6 +3216,7 @@ int SQL_SELECT::test_quick_select(THD *thd, key_map keys_to_use,
thd->no_errors=0;
}
DBUG_EXECUTE("info", print_quick(quick, &needed_reg););
/*
@ -10467,6 +10480,7 @@ ha_rows check_quick_select(PARAM *param, uint idx, bool index_only,
if (rows != HA_POS_ERROR)
{
param->quick_rows[keynr]= rows;
param->possible_keys.set_bit(keynr);
if (update_tbl_stats)
{
param->table->quick_keys.set_bit(keynr);
@ -11960,78 +11974,134 @@ void QUICK_SELECT_I::add_key_name(String *str, bool *first)
}
void QUICK_RANGE_SELECT::add_info_string(String *str)
Explain_quick_select* QUICK_RANGE_SELECT::get_explain(MEM_ROOT *alloc)
{
bool first= TRUE;
add_key_name(str, &first);
Explain_quick_select *res;
if ((res= new (alloc) Explain_quick_select(QS_TYPE_RANGE)))
res->range.set(alloc, head->key_info[index].name, max_used_key_length);
return res;
}
void QUICK_INDEX_MERGE_SELECT::add_info_string(String *str)
{
QUICK_RANGE_SELECT *quick;
bool first= TRUE;
List_iterator_fast<QUICK_RANGE_SELECT> it(quick_selects);
str->append(STRING_WITH_LEN("sort_union("));
Explain_quick_select* QUICK_GROUP_MIN_MAX_SELECT::get_explain(MEM_ROOT *alloc)
{
Explain_quick_select *res;
if ((res= new (alloc) Explain_quick_select(QS_TYPE_GROUP_MIN_MAX)))
res->range.set(alloc, head->key_info[index].name, max_used_key_length);
return res;
}
Explain_quick_select* QUICK_INDEX_SORT_SELECT::get_explain(MEM_ROOT *alloc)
{
Explain_quick_select *res;
if (!(res= new (alloc) Explain_quick_select(get_type())))
return NULL;
QUICK_RANGE_SELECT *quick;
Explain_quick_select *child_explain;
List_iterator_fast<QUICK_RANGE_SELECT> it(quick_selects);
while ((quick= it++))
{
quick->add_key_name(str, &first);
if ((child_explain= quick->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
if (pk_quick_select)
pk_quick_select->add_key_name(str, &first);
str->append(')');
{
if ((child_explain= pk_quick_select->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
return res;
}
void QUICK_INDEX_INTERSECT_SELECT::add_info_string(String *str)
{
QUICK_RANGE_SELECT *quick;
bool first= TRUE;
List_iterator_fast<QUICK_RANGE_SELECT> it(quick_selects);
str->append(STRING_WITH_LEN("sort_intersect("));
/*
Same as QUICK_INDEX_SORT_SELECT::get_explain(), but primary key is printed
first
*/
Explain_quick_select* QUICK_INDEX_INTERSECT_SELECT::get_explain(MEM_ROOT *alloc)
{
Explain_quick_select *res;
Explain_quick_select *child_explain;
if (!(res= new (alloc) Explain_quick_select(get_type())))
return NULL;
if (pk_quick_select)
pk_quick_select->add_key_name(str, &first);
{
if ((child_explain= pk_quick_select->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
QUICK_RANGE_SELECT *quick;
List_iterator_fast<QUICK_RANGE_SELECT> it(quick_selects);
while ((quick= it++))
{
quick->add_key_name(str, &first);
if ((child_explain= quick->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
str->append(')');
return res;
}
void QUICK_ROR_INTERSECT_SELECT::add_info_string(String *str)
Explain_quick_select* QUICK_ROR_INTERSECT_SELECT::get_explain(MEM_ROOT *alloc)
{
bool first= TRUE;
Explain_quick_select *res;
Explain_quick_select *child_explain;
if (!(res= new (alloc) Explain_quick_select(get_type())))
return NULL;
QUICK_SELECT_WITH_RECORD *qr;
List_iterator_fast<QUICK_SELECT_WITH_RECORD> it(quick_selects);
str->append(STRING_WITH_LEN("intersect("));
while ((qr= it++))
{
qr->quick->add_key_name(str, &first);
if ((child_explain= qr->quick->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
if (cpk_quick)
cpk_quick->add_key_name(str, &first);
str->append(')');
{
if ((child_explain= cpk_quick->get_explain(alloc)))
res->children.push_back(child_explain);
else
return NULL;
}
return res;
}
void QUICK_ROR_UNION_SELECT::add_info_string(String *str)
Explain_quick_select* QUICK_ROR_UNION_SELECT::get_explain(MEM_ROOT *alloc)
{
QUICK_SELECT_I *quick;
bool first= TRUE;
List_iterator_fast<QUICK_SELECT_I> it(quick_selects);
Explain_quick_select *res;
Explain_quick_select *child_explain;
str->append(STRING_WITH_LEN("union("));
if (!(res= new (alloc) Explain_quick_select(get_type())))
return NULL;
QUICK_SELECT_I *quick;
List_iterator_fast<QUICK_SELECT_I> it(quick_selects);
while ((quick= it++))
{
if (first)
first= FALSE;
if ((child_explain= quick->get_explain(alloc)))
res->children.push_back(child_explain);
else
str->append(',');
quick->add_info_string(str);
return NULL;
}
str->append(')');
return res;
}