FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpp.react/src/engine/PulsecountEngine.cpp at master · gitxyf/cpp.react · GitHub
gitxyf
/
cpp.react
Public
forked from
snakster/cpp.react
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpp.react
/
src
/
engine
/
PulsecountEngine.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
288 lines (222 loc) · 8.16 KB
Breadcrumbs
cpp.react
/
src
/
engine
/
PulsecountEngine.cpp
Copy path
File metadata and controls
288 lines (222 loc) · 8.16 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
//
Copyright Sebastian Jeckel 2017.
//
Distributed under the Boost Software License, Version 1.0.
//
(See accompanying file LICENSE_1_0.txt or copy at
//
http://www.boost.org/LICENSE_1_0.txt)
#
if
0
#include "react/engine/PulsecountEngine.h"
#include <cstdint>
#include <utility>
#include "react/common/Types.h"
/***************************************/ REACT_IMPL_BEGIN /**************************************/
namespace pulsecount {
///////////////////////////////////////////////////////////////////////////////////////////////////
/// Constants
///////////////////////////////////////////////////////////////////////////////////////////////////
static const uint chunk_size = 8;
static const uint dfs_threshold = 3;
///////////////////////////////////////////////////////////////////////////////////////////////////
/// MarkerTask
///////////////////////////////////////////////////////////////////////////////////////////////////
class MarkerTask: public task
{
public:
using BufferT = NodeBuffer<Node,chunk_size>;
template <typename TInput>
MarkerTask(TInput srcBegin, TInput srcEnd) :
nodes_( srcBegin, srcEnd )
{}
MarkerTask(MarkerTask& other, SplitTag) :
nodes_( other.nodes_, SplitTag( ) )
{}
task* execute()
{
uint splitCount = 0;
while (! nodes_.IsEmpty())
{
Node& node = splitCount > dfs_threshold ? *nodes_.PopBack() : *nodes_.PopFront();
// Increment counter of each successor and add it to smaller stack
for (auto* succ : node.Successors)
{
succ->IncCounter();
// Skip if already marked as reachable
if (! succ->ExchangeMark(ENodeMark::visited))
continue;
nodes_.PushBack(succ);
if (nodes_.IsFull())
{
splitCount++;
//Delegate half the work to new task
auto& t = *new(task::allocate_additional_child_of(*parent()))
MarkerTask(*this, SplitTag{});
spawn(t);
}
}
}
return nullptr;
}
private:
BufferT nodes_;
};
///////////////////////////////////////////////////////////////////////////////////////////////////
/// UpdaterTask
///////////////////////////////////////////////////////////////////////////////////////////////////
class UpdaterTask: public task
{
public:
using BufferT = NodeBuffer<Node,chunk_size>;
template <typename TInput>
UpdaterTask(Turn& turn, TInput srcBegin, TInput srcEnd) :
turn_( turn ),
nodes_( srcBegin, srcEnd )
{}
UpdaterTask(Turn& turn, Node* node) :
turn_( turn ),
nodes_( node )
{}
UpdaterTask(UpdaterTask& other, SplitTag) :
turn_( other.turn_ ),
nodes_( other.nodes_, SplitTag( ) )
{}
task* execute()
{
uint splitCount = 0;
while (!nodes_.IsEmpty())
{
Node& node = splitCount > dfs_threshold ? *nodes_.PopBack() : *nodes_.PopFront();
if (node.Mark() == ENodeMark::should_update)
node.Tick(&turn_);
// Defer if node was dynamically attached to a predecessor that
// has not pulsed yet
if (node.State == ENodeState::dyn_defer)
continue;
// Repeat the update if a node was dynamically attached to a
// predecessor that has already pulsed
while (node.State == ENodeState::dyn_repeat)
node.Tick(&turn_);
// Mark successors for update?
bool update = node.State == ENodeState::changed;
node.State = ENodeState::unchanged;
{// node.ShiftMutex
Node::ShiftMutexT::scoped_lock lock(node.ShiftMutex, false);
for (auto* succ : node.Successors)
{
if (update)
succ->SetMark(ENodeMark::should_update);
// Delay tick?
if (succ->DecCounter())
continue;
// Heavyweight - spawn new task
if (succ->IsHeavyweight())
{
auto& t = *new(task::allocate_additional_child_of(*parent()))
UpdaterTask(turn_, succ);
spawn(t);
}
// Leightweight - add to buffer, split if full
else
{
nodes_.PushBack(succ);
if (nodes_.IsFull())
{
splitCount++;
//Delegate half the work to new task
auto& t = *new(task::allocate_additional_child_of(*parent()))
UpdaterTask(*this, SplitTag{});
spawn(t);
}
}
}
node.SetMark(ENodeMark::unmarked);
}// ~node.ShiftMutex
}
return nullptr;
}
private:
Turn& turn_;
BufferT nodes_;
};
///////////////////////////////////////////////////////////////////////////////////////////////////
/// Turn
///////////////////////////////////////////////////////////////////////////////////////////////////
Turn::Turn(TurnIdT id, TransactionFlagsT flags) :
TurnBase( id, flags )
{}
///////////////////////////////////////////////////////////////////////////////////////////////////
/// PulsecountEngine
///////////////////////////////////////////////////////////////////////////////////////////////////
void EngineBase::AttachNode(Node& node, Node& parent)
{
parent.Successors.Add(node);
}
void EngineBase::DetachNode(Node& node, Node& parent)
{
parent.Successors.Remove(node);
}
void EngineBase::OnInputChange(Node& node, Turn& turn)
{
changedInputs_.push_back(&node);
node.State = ENodeState::changed;
}
template <typename TTask, typename TIt, typename ... TArgs>
void spawnTasks
(
task& rootTask, task_list& spawnList,
const size_t count, TIt start, TIt end,
TArgs& ... args
)
{
assert(1 + count <=
static_cast<size_t>((std::numeric_limits<int>::max)()));
rootTask.set_ref_count(1 + static_cast<int>(count));
for (size_t i=0; i < (count - 1); i++)
{
spawnList.push_back(*new(rootTask.allocate_child())
TTask(args ..., start, start + chunk_size));
start += chunk_size;
}
spawnList.push_back(*new(rootTask.allocate_child())
TTask(args ..., start, end));
rootTask.spawn_and_wait_for_all(spawnList);
spawnList.clear();
}
void EngineBase::Propagate(Turn& turn)
{
const size_t initialTaskCount = (changedInputs_.size() - 1) / chunk_size + 1;
spawnTasks<MarkerTask>(rootTask_, spawnList_, initialTaskCount,
changedInputs_.begin(), changedInputs_.end());
spawnTasks<UpdaterTask>(rootTask_, spawnList_, initialTaskCount,
changedInputs_.begin(), changedInputs_.end(), turn);
changedInputs_.clear();
}
void EngineBase::OnNodePulse(Node& node, Turn& turn)
{
node.State = ENodeState::changed;
}
void EngineBase::OnNodeIdlePulse(Node& node, Turn& turn)
{
node.State = ENodeState::unchanged;
}
void EngineBase::OnDynamicNodeAttach(Node& node, Node& parent, Turn& turn)
{// parent.ShiftMutex (write)
NodeShiftMutexT::scoped_lock lock(parent.ShiftMutex, true);
parent.Successors.Add(node);
// Has already nudged its neighbors?
if (parent.Mark() == ENodeMark::unmarked)
{
node.State = ENodeState::dyn_repeat;
}
else
{
node.State = ENodeState::dyn_defer;
node.IncCounter();
node.SetMark(ENodeMark::should_update);
}
}// ~parent.ShiftMutex (write)
void EngineBase::OnDynamicNodeDetach(Node& node, Node& parent, Turn& turn)
{// parent.ShiftMutex (write)
NodeShiftMutexT::scoped_lock lock(parent.ShiftMutex, true);
parent.Successors.Remove(node);
}// ~parent.ShiftMutex (write)
} // ~namespace pulsecount
/****************************************/ REACT_IMPL_END /***************************************/
#
endif
Back
|
FazBrowse Home
|
New Git URL