Home
last modified time | relevance | path

Searched refs:TIME_FOR_COMPARE_ROWID (Results 1 – 25 of 33) sorted by relevance

12

/dports/databases/mariadb105-client/mariadb-10.5.15/sql/
H A Dfilesort_utils.cc35 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
58 TIME_FOR_COMPARE_ROWID); in get_merge_many_buffs_cost_fast()
H A Dsql_const.h218 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc2032 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 Dfilesort_utils.cc35 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
58 TIME_FOR_COMPARE_ROWID); in get_merge_many_buffs_cost_fast()
H A Dsql_const.h218 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc2032 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 Dfilesort_utils.cc33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
H A Dsql_const.h217 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc1872 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
H A Dopt_range.cc5214 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 Dfilesort.cc1447 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 Dfilesort_utils.cc33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
H A Dsql_const.h217 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc1872 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID);
H A Dopt_range.cc5214 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 Dfilesort_utils.cc33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
H A Dsql_const.h213 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc1787 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
H A Dopt_range.cc4800 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 Dfilesort_utils.cc33 (TIME_FOR_COMPARE_ROWID * M_LN2); in get_merge_cost()
56 / TIME_FOR_COMPARE_ROWID; in get_merge_many_buffs_cost_fast()
H A Dsql_const.h213 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*100) macro
H A Dmulti_range_read.cc1787 double cmp_op= rows2double(nrows) * (1.0 / TIME_FOR_COMPARE_ROWID); in get_sort_and_sweep_cost()
H A Dopt_range.cc4800 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 Dsql_const.h170 #define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2) macro
H A Duniques.cc143 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()

12