Coverage Report

Created: 2026-04-18 17:00

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/exchange/exchange_writer.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/exchange/exchange_writer.h"
19
20
#include <glog/logging.h>
21
22
#include <algorithm>
23
#include <cstdint>
24
#include <vector>
25
26
#include "common/logging.h"
27
#include "common/status.h"
28
#include "core/assert_cast.h"
29
#include "core/block/block.h"
30
#include "exec/operator/exchange_sink_operator.h"
31
#include "exec/sink/tablet_sink_hash_partitioner.h"
32
33
namespace doris {
34
35
ExchangeWriterBase::ExchangeWriterBase(ExchangeSinkLocalState& local_state)
36
644k
        : _local_state(local_state), _partitioner(local_state.partitioner()) {}
37
38
template <typename ChannelPtrType>
39
Status ExchangeWriterBase::_handle_eof_channel(RuntimeState* state, ChannelPtrType channel,
40
14.0k
                                               Status st) const {
41
14.0k
    channel->set_receiver_eof(st);
42
    // Channel will not send RPC to the downstream when eof, so close channel by OK status.
43
14.0k
    return channel->close(state);
44
14.0k
}
45
46
// NOLINTBEGIN(readability-function-cognitive-complexity)
47
Status ExchangeWriterBase::_add_rows_impl(RuntimeState* state,
48
                                          std::vector<std::shared_ptr<Channel>>& channels,
49
258k
                                          size_t channel_count, Block* block, bool eos) {
50
258k
    Status status = Status::OK();
51
258k
    uint32_t offset = 0;
52
3.42M
    for (size_t i = 0; i < channel_count; ++i) {
53
3.16M
        uint32_t size = _channel_rows_histogram[i];
54
3.16M
        if (!channels[i]->is_receiver_eof() && size > 0) {
55
18.4E
            VLOG_DEBUG << fmt::format("partition {} of {}, block:\n{}, start: {}, size: {}", i,
56
18.4E
                                      channel_count, block->dump_data(), offset, size);
57
65.0k
            status = channels[i]->add_rows(block, _origin_row_idx.data(), offset, size, false);
58
65.0k
            HANDLE_CHANNEL_STATUS(state, channels[i], status);
59
65.0k
        }
60
3.16M
        offset += size;
61
3.16M
    }
62
258k
    if (eos) {
63
3.25M
        for (int i = 0; i < channel_count; ++i) {
64
3.01M
            if (!channels[i]->is_receiver_eof()) {
65
18.4E
                VLOG_DEBUG << fmt::format("EOS partition {} of {}, block:\n{}", i, channel_count,
66
18.4E
                                          block->dump_data());
67
3.01M
                status = channels[i]->add_rows(block, _origin_row_idx.data(), 0, 0, true);
68
3.01M
                HANDLE_CHANNEL_STATUS(state, channels[i], status);
69
3.01M
            }
70
3.00M
        }
71
248k
    }
72
258k
    return Status::OK();
73
258k
}
74
// NOLINTEND(readability-function-cognitive-complexity)
75
76
480
Status ExchangeOlapWriter::write(RuntimeState* state, Block* block, bool eos) {
77
480
    Block prior_block;
78
480
    auto* tablet_partitioner = assert_cast<TabletSinkHashPartitioner*>(_partitioner);
79
480
    RETURN_IF_ERROR(tablet_partitioner->try_cut_in_line(prior_block));
80
480
    if (!prior_block.empty()) {
81
        // prior_block (batching rows) cuts in line, deal it first.
82
0
        RETURN_IF_ERROR(_write_impl(state, &prior_block));
83
0
        tablet_partitioner->finish_cut_in_line();
84
0
    }
85
86
480
    RETURN_IF_ERROR(_write_impl(state, block));
87
88
    // all data wrote. consider batched rows before eos.
89
480
    if (eos) {
90
        // get all batched rows
91
432
        tablet_partitioner->mark_last_block();
92
432
        Block final_batching_block;
93
432
        RETURN_IF_ERROR(tablet_partitioner->try_cut_in_line(final_batching_block));
94
432
        if (!final_batching_block.empty()) {
95
0
            RETURN_IF_ERROR(_write_impl(state, &final_batching_block, true));
96
432
        } else {
97
            // No batched rows, send empty block with eos signal.
98
432
            Block empty_block = block->clone_empty();
99
432
            RETURN_IF_ERROR(_write_impl(state, &empty_block, true));
100
432
        }
101
432
    }
102
480
    return Status::OK();
103
480
}
104
105
912
Status ExchangeOlapWriter::_write_impl(RuntimeState* state, Block* block, bool eos) {
106
912
    auto rows = block->rows();
107
912
    auto* tablet_partitioner = assert_cast<TabletSinkHashPartitioner*>(_partitioner);
108
912
    {
109
912
        SCOPED_TIMER(_local_state.split_block_hash_compute_timer());
110
912
        RETURN_IF_ERROR(tablet_partitioner->do_partitioning(state, block));
111
912
    }
112
912
    {
113
912
        SCOPED_TIMER(_local_state.distribute_rows_into_channels_timer());
114
912
        const auto& channel_ids = tablet_partitioner->get_channel_ids();
115
912
        const auto invalid_val = tablet_partitioner->invalid_sentinel();
116
912
        DCHECK_EQ(channel_ids.size(), rows);
117
118
        // decrease not sinked rows this time
119
912
        COUNTER_UPDATE(_local_state.rows_input_counter(),
120
912
                       -1LL * std::ranges::count(channel_ids, invalid_val));
121
122
912
        RETURN_IF_ERROR(_channel_add_rows(state, _local_state.channels,
123
912
                                          _local_state.channels.size(), channel_ids, rows, block,
124
912
                                          eos, invalid_val));
125
912
    }
126
912
    return Status::OK();
127
912
}
128
129
256k
Status ExchangeTrivialWriter::write(RuntimeState* state, Block* block, bool eos) {
130
256k
    {
131
256k
        SCOPED_TIMER(_local_state.split_block_hash_compute_timer());
132
256k
        RETURN_IF_ERROR(_partitioner->do_partitioning(state, block));
133
256k
    }
134
256k
    {
135
256k
        auto rows = block->rows();
136
256k
        SCOPED_TIMER(_local_state.distribute_rows_into_channels_timer());
137
256k
        const auto& channel_ids = _partitioner->get_channel_ids();
138
139
256k
        RETURN_IF_ERROR(_channel_add_rows(state, _local_state.channels,
140
256k
                                          _local_state.channels.size(), channel_ids, rows, block,
141
256k
                                          eos));
142
256k
    }
143
144
256k
    return Status::OK();
145
256k
}
146
147
Status ExchangeOlapWriter::_channel_add_rows(RuntimeState* state,
148
                                             std::vector<std::shared_ptr<Channel>>& channels,
149
                                             size_t channel_count,
150
                                             const std::vector<HashValType>& channel_ids,
151
                                             size_t rows, Block* block, bool eos,
152
913
                                             HashValType invalid_val) {
153
913
    size_t effective_rows = 0;
154
913
    effective_rows =
155
913
            std::ranges::count_if(channel_ids, [=](int64_t cid) { return cid != invalid_val; });
156
157
    // row index will skip all skipped rows.
158
913
    _origin_row_idx.resize(effective_rows);
159
913
    _channel_rows_histogram.assign(channel_count, 0U);
160
913
    _channel_pos_offsets.resize(channel_count);
161
983
    for (size_t i = 0; i < rows; ++i) {
162
70
        if (channel_ids[i] == invalid_val) {
163
2
            continue;
164
2
        }
165
68
        auto cid = channel_ids[i];
166
68
        _channel_rows_histogram[cid]++;
167
68
    }
168
913
    _channel_pos_offsets[0] = 0;
169
7.29k
    for (size_t i = 1; i < channel_count; ++i) {
170
6.38k
        _channel_pos_offsets[i] = _channel_pos_offsets[i - 1] + _channel_rows_histogram[i - 1];
171
6.38k
    }
172
983
    for (uint32_t i = 0; i < rows; ++i) {
173
70
        if (channel_ids[i] == invalid_val) {
174
2
            continue;
175
2
        }
176
68
        auto cid = channel_ids[i];
177
68
        auto pos = _channel_pos_offsets[cid]++;
178
68
        _origin_row_idx[pos] = i;
179
68
    }
180
181
913
    return _add_rows_impl(state, channels, channel_count, block, eos);
182
913
}
183
184
Status ExchangeTrivialWriter::_channel_add_rows(RuntimeState* state,
185
                                                std::vector<std::shared_ptr<Channel>>& channels,
186
                                                size_t channel_count,
187
                                                const std::vector<HashValType>& channel_ids,
188
256k
                                                size_t rows, Block* block, bool eos) {
189
256k
    _origin_row_idx.resize(rows);
190
256k
    _channel_rows_histogram.assign(channel_count, 0U);
191
256k
    _channel_pos_offsets.resize(channel_count);
192
17.2M
    for (size_t i = 0; i < rows; ++i) {
193
16.9M
        _channel_rows_histogram[channel_ids[i]]++;
194
16.9M
    }
195
256k
    _channel_pos_offsets[0] = 0;
196
3.16M
    for (size_t i = 1; i < channel_count; ++i) {
197
2.90M
        _channel_pos_offsets[i] = _channel_pos_offsets[i - 1] + _channel_rows_histogram[i - 1];
198
2.90M
    }
199
17.1M
    for (uint32_t i = 0; i < rows; i++) {
200
16.9M
        auto cid = channel_ids[i];
201
16.9M
        auto pos = _channel_pos_offsets[cid]++;
202
16.9M
        _origin_row_idx[pos] = i;
203
16.9M
    }
204
205
256k
    return _add_rows_impl(state, channels, channel_count, block, eos);
206
256k
}
207
208
} // namespace doris