Coverage Report

Created: 2026-07-09 20:07

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/scan/parallel_scanner_builder.cpp
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#include "exec/scan/parallel_scanner_builder.h"
19
20
#include <cstddef>
21
22
#include "cloud/cloud_storage_engine.h"
23
#include "cloud/cloud_tablet_hotspot.h"
24
#include "cloud/config.h"
25
#include "common/status.h"
26
#include "exec/operator/olap_scan_operator.h"
27
#include "exec/scan/olap_scanner.h"
28
#include "storage/rowset/beta_rowset.h"
29
#include "storage/segment/segment_loader.h"
30
#include "storage/tablet/base_tablet.h"
31
32
namespace doris {
33
34
namespace {
35
36
io::FileCacheStatistics take_initial_file_cache_stats(
37
355k
        std::unordered_map<int64_t, io::FileCacheStatistics>* preload_stats, int64_t tablet_id) {
38
355k
    auto it = preload_stats->find(tablet_id);
39
355k
    if (it == preload_stats->end()) {
40
52.3k
        return {};
41
52.3k
    }
42
302k
    auto stats = std::move(it->second);
43
302k
    preload_stats->erase(it);
44
302k
    return stats;
45
355k
}
46
47
} // namespace
48
49
117k
Status ParallelScannerBuilder::build_scanners(std::list<ScannerSPtr>& scanners) {
50
117k
    RETURN_IF_ERROR(_load());
51
117k
    if (_scan_parallelism_by_per_segment) {
52
33
        return _build_scanners_by_per_segment(scanners);
53
119k
    } else if (_is_dup_mow_key) {
54
        // Default strategy for DUP/MOW tables: split by rowids within segments
55
119k
        return _build_scanners_by_rowid(scanners);
56
18.4E
    } else {
57
        // TODO: support to split by key range
58
18.4E
        return Status::NotSupported("split by key range not supported yet.");
59
18.4E
    }
60
117k
}
61
62
119k
Status ParallelScannerBuilder::_build_scanners_by_rowid(std::list<ScannerSPtr>& scanners) {
63
119k
    DCHECK_GE(_rows_per_scanner, _min_rows_per_scanner);
64
65
509k
    for (auto&& [tablet, version] : _tablets) {
66
509k
        DCHECK(_all_read_sources.contains(tablet->tablet_id()));
67
509k
        auto& entire_read_source = _all_read_sources[tablet->tablet_id()];
68
69
509k
        if (config::is_cloud_mode()) {
70
            // FIXME(plat1ko): Avoid pointer cast
71
503k
            ExecEnv::GetInstance()->storage_engine().to_cloud().tablet_hotspot().count(*tablet);
72
503k
        }
73
74
        // `rs_splits` in `entire read source` will be devided into several partitial read sources
75
        // to build several parallel scanners, based on segment rows number. All the partitial read sources
76
        // share the same delete predicates from their corresponding entire read source.
77
509k
        TabletReadSource partitial_read_source;
78
509k
        int64_t rows_collected = 0;
79
2.45M
        for (auto& rs_split : entire_read_source.rs_splits) {
80
2.45M
            auto reader = rs_split.rs_reader;
81
2.45M
            auto rowset = reader->rowset();
82
2.45M
            const auto rowset_id = rowset->rowset_id();
83
84
2.45M
            const auto& segments_rows = _all_segments_rows[rowset_id];
85
86
2.45M
            if (rowset->num_rows() == 0) {
87
1.78M
                continue;
88
1.78M
            }
89
90
663k
            int64_t segment_start = 0;
91
663k
            auto split = RowSetSplits(reader->clone());
92
93
1.32M
            for (size_t i = 0; i != segments_rows.size(); ++i) {
94
663k
                const size_t rows_of_segment = segments_rows[i];
95
663k
                RowRanges row_ranges;
96
663k
                int64_t offset_in_segment = 0;
97
98
                // try to split large segments into RowRanges
99
1.37M
                while (offset_in_segment < rows_of_segment) {
100
713k
                    const int64_t remaining_rows = rows_of_segment - offset_in_segment;
101
713k
                    auto rows_need = _rows_per_scanner - rows_collected;
102
103
                    // 0.9: try to avoid splitting the segments into excessively small parts.
104
713k
                    if (rows_need >= remaining_rows * 9 / 10) {
105
663k
                        rows_need = remaining_rows;
106
663k
                    }
107
713k
                    DCHECK_LE(rows_need, remaining_rows);
108
109
                    // RowRange stands for range: [From, To), From is inclusive, To is exclusive.
110
713k
                    row_ranges.add({offset_in_segment,
111
713k
                                    offset_in_segment + static_cast<int64_t>(rows_need)});
112
713k
                    rows_collected += rows_need;
113
713k
                    offset_in_segment += rows_need;
114
115
                    // If collected enough rows, build a new scanner
116
713k
                    if (rows_collected >= _rows_per_scanner) {
117
52.8k
                        split.segment_offsets.first = segment_start,
118
52.8k
                        split.segment_offsets.second = i + 1;
119
52.8k
                        split.segment_row_ranges.emplace_back(std::move(row_ranges));
120
121
52.8k
                        DCHECK_EQ(split.segment_offsets.second - split.segment_offsets.first,
122
52.8k
                                  split.segment_row_ranges.size());
123
124
52.8k
                        partitial_read_source.rs_splits.emplace_back(std::move(split));
125
126
52.8k
                        scanners.emplace_back(_build_scanner(
127
52.8k
                                tablet, version, _key_ranges,
128
52.8k
                                {.rs_splits = std::move(partitial_read_source.rs_splits),
129
52.8k
                                 .delete_predicates = entire_read_source.delete_predicates,
130
52.8k
                                 .delete_bitmap = entire_read_source.delete_bitmap},
131
52.8k
                                take_initial_file_cache_stats(&_tablet_preload_file_cache_stats,
132
52.8k
                                                              tablet->tablet_id())));
133
134
52.8k
                        partitial_read_source = {};
135
52.8k
                        split = RowSetSplits(reader->clone());
136
52.8k
                        row_ranges = RowRanges();
137
138
52.8k
                        segment_start = offset_in_segment < rows_of_segment ? i : i + 1;
139
52.8k
                        rows_collected = 0;
140
52.8k
                    }
141
713k
                }
142
143
                // The non-empty `row_ranges` means there are some rows left in this segment not added into `split`.
144
663k
                if (!row_ranges.is_empty()) {
145
660k
                    DCHECK_GT(rows_collected, 0);
146
660k
                    DCHECK_EQ(row_ranges.to(), rows_of_segment);
147
660k
                    split.segment_row_ranges.emplace_back(std::move(row_ranges));
148
660k
                }
149
663k
            }
150
151
663k
            DCHECK_LE(rows_collected, _rows_per_scanner);
152
663k
            if (rows_collected > 0) {
153
661k
                split.segment_offsets.first = segment_start;
154
661k
                split.segment_offsets.second = segments_rows.size();
155
661k
                DCHECK_GT(split.segment_offsets.second, split.segment_offsets.first);
156
661k
                DCHECK_EQ(split.segment_row_ranges.size(),
157
661k
                          split.segment_offsets.second - split.segment_offsets.first);
158
661k
                partitial_read_source.rs_splits.emplace_back(std::move(split));
159
661k
            }
160
663k
        } // end `for (auto& rowset : rowsets)`
161
162
509k
        DCHECK_LE(rows_collected, _rows_per_scanner);
163
509k
        if (rows_collected > 0) {
164
303k
            DCHECK_GT(partitial_read_source.rs_splits.size(), 0);
165
303k
#ifndef NDEBUG
166
590k
            for (auto& split : partitial_read_source.rs_splits) {
167
590k
                DCHECK(split.rs_reader != nullptr);
168
590k
                DCHECK_LT(split.segment_offsets.first, split.segment_offsets.second);
169
590k
                DCHECK_EQ(split.segment_row_ranges.size(),
170
590k
                          split.segment_offsets.second - split.segment_offsets.first);
171
590k
            }
172
303k
#endif
173
303k
            scanners.emplace_back(
174
303k
                    _build_scanner(tablet, version, _key_ranges,
175
303k
                                   {.rs_splits = std::move(partitial_read_source.rs_splits),
176
303k
                                    .delete_predicates = entire_read_source.delete_predicates,
177
303k
                                    .delete_bitmap = entire_read_source.delete_bitmap},
178
303k
                                   take_initial_file_cache_stats(&_tablet_preload_file_cache_stats,
179
303k
                                                                 tablet->tablet_id())));
180
303k
        }
181
509k
    }
182
183
119k
    return Status::OK();
184
119k
}
185
186
// Build scanners so that each segment is exclusively scanned by a single scanner.
187
// This guarantees the number of scanners equals the number of segments across all rowsets
188
// for the involved tablets. It preserves delete predicates and key ranges, and clones
189
// RowsetReader per scanner to avoid sharing between scanners.
190
33
Status ParallelScannerBuilder::_build_scanners_by_per_segment(std::list<ScannerSPtr>& scanners) {
191
33
    DCHECK_GE(_rows_per_scanner, _min_rows_per_scanner);
192
193
134
    for (auto&& [tablet, version] : _tablets) {
194
134
        DCHECK(_all_read_sources.contains(tablet->tablet_id()));
195
134
        auto& entire_read_source = _all_read_sources[tablet->tablet_id()];
196
197
134
        if (config::is_cloud_mode()) {
198
            // FIXME(plat1ko): Avoid pointer cast
199
134
            ExecEnv::GetInstance()->storage_engine().to_cloud().tablet_hotspot().count(*tablet);
200
134
        }
201
202
        // For each RowSet split in the read source, split by segment id and build
203
        // one scanner per segment. Keep delete predicates shared.
204
271
        for (auto& rs_split : entire_read_source.rs_splits) {
205
271
            auto reader = rs_split.rs_reader;
206
271
            auto rowset = reader->rowset();
207
271
            const auto rowset_id = rowset->rowset_id();
208
271
            const auto& segments_rows = _all_segments_rows[rowset_id];
209
271
            if (segments_rows.empty() || rowset->num_rows() == 0) {
210
205
                continue;
211
205
            }
212
213
            // Build scanners for [i, i+1) segment range, without row-range slicing.
214
132
            for (int64_t i = 0; i < rowset->num_segments(); ++i) {
215
66
                RowSetSplits split(reader->clone());
216
66
                split.segment_offsets.first = i;
217
66
                split.segment_offsets.second = i + 1;
218
                // No row-ranges slicing; scan whole segment i.
219
66
                DCHECK_GE(split.segment_offsets.second, split.segment_offsets.first + 1);
220
221
66
                TabletReadSource partitial_read_source;
222
66
                partitial_read_source.rs_splits.emplace_back(std::move(split));
223
224
66
                scanners.emplace_back(_build_scanner(
225
66
                        tablet, version, _key_ranges,
226
66
                        {.rs_splits = std::move(partitial_read_source.rs_splits),
227
66
                         .delete_predicates = entire_read_source.delete_predicates,
228
66
                         .delete_bitmap = entire_read_source.delete_bitmap},
229
66
                        take_initial_file_cache_stats(&_tablet_preload_file_cache_stats,
230
66
                                                      tablet->tablet_id())));
231
66
            }
232
66
        }
233
134
    }
234
235
33
    return Status::OK();
236
33
}
237
238
/**
239
 * Load rowsets of each tablet with specified version, segments of each rowset.
240
 */
241
118k
Status ParallelScannerBuilder::_load() {
242
118k
    _total_rows = 0;
243
118k
    size_t idx = 0;
244
118k
    bool enable_segment_cache = _state->query_options().__isset.enable_segment_cache
245
118k
                                        ? _state->query_options().enable_segment_cache
246
118k
                                        : true;
247
506k
    for (auto&& [tablet, version] : _tablets) {
248
506k
        const auto tablet_id = tablet->tablet_id();
249
506k
        _all_read_sources[tablet_id] = _read_sources[idx];
250
506k
        const auto& read_source = _all_read_sources[tablet_id];
251
2.44M
        for (auto& rs_split : read_source.rs_splits) {
252
2.44M
            auto rowset = rs_split.rs_reader->rowset();
253
2.44M
            RETURN_IF_ERROR(rowset->load());
254
2.44M
            const auto rowset_id = rowset->rowset_id();
255
256
2.44M
            auto beta_rowset = std::dynamic_pointer_cast<BetaRowset>(rowset);
257
2.44M
            std::vector<uint32_t> segment_rows;
258
2.44M
            OlapReaderStatistics preload_stats;
259
2.44M
            RETURN_IF_ERROR(beta_rowset->get_segment_num_rows(&segment_rows, enable_segment_cache,
260
2.44M
                                                              &preload_stats));
261
2.44M
            _tablet_preload_file_cache_stats[tablet_id].merge_from(preload_stats.file_cache_stats);
262
2.44M
            auto segment_count = rowset->num_segments();
263
3.11M
            for (int64_t i = 0; i != segment_count; i++) {
264
662k
                _all_segments_rows[rowset_id].emplace_back(segment_rows[i]);
265
662k
            }
266
2.44M
            _total_rows += rowset->num_rows();
267
2.44M
        }
268
506k
        idx++;
269
506k
    }
270
271
118k
    _rows_per_scanner = _total_rows / _max_scanners_count;
272
118k
    _rows_per_scanner = std::max<size_t>(_rows_per_scanner, _min_rows_per_scanner);
273
274
118k
    return Status::OK();
275
118k
}
276
277
std::shared_ptr<OlapScanner> ParallelScannerBuilder::_build_scanner(
278
        BaseTabletSPtr tablet, int64_t version, const std::vector<OlapScanRange*>& key_ranges,
279
354k
        TabletReadSource&& read_source, io::FileCacheStatistics&& initial_file_cache_stats) {
280
354k
    OlapScanner::Params params {
281
354k
            .state = _state,
282
354k
            .profile = _scanner_profile.get(),
283
354k
            .key_ranges = key_ranges,
284
354k
            .tablet = std::move(tablet),
285
354k
            .version = version,
286
354k
            .read_source = std::move(read_source),
287
354k
            .initial_file_cache_stats = std::move(initial_file_cache_stats),
288
354k
            .limit = _limit,
289
354k
            .aggregation = _is_preaggregation,
290
354k
            .read_row_binlog = false,
291
354k
            .binlog_scan_type = TBinlogScanType::NONE,
292
354k
            .start_tso = std::nullopt,
293
354k
            .end_tso = std::nullopt,
294
354k
    };
295
354k
    return OlapScanner::create_shared(_parent, std::move(params));
296
354k
}
297
298
} // namespace doris