diff options
| author | Igor Babaev <igor@askmonty.org> | 2012-09-01 14:21:59 -0700 |
|---|---|---|
| committer | Igor Babaev <igor@askmonty.org> | 2012-09-01 14:21:59 -0700 |
| commit | a6b88f1431238152643e41979ce10b9bbdac2a82 (patch) | |
| tree | 42482ef66f3c59b255d299fc58ace8c1b0c518ea /sql/filesort.h | |
| parent | 5a86a61219826aadf8d08cbc447fe438f2bf50c3 (diff) | |
| download | mariadb-git-a6b88f1431238152643e41979ce10b9bbdac2a82.tar.gz | |
MDEV-415: Back-port of the WL task #1393 from the mysql-5.6 code line.
The task adds a more efficient handling of the queries with
ORDER BY order LIMIT n, such that n is small enough and
no indexes are used for order.
Diffstat (limited to 'sql/filesort.h')
| -rw-r--r-- | sql/filesort.h | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/sql/filesort.h b/sql/filesort.h index 8ee8999d055..8960fa6cb66 100644 --- a/sql/filesort.h +++ b/sql/filesort.h @@ -29,10 +29,8 @@ typedef struct st_sort_field SORT_FIELD; ha_rows filesort(THD *thd, TABLE *table, st_sort_field *sortorder, uint s_length, SQL_SELECT *select, ha_rows max_rows, bool sort_positions, - ha_rows *examined_rows); + ha_rows *examined_rows, ha_rows *found_rows); void filesort_free_buffers(TABLE *table, bool full); -double get_merge_many_buffs_cost(uint *buffer, uint last_n_elems, - int elem_size); void change_double_for_sort(double nr,uchar *to); #endif /* FILESORT_INCLUDED */ |