be/src/exec/pipeline/task_queue.cpp

Source
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements.  See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership.  The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License.  You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied.  See the License for the
// specific language governing permissions and limitations
// under the License.

#include "exec/pipeline/task_queue.h"

// IWYU pragma: no_include <bits/chrono.h>
#include <chrono> // IWYU pragma: keep
#include <memory>
#include <string>

#include "common/logging.h"
#include "exec/pipeline/pipeline_task.h"
#include "runtime/workload_group/workload_group.h"

namespace doris {

PipelineTaskSPtr SubTaskQueue::try_take(bool is_steal) {
    if (_queue.empty()) {
        return nullptr;
    }
    auto task = _queue.front();
    _queue.pop();
    return task;
}

////////////////////  PriorityTaskQueue ////////////////////

PriorityTaskQueue::PriorityTaskQueue() : _closed(false) {
    double factor = 1;
    for (int i = SUB_QUEUE_LEVEL - 1; i >= 0; i--) {
        _sub_queues[i].set_level_factor(factor);
        factor *= LEVEL_QUEUE_TIME_FACTOR;
    }
}

void PriorityTaskQueue::close() {
    std::unique_lock<std::mutex> lock(_work_size_mutex);
    _closed = true;
    _wait_task.notify_all();
    DorisMetrics::instance()->pipeline_task_queue_size->increment(-_total_task_size);
}

PipelineTaskSPtr PriorityTaskQueue::_try_take_unprotected(bool is_steal) {
    if (_total_task_size == 0 || _closed) {
        return nullptr;
    }

    double min_vruntime = 0;
    int level = -1;
    for (int i = 0; i < SUB_QUEUE_LEVEL; ++i) {
        double cur_queue_vruntime = _sub_queues[i].get_vruntime();
        if (!_sub_queues[i].empty()) {
            if (level == -1 || cur_queue_vruntime < min_vruntime) {
                level = i;
                min_vruntime = cur_queue_vruntime;
            }
        }
    }
    DCHECK(level != -1);
    _queue_level_min_vruntime = uint64_t(min_vruntime);

    auto task = _sub_queues[level].try_take(is_steal);
    if (task) {
        task->update_queue_level(level);
        _total_task_size--;
        DorisMetrics::instance()->pipeline_task_queue_size->increment(-1);
    }
    return task;
}

int PriorityTaskQueue::_compute_level(uint64_t runtime) {
    for (int i = 0; i < SUB_QUEUE_LEVEL - 1; ++i) {
        if (runtime <= _queue_level_limit[i]) {
            return i;
        }
    }
    return SUB_QUEUE_LEVEL - 1;
}

PipelineTaskSPtr PriorityTaskQueue::try_take(bool is_steal) {
    // TODO other efficient lock? e.g. if get lock fail, return null_ptr
    std::unique_lock<std::mutex> lock(_work_size_mutex);
    return _try_take_unprotected(is_steal);
}

PipelineTaskSPtr PriorityTaskQueue::take(uint32_t timeout_ms) {
    std::unique_lock<std::mutex> lock(_work_size_mutex);
    auto task = _try_take_unprotected(false);
    if (task) {
        return task;
    } else {
        if (timeout_ms > 0) {
            _wait_task.wait_for(lock, std::chrono::milliseconds(timeout_ms));
        } else {
            _wait_task.wait(lock);
        }
        return _try_take_unprotected(false);
    }
}

Status PriorityTaskQueue::push(PipelineTaskSPtr task) {
    if (_closed) {
        return Status::InternalError("WorkTaskQueue closed");
    }
    auto level = _compute_level(task->get_runtime_ns());
    std::unique_lock<std::mutex> lock(_work_size_mutex);

    // update empty queue's  runtime, to avoid too high priority
    if (_sub_queues[level].empty() &&
        double(_queue_level_min_vruntime) > _sub_queues[level].get_vruntime()) {
        _sub_queues[level].adjust_runtime(_queue_level_min_vruntime);
    }

    _sub_queues[level].push_back(task);
    _total_task_size++;
    DorisMetrics::instance()->pipeline_task_queue_size->increment(1);
    _wait_task.notify_one();
    return Status::OK();
}

MultiCoreTaskQueue::~MultiCoreTaskQueue() = default;

MultiCoreTaskQueue::MultiCoreTaskQueue(int core_size)
        : _prio_task_queues(core_size), _closed(false), _core_size(core_size) {}

void MultiCoreTaskQueue::close() {
    if (_closed) {
        return;
    }
    _closed = true;
    // close all priority task queue
    std::ranges::for_each(_prio_task_queues,
                          [](auto& prio_task_queue) { prio_task_queue.close(); });
}

PipelineTaskSPtr MultiCoreTaskQueue::take(int core_id) {
    PipelineTaskSPtr task = nullptr;
    while (!_closed) {
        DCHECK(_prio_task_queues.size() > core_id)
                << " list size: " << _prio_task_queues.size() << " core_id: " << core_id
                << " _core_size: " << _core_size << " _next_core: " << _next_core.load();
        task = _prio_task_queues[core_id].try_take(false);
        if (task) {
            break;
        }
        task = _steal_take(core_id);
        if (task) {
            break;
        }
        task = _prio_task_queues[core_id].take(WAIT_CORE_TASK_TIMEOUT_MS /* timeout_ms */);
        if (task) {
            break;
        }
    }
    if (task) {
        task->pop_out_runnable_queue();
    }
    return task;
}

PipelineTaskSPtr MultiCoreTaskQueue::_steal_take(int core_id) {
    DCHECK(core_id < _core_size);
    int next_id = core_id;
    for (int i = 1; i < _core_size; ++i) {
        ++next_id;
        if (next_id == _core_size) {
            next_id = 0;
        }
        DCHECK(next_id < _core_size);
        auto task = _prio_task_queues[next_id].try_take(true);
        if (task) {
            return task;
        }
    }
    return nullptr;
}

Status MultiCoreTaskQueue::push_back(PipelineTaskSPtr task) {
    int thread_id = task->get_thread_id(_core_size);
    if (thread_id < 0) {
        thread_id = _next_core.fetch_add(1) % _core_size;
    }
    return push_back(task, thread_id);
}

Status MultiCoreTaskQueue::push_back(PipelineTaskSPtr task, int core_id) {
    DCHECK(core_id < _core_size);
    task->put_in_runnable_queue();
    return _prio_task_queues[core_id].push(task);
}

void MultiCoreTaskQueue::update_statistics(PipelineTask* task, int64_t time_spent) {
    // if the task not execute but exception early close, core_id == -1
    // should not do update_statistics
    if (auto core_id = task->get_thread_id(_core_size); core_id >= 0) {
        task->inc_runtime_ns(time_spent);
        _prio_task_queues[core_id].inc_sub_queue_runtime(task->get_queue_level(), time_spent);
    }
}

} // namespace doris

Coverage Report

Created: 2026-05-12 20:22

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/task_queue.h"
19
20		// IWYU pragma: no_include <bits/chrono.h>
21		#include <chrono> // IWYU pragma: keep
22		#include <memory>
23		#include <string>
24
25		#include "common/logging.h"
26		#include "exec/pipeline/pipeline_task.h"
27		#include "runtime/workload_group/workload_group.h"
28
29		namespace doris {
30
31	1.70M	PipelineTaskSPtr SubTaskQueue::try_take(bool is_steal) {
32	1.70M	if (_queue.empty()) {
33	0	return nullptr;
34	0	}
35	1.70M	auto task = _queue.front();
36	1.70M	_queue.pop();
37	1.70M	return task;
38	1.70M	}
39
40		//////////////////// PriorityTaskQueue ////////////////////
41
42	180	PriorityTaskQueue::PriorityTaskQueue() : _closed(false) {
43	180	double factor = 1;
44	1.26k	for (int i = SUB_QUEUE_LEVEL - 1; i >= 0; i--) {
45	1.08k	_sub_queues[i].set_level_factor(factor);
46	1.08k	factor *= LEVEL_QUEUE_TIME_FACTOR;
47	1.08k	}
48	180	}
49
50	72	void PriorityTaskQueue::close() {
51	72	std::unique_lock<std::mutex> lock(_work_size_mutex);
52	72	_closed = true;
53	72	_wait_task.notify_all();
54	72	DorisMetrics::instance()->pipeline_task_queue_size->increment(-_total_task_size);
55	72	}
56
57	113M	PipelineTaskSPtr PriorityTaskQueue::_try_take_unprotected(bool is_steal) {
58	113M	if (_total_task_size == 0 \|\| _closed) {
59	112M	return nullptr;
60	112M	}
61
62	1.54M	double min_vruntime = 0;
63	1.54M	int level = -1;
64	11.7M	for (int i = 0; i < SUB_QUEUE_LEVEL; ++i) {
65	10.2M	double cur_queue_vruntime = _sub_queues[i].get_vruntime();
66	10.2M	if (!_sub_queues[i].empty()) {
67	1.70M	if (level == -1 \|\| cur_queue_vruntime < min_vruntime) {
68	1.70M	level = i;
69	1.70M	min_vruntime = cur_queue_vruntime;
70	1.70M	}
71	1.70M	}
72	10.2M	}
73	1.54M	DCHECK(level != -1);
74	1.54M	_queue_level_min_vruntime = uint64_t(min_vruntime);
75
76	1.54M	auto task = _sub_queues[level].try_take(is_steal);
77	1.70M	if (task) {
78	1.70M	task->update_queue_level(level);
79	1.70M	_total_task_size--;
80	1.70M	DorisMetrics::instance()->pipeline_task_queue_size->increment(-1);
81	1.70M	}
82	1.54M	return task;
83	113M	}
84
85	1.70M	int PriorityTaskQueue::_compute_level(uint64_t runtime) {
86	18.4E	for (int i = 0; i < SUB_QUEUE_LEVEL - 1; ++i) {
87	1.70M	if (runtime <= _queue_level_limit[i]) {
88	1.70M	return i;
89	1.70M	}
90	1.70M	}
91	18.4E	return SUB_QUEUE_LEVEL - 1;
92	1.70M	}
93
94	106M	PipelineTaskSPtr PriorityTaskQueue::try_take(bool is_steal) {
95		// TODO other efficient lock? e.g. if get lock fail, return null_ptr
96	106M	std::unique_lock<std::mutex> lock(_work_size_mutex);
97	106M	return _try_take_unprotected(is_steal);
98	106M	}
99
100	4.28M	PipelineTaskSPtr PriorityTaskQueue::take(uint32_t timeout_ms) {
101	4.28M	std::unique_lock<std::mutex> lock(_work_size_mutex);
102	4.28M	auto task = _try_take_unprotected(false);
103	4.28M	if (task) {
104	2.15k	return task;
105	4.28M	} else {
106	4.28M	if (timeout_ms > 0) {
107	4.28M	_wait_task.wait_for(lock, std::chrono::milliseconds(timeout_ms));
108	18.4E	} else {
109	18.4E	_wait_task.wait(lock);
110	18.4E	}
111	4.28M	return _try_take_unprotected(false);
112	4.28M	}
113	4.28M	}
114
115	1.70M	Status PriorityTaskQueue::push(PipelineTaskSPtr task) {
116	1.70M	if (_closed) {
117	0	return Status::InternalError("WorkTaskQueue closed");
118	0	}
119	1.70M	auto level = _compute_level(task->get_runtime_ns());
120	1.70M	std::unique_lock<std::mutex> lock(_work_size_mutex);
121
122		// update empty queue's runtime, to avoid too high priority
123	1.70M	if (_sub_queues[level].empty() &&
124	1.70M	double(_queue_level_min_vruntime) > _sub_queues[level].get_vruntime()) {
125	0	_sub_queues[level].adjust_runtime(_queue_level_min_vruntime);
126	0	}
127
128	1.70M	_sub_queues[level].push_back(task);
129	1.70M	_total_task_size++;
130	1.70M	DorisMetrics::instance()->pipeline_task_queue_size->increment(1);
131	1.70M	_wait_task.notify_one();
132	1.70M	return Status::OK();
133	1.70M	}
134
135	78	MultiCoreTaskQueue::~MultiCoreTaskQueue() = default;
136
137		MultiCoreTaskQueue::MultiCoreTaskQueue(int core_size)
138	84	: _prio_task_queues(core_size), _closed(false), _core_size(core_size) {}
139
140	42	void MultiCoreTaskQueue::close() {
141	42	if (_closed) {
142	0	return;
143	0	}
144	42	_closed = true;
145		// close all priority task queue
146	42	std::ranges::for_each(_prio_task_queues,
147	72	[](auto& prio_task_queue) { prio_task_queue.close(); });
148	42	}
149
150	1.95M	PipelineTaskSPtr MultiCoreTaskQueue::take(int core_id) {
151	1.95M	PipelineTaskSPtr task = nullptr;
152	5.32M	while (!_closed) {
153	18.4E	DCHECK(_prio_task_queues.size() > core_id)
154	18.4E	<< " list size: " << _prio_task_queues.size() << " core_id: " << core_id
155	18.4E	<< " _core_size: " << _core_size << " _next_core: " << _next_core.load();
156	5.07M	task = _prio_task_queues[core_id].try_take(false);
157	5.07M	if (task) {
158	303k	break;
159	303k	}
160	4.76M	task = _steal_take(core_id);
161	4.76M	if (task) {
162	480k	break;
163	480k	}
164	4.28M	task = _prio_task_queues[core_id].take(WAIT_CORE_TASK_TIMEOUT_MS /* timeout_ms */);
165	4.28M	if (task) {
166	922k	break;
167	922k	}
168	4.28M	}
169	1.95M	if (task) {
170	1.70M	task->pop_out_runnable_queue();
171	1.70M	}
172	1.95M	return task;
173	1.95M	}
174
175	4.76M	PipelineTaskSPtr MultiCoreTaskQueue::_steal_take(int core_id) {
176	4.76M	DCHECK(core_id < _core_size);
177	4.76M	int next_id = core_id;
178	106M	for (int i = 1; i < _core_size; ++i) {
179	101M	++next_id;
180	101M	if (next_id == _core_size) {
181	4.27M	next_id = 0;
182	4.27M	}
183	101M	DCHECK(next_id < _core_size);
184	101M	auto task = _prio_task_queues[next_id].try_take(true);
185	101M	if (task) {
186	480k	return task;
187	480k	}
188	101M	}
189	4.28M	return nullptr;
190	4.76M	}
191
192	1.54M	Status MultiCoreTaskQueue::push_back(PipelineTaskSPtr task) {
193	1.54M	int thread_id = task->get_thread_id(_core_size);
194	1.54M	if (thread_id < 0) {
195	394k	thread_id = _next_core.fetch_add(1) % _core_size;
196	394k	}
197	1.54M	return push_back(task, thread_id);
198	1.54M	}
199
200	1.70M	Status MultiCoreTaskQueue::push_back(PipelineTaskSPtr task, int core_id) {
201	1.70M	DCHECK(core_id < _core_size);
202	1.70M	task->put_in_runnable_queue();
203	1.70M	return _prio_task_queues[core_id].push(task);
204	1.70M	}
205
206	1.54M	void MultiCoreTaskQueue::update_statistics(PipelineTask* task, int64_t time_spent) {
207		// if the task not execute but exception early close, core_id == -1
208		// should not do update_statistics
209	1.54M	if (auto core_id = task->get_thread_id(_core_size); core_id >= 0) {
210	1.54M	task->inc_runtime_ns(time_spent);
211	1.54M	_prio_task_queues[core_id].inc_sub_queue_runtime(task->get_queue_level(), time_spent);
212	1.54M	}
213	1.54M	}
214
215		} // namespace doris