mirror of
https://github.com/MariaDB/server.git
synced 2025-08-08 11:22:35 +03:00
Merge polly.(none):/home/kaa/src/maint/mysql-5.0-maint
into polly.(none):/home/kaa/src/maint/mysql-5.1-maint include/my_sys.h: Auto merged libmysql/Makefile.shared: Auto merged sql/item_cmpfunc.cc: Auto merged sql/item_cmpfunc.h: Auto merged sql/opt_range.cc: Auto merged sql/records.cc: Auto merged sql/sql_array.h: Auto merged sql/sql_help.cc: Auto merged sql/sql_select.cc: Auto merged storage/myisam/ft_boolean_search.c: Auto merged storage/myisam/ft_nlq_search.c: Auto merged storage/myisam/myisampack.c: Auto merged mysys/mf_keycache.c: Manual merge. mysys/mf_sort.c: Manual merge. mysys/my_lib.c: Manual merge. mysys/queues.c: Manual merge. sql/sql_acl.cc: Manual merge. sql/sql_table.cc: Manual merge. storage/csv/ha_tina.cc: Manual merge. storage/myisam/sort.c: Manual merge.
This commit is contained in:
@@ -4465,8 +4465,8 @@ TRP_ROR_INTERSECT *get_best_ror_intersect(const PARAM *param, SEL_TREE *tree,
|
||||
ROR_SCAN_INFO's.
|
||||
Step 2: Get best ROR-intersection using an approximate algorithm.
|
||||
*/
|
||||
qsort(tree->ror_scans, tree->n_ror_scans, sizeof(ROR_SCAN_INFO*),
|
||||
(qsort_cmp)cmp_ror_scan_info);
|
||||
my_qsort(tree->ror_scans, tree->n_ror_scans, sizeof(ROR_SCAN_INFO*),
|
||||
(qsort_cmp)cmp_ror_scan_info);
|
||||
DBUG_EXECUTE("info",print_ror_scans_arr(param->table, "ordered",
|
||||
tree->ror_scans,
|
||||
tree->ror_scans_end););
|
||||
@@ -4658,8 +4658,8 @@ TRP_ROR_INTERSECT *get_best_covering_ror_intersect(PARAM *param,
|
||||
bitmap_get_first(&(*scan)->covered_fields);
|
||||
}
|
||||
|
||||
qsort(ror_scan_mark, ror_scans_end-ror_scan_mark, sizeof(ROR_SCAN_INFO*),
|
||||
(qsort_cmp)cmp_ror_scan_info_covering);
|
||||
my_qsort(ror_scan_mark, ror_scans_end-ror_scan_mark, sizeof(ROR_SCAN_INFO*),
|
||||
(qsort_cmp)cmp_ror_scan_info_covering);
|
||||
|
||||
DBUG_EXECUTE("info", print_ror_scans_arr(param->table,
|
||||
"remaining scans",
|
||||
|
Reference in New Issue
Block a user