|
|
|
@ -2206,7 +2206,7 @@ double get_sweep_read_cost(const PARAM *param, ha_rows records) |
|
|
|
if (param->table->file->primary_key_is_clustered()) |
|
|
|
{ |
|
|
|
result= param->table->file->read_time(param->table->s->primary_key, |
|
|
|
records, records); |
|
|
|
(uint)records, records); |
|
|
|
} |
|
|
|
else |
|
|
|
{ |
|
|
|
@ -2414,7 +2414,7 @@ TABLE_READ_PLAN *get_best_disjunct_quick(PARAM *param, SEL_IMERGE *imerge, |
|
|
|
|
|
|
|
/* Add Unique operations cost */ |
|
|
|
unique_calc_buff_size= |
|
|
|
Unique::get_cost_calc_buff_size(non_cpk_scan_records, |
|
|
|
Unique::get_cost_calc_buff_size((ulong)non_cpk_scan_records, |
|
|
|
param->table->file->ref_length, |
|
|
|
param->thd->variables.sortbuff_size); |
|
|
|
if (param->imerge_cost_buff_size < unique_calc_buff_size) |
|
|
|
@ -2426,7 +2426,7 @@ TABLE_READ_PLAN *get_best_disjunct_quick(PARAM *param, SEL_IMERGE *imerge, |
|
|
|
} |
|
|
|
|
|
|
|
imerge_cost += |
|
|
|
Unique::get_use_cost(param->imerge_cost_buff, non_cpk_scan_records, |
|
|
|
Unique::get_use_cost(param->imerge_cost_buff, (uint)non_cpk_scan_records, |
|
|
|
param->table->file->ref_length, |
|
|
|
param->thd->variables.sortbuff_size); |
|
|
|
DBUG_PRINT("info",("index_merge total cost: %g (wanted: less then %g)", |
|
|
|
@ -2765,7 +2765,7 @@ ROR_INTERSECT_INFO* ror_intersect_init(const PARAM *param) |
|
|
|
info->is_covering= FALSE; |
|
|
|
info->index_scan_costs= 0.0; |
|
|
|
info->index_records= 0; |
|
|
|
info->out_rows= param->table->file->records; |
|
|
|
info->out_rows= (double) param->table->file->records; |
|
|
|
bitmap_clear_all(&info->covered_fields); |
|
|
|
return info; |
|
|
|
} |
|
|
|
@ -6757,7 +6757,7 @@ int QUICK_RANGE_SELECT::reset() |
|
|
|
if (file->table_flags() & HA_NEED_READ_RANGE_BUFFER) |
|
|
|
{ |
|
|
|
mrange_bufsiz= min(multi_range_bufsiz, |
|
|
|
(QUICK_SELECT_I::records + 1)* head->s->reclength); |
|
|
|
((uint)QUICK_SELECT_I::records + 1)* head->s->reclength); |
|
|
|
|
|
|
|
while (mrange_bufsiz && |
|
|
|
! my_multi_malloc(MYF(MY_WME), |
|
|
|
@ -8359,7 +8359,7 @@ void cost_group_min_max(TABLE* table, KEY *index_info, uint used_key_parts, |
|
|
|
bool have_min, bool have_max, |
|
|
|
double *read_cost, ha_rows *records) |
|
|
|
{ |
|
|
|
uint table_records; |
|
|
|
ha_rows table_records; |
|
|
|
uint num_groups; |
|
|
|
uint num_blocks; |
|
|
|
uint keys_per_block; |
|
|
|
|