-
Notifications
You must be signed in to change notification settings - Fork 8
/
testreorder.cpp
76 lines (59 loc) · 2.14 KB
/
testreorder.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
#include <cassert>
#include <cstdio>
#include "rtmfp/RunLoops.hpp"
#include "rtmfp/ReorderBuffer.hpp"
using namespace com::zenomt;
using namespace com::zenomt::rtmfp;
int main(int argc, char **argv)
{
SelectRunLoop rl; // intentionally keep SelectRunLoop so there's at least one test for it on Linux
size_t lateCount = 0;
size_t receivedCount = 0;
RunLoopReorderBuffer reorder(&rl, 1);
reorder.onMessage = [&] (const uint8_t *bytes, size_t len, uintmax_t sequenceNumber, size_t fragmentCount, bool isLate) {
uintmax_t highest = sequenceNumber + fragmentCount - 1;
printf("onMessage %lu to %lu%s at %f\n", (unsigned long)sequenceNumber, (unsigned long)highest, isLate ? " late" : "", (double)rl.getCurrentTime());
if(isLate)
lateCount++;
receivedCount++;
};
uint8_t msg[] = "hi there";
reorder.insert(msg, sizeof(msg), 4, 2);
reorder.insert(msg, sizeof(msg), 3, 1);
assert(0 == receivedCount);
reorder.insert(msg, sizeof(msg), 1, 2);
assert(3 == receivedCount);
reorder.insert(msg, sizeof(msg), 6, 1);
assert(4 == receivedCount);
reorder.insert(msg, sizeof(msg), 10, 1);
reorder.insert(msg, sizeof(msg), 8, 2);
assert(4 == receivedCount);
assert(0 == lateCount);
rl.schedule(0.5)->action = [&] (const std::shared_ptr<Timer> &sender, Time now) {
reorder.insert(msg, sizeof(msg), 12, 1);
reorder.insert(msg, sizeof(msg), 14, 1);
};
rl.schedule(0.7)->action = [&] (const std::shared_ptr<Timer> &sender, Time now) {
reorder.insert(msg, sizeof(msg), 15, 1); // should be delivered with 12 & 14
};
rl.schedule(1.1)->action = [&] (const std::shared_ptr<Timer> &sender, Time now) {
assert(6 == receivedCount);
assert(0 == lateCount);
reorder.insert(msg, sizeof(msg), 7, 1);
assert(7 == receivedCount);
assert(1 == lateCount);
};
rl.schedule(1.6)->action = [&] (const std::shared_ptr<Timer> &sender, Time now) {
assert(10 == receivedCount);
assert(1 == lateCount);
};
rl.schedule(1.8)->action = [&] (const std::shared_ptr<Timer> &sender, Time now) {
reorder.insert(msg, sizeof(msg), 18, 1);
};
rl.run(2);
assert(10 == receivedCount);
reorder.flush();
assert(11 == receivedCount);
assert(1 == lateCount);
return 0;
}