-
Notifications
You must be signed in to change notification settings - Fork 91
/
Copy pathaction_executor.cpp
179 lines (155 loc) · 4.83 KB
/
action_executor.cpp
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
/*
* .============.
* // M A K E / \
* // C++ DEV / \
* // E A S Y / \/ \
* ++ ----------. \/\ .
* \\ \ \ /\ /
* \\ \ \ /
* \\ \ \ /
* -============'
*
* Copyright (c) 2018 Hevake and contributors, all rights reserved.
*
* This file is part of cpp-tbox (https://github.com/cpp-main/cpp-tbox)
* Use of this source code is governed by MIT license that can be found
* in the LICENSE file in the root of the source tree. All contributing
* project authors may be found in the CONTRIBUTORS.md file in the root
* of the source tree.
*/
#include "action_executor.h"
#include <algorithm>
#include <tbox/base/assert.h>
#include "action.h"
namespace tbox {
namespace flow {
ActionExecutor::ActionExecutor() { }
ActionExecutor::~ActionExecutor() {
TBOX_ASSERT(cb_level_ == 0);
for (auto &action_deque : action_deque_array_) {
for (auto item : action_deque)
delete item.action;
action_deque.clear();
}
}
ActionExecutor::ActionId ActionExecutor::append(Action *action, int prio) {
TBOX_ASSERT(0 <= prio && prio <= 2);
TBOX_ASSERT(action != nullptr);
Item item = {
.id = allocActionId(),
.action = action
};
action_deque_array_.at(prio).push_back(item);
action->setFinishCallback([this](bool, const Action::Reason &, const Action::Trace &) { schedule(); });
action->vars().setParent(&vars_);
schedule();
return item.id;
}
ActionExecutor::ActionId ActionExecutor::current() const {
if (curr_action_deque_index_ == -1)
return -1;
auto &action_deque = action_deque_array_.at(curr_action_deque_index_);
return action_deque.front().id;
}
bool ActionExecutor::cancelCurrent() {
if (curr_action_deque_index_ == -1)
return false;
auto &action_deque = action_deque_array_.at(curr_action_deque_index_);
auto item = action_deque.front();
item.action->stop();
delete item.action;
action_deque.pop_front();
schedule();
return true;
}
bool ActionExecutor::cancel(ActionId action_id) {
TBOX_ASSERT(action_id > 0);
for (auto &action_deque : action_deque_array_) {
auto iter = std::find_if(action_deque.begin(), action_deque.end(),
[action_id] (const Item &item) { return item.id == action_id; }
);
if (iter != action_deque.end()) {
delete iter->action;
action_deque.erase(iter);
schedule();
return true;
}
}
return false;
}
void ActionExecutor::cancelAll() {
for (auto &action_deque : action_deque_array_) {
if (!action_deque.empty()) {
auto action_item = action_deque.front();
action_item.action->stop();
}
}
}
ActionExecutor::ActionId ActionExecutor::allocActionId() { return ++action_id_alloc_counter_; }
void ActionExecutor::schedule() {
TBOX_ASSERT(cb_level_ == 0);
while (true) {
//! 找出优先级最高,且不为空的队列
int ready_deque_index = -1;
for (int i = 0; i < 3; ++i) {
if (!action_deque_array_.at(i).empty()) {
ready_deque_index = i;
break;
}
}
//! 如果所有的队列都是空的,那么就直接退出
if (ready_deque_index == -1) {
++cb_level_;
if (all_finished_cb_)
all_finished_cb_();
--cb_level_;
return;
}
//! 如果高优先级的队列比当前队列优先级还高,则要先暂停当前队列头部的动作
if (curr_action_deque_index_ != -1 &&
ready_deque_index < curr_action_deque_index_) {
action_deque_array_.at(curr_action_deque_index_).front().action->pause();
}
auto &ready_deque = action_deque_array_.at(ready_deque_index);
while (!ready_deque.empty()) {
auto item = ready_deque.front();
//! 没有启动的要启动
if (item.action->state() == Action::State::kIdle) {
if (item.action->start()) {
curr_action_deque_index_ = ready_deque_index;
++cb_level_;
if (action_started_cb_)
action_started_cb_(item.id);
--cb_level_;
} else {
ready_deque.pop_front();
delete item.action;
curr_action_deque_index_ = -1;
++cb_level_;
if (action_finished_cb_)
action_finished_cb_(item.id);
--cb_level_;
}
//! 被暂停了的,要恢复
} else if (item.action->state() == Action::State::kPause) {
curr_action_deque_index_ = ready_deque_index;
item.action->resume();
//! 已完成了的,要删除
} else if (item.action->state() == Action::State::kFinished ||
item.action->state() == Action::State::kStoped) {
ready_deque.pop_front();
delete item.action;
curr_action_deque_index_ = -1;
++cb_level_;
if (action_finished_cb_)
action_finished_cb_(item.id);
--cb_level_;
//! 其它状态:运行中,不需要处理
} else {
return;
}
}
}
}
}
}