rippled
Loading...
Searching...
No Matches
BasicNetwork_test.cpp
1#include <test/csf/BasicNetwork.h>
2#include <test/csf/Scheduler.h>
3
4#include <xrpl/beast/unit_test.h>
5
6#include <set>
7#include <vector>
8
9namespace xrpl {
10namespace test {
11
13{
14public:
15 struct Peer
16 {
17 int id;
19
20 Peer(Peer const&) = default;
21 Peer(Peer&&) = default;
22
23 explicit Peer(int id_) : id(id_)
24 {
25 }
26
27 template <class Net>
28 void
29 start(csf::Scheduler& scheduler, Net& net)
30 {
31 using namespace std::chrono_literals;
32 auto t = scheduler.in(1s, [&] { set.insert(0); });
33 if (id == 0)
34 {
35 for (auto const link : net.links(this))
36 net.send(this, link.target, [&, to = link.target] { to->receive(net, this, 1); });
37 }
38 else
39 {
40 scheduler.cancel(t);
41 }
42 }
43
44 template <class Net>
45 void
46 receive(Net& net, Peer* from, int m)
47 {
48 set.insert(m);
49 ++m;
50 if (m < 5)
51 {
52 for (auto const link : net.links(this))
53 net.send(this, link.target, [&, mm = m, to = link.target] { to->receive(net, this, mm); });
54 }
55 }
56 };
57
58 void
60 {
61 using namespace std::chrono_literals;
63 pv.emplace_back(0);
64 pv.emplace_back(1);
65 pv.emplace_back(2);
66 csf::Scheduler scheduler;
67 csf::BasicNetwork<Peer*> net(scheduler);
68 BEAST_EXPECT(!net.connect(&pv[0], &pv[0]));
69 BEAST_EXPECT(net.connect(&pv[0], &pv[1], 1s));
70 BEAST_EXPECT(net.connect(&pv[1], &pv[2], 1s));
71 BEAST_EXPECT(!net.connect(&pv[0], &pv[1]));
72 for (auto& peer : pv)
73 peer.start(scheduler, net);
74 BEAST_EXPECT(scheduler.step_for(0s));
75 BEAST_EXPECT(scheduler.step_for(1s));
76 BEAST_EXPECT(scheduler.step());
77 BEAST_EXPECT(!scheduler.step());
78 BEAST_EXPECT(!scheduler.step_for(1s));
79 net.send(&pv[0], &pv[1], [] {});
80 net.send(&pv[1], &pv[0], [] {});
81 BEAST_EXPECT(net.disconnect(&pv[0], &pv[1]));
82 BEAST_EXPECT(!net.disconnect(&pv[0], &pv[1]));
83 for (;;)
84 {
85 auto const links = net.links(&pv[1]);
86 if (links.empty())
87 break;
88 BEAST_EXPECT(net.disconnect(&pv[1], links[0].target));
89 }
90 BEAST_EXPECT(pv[0].set == std::set<int>({0, 2, 4}));
91 BEAST_EXPECT(pv[1].set == std::set<int>({1, 3}));
92 BEAST_EXPECT(pv[2].set == std::set<int>({2, 4}));
93 }
94
95 void
97 {
98 using namespace std::chrono_literals;
99 csf::Scheduler scheduler;
100 csf::BasicNetwork<int> net(scheduler);
101 BEAST_EXPECT(net.connect(0, 1, 1s));
102 BEAST_EXPECT(net.connect(0, 2, 2s));
103
104 std::set<int> delivered;
105 net.send(0, 1, [&]() { delivered.insert(1); });
106 net.send(0, 2, [&]() { delivered.insert(2); });
107
108 scheduler.in(1000ms, [&]() { BEAST_EXPECT(net.disconnect(0, 2)); });
109 scheduler.in(1100ms, [&]() { BEAST_EXPECT(net.connect(0, 2)); });
110
111 scheduler.step();
112
113 // only the first message is delivered because the disconnect at 1 s
114 // purges all pending messages from 0 to 2
115 BEAST_EXPECT(delivered == std::set<int>({1}));
116 }
117
118 void
119 run() override
120 {
121 testNetwork();
122 testDisconnect();
123 }
124};
125
126BEAST_DEFINE_TESTSUITE(BasicNetwork, csf, xrpl);
127
128} // namespace test
129} // namespace xrpl
A testsuite class.
Definition suite.h:52
void run() override
Runs the suite.
Peer to peer network simulator.
bool connect(Peer const &from, Peer const &to, duration const &delay=std::chrono::seconds{0})
Connect two peers.
auto links(Peer const &from)
Return the range of active links.
bool disconnect(Peer const &peer1, Peer const &peer2)
Break a link.
void send(Peer const &from, Peer const &to, Function &&f)
Send a message to a peer.
Simulated discrete-event scheduler.
cancel_token in(duration const &delay, Function &&f)
Schedule an event after a specified duration passes.
bool step()
Run the scheduler until no events remain.
bool step_for(std::chrono::duration< Period, Rep > const &amount)
Run the scheduler until time has elapsed.
T emplace_back(T... args)
T insert(T... args)
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition algorithm.h:6
bool set(T &target, std::string const &name, Section const &section)
Set a value from a configuration Section If the named value is not found or doesn't parse as a T,...
void receive(Net &net, Peer *from, int m)
void start(csf::Scheduler &scheduler, Net &net)