diff options
| author | Vicențiu Ciorbaru <vicentiu@mariadb.org> | 2022-07-02 22:15:22 +0300 |
|---|---|---|
| committer | Sergei Petrunia <sergey@mariadb.com> | 2023-02-02 23:08:06 +0300 |
| commit | 59193ef67361354e8a5702ade8ce69d8b0ffe014 (patch) | |
| tree | 7b1ca52977cc3e88566b6fd2d193ec7e9d52dc10 /mysql-test/main/join_cache.result | |
| parent | b70290869e91047bd5b24d5abab9220d8215637d (diff) | |
| download | mariadb-git-59193ef67361354e8a5702ade8ce69d8b0ffe014.tar.gz | |
Implement cost_of_filesort()
The sort length is extracted similarly to how sortlength() function does
it. The function makes use of filesort_use_addons function to compute
the length of addon fields. Finally, by calling compute_sort_costs we
get the fastest_sort possible.
Other changes:
* Sort_param::using_addon_fields() assumes addon fields are already
allocated. This makes the use of Sort_param unusable for
compute_sort_costs *if* we don't want to allocate addon fields.
As a preliminary fix, pass "with_addon_fields" as bool value to
compute_sort_costs() and make the internal functions use that value
instead of Sort_param::using_addon_fields() method.
The ideal fix would be to define a "leaner" struct with only the
necessary members, but this can be done as a separate commit.
Reviewer: Monty
Diffstat (limited to 'mysql-test/main/join_cache.result')
0 files changed, 0 insertions, 0 deletions
