diff options
| author | Varun Gupta <varun.gupta@mariadb.com> | 2020-03-10 04:56:38 +0530 |
|---|---|---|
| committer | Varun Gupta <varun.gupta@mariadb.com> | 2020-03-10 15:09:17 +0530 |
| commit | b753ac066bc26acda9deb707a31c112f1bbf9ec2 (patch) | |
| tree | 6667ed652cf893a5c695b1ce6b621f54d5f0fdc9 /sql/bounded_queue.h | |
| parent | 561b5ce3647a63c343f70ce183e408423b3fa65c (diff) | |
| download | mariadb-git-b753ac066bc26acda9deb707a31c112f1bbf9ec2.tar.gz | |
MDEV-21580: Allow packed sort keys in sort buffer
This task deals with packing the sort key inside the sort buffer, which would
lead to efficient usage of the memory allocated for the sort buffer.
The changes brought by this feature are
1) Sort buffers would have sort keys of variable length
2) The format for sort keys inside the sort buffer would look like
|<sort_length><null_byte><key_part1><null_byte><key_part2>.......|
sort_length is the extra bytes that are required to store the variable
length of a sort key.
3) When packing of sort key is done we store the ORIGINAL VALUES inside
the sort buffer and not the STRXFRM form (mem-comparable sort keys).
4) Special comparison function packed_keys_comparison() is introduced
to compare 2 sort keys.
This patch also contains contributions from Sergei Petrunia.
Diffstat (limited to 'sql/bounded_queue.h')
| -rw-r--r-- | sql/bounded_queue.h | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/sql/bounded_queue.h b/sql/bounded_queue.h index cd710d835aa..07ab6dbaab9 100644 --- a/sql/bounded_queue.h +++ b/sql/bounded_queue.h @@ -59,7 +59,8 @@ public: */ typedef uint (*keymaker_function)(Sort_param *param, Key_type *to, - Element_type *from); + Element_type *from, + bool packing_keys); /** Function for comparing two keys. @@ -181,11 +182,12 @@ void Bounded_queue<Element_type, Key_type>::push(Element_type *element) { // Replace top element with new key, and re-order the queue. Key_type **pq_top= reinterpret_cast<Key_type **>(queue_top(&m_queue)); - (void)(*m_keymaker)(m_sort_param, *pq_top, element); + (void)(*m_keymaker)(m_sort_param, *pq_top, element, false); queue_replace_top(&m_queue); } else { // Insert new key into the queue. - (*m_keymaker)(m_sort_param, m_sort_keys[m_queue.elements], element); + (*m_keymaker)(m_sort_param, m_sort_keys[m_queue.elements], + element, false); queue_insert(&m_queue, reinterpret_cast<uchar*>(&m_sort_keys[m_queue.elements])); } |