/dports/databases/mariadb105-client/mariadb-10.5.15/sql/ |
H A D | filesort_utils.cc | 35 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 58 TIME_FOR_COMPARE_ROWID); in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 218 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 2032 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
|
/dports/databases/mariadb105-server/mariadb-10.5.15/sql/ |
H A D | filesort_utils.cc | 35 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 58 TIME_FOR_COMPARE_ROWID); in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 218 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 2032 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
|
/dports/databases/mariadb104-server/mariadb-10.4.24/sql/ |
H A D | filesort_utils.cc | 33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 217 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 1872 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
|
H A D | opt_range.cc | 5214 TIME_FOR_COMPARE_ROWID; in get_best_disjunct_quick() 5254 TIME_FOR_COMPARE_ROWID, in get_best_disjunct_quick() 5369 (TIME_FOR_COMPARE_ROWID * M_LN2) + in get_best_disjunct_quick() 5738 common->compare_factor= TIME_FOR_COMPARE_ROWID; in prepare_search_best_index_intersect() 6900 TIME_FOR_COMPARE_ROWID; in ror_intersect_add() 7349 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_best_covering_ror_intersect()
|
H A D | filesort.cc | 1447 log((double) param->max_keys_per_buffer) / TIME_FOR_COMPARE_ROWID; in check_if_pq_applicable()
|
/dports/databases/mariadb104-client/mariadb-10.4.24/sql/ |
H A D | filesort_utils.cc | 33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 217 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 1872 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID);
|
H A D | opt_range.cc | 5214 TIME_FOR_COMPARE_ROWID; in get_best_disjunct_quick() 5254 TIME_FOR_COMPARE_ROWID, in get_best_disjunct_quick() 5369 (TIME_FOR_COMPARE_ROWID * M_LN2) + in get_best_disjunct_quick() 5738 common->compare_factor= TIME_FOR_COMPARE_ROWID; in prepare_search_best_index_intersect() 6900 TIME_FOR_COMPARE_ROWID; in ror_intersect_add() 7349 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_best_covering_ror_intersect()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/sql/ |
H A D | filesort_utils.cc | 33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 213 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 1787 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
|
H A D | opt_range.cc | 4800 imerge_cost += non_cpk_scan_records / TIME_FOR_COMPARE_ROWID; in get_best_disjunct_quick() 4830 TIME_FOR_COMPARE_ROWID, in get_best_disjunct_quick() 4935 (TIME_FOR_COMPARE_ROWID * M_LN2) + in get_best_disjunct_quick() 5288 common->compare_factor= TIME_FOR_COMPARE_ROWID; in prepare_search_best_index_intersect() 6367 TIME_FOR_COMPARE_ROWID; in ror_intersect_add() 6754 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_best_covering_ror_intersect()
|
/dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
H A D | filesort_utils.cc | 33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost() 56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
|
H A D | sql_const.h | 213 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
|
H A D | multi_range_read.cc | 1787 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
|
H A D | opt_range.cc | 4800 imerge_cost += non_cpk_scan_records / TIME_FOR_COMPARE_ROWID; in get_best_disjunct_quick() 4830 TIME_FOR_COMPARE_ROWID, in get_best_disjunct_quick() 4935 (TIME_FOR_COMPARE_ROWID * M_LN2) + in get_best_disjunct_quick() 5288 common->compare_factor= TIME_FOR_COMPARE_ROWID; in prepare_search_best_index_intersect() 6367 TIME_FOR_COMPARE_ROWID; in ror_intersect_add() 6754 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_best_covering_ror_intersect()
|
/dports/databases/mysql55-client/mysql-5.5.62/sql/ |
H A D | sql_const.h | 170 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2) macro
|
H A D | uniques.cc | 143 total_buf_elems*log((double) n_buffers) / (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_buffers_cost() 285 result /= TIME_FOR_COMPARE_ROWID; in get_use_cost()
|