Coverage Report

Created: 2026-03-15 18:33

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/scan/scanner.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/scanner.h"
19
20
#include <glog/logging.h>
21
22
#include "common/config.h"
23
#include "common/status.h"
24
#include "core/block/column_with_type_and_name.h"
25
#include "core/column/column_nothing.h"
26
#include "exec/operator/scan_operator.h"
27
#include "exec/scan/scan_node.h"
28
#include "exprs/vexpr_context.h"
29
#include "runtime/descriptors.h"
30
#include "runtime/runtime_profile.h"
31
#include "util/concurrency_stats.h"
32
#include "util/defer_op.h"
33
34
namespace doris {
35
36
Scanner::Scanner(RuntimeState* state, ScanLocalStateBase* local_state, int64_t limit,
37
                 RuntimeProfile* profile)
38
1.01M
        : _state(state),
39
1.01M
          _local_state(local_state),
40
1.01M
          _limit(limit),
41
1.01M
          _profile(profile),
42
1.01M
          _output_tuple_desc(_local_state->output_tuple_desc()),
43
1.01M
          _output_row_descriptor(_local_state->_parent->output_row_descriptor()),
44
1.01M
          _has_prepared(false) {
45
1.01M
    _total_rf_num = cast_set<int>(_local_state->_helper.runtime_filter_nums());
46
1.01M
    DorisMetrics::instance()->scanner_cnt->increment(1);
47
1.01M
}
48
49
1.01M
Status Scanner::init(RuntimeState* state, const VExprContextSPtrs& conjuncts) {
50
1.01M
    if (!conjuncts.empty()) {
51
12.8k
        _conjuncts.resize(conjuncts.size());
52
28.3k
        for (size_t i = 0; i != conjuncts.size(); ++i) {
53
15.5k
            RETURN_IF_ERROR(conjuncts[i]->clone(state, _conjuncts[i]));
54
15.5k
        }
55
12.8k
    }
56
57
1.01M
    const auto& projections = _local_state->_projections;
58
1.01M
    if (!projections.empty()) {
59
946k
        _projections.resize(projections.size());
60
8.59M
        for (size_t i = 0; i != projections.size(); ++i) {
61
7.64M
            RETURN_IF_ERROR(projections[i]->clone(state, _projections[i]));
62
7.64M
        }
63
946k
    }
64
65
1.01M
    const auto& intermediate_projections = _local_state->_intermediate_projections;
66
1.01M
    if (!intermediate_projections.empty()) {
67
10.8k
        _intermediate_projections.resize(intermediate_projections.size());
68
24.6k
        for (int i = 0; i < intermediate_projections.size(); i++) {
69
13.7k
            _intermediate_projections[i].resize(intermediate_projections[i].size());
70
81.7k
            for (int j = 0; j < intermediate_projections[i].size(); j++) {
71
68.0k
                RETURN_IF_ERROR(intermediate_projections[i][j]->clone(
72
68.0k
                        state, _intermediate_projections[i][j]));
73
68.0k
            }
74
13.7k
        }
75
10.8k
    }
76
77
1.01M
    return Status::OK();
78
1.01M
}
79
80
1.05M
Status Scanner::get_block_after_projects(RuntimeState* state, Block* block, bool* eos) {
81
1.05M
    SCOPED_CONCURRENCY_COUNT(ConcurrencyStatsManager::instance().vscanner_get_block);
82
1.05M
    auto& row_descriptor = _local_state->_parent->row_descriptor();
83
1.05M
    if (_output_row_descriptor) {
84
955k
        if (_alreay_eos) {
85
0
            *eos = true;
86
0
            _padding_block.swap(_origin_block);
87
955k
        } else {
88
955k
            _origin_block.clear_column_data(row_descriptor.num_materialized_slots());
89
955k
            const auto min_batch_size = std::max(state->batch_size() / 2, 1);
90
2.11M
            while (_padding_block.rows() < min_batch_size && !*eos) {
91
1.17M
                RETURN_IF_ERROR(get_block(state, &_origin_block, eos));
92
1.17M
                if (_origin_block.rows() >= min_batch_size) {
93
16.1k
                    break;
94
16.1k
                }
95
96
1.15M
                if (_origin_block.rows() + _padding_block.rows() <= state->batch_size()) {
97
1.15M
                    RETURN_IF_ERROR(_merge_padding_block());
98
1.15M
                    _origin_block.clear_column_data(row_descriptor.num_materialized_slots());
99
18.4E
                } else {
100
18.4E
                    if (_origin_block.rows() < _padding_block.rows()) {
101
0
                        _padding_block.swap(_origin_block);
102
0
                    }
103
18.4E
                    break;
104
18.4E
                }
105
1.15M
            }
106
955k
        }
107
108
        // first output the origin block change eos = false, next time output padding block
109
        // set the eos to true
110
955k
        if (*eos && !_padding_block.empty() && !_origin_block.empty()) {
111
0
            _alreay_eos = true;
112
0
            *eos = false;
113
0
        }
114
955k
        if (_origin_block.empty() && !_padding_block.empty()) {
115
192k
            _padding_block.swap(_origin_block);
116
192k
        }
117
955k
        return _do_projections(&_origin_block, block);
118
955k
    } else {
119
97.3k
        return get_block(state, block, eos);
120
97.3k
    }
121
1.05M
}
122
123
1.26M
Status Scanner::get_block(RuntimeState* state, Block* block, bool* eof) {
124
    // only empty block should be here
125
1.26M
    DCHECK(block->rows() == 0);
126
    // scanner running time
127
1.26M
    SCOPED_RAW_TIMER(&_per_scanner_timer);
128
1.26M
    int64_t rows_read_threshold = _num_rows_read + config::doris_scanner_row_num;
129
1.26M
    if (!block->mem_reuse()) {
130
8.58M
        for (auto* const slot_desc : _output_tuple_desc->slots()) {
131
8.58M
            block->insert(ColumnWithTypeAndName(slot_desc->get_empty_mutable_column(),
132
8.58M
                                                slot_desc->get_data_type_ptr(),
133
8.58M
                                                slot_desc->col_name()));
134
8.58M
        }
135
1.13M
    }
136
137
1.26M
    {
138
1.27M
        do {
139
            // 1. Get input block from scanner
140
1.27M
            {
141
                // get block time
142
1.27M
                SCOPED_TIMER(_local_state->_scan_timer);
143
1.27M
                RETURN_IF_ERROR(_get_block_impl(state, block, eof));
144
1.27M
                if (*eof) {
145
1.00M
                    DCHECK(block->rows() == 0);
146
1.00M
                    break;
147
1.00M
                }
148
273k
                _num_rows_read += block->rows();
149
273k
                _num_byte_read += block->allocated_bytes();
150
273k
            }
151
152
            // 2. Filter the output block finally.
153
0
            {
154
273k
                SCOPED_TIMER(_local_state->_filter_timer);
155
273k
                RETURN_IF_ERROR(_filter_output_block(block));
156
273k
            }
157
            // record rows return (after filter) for _limit check
158
273k
            _num_rows_return += block->rows();
159
273k
        } while (!_should_stop && !state->is_cancelled() && block->rows() == 0 && !(*eof) &&
160
273k
                 _num_rows_read < rows_read_threshold);
161
1.26M
    }
162
163
1.26M
    if (state->is_cancelled()) {
164
        // TODO: Should return the specific ErrorStatus instead of just Cancelled.
165
6
        return Status::Cancelled("cancelled");
166
6
    }
167
1.26M
    *eof = *eof || _should_stop;
168
    // set eof to true if per scanner limit is reached
169
    // currently for query: ORDER BY key LIMIT n
170
1.26M
    *eof = *eof || (_limit > 0 && _num_rows_return >= _limit);
171
172
1.26M
    return Status::OK();
173
1.26M
}
174
175
273k
Status Scanner::_filter_output_block(Block* block) {
176
273k
    auto old_rows = block->rows();
177
273k
    Status st = VExprContext::filter_block(_conjuncts, block, block->columns());
178
273k
    _counter.num_rows_unselected += old_rows - block->rows();
179
273k
    return st;
180
273k
}
181
182
956k
Status Scanner::_do_projections(Block* origin_block, Block* output_block) {
183
956k
    SCOPED_RAW_TIMER(&_per_scanner_timer);
184
956k
    SCOPED_RAW_TIMER(&_projection_timer);
185
186
956k
    const size_t rows = origin_block->rows();
187
956k
    if (rows == 0) {
188
747k
        return Status::OK();
189
747k
    }
190
208k
    Block input_block = *origin_block;
191
192
208k
    std::vector<int> result_column_ids;
193
208k
    for (auto& projections : _intermediate_projections) {
194
14.0k
        result_column_ids.resize(projections.size());
195
88.0k
        for (int i = 0; i < projections.size(); i++) {
196
73.9k
            RETURN_IF_ERROR(projections[i]->execute(&input_block, &result_column_ids[i]));
197
73.9k
        }
198
14.0k
        input_block.shuffle_columns(result_column_ids);
199
14.0k
    }
200
201
208k
    DCHECK_EQ(rows, input_block.rows());
202
208k
    MutableBlock mutable_block =
203
208k
            VectorizedUtils::build_mutable_mem_reuse_block(output_block, *_output_row_descriptor);
204
205
208k
    auto& mutable_columns = mutable_block.mutable_columns();
206
207
208k
    DCHECK_EQ(mutable_columns.size(), _projections.size());
208
209
753k
    for (int i = 0; i < mutable_columns.size(); ++i) {
210
546k
        ColumnPtr column_ptr;
211
546k
        RETURN_IF_ERROR(_projections[i]->execute(&input_block, column_ptr));
212
544k
        column_ptr = column_ptr->convert_to_full_column_if_const();
213
544k
        if (mutable_columns[i]->is_nullable() != column_ptr->is_nullable()) {
214
0
            throw Exception(ErrorCode::INTERNAL_ERROR, "Nullable mismatch");
215
0
        }
216
544k
        mutable_columns[i] = column_ptr->assume_mutable();
217
544k
    }
218
219
207k
    output_block->set_columns(std::move(mutable_columns));
220
221
    // origin columns was moved into output_block, so we need to set origin_block to empty columns
222
207k
    auto empty_columns = origin_block->clone_empty_columns();
223
207k
    origin_block->set_columns(std::move(empty_columns));
224
207k
    DCHECK_EQ(output_block->rows(), rows);
225
226
207k
    return Status::OK();
227
208k
}
228
229
1.00M
Status Scanner::try_append_late_arrival_runtime_filter() {
230
1.00M
    if (_applied_rf_num == _total_rf_num) {
231
960k
        return Status::OK();
232
960k
    }
233
1.00M
    DCHECK(_applied_rf_num < _total_rf_num);
234
49.2k
    int arrived_rf_num = 0;
235
49.2k
    RETURN_IF_ERROR(_local_state->update_late_arrival_runtime_filter(_state, arrived_rf_num));
236
237
49.2k
    if (arrived_rf_num == _applied_rf_num) {
238
        // No newly arrived runtime filters, just return;
239
3.41k
        return Status::OK();
240
3.41k
    }
241
242
    // avoid conjunct destroy in used by storage layer
243
45.8k
    _conjuncts.clear();
244
45.8k
    RETURN_IF_ERROR(_local_state->clone_conjunct_ctxs(_conjuncts));
245
45.8k
    return Status::OK();
246
45.8k
}
247
248
1.01M
Status Scanner::close(RuntimeState* state) {
249
1.01M
#ifndef BE_TEST
250
1.01M
    COUNTER_UPDATE(_local_state->_scanner_wait_worker_timer, _scanner_wait_worker_timer);
251
1.01M
#endif
252
1.01M
    return Status::OK();
253
1.01M
}
254
255
1.01M
bool Scanner::_try_close() {
256
1.01M
    bool expected = false;
257
1.01M
    return _is_closed.compare_exchange_strong(expected, true);
258
1.01M
}
259
260
1.00M
void Scanner::_collect_profile_before_close() {
261
1.00M
    COUNTER_UPDATE(_local_state->_scan_cpu_timer, _scan_cpu_timer);
262
1.00M
    COUNTER_UPDATE(_local_state->_rows_read_counter, _num_rows_read);
263
264
    // Update stats for load
265
1.00M
    _state->update_num_rows_load_filtered(_counter.num_rows_filtered);
266
1.00M
    _state->update_num_rows_load_unselected(_counter.num_rows_unselected);
267
1.00M
}
268
269
1.00M
void Scanner::update_scan_cpu_timer() {
270
1.00M
    int64_t cpu_time = _cpu_watch.elapsed_time();
271
1.00M
    _scan_cpu_timer += cpu_time;
272
1.00M
    if (_state && _state->get_query_ctx()) {
273
1.00M
        _state->get_query_ctx()->resource_ctx()->cpu_context()->update_cpu_cost_ms(cpu_time);
274
1.00M
    }
275
1.00M
}
276
277
} // namespace doris