Coverage Report

Created: 2026-03-31 16:02

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