aboutsummaryrefslogtreecommitdiffstats
path: root/net.cpp
blob: d5113b8b423e05c168f0d1d98741288b0c96682d (plain) (blame)
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
/*
    This file is part of cpp-ethereum.

    cpp-ethereum is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    cpp-ethereum is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with cpp-ethereum.  If not, see <http://www.gnu.org/licenses/>.
*/
/** @file net.cpp
 * @author Alex Leverington <nessence@gmail.com>
 * @date 2014
 */

#include <boost/test/unit_test.hpp>
#include <libdevcore/Worker.h>
#include <libdevcrypto/Common.h>
#include <libp2p/UDP.h>
#include <libp2p/NodeTable.h>
using namespace std;
using namespace dev;
using namespace dev::p2p;
namespace ba = boost::asio;
namespace bi = ba::ip;

BOOST_AUTO_TEST_SUITE(p2p)

/**
 * Only used for testing. Not useful beyond tests.
 */
class TestHost: public Worker
{
public:
    TestHost(): Worker("test",0), m_io() {};
    virtual ~TestHost() { m_io.stop(); stopWorking(); }
    void start() { startWorking(); }
    void doWork() { m_io.run(); }
    void doneWorking() { m_io.reset(); m_io.poll(); m_io.reset(); }
    
protected:
    ba::io_service m_io;
};

struct TestNodeTable: public NodeTable
{
    /// Constructor
    using NodeTable::NodeTable;
    
    void pingAll(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes)
    {
        bi::address ourIp = bi::address::from_string("127.0.0.1");
        for (auto& n: _testNodes)
        {
            ping(bi::udp::endpoint(ourIp, n.second));
            this_thread::sleep_for(chrono::milliseconds(5));
        }
    }
    
    void populate(std::vector<std::pair<KeyPair,unsigned>> const& _testNodes, size_t _count = 0)
    {
        if (!_count)
            _count = _testNodes.size();

        bi::address ourIp = bi::address::from_string("127.0.0.1");
        for (auto& n: _testNodes)
            if (_count--)
                noteNode(n.first.pub(), bi::udp::endpoint(ourIp, n.second));
            else
                break;
    }
    
    void reset()
    {
        Guard l(x_state);
        for (auto& n: m_state) n.nodes.clear();
    }
};

/**
 * Only used for testing. Not useful beyond tests.
 */
struct TestNodeTableHost: public TestHost
{
    TestNodeTableHost(): m_alias(KeyPair::create()), nodeTable(new TestNodeTable(m_io, m_alias)) {};
    ~TestNodeTableHost() { m_io.stop(); stopWorking(); }
    
    void generateTestNodes(int _count = 16)
    {
        asserts(_count < 1000);
        static uint16_t s_basePort = 30500;
        
        m_testNodes.clear();
        for (auto i = 0; i < _count; i++)
        {
            KeyPair k = KeyPair::create();
            m_testNodes.push_back(make_pair(k,s_basePort+i));
            testNodes.push_back(make_shared<TestNodeTable>(m_io,k,s_basePort+i));
        }
    }
    std::vector<std::pair<KeyPair,unsigned>> m_testNodes; // keypair and port

    void setup()
    {
        generateTestNodes();
    }
    
    void pingAll()
    {
        nodeTable->pingAll(m_testNodes);
//      for (auto& n: testNodes)
//          n->pingAll(m_testNodes);
    }
    
    void populate(size_t _count = 0)
    {
        nodeTable->populate(m_testNodes, _count);
    }
    
    KeyPair m_alias;
    shared_ptr<TestNodeTable> nodeTable;
    std::vector<shared_ptr<TestNodeTable>> testNodes;
};

class TestUDPSocket: UDPSocketEvents, public TestHost
{
public:
    TestUDPSocket(): m_socket(new UDPSocket<TestUDPSocket, 1024>(m_io, *this, 30300)) {}

    void onDisconnected(UDPSocketFace*) {};
    void onReceived(UDPSocketFace*, bi::udp::endpoint const&, bytesConstRef _packet) { if (_packet.toString() == "AAAA") success = true; }

    shared_ptr<UDPSocket<TestUDPSocket, 1024>> m_socket;
    
    bool success = false;
};

BOOST_AUTO_TEST_CASE(test_findnode_neighbors)
{
    // Executing findNode should result in a list which is serialized
    // into Neighbors packet. Neighbors packet should then be deserialized
    // into the same list of nearest nodes.
}

BOOST_AUTO_TEST_CASE(kademlia)
{
    TestNodeTableHost node;
    node.start();
    node.nodeTable->join(); // ideally, joining with empty node table logs warning we can check for
    node.setup();
    node.pingAll();
    clog << "NodeTable:\n" << *node.nodeTable.get() << endl;
    this_thread::sleep_for(chrono::milliseconds(10000));
    
    node.nodeTable->reset();
    clog << "NodeTable:\n" << *node.nodeTable.get() << endl;

    node.populate(2);
    clog << "NodeTable:\n" << *node.nodeTable.get() << endl;
    this_thread::sleep_for(chrono::milliseconds(500));
    
//  node.nodeTable->join();
//  this_thread::sleep_for(chrono::milliseconds(2000));
//  
//  clog << "NodeTable:\n" << *node.nodeTable.get() << endl;
}

BOOST_AUTO_TEST_CASE(test_udp_once)
{
    UDPDatagram d(bi::udp::endpoint(boost::asio::ip::address::from_string("127.0.0.1"), 30300), bytes({65,65,65,65}));
    TestUDPSocket a; a.m_socket->connect(); a.start();
    a.m_socket->send(d);
    sleep(1);
    BOOST_REQUIRE_EQUAL(true, a.success);
}

BOOST_AUTO_TEST_SUITE_END()