-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExecutionChecker.cpp
More file actions
394 lines (338 loc) · 14 KB
/
Copy pathExecutionChecker.cpp
File metadata and controls
394 lines (338 loc) · 14 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
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
#include"BaseLib/Strategy/ExecutionChecker.h"
namespace BaseLib { namespace Strategy {
// ------------------------------------------------------------
// Strategies to check if state and policy allows execution
// ------------------------------------------------------------
int ComputeNumPacketsToDequeue::Perform(const Status::FlowStatus& , const Policy::Throughput& )
{
//IINFO() << " dequeue max(0," << throughput.Rate().PerSecond() << " - " << status.Dequeued().SumAsTimeRate().PerSecond() << ")";
//return std::max(0, int(status.Dequeued().SumAsTimeRate().PerSecond() - throughput.Rate().PerSecond()));
return INT_MAX; //std::max(0, throughput.Rate().PerSecond() - status.Dequeued().SumAsTimeRate().PerSecond());
}
Status::TimeRate CalculateTimeRateAIMD::Perform(const Status::FlowStatus& , const Policy::Throughput& /*maxThroughput*/, const Policy::Congestion& /*congestion*/)
{
// ---------------------------------------------------------
// Calculate rate based on current flow status throughput
// and congestion policy, throughput policy represents maximum.
// ---------------------------------------------------------
// TODO: How to detect congestion?
// Queue is full?
return Status::TimeRate(1, Duration::FromSeconds(1));
}
// ------------------------------------------------------------
// Strategies to check if state and policy allows execution
// ------------------------------------------------------------
bool IsInLifetime::Perform(const Status::AccessStatus& status, const Policy::Lifespan& lifespan)
{
return !status.IsDeleted() && status.Time().TimeSinceStarted() <= lifespan.delegate();
}
// ------------------------------------------------------------
// Strategies to check if state and policy allows execution
// ------------------------------------------------------------
bool IsInLifespan::Perform(const Status::ExecutionStatus& status, const Policy::Lifespan& lifespan)
{
return status.Time().TimeSinceLastExecutionTime() > lifespan.AsDuration();
}
bool IsInInterval::Perform(const Status::ExecutionStatus& status, const Policy::Interval& interval)
{
if(status.IsSuspended())
{
return false;
}
// ------------------------------------------------------------------------------------------------
// if "never run before" and "time since command creation" > "initial delayed start"
// ------------------------------------------------------------------------------------------------
if(status.IsNeverExecuted() && status.Time().TimeSinceLastExecutionTime() >= interval.Initial())
{
return true;
}
// ------------------------------------------------------------------------------------------------
// (else if implied "run before") and if "time since last execution" >= "configured minimum interval period"
// ------------------------------------------------------------------------------------------------
else if(status.Time().TimeSinceLastExecutionTime() >= interval.Period())
{
return true;
}
// ------------------------------------------------------------------------------------------------
// if "time since last execution" < "configured minimum interval period"
// ------------------------------------------------------------------------------------------------
//else if(executionState.getExecutionTime().getTimeSinceLastExecutionTimeMs() < interval.getPeriodMs()) {
// return false;
//}
//ASSERT(status.Time().TimeSinceLastExecutionTime() < interval.Period());
return false;
}
bool IsInRetryInterval::Perform(const Status::ExecutionStatus& status, const Policy::Interval& interval)
{
if(status.IsLastExecutionFailure())
{
return IsInInterval::Perform(status, interval);
}
return false;
}
bool IsInAttempt::Perform(const BaseLib::Status::ExecutionStatus& status, const Policy::Attempt& attempt)
{
bool executeCommand = false;
// ---------------------------------------
// If command is cancelled it is done
// --------------------------------------
if(status.IsCancelled())
{
return false;
}
// ---------------------------------------
// Check execution counts
// ---------------------------------------
switch(attempt.Kind())
{
case Policy::AttemptKind::FOREVER:
{
executeCommand = true;
break;
}
case Policy::AttemptKind::NUM_SUCCESSFUL_TIMES:
{
// ------------------------------------------------------------------------------------------------
// if "number of successful executions" < "required number of successful executions" then doExecute
// ------------------------------------------------------------------------------------------------
if(status.Count().NumSuccesses() < attempt.MinNumSuccesses())
{
executeCommand = true;
}
// ------------------------------------------------------------------------------------------------
// if "total number of attempts" >= "maximum number of attempts" then doNotExecute
// ------------------------------------------------------------------------------------------------
if(status.Count().TotalNumAttempts() >= attempt.MaxNumAttempts())
{
executeCommand = false;
}
break;
}
case Policy::AttemptKind::UNTIL_SUCCESS:
{
// ------------------------------------------------------------------------------------------------
// if "number of successful executions" == 0 then doExecute
// ------------------------------------------------------------------------------------------------
if(status.Count().NumSuccesses() == 0)
{
executeCommand = true;
}
// ------------------------------------------------------------------------------------------------
// if "total number of attempts" >= "maximum number of attempts" then doNotExecute
// ------------------------------------------------------------------------------------------------
if(status.Count().TotalNumAttempts() >= attempt.MaxNumAttempts())
{
executeCommand = false;
}
break;
}
default:
IWARNING() << "Unrecognized command policy Lifetime.kind";
break;
}
return executeCommand;
}
bool IsTimeout::Perform(const BaseLib::Status::ExecutionStatus& status, const Policy::Timeout& timeout)
{
//IINFO() << status.Time().TimeSinceLastExecutionTime().InMillis() << " >= " << timeout.AsDuration().TimeSinceEpoch();
return status.IsExecuting() && status.Time().TimeSinceLastExecutionTime() >= timeout.delegate();
}
bool IsIdle::Perform(const BaseLib::Status::ExecutionStatus& status, const Policy::Timeout& timeout)
{
return !status.IsExecuting() && status.Time().TimeSinceLastExecutionTime() >= timeout.delegate();
}
bool IsReadyToExecute::Perform(
const Status::ExecutionStatus& status,
const Policy::Attempt& attempt,
const Policy::Interval& interval,
const Policy::Interval& retryInterval
)
{
bool inLifetime = IsInAttempt::Perform(status, attempt);
bool inInterval = IsInInterval::Perform(status, interval);
bool inRetryInterval = IsInRetryInterval::Perform(status, retryInterval);
// ---------------------------------------
// Q: Is Timeout policy relevant here?
// A: No, it is handled in controller
// ---------------------------------------
return (inLifetime && inInterval) || (inLifetime && inRetryInterval);
}
Duration ComputeTimeUntilNextExecution::Perform(const Status::ExecutionStatus& status, const Policy::Interval& interval)
{
if(status.IsSuspended())
{
return Duration::Infinite();
}
else if(status.IsNeverExecuted())
{
return std::max<Duration>(Duration::Zero(), interval.Initial() - status.Time().TimeSinceLastExecutionTime());
//IDEBUG() << "Time to execute according to initialDelayMs " << initialDelayMs;
//ASSERT(!status.IsStarted());
}
else // executionStatus.Count().TotalNumAttempts() > 0
{
return std::max<Duration>(Duration::Zero(), interval.Period() - status.Time().TimeSinceLastExecutionTime());
//IDEBUG() << "Time to execute according to periodMs " << intervalMs;
}
}
Duration ComputeTimeUntilNextRetry::Perform(const Status::ExecutionStatus& status, const Policy::Interval& interval)
{
if(IsInRetryInterval::Perform(status, interval))
{
return ComputeTimeUntilNextExecution::Perform(status, interval);
}
return Duration::Infinite();
}
Duration ComputeTimeUntilTimeout::Perform(const Status::ExecutionStatus& status, const Policy::Timeout& timeout)
{
if(!status.IsExecuting() || status.IsSuspended()) return Duration::Infinite();
return std::max<Duration>(Duration::Zero(), timeout.delegate() - status.Time().TimeSinceLastExecutionTime());
}
Duration ComputeEarliestReadyIn::Perform(
const Status::ExecutionStatus& status,
const Policy::Attempt& attempt,
const Policy::Interval& interval,
const Policy::Interval& retryInterval,
const Policy::Timeout& timeout
)
{
Duration nextExecution = Duration::Infinite();
if(IsInAttempt::Perform(status, attempt) && !status.IsExecuting())
{
nextExecution = ComputeTimeUntilNextExecution::Perform(status, interval);
}
else if(status.IsExecuting())
{
nextExecution = interval.Period();
}
Duration nextRetry = ComputeTimeUntilNextRetry::Perform(status, retryInterval);
Duration nextTimeout = Duration::Infinite();
if(!status.IsInterrupted())
{
nextTimeout = ComputeTimeUntilTimeout::Perform(status, timeout);
}
else
IINFO() << "Was interrupted " << status;
// -----------------------------------------
// Compute earliest ready time based on policies and status
// -----------------------------------------
Duration earliestReadyIn = Duration::Infinite();
earliestReadyIn = std::min<Duration>(earliestReadyIn, nextExecution);
earliestReadyIn = std::min<Duration>(earliestReadyIn, nextRetry);
earliestReadyIn = std::min<Duration>(earliestReadyIn, nextTimeout);
// if(earliestReadyIn == Duration::Infinite())
// {
// IWARNING() << "Earliest ready time FOREVER. isExecuting = " << status.IsExecuting()
// << ", nextExecution = " << nextExecution << ", nextRetry = " << nextRetry << ", nextTimeout = " << nextTimeout;
// }
{
//IDEBUG() << "earliestReadyIn = " << earliestReadyIn << ". isExecuting = " << status.IsExecuting()
//<< ", nextExecution = " << nextExecution << ", nextRetry = " << nextRetry << ", nextTimeout = " << nextTimeout;
}
if(status.IsFalseStart() && earliestReadyIn <= Duration::Zero())
{
earliestReadyIn = ComputeExponentialBackoff::Perform(status, retryInterval);
//IWARNING() << "False start - backing off and making new attempt in " << earliestReadyIn << " ms";
}
// --------------------------------------------
// Post conditions
// --------------------------------------------
if(earliestReadyIn <= Duration::Zero())
{
ASSERT(!status.IsSuspended());
if(nextTimeout <= Duration::zero())
{
ASSERT(status.IsExecuting());
}
else
{
ASSERT(!status.IsExecuting());
ASSERT(IsReadyToExecute::Perform(status, attempt, interval, retryInterval));
}
//IDEBUG() << "Ready NOW! earliestReadyIn = " << earliestReadyIn << ". isExecuting = " << status.IsExecuting() << ", nextExecution = " << nextExecution << ", nextRetry = " << nextRetry << ", nextTimeout = " << nextTimeout;
}
return earliestReadyIn;
}
Duration ComputeExponentialBackoff::Perform(const Status::ExecutionStatus& status, const Policy::Interval& retryInterval)
{
return std::max(status.Count().NumConsecutiveFailures().Clone() * (int) retryInterval.Period().InMillis(), status.Count().NumFalseStarts().Clone() * 1000);
}
bool IsLifetimePolicyViolated::Perform(const Status::ExecutionStatus& status, const Policy::Attempt& attempt)
{
if(status.Count().TotalNumAttempts() > attempt.MaxNumAttempts())
{
return true;
}
else if(status.Count().NumSuccesses() > attempt.MinNumSuccesses())
{
return true;
}
return false;
}
bool IsIntervalPolicyViolated::Perform(const Status::ExecutionStatus& status, const Policy::Interval& interval)
{
if(status.IsSuspended())
{
return false;
}
else if(status.IsNeverExecuted())
{
if(status.Time().TimeSinceLastExecutionTime() > interval.Initial())
{
return true;
}
}
else
{
if(status.Time().TimeSinceLastExecutionTime() > interval.Period())
{
return true;
}
}
return false;
}
bool IsTimeoutPolicyViolated::Perform(const Status::ExecutionStatus& status, const Policy::Timeout& timeout)
{
return status.IsExecuting() && status.Time().TimeSinceLastExecutionTime() > timeout.delegate();
}
bool IsPolicyViolated::Perform(
const Status::ExecutionStatus& status,
const Policy::Interval& interval,
const Policy::Timeout& timeout,
const Policy::Attempt& attempt
)
{
if(IsIntervalPolicyViolated::Perform(status, interval))
{
return true;
}
else if(IsTimeoutPolicyViolated::Perform(status, timeout))
{
return true;
}
else if(IsLifetimePolicyViolated::Perform(status, attempt))
{
return true;
}
return false;
}
bool IsCriterionMet::Perform(const Status::ExecutionStatus& status, const Policy::Criterion& successCriterion)
{
if(successCriterion.IsAll())
{
if(status.Count().NumFailures() > 0)
{
return false;
}
}
else if(successCriterion.IsMinimum())
{
if(status.Count().NumFailures() > successCriterion.Limit().Limit())
{
return false;
}
}
// Note! Unconditional criterion is always true
return true;
}
}}