Coverage Report

Created: 2026-04-01 20:50

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/pipeline/pipeline.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/pipeline/pipeline.h"
19
20
#include <memory>
21
#include <string>
22
#include <utility>
23
24
#include "exec/operator/operator.h"
25
#include "exec/pipeline/pipeline_fragment_context.h"
26
#include "exec/pipeline/pipeline_task.h"
27
28
namespace doris {
29
30
811k
void Pipeline::_init_profile() {
31
811k
    auto s = fmt::format("Pipeline (pipeline id={})", _pipeline_id);
32
811k
    _pipeline_profile = std::make_unique<RuntimeProfile>(std::move(s));
33
811k
}
34
35
bool Pipeline::need_to_local_exchange(const DataDistribution target_data_distribution,
36
136k
                                      const int idx) const {
37
136k
    if (!target_data_distribution.need_local_exchange()) {
38
2
        return false;
39
2
    }
40
    // If serial operator exists after `idx`-th operator, we should not improve parallelism.
41
136k
    if (std::any_of(_operators.begin() + idx, _operators.end(),
42
136k
                    [&](OperatorPtr op) -> bool { return op->is_serial_operator(); })) {
43
212
        return false;
44
212
    }
45
    // If all operators are serial and sink is not serial, we should improve parallelism for sink.
46
136k
    if (std::all_of(_operators.begin(), _operators.end(),
47
174k
                    [&](OperatorPtr op) -> bool { return op->is_serial_operator(); })) {
48
32.9k
        if (!_sink->is_serial_operator()) {
49
27.6k
            return true;
50
27.6k
        }
51
103k
    } else if (std::any_of(_operators.begin(), _operators.end(),
52
147k
                           [&](OperatorPtr op) -> bool { return op->is_serial_operator(); })) {
53
        // If non-serial operators exist, we should improve parallelism for those.
54
37.6k
        return true;
55
37.6k
    }
56
57
70.9k
    if (target_data_distribution.distribution_type != ExchangeType::BUCKET_HASH_SHUFFLE &&
58
70.9k
        target_data_distribution.distribution_type != ExchangeType::HASH_SHUFFLE) {
59
        // Always do local exchange if non-hash-partition exchanger is required.
60
        // For example, `PASSTHROUGH` exchanger is always required to distribute data evenly.
61
26.0k
        return true;
62
44.8k
    } else if (_operators.front()->is_serial_operator()) {
63
0
        DCHECK(std::all_of(_operators.begin(), _operators.end(),
64
0
                           [&](OperatorPtr op) -> bool { return op->is_serial_operator(); }) &&
65
0
               _sink->is_serial_operator())
66
0
                << debug_string();
67
        // All operators and sink are serial in this path.
68
0
        return false;
69
44.8k
    } else {
70
44.8k
        return _data_distribution.distribution_type != target_data_distribution.distribution_type &&
71
44.8k
               !(is_hash_exchange(_data_distribution.distribution_type) &&
72
2.35k
                 is_hash_exchange(target_data_distribution.distribution_type));
73
44.8k
    }
74
70.9k
}
75
76
807k
Status Pipeline::add_operator(OperatorPtr& op, const int parallelism) {
77
807k
    if (parallelism > 0 && op->is_serial_operator()) {
78
86.4k
        set_num_tasks(parallelism);
79
86.4k
    }
80
807k
    op->set_parallel_tasks(num_tasks());
81
807k
    _operators.emplace_back(op);
82
807k
    if (op->is_source()) {
83
623k
        std::reverse(_operators.begin(), _operators.end());
84
623k
    }
85
807k
    return Status::OK();
86
807k
}
87
88
667k
Status Pipeline::prepare(RuntimeState* state) {
89
667k
    RETURN_IF_ERROR(_operators.back()->prepare(state));
90
666k
    RETURN_IF_ERROR(_sink->prepare(state));
91
666k
    _name.append(std::to_string(id()));
92
666k
    _name.push_back('-');
93
779k
    for (auto& op : _operators) {
94
779k
        _name.append(std::to_string(op->node_id()));
95
779k
        _name.append(op->get_name());
96
779k
    }
97
666k
    _name.push_back('-');
98
666k
    _name.append(std::to_string(_sink->node_id()));
99
666k
    _name.append(_sink->get_name());
100
666k
    return Status::OK();
101
666k
}
102
103
810k
Status Pipeline::set_sink(DataSinkOperatorPtr& sink) {
104
810k
    if (_sink) {
105
0
        return Status::InternalError("set sink twice");
106
0
    }
107
810k
    if (!sink->is_sink()) {
108
0
        return Status::InternalError("should set a sink operator but {}", typeid(sink).name());
109
0
    }
110
810k
    _sink = sink;
111
810k
    return Status::OK();
112
810k
}
113
114
355k
void Pipeline::make_all_runnable(PipelineId wake_by) {
115
355k
    DBUG_EXECUTE_IF("Pipeline::make_all_runnable.sleep", {
116
355k
        auto pipeline_id = DebugPoints::instance()->get_debug_param_or_default<int32_t>(
117
355k
                "Pipeline::make_all_runnable.sleep", "pipeline_id", -1);
118
355k
        if (pipeline_id == id()) {
119
355k
            LOG(WARNING) << "Pipeline::make_all_runnable.sleep sleep 10s";
120
355k
            sleep(10);
121
355k
        }
122
355k
    });
123
124
355k
    if (_sink->count_down_destination()) {
125
1.16M
        for (auto* task : _tasks) {
126
1.16M
            if (task) {
127
1.16M
                task->set_wake_up_early(wake_by);
128
1.16M
                task->unblock_all_dependencies();
129
1.16M
            }
130
1.16M
        }
131
352k
    }
132
355k
}
133
134
} // namespace doris