-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Refactor jobs engine into multiple files (#28)
* Refactor jobs engine into multiple files
- Loading branch information
1 parent
9d0b439
commit e024856
Showing
9 changed files
with
820 additions
and
610 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,103 @@ | ||
| #pragma once | ||
|
|
||
| #include <atomic> | ||
| #include <deque> | ||
| #include <functional> | ||
| #include <queue> | ||
| #include <unordered_map> | ||
| #include <vector> | ||
|
|
||
| #include "../base_lock.h" | ||
|
|
||
| namespace small::jobsimpl { | ||
| // a job can be in the following states | ||
| enum class EnumJobsState : unsigned int | ||
| { | ||
| kNone = 0, | ||
| kInProgress, | ||
| kFinished, | ||
| kFailed, | ||
| kCancelled, | ||
| kTimeout | ||
| }; | ||
|
|
||
| // a job item | ||
| template <typename JobsTypeT, typename JobsRequestT, typename JobsResponseT> | ||
| struct jobs_item | ||
| { | ||
| using JobsID = unsigned long long; | ||
|
|
||
| JobsID id{}; // job unique id | ||
| JobsTypeT type{}; // job type | ||
| std::atomic<EnumJobsState> state{EnumJobsState::kNone}; // job state | ||
| std::atomic<int> progress{}; // progress 0-100 for state kInProgress | ||
| JobsRequestT request{}; // request needed for processing function | ||
| JobsResponseT response{}; // where the results are saved (for the finished callback if exists) | ||
|
|
||
| explicit jobs_item() = default; | ||
| explicit jobs_item(const JobsID &jobs_id, const JobsTypeT &jobs_type, const JobsRequestT &jobs_request) | ||
| : id(jobs_id), type(jobs_type), request(jobs_request) {} | ||
| explicit jobs_item(const JobsTypeT &jobs_type, const JobsRequestT &jobs_request) | ||
| : type(jobs_type), request(jobs_request) {} | ||
| explicit jobs_item(const JobsID &jobs_id, const JobsTypeT &jobs_type, JobsRequestT &&jobs_request) | ||
| : id(jobs_id), type(jobs_type), request(std::forward<JobsRequestT>(jobs_request)) {} | ||
| explicit jobs_item(const JobsTypeT &jobs_type, JobsRequestT &&jobs_request) | ||
| : type(jobs_type), request(std::forward<JobsRequestT>(jobs_request)) {} | ||
|
|
||
| jobs_item(const jobs_item &other) { operator=(other); }; | ||
| jobs_item(jobs_item &&other) noexcept { operator=(other); }; | ||
| jobs_item &operator=(const jobs_item &other) | ||
| { | ||
| id = other.id; | ||
| type = other.type; | ||
| state = other.state.load(); | ||
| progress = other.progress.load(); | ||
| request = other.request; | ||
| response = other.response; | ||
| return *this; | ||
| } | ||
| jobs_item &operator=(jobs_item &&other) noexcept | ||
| { | ||
| id = std::move(other.id); | ||
| type = std::move(other.type); | ||
| state = other.state.load(); | ||
| progress = other.progress.load(); | ||
| request = std::move(other.request); | ||
| response = std::move(other.response); | ||
| return *this; | ||
| } | ||
|
|
||
| // | ||
| // set job state (can only go from lower to upper state) | ||
| // | ||
| inline void set_state(const EnumJobsState &new_state) | ||
| { | ||
| for (;;) { | ||
| EnumJobsState current_state = state.load(); | ||
| if (current_state >= new_state) { | ||
| return; | ||
| } | ||
| if (state.compare_exchange_weak(current_state, new_state)) { | ||
| return; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| // | ||
| // set job progress (can only increase) | ||
| // | ||
| inline void set_progress(const int &new_progress) | ||
| { | ||
| for (;;) { | ||
| int current_progress = progress.load(); | ||
| if (current_progress >= new_progress) { | ||
| return; | ||
| } | ||
| if (progress.compare_exchange_weak(current_progress, new_progress)) { | ||
| return; | ||
| } | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| } // namespace small::jobsimpl |
Oops, something went wrong.