1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*****************************************************************************
Copyright (c) 2020, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License, version 2.0, as published by the
Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
for more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
/** @file include/ddl0impl-merge.h
DDL cluster merge sort data structures.
Created 2020-11-01 by Sunny Bains. */
#ifndef ddl0impl_merge_h
#define ddl0impl_merge_h
#include <vector>
#include "ddl0impl-file-reader.h"
namespace ddl {
// Forward declaration.
struct Builder;
/** Merge the blocks in the file. */
struct Merge_file_sort {
// Forward declarations.
struct Cursor;
struct Output_file;
/** The design is generalized as an N way merge, however we stick
with 2 for now. */
static constexpr size_t N_WAY_MERGE = 2;
/** Context to use for merging the files/runs. */
struct Context {
/** File to sort. */
ddl::file_t *m_file{};
/** For reporting duplicates, it has the index instance too. */
Dup *m_dup{};
/** Number of scan threads used, for memory buffer calculation. */
size_t m_n_threads{};
/** PFS progress monitoring. */
Alter_stage *m_stage{};
};
/** Offsets of record lists to merge. Two adjacent entries make one list or
range */
using Ranges = std::vector<os_offset_t>;
/** Constructor.
@param[in,out] merge_ctx Data blocks merge meta data. */
explicit Merge_file_sort(Context *merge_ctx) noexcept
: m_merge_ctx(merge_ctx) {}
/** Merge the the blocks.
@param[in,out] builder Builder instance used for building index.
@param[in,out] offsets Offsets from where to start the merge.
@return DB_SUCCESS or error code. */
[[nodiscard]] dberr_t sort(Builder *builder, Merge_offsets &offsets) noexcept;
/** @return the number of rows in the sorted file. */
[[nodiscard]] uint64_t get_n_rows() const noexcept { return m_n_rows; }
private:
/** Merge the rows.
@param[in,out] cursor To iterate over the rows to merge.
@param[in,out] output_file Output file to write the merged rows.
@return DB_SUCCESS or error code. */
[[nodiscard]] dberr_t merge_rows(Cursor &cursor,
Output_file &output_file) noexcept;
/** Merge the blocks in the ranges.
@param[in,out] cursor To iterate over the rows to merge.
@param[in,out] offsets Starting offsets of record lists to merge.
@param[in,out] output_file Output file to write the merged rows.
@param[in] buffer_size IO buffer size for reads.
@return DB_SUCCESS or error code. */
[[nodiscard]] dberr_t merge_ranges(Cursor &cursor, Merge_offsets &offsets,
Output_file &output_file,
size_t buffer_size) noexcept;
/** Move to the next ranges of pages to merge.
@param[in,out] offsets Current offsets to start the merge from.
@return the next range to merge. */
Ranges next_ranges(Merge_offsets &offsets) noexcept;
private:
/** To check and report duplicates. */
Dup *m_dup{};
/** Meta data for merging blocks. */
Context *m_merge_ctx{};
/** Page numbers to merge for the next pass. */
Merge_offsets m_next_offsets{};
/** Number of rows in the sorted file. */
uint64_t m_n_rows{};
};
} // namespace ddl
#endif /* !ddl0impl_merge_h */
|
