Coverage Report

Created: 2026-04-08 13:21

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