summaryrefslogtreecommitdiff
path: root/.gitattributes
diff options
context:
space:
mode:
authorVicențiu Ciorbaru <vicentiu@mariadb.org>2022-07-02 22:15:22 +0300
committerMonty <monty@mariadb.org>2022-07-10 15:09:32 +0300
commitb34b66a3b2ce1e83428b06d0c2a52b9f2e5b4fe0 (patch)
treec0e22a1818ec4694cf059a4babc3f2b007b9f1b6 /.gitattributes
parent0890c489475abb1c01b0e6d5dafe1bc641b8b1eb (diff)
downloadmariadb-git-b34b66a3b2ce1e83428b06d0c2a52b9f2e5b4fe0.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 '.gitattributes')
0 files changed, 0 insertions, 0 deletions