Coverage Report

Created: 2026-04-16 16:35

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/runtime/result_block_buffer.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 "runtime/result_block_buffer.h"
19
20
#include <gen_cpp/Data_types.h>
21
#include <gen_cpp/PaloInternalService_types.h>
22
#include <gen_cpp/internal_service.pb.h>
23
#include <glog/logging.h>
24
#include <google/protobuf/stubs/callback.h>
25
// IWYU pragma: no_include <bits/chrono.h>
26
#include <chrono> // IWYU pragma: keep
27
#include <limits>
28
#include <ostream>
29
#include <string>
30
#include <utility>
31
#include <vector>
32
33
#include "arrow/type_fwd.h"
34
#include "common/config.h"
35
#include "core/block/block.h"
36
#include "exec/pipeline/dependency.h"
37
#include "exec/sink/writer/varrow_flight_result_writer.h"
38
#include "exec/sink/writer/vmysql_result_writer.h"
39
#include "runtime/runtime_profile.h"
40
#include "runtime/thread_context.h"
41
#include "util/thrift_util.h"
42
43
namespace doris {
44
45
template <typename ResultCtxType>
46
ResultBlockBuffer<ResultCtxType>::ResultBlockBuffer(TUniqueId id, RuntimeState* state,
47
                                                    int buffer_size)
48
180k
        : _fragment_id(std::move(id)),
49
180k
          _is_close(false),
50
180k
          _batch_size(state->batch_size()),
51
180k
          _timezone(state->timezone()),
52
180k
          _be_exec_version(state->be_exec_version()),
53
180k
          _fragment_transmission_compression_type(state->fragement_transmission_compression_type()),
54
180k
          _buffer_limit(buffer_size) {
55
180k
    _mem_tracker = MemTrackerLimiter::create_shared(
56
180k
            MemTrackerLimiter::Type::QUERY,
57
180k
            fmt::format("ResultBlockBuffer#FragmentInstanceId={}", print_id(_fragment_id)));
58
180k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEEC2ENS_9TUniqueIdEPNS_12RuntimeStateEi
Line
Count
Source
48
8
        : _fragment_id(std::move(id)),
49
8
          _is_close(false),
50
8
          _batch_size(state->batch_size()),
51
8
          _timezone(state->timezone()),
52
8
          _be_exec_version(state->be_exec_version()),
53
8
          _fragment_transmission_compression_type(state->fragement_transmission_compression_type()),
54
8
          _buffer_limit(buffer_size) {
55
8
    _mem_tracker = MemTrackerLimiter::create_shared(
56
8
            MemTrackerLimiter::Type::QUERY,
57
8
            fmt::format("ResultBlockBuffer#FragmentInstanceId={}", print_id(_fragment_id)));
58
8
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEEC2ENS_9TUniqueIdEPNS_12RuntimeStateEi
Line
Count
Source
48
180k
        : _fragment_id(std::move(id)),
49
180k
          _is_close(false),
50
180k
          _batch_size(state->batch_size()),
51
180k
          _timezone(state->timezone()),
52
180k
          _be_exec_version(state->be_exec_version()),
53
180k
          _fragment_transmission_compression_type(state->fragement_transmission_compression_type()),
54
180k
          _buffer_limit(buffer_size) {
55
180k
    _mem_tracker = MemTrackerLimiter::create_shared(
56
180k
            MemTrackerLimiter::Type::QUERY,
57
180k
            fmt::format("ResultBlockBuffer#FragmentInstanceId={}", print_id(_fragment_id)));
58
180k
}
59
60
template <typename ResultCtxType>
61
Status ResultBlockBuffer<ResultCtxType>::close(const TUniqueId& id, Status exec_status,
62
396k
                                               int64_t num_rows, bool& is_fully_closed) {
63
396k
    std::unique_lock<std::mutex> l(_lock);
64
396k
    _returned_rows.fetch_add(num_rows);
65
    // close will be called multiple times and error status needs to be collected.
66
396k
    if (!exec_status.ok()) {
67
1.25k
        _status = exec_status;
68
1.25k
    }
69
70
396k
    auto it = _result_sink_dependencies.find(id);
71
397k
    if (it != _result_sink_dependencies.end()) {
72
397k
        it->second->set_always_ready();
73
397k
        _result_sink_dependencies.erase(it);
74
18.4E
    } else {
75
18.4E
        _status = Status::InternalError("Instance {} is not found in ResultBlockBuffer",
76
18.4E
                                        print_id(id));
77
18.4E
    }
78
396k
    if (!_result_sink_dependencies.empty()) {
79
        // Still waiting for other instances to finish; this is not the final close.
80
215k
        is_fully_closed = false;
81
215k
        return _status;
82
215k
    }
83
84
    // All instances have closed: the buffer is now fully closed.
85
181k
    is_fully_closed = true;
86
181k
    _is_close = true;
87
181k
    _arrow_data_arrival.notify_all();
88
89
181k
    if (!_waiting_rpc.empty()) {
90
97.5k
        if (_status.ok()) {
91
96.3k
            for (auto& ctx : _waiting_rpc) {
92
96.3k
                ctx->on_close(_packet_num, _returned_rows);
93
96.3k
            }
94
96.3k
        } else {
95
1.21k
            for (auto& ctx : _waiting_rpc) {
96
1.21k
                ctx->on_failure(_status);
97
1.21k
            }
98
1.21k
        }
99
97.5k
        _waiting_rpc.clear();
100
97.5k
    }
101
102
181k
    return _status;
103
396k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE5closeERKNS_9TUniqueIdENS_6StatusElRb
Line
Count
Source
62
6
                                               int64_t num_rows, bool& is_fully_closed) {
63
6
    std::unique_lock<std::mutex> l(_lock);
64
6
    _returned_rows.fetch_add(num_rows);
65
    // close will be called multiple times and error status needs to be collected.
66
6
    if (!exec_status.ok()) {
67
2
        _status = exec_status;
68
2
    }
69
70
6
    auto it = _result_sink_dependencies.find(id);
71
6
    if (it != _result_sink_dependencies.end()) {
72
5
        it->second->set_always_ready();
73
5
        _result_sink_dependencies.erase(it);
74
5
    } else {
75
1
        _status = Status::InternalError("Instance {} is not found in ResultBlockBuffer",
76
1
                                        print_id(id));
77
1
    }
78
6
    if (!_result_sink_dependencies.empty()) {
79
        // Still waiting for other instances to finish; this is not the final close.
80
1
        is_fully_closed = false;
81
1
        return _status;
82
1
    }
83
84
    // All instances have closed: the buffer is now fully closed.
85
5
    is_fully_closed = true;
86
5
    _is_close = true;
87
5
    _arrow_data_arrival.notify_all();
88
89
5
    if (!_waiting_rpc.empty()) {
90
2
        if (_status.ok()) {
91
1
            for (auto& ctx : _waiting_rpc) {
92
1
                ctx->on_close(_packet_num, _returned_rows);
93
1
            }
94
1
        } else {
95
1
            for (auto& ctx : _waiting_rpc) {
96
1
                ctx->on_failure(_status);
97
1
            }
98
1
        }
99
2
        _waiting_rpc.clear();
100
2
    }
101
102
5
    return _status;
103
6
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE5closeERKNS_9TUniqueIdENS_6StatusElRb
Line
Count
Source
62
396k
                                               int64_t num_rows, bool& is_fully_closed) {
63
396k
    std::unique_lock<std::mutex> l(_lock);
64
396k
    _returned_rows.fetch_add(num_rows);
65
    // close will be called multiple times and error status needs to be collected.
66
396k
    if (!exec_status.ok()) {
67
1.25k
        _status = exec_status;
68
1.25k
    }
69
70
396k
    auto it = _result_sink_dependencies.find(id);
71
397k
    if (it != _result_sink_dependencies.end()) {
72
397k
        it->second->set_always_ready();
73
397k
        _result_sink_dependencies.erase(it);
74
18.4E
    } else {
75
18.4E
        _status = Status::InternalError("Instance {} is not found in ResultBlockBuffer",
76
18.4E
                                        print_id(id));
77
18.4E
    }
78
396k
    if (!_result_sink_dependencies.empty()) {
79
        // Still waiting for other instances to finish; this is not the final close.
80
215k
        is_fully_closed = false;
81
215k
        return _status;
82
215k
    }
83
84
    // All instances have closed: the buffer is now fully closed.
85
181k
    is_fully_closed = true;
86
181k
    _is_close = true;
87
181k
    _arrow_data_arrival.notify_all();
88
89
181k
    if (!_waiting_rpc.empty()) {
90
97.5k
        if (_status.ok()) {
91
96.3k
            for (auto& ctx : _waiting_rpc) {
92
96.3k
                ctx->on_close(_packet_num, _returned_rows);
93
96.3k
            }
94
96.3k
        } else {
95
1.21k
            for (auto& ctx : _waiting_rpc) {
96
1.20k
                ctx->on_failure(_status);
97
1.20k
            }
98
1.21k
        }
99
97.5k
        _waiting_rpc.clear();
100
97.5k
    }
101
102
181k
    return _status;
103
396k
}
104
105
template <typename ResultCtxType>
106
133k
void ResultBlockBuffer<ResultCtxType>::cancel(const Status& reason) {
107
133k
    std::unique_lock<std::mutex> l(_lock);
108
133k
    SCOPED_SWITCH_THREAD_MEM_TRACKER_LIMITER(_mem_tracker);
109
133k
    if (_status.ok()) {
110
133k
        _status = reason;
111
133k
    }
112
133k
    _arrow_data_arrival.notify_all();
113
133k
    for (auto& ctx : _waiting_rpc) {
114
2
        ctx->on_failure(reason);
115
2
    }
116
133k
    _waiting_rpc.clear();
117
133k
    _update_dependency();
118
133k
    _result_batch_queue.clear();
119
133k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE6cancelERKNS_6StatusE
Line
Count
Source
106
4
void ResultBlockBuffer<ResultCtxType>::cancel(const Status& reason) {
107
4
    std::unique_lock<std::mutex> l(_lock);
108
4
    SCOPED_SWITCH_THREAD_MEM_TRACKER_LIMITER(_mem_tracker);
109
4
    if (_status.ok()) {
110
4
        _status = reason;
111
4
    }
112
4
    _arrow_data_arrival.notify_all();
113
4
    for (auto& ctx : _waiting_rpc) {
114
1
        ctx->on_failure(reason);
115
1
    }
116
4
    _waiting_rpc.clear();
117
4
    _update_dependency();
118
4
    _result_batch_queue.clear();
119
4
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE6cancelERKNS_6StatusE
Line
Count
Source
106
133k
void ResultBlockBuffer<ResultCtxType>::cancel(const Status& reason) {
107
133k
    std::unique_lock<std::mutex> l(_lock);
108
133k
    SCOPED_SWITCH_THREAD_MEM_TRACKER_LIMITER(_mem_tracker);
109
133k
    if (_status.ok()) {
110
133k
        _status = reason;
111
133k
    }
112
133k
    _arrow_data_arrival.notify_all();
113
133k
    for (auto& ctx : _waiting_rpc) {
114
1
        ctx->on_failure(reason);
115
1
    }
116
133k
    _waiting_rpc.clear();
117
133k
    _update_dependency();
118
133k
    _result_batch_queue.clear();
119
133k
}
120
121
template <typename ResultCtxType>
122
void ResultBlockBuffer<ResultCtxType>::set_dependency(
123
392k
        const TUniqueId& id, std::shared_ptr<Dependency> result_sink_dependency) {
124
392k
    std::unique_lock<std::mutex> l(_lock);
125
392k
    _result_sink_dependencies[id] = result_sink_dependency;
126
392k
    _update_dependency();
127
392k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE14set_dependencyERKNS_9TUniqueIdESt10shared_ptrINS_10DependencyEE
Line
Count
Source
123
8
        const TUniqueId& id, std::shared_ptr<Dependency> result_sink_dependency) {
124
8
    std::unique_lock<std::mutex> l(_lock);
125
8
    _result_sink_dependencies[id] = result_sink_dependency;
126
8
    _update_dependency();
127
8
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE14set_dependencyERKNS_9TUniqueIdESt10shared_ptrINS_10DependencyEE
Line
Count
Source
123
392k
        const TUniqueId& id, std::shared_ptr<Dependency> result_sink_dependency) {
124
392k
    std::unique_lock<std::mutex> l(_lock);
125
392k
    _result_sink_dependencies[id] = result_sink_dependency;
126
392k
    _update_dependency();
127
392k
}
128
129
template <typename ResultCtxType>
130
941k
void ResultBlockBuffer<ResultCtxType>::_update_dependency() {
131
941k
    if (!_status.ok()) {
132
133k
        for (auto it : _result_sink_dependencies) {
133
6
            it.second->set_ready();
134
6
        }
135
133k
        return;
136
133k
    }
137
138
2.28M
    for (auto it : _result_sink_dependencies) {
139
2.28M
        if (_instance_rows[it.first] > _batch_size) {
140
6
            it.second->block();
141
2.28M
        } else {
142
2.28M
            it.second->set_ready();
143
2.28M
        }
144
2.28M
    }
145
807k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE18_update_dependencyEv
Line
Count
Source
130
34
void ResultBlockBuffer<ResultCtxType>::_update_dependency() {
131
34
    if (!_status.ok()) {
132
6
        for (auto it : _result_sink_dependencies) {
133
3
            it.second->set_ready();
134
3
        }
135
6
        return;
136
6
    }
137
138
28
    for (auto it : _result_sink_dependencies) {
139
22
        if (_instance_rows[it.first] > _batch_size) {
140
4
            it.second->block();
141
18
        } else {
142
18
            it.second->set_ready();
143
18
        }
144
22
    }
145
28
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE18_update_dependencyEv
Line
Count
Source
130
941k
void ResultBlockBuffer<ResultCtxType>::_update_dependency() {
131
941k
    if (!_status.ok()) {
132
133k
        for (auto it : _result_sink_dependencies) {
133
3
            it.second->set_ready();
134
3
        }
135
133k
        return;
136
133k
    }
137
138
2.28M
    for (auto it : _result_sink_dependencies) {
139
2.28M
        if (_instance_rows[it.first] > _batch_size) {
140
2
            it.second->block();
141
2.28M
        } else {
142
2.28M
            it.second->set_ready();
143
2.28M
        }
144
2.28M
    }
145
807k
}
146
147
template <typename ResultCtxType>
148
295k
Status ResultBlockBuffer<ResultCtxType>::get_batch(std::shared_ptr<ResultCtxType> ctx) {
149
295k
    std::lock_guard<std::mutex> l(_lock);
150
295k
    SCOPED_ATTACH_TASK(_mem_tracker);
151
296k
    Defer defer {[&]() { _update_dependency(); }};
_ZZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE9get_batchESt10shared_ptrIS1_EENKUlvE_clEv
Line
Count
Source
151
8
    Defer defer {[&]() { _update_dependency(); }};
_ZZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE9get_batchESt10shared_ptrIS1_EENKUlvE_clEv
Line
Count
Source
151
296k
    Defer defer {[&]() { _update_dependency(); }};
152
295k
    if (!_status.ok()) {
153
12
        ctx->on_failure(_status);
154
12
        return _status;
155
12
    }
156
295k
    if (!_result_batch_queue.empty()) {
157
5.92k
        auto result = _result_batch_queue.front();
158
5.92k
        _result_batch_queue.pop_front();
159
6.06k
        for (auto it : _instance_rows_in_queue.front()) {
160
6.06k
            _instance_rows[it.first] -= it.second;
161
6.06k
        }
162
5.92k
        _instance_rows_in_queue.pop_front();
163
5.92k
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
164
5.92k
        _packet_num++;
165
5.92k
        return Status::OK();
166
5.92k
    }
167
289k
    if (_is_close) {
168
81.7k
        if (!_status.ok()) {
169
0
            ctx->on_failure(_status);
170
0
            return Status::OK();
171
0
        }
172
81.7k
        ctx->on_close(_packet_num, _returned_rows);
173
81.7k
        LOG(INFO) << fmt::format(
174
81.7k
                "ResultBlockBuffer finished, fragment_id={}, is_close={}, is_cancelled={}, "
175
81.7k
                "packet_num={}, peak_memory_usage={}",
176
81.7k
                print_id(_fragment_id), _is_close, !_status.ok(), _packet_num,
177
81.7k
                _mem_tracker->peak_consumption());
178
81.7k
        return Status::OK();
179
81.7k
    }
180
    // no ready data, push ctx to waiting list
181
208k
    _waiting_rpc.push_back(ctx);
182
208k
    return Status::OK();
183
289k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE9get_batchESt10shared_ptrIS1_E
Line
Count
Source
148
8
Status ResultBlockBuffer<ResultCtxType>::get_batch(std::shared_ptr<ResultCtxType> ctx) {
149
8
    std::lock_guard<std::mutex> l(_lock);
150
8
    SCOPED_ATTACH_TASK(_mem_tracker);
151
8
    Defer defer {[&]() { _update_dependency(); }};
152
8
    if (!_status.ok()) {
153
1
        ctx->on_failure(_status);
154
1
        return _status;
155
1
    }
156
7
    if (!_result_batch_queue.empty()) {
157
2
        auto result = _result_batch_queue.front();
158
2
        _result_batch_queue.pop_front();
159
2
        for (auto it : _instance_rows_in_queue.front()) {
160
2
            _instance_rows[it.first] -= it.second;
161
2
        }
162
2
        _instance_rows_in_queue.pop_front();
163
2
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
164
2
        _packet_num++;
165
2
        return Status::OK();
166
2
    }
167
5
    if (_is_close) {
168
1
        if (!_status.ok()) {
169
0
            ctx->on_failure(_status);
170
0
            return Status::OK();
171
0
        }
172
1
        ctx->on_close(_packet_num, _returned_rows);
173
1
        LOG(INFO) << fmt::format(
174
1
                "ResultBlockBuffer finished, fragment_id={}, is_close={}, is_cancelled={}, "
175
1
                "packet_num={}, peak_memory_usage={}",
176
1
                print_id(_fragment_id), _is_close, !_status.ok(), _packet_num,
177
1
                _mem_tracker->peak_consumption());
178
1
        return Status::OK();
179
1
    }
180
    // no ready data, push ctx to waiting list
181
4
    _waiting_rpc.push_back(ctx);
182
4
    return Status::OK();
183
5
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE9get_batchESt10shared_ptrIS1_E
Line
Count
Source
148
295k
Status ResultBlockBuffer<ResultCtxType>::get_batch(std::shared_ptr<ResultCtxType> ctx) {
149
295k
    std::lock_guard<std::mutex> l(_lock);
150
295k
    SCOPED_ATTACH_TASK(_mem_tracker);
151
295k
    Defer defer {[&]() { _update_dependency(); }};
152
295k
    if (!_status.ok()) {
153
11
        ctx->on_failure(_status);
154
11
        return _status;
155
11
    }
156
295k
    if (!_result_batch_queue.empty()) {
157
5.92k
        auto result = _result_batch_queue.front();
158
5.92k
        _result_batch_queue.pop_front();
159
6.06k
        for (auto it : _instance_rows_in_queue.front()) {
160
6.06k
            _instance_rows[it.first] -= it.second;
161
6.06k
        }
162
5.92k
        _instance_rows_in_queue.pop_front();
163
5.92k
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
164
5.92k
        _packet_num++;
165
5.92k
        return Status::OK();
166
5.92k
    }
167
289k
    if (_is_close) {
168
81.7k
        if (!_status.ok()) {
169
0
            ctx->on_failure(_status);
170
0
            return Status::OK();
171
0
        }
172
81.7k
        ctx->on_close(_packet_num, _returned_rows);
173
81.7k
        LOG(INFO) << fmt::format(
174
81.7k
                "ResultBlockBuffer finished, fragment_id={}, is_close={}, is_cancelled={}, "
175
81.7k
                "packet_num={}, peak_memory_usage={}",
176
81.7k
                print_id(_fragment_id), _is_close, !_status.ok(), _packet_num,
177
81.7k
                _mem_tracker->peak_consumption());
178
81.7k
        return Status::OK();
179
81.7k
    }
180
    // no ready data, push ctx to waiting list
181
208k
    _waiting_rpc.push_back(ctx);
182
208k
    return Status::OK();
183
289k
}
184
185
template <typename ResultCtxType>
186
Status ResultBlockBuffer<ResultCtxType>::add_batch(RuntimeState* state,
187
117k
                                                   std::shared_ptr<InBlockType>& result) {
188
117k
    std::unique_lock<std::mutex> l(_lock);
189
190
117k
    if (!_status.ok()) {
191
2
        return _status;
192
2
    }
193
194
117k
    if (_waiting_rpc.empty()) {
195
6.90k
        auto sz = 0;
196
6.90k
        auto num_rows = 0;
197
6.90k
        size_t batch_size = 0;
198
6.90k
        if constexpr (std::is_same_v<InBlockType, Block>) {
199
7
            num_rows = cast_set<int>(result->rows());
200
7
            batch_size = result->bytes();
201
6.89k
        } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
202
6.89k
            num_rows = cast_set<int>(result->result_batch.rows.size());
203
14.2k
            for (const auto& row : result->result_batch.rows) {
204
14.2k
                batch_size += row.size();
205
14.2k
            }
206
6.89k
        }
207
6.90k
        if (!_result_batch_queue.empty()) {
208
729
            if constexpr (std::is_same_v<InBlockType, Block>) {
209
2
                sz = cast_set<int>(_result_batch_queue.back()->rows());
210
727
            } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
211
727
                sz = cast_set<int>(_result_batch_queue.back()->result_batch.rows.size());
212
727
            }
213
729
            if (sz + num_rows < _buffer_limit &&
214
729
                (batch_size + _last_batch_bytes) <= config::thrift_max_message_size) {
215
729
                if constexpr (std::is_same_v<InBlockType, Block>) {
216
2
                    auto last_block = _result_batch_queue.back();
217
4
                    for (size_t i = 0; i < last_block->columns(); i++) {
218
2
                        last_block->mutate_columns()[i]->insert_range_from(
219
2
                                *result->get_by_position(i).column, 0, num_rows);
220
2
                    }
221
727
                } else {
222
727
                    std::vector<std::string>& back_rows =
223
727
                            _result_batch_queue.back()->result_batch.rows;
224
727
                    std::vector<std::string>& result_rows = result->result_batch.rows;
225
727
                    back_rows.insert(back_rows.end(), std::make_move_iterator(result_rows.begin()),
226
727
                                     std::make_move_iterator(result_rows.end()));
227
727
                }
228
729
                _last_batch_bytes += batch_size;
229
729
            } else {
230
0
                _instance_rows_in_queue.emplace_back();
231
0
                _result_batch_queue.push_back(std::move(result));
232
0
                _last_batch_bytes = batch_size;
233
0
                _arrow_data_arrival
234
0
                        .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
235
0
            }
236
6.17k
        } else {
237
6.17k
            _instance_rows_in_queue.emplace_back();
238
6.17k
            _result_batch_queue.push_back(std::move(result));
239
6.17k
            _last_batch_bytes = batch_size;
240
6.17k
            _arrow_data_arrival
241
6.17k
                    .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
242
6.17k
        }
243
6.90k
        _instance_rows[state->fragment_instance_id()] += num_rows;
244
6.90k
        _instance_rows_in_queue.back()[state->fragment_instance_id()] += num_rows;
245
111k
    } else {
246
111k
        auto ctx = _waiting_rpc.front();
247
111k
        _waiting_rpc.pop_front();
248
111k
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
249
111k
        _packet_num++;
250
111k
    }
251
252
117k
    _update_dependency();
253
117k
    return Status::OK();
254
117k
}
_ZN5doris17ResultBlockBufferINS_22GetArrowResultBatchCtxEE9add_batchEPNS_12RuntimeStateERSt10shared_ptrINS_5BlockEE
Line
Count
Source
187
9
                                                   std::shared_ptr<InBlockType>& result) {
188
9
    std::unique_lock<std::mutex> l(_lock);
189
190
9
    if (!_status.ok()) {
191
1
        return _status;
192
1
    }
193
194
8
    if (_waiting_rpc.empty()) {
195
7
        auto sz = 0;
196
7
        auto num_rows = 0;
197
7
        size_t batch_size = 0;
198
7
        if constexpr (std::is_same_v<InBlockType, Block>) {
199
7
            num_rows = cast_set<int>(result->rows());
200
7
            batch_size = result->bytes();
201
        } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
202
            num_rows = cast_set<int>(result->result_batch.rows.size());
203
            for (const auto& row : result->result_batch.rows) {
204
                batch_size += row.size();
205
            }
206
        }
207
7
        if (!_result_batch_queue.empty()) {
208
2
            if constexpr (std::is_same_v<InBlockType, Block>) {
209
2
                sz = cast_set<int>(_result_batch_queue.back()->rows());
210
            } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
211
                sz = cast_set<int>(_result_batch_queue.back()->result_batch.rows.size());
212
            }
213
2
            if (sz + num_rows < _buffer_limit &&
214
2
                (batch_size + _last_batch_bytes) <= config::thrift_max_message_size) {
215
2
                if constexpr (std::is_same_v<InBlockType, Block>) {
216
2
                    auto last_block = _result_batch_queue.back();
217
4
                    for (size_t i = 0; i < last_block->columns(); i++) {
218
2
                        last_block->mutate_columns()[i]->insert_range_from(
219
2
                                *result->get_by_position(i).column, 0, num_rows);
220
2
                    }
221
                } else {
222
                    std::vector<std::string>& back_rows =
223
                            _result_batch_queue.back()->result_batch.rows;
224
                    std::vector<std::string>& result_rows = result->result_batch.rows;
225
                    back_rows.insert(back_rows.end(), std::make_move_iterator(result_rows.begin()),
226
                                     std::make_move_iterator(result_rows.end()));
227
                }
228
2
                _last_batch_bytes += batch_size;
229
2
            } else {
230
0
                _instance_rows_in_queue.emplace_back();
231
0
                _result_batch_queue.push_back(std::move(result));
232
0
                _last_batch_bytes = batch_size;
233
0
                _arrow_data_arrival
234
0
                        .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
235
0
            }
236
5
        } else {
237
5
            _instance_rows_in_queue.emplace_back();
238
5
            _result_batch_queue.push_back(std::move(result));
239
5
            _last_batch_bytes = batch_size;
240
5
            _arrow_data_arrival
241
5
                    .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
242
5
        }
243
7
        _instance_rows[state->fragment_instance_id()] += num_rows;
244
7
        _instance_rows_in_queue.back()[state->fragment_instance_id()] += num_rows;
245
7
    } else {
246
1
        auto ctx = _waiting_rpc.front();
247
1
        _waiting_rpc.pop_front();
248
1
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
249
1
        _packet_num++;
250
1
    }
251
252
8
    _update_dependency();
253
8
    return Status::OK();
254
8
}
_ZN5doris17ResultBlockBufferINS_17GetResultBatchCtxEE9add_batchEPNS_12RuntimeStateERSt10shared_ptrINS_16TFetchDataResultEE
Line
Count
Source
187
117k
                                                   std::shared_ptr<InBlockType>& result) {
188
117k
    std::unique_lock<std::mutex> l(_lock);
189
190
117k
    if (!_status.ok()) {
191
1
        return _status;
192
1
    }
193
194
117k
    if (_waiting_rpc.empty()) {
195
6.89k
        auto sz = 0;
196
6.89k
        auto num_rows = 0;
197
6.89k
        size_t batch_size = 0;
198
        if constexpr (std::is_same_v<InBlockType, Block>) {
199
            num_rows = cast_set<int>(result->rows());
200
            batch_size = result->bytes();
201
6.89k
        } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
202
6.89k
            num_rows = cast_set<int>(result->result_batch.rows.size());
203
14.2k
            for (const auto& row : result->result_batch.rows) {
204
14.2k
                batch_size += row.size();
205
14.2k
            }
206
6.89k
        }
207
6.89k
        if (!_result_batch_queue.empty()) {
208
            if constexpr (std::is_same_v<InBlockType, Block>) {
209
                sz = cast_set<int>(_result_batch_queue.back()->rows());
210
727
            } else if constexpr (std::is_same_v<InBlockType, TFetchDataResult>) {
211
727
                sz = cast_set<int>(_result_batch_queue.back()->result_batch.rows.size());
212
727
            }
213
727
            if (sz + num_rows < _buffer_limit &&
214
727
                (batch_size + _last_batch_bytes) <= config::thrift_max_message_size) {
215
                if constexpr (std::is_same_v<InBlockType, Block>) {
216
                    auto last_block = _result_batch_queue.back();
217
                    for (size_t i = 0; i < last_block->columns(); i++) {
218
                        last_block->mutate_columns()[i]->insert_range_from(
219
                                *result->get_by_position(i).column, 0, num_rows);
220
                    }
221
727
                } else {
222
727
                    std::vector<std::string>& back_rows =
223
727
                            _result_batch_queue.back()->result_batch.rows;
224
727
                    std::vector<std::string>& result_rows = result->result_batch.rows;
225
727
                    back_rows.insert(back_rows.end(), std::make_move_iterator(result_rows.begin()),
226
727
                                     std::make_move_iterator(result_rows.end()));
227
727
                }
228
727
                _last_batch_bytes += batch_size;
229
727
            } else {
230
0
                _instance_rows_in_queue.emplace_back();
231
0
                _result_batch_queue.push_back(std::move(result));
232
0
                _last_batch_bytes = batch_size;
233
0
                _arrow_data_arrival
234
0
                        .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
235
0
            }
236
6.17k
        } else {
237
6.17k
            _instance_rows_in_queue.emplace_back();
238
6.17k
            _result_batch_queue.push_back(std::move(result));
239
6.17k
            _last_batch_bytes = batch_size;
240
6.17k
            _arrow_data_arrival
241
6.17k
                    .notify_one(); // Only valid for get_arrow_batch(std::shared_ptr<Block>,)
242
6.17k
        }
243
6.89k
        _instance_rows[state->fragment_instance_id()] += num_rows;
244
6.89k
        _instance_rows_in_queue.back()[state->fragment_instance_id()] += num_rows;
245
111k
    } else {
246
111k
        auto ctx = _waiting_rpc.front();
247
111k
        _waiting_rpc.pop_front();
248
111k
        RETURN_IF_ERROR(ctx->on_data(result, _packet_num, this));
249
111k
        _packet_num++;
250
111k
    }
251
252
117k
    _update_dependency();
253
117k
    return Status::OK();
254
117k
}
255
256
template class ResultBlockBuffer<GetArrowResultBatchCtx>;
257
template class ResultBlockBuffer<GetResultBatchCtx>;
258
259
} // namespace doris