-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtask.cpp
More file actions
60 lines (48 loc) · 1.43 KB
/
Copy pathtask.cpp
File metadata and controls
60 lines (48 loc) · 1.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/**
* Copyright 2025, Aleksandar Colic
*
* Licensed 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 "task.hpp"
#include <atomic>
#include <memory>
#include <mutex>
#include <utility>
#include "spinlock.hpp"
#include "types.hpp"
namespace ums {
void Tasks::enque(std::shared_ptr<TaskBase> task)
{
const std::scoped_lock<Spinlock> l{m_lock};
m_tasks.push_back(std::move(task));
m_size.fetch_add(1, std::memory_order_relaxed);
}
std::shared_ptr<TaskBase> Tasks::deque() noexcept
{
const std::scoped_lock<Spinlock> l{m_lock};
if (m_tasks.empty())
return nullptr;
std::shared_ptr<TaskBase> t{std::move(m_tasks.front())};
m_tasks.pop_front();
m_size.fetch_sub(1, std::memory_order_relaxed);
return t;
}
[[nodiscard]] usize Tasks::size() const noexcept
{
return m_size.load(std::memory_order_relaxed);
}
[[nodiscard]] bool Tasks::empty() const noexcept
{
return size() == 0;
}
} // namespace ums