123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113 |
- #include "DHTRoutingTable.h"
- #include <cstring>
- #include <cppunit/extensions/HelperMacros.h>
- #include "Exception.h"
- #include "util.h"
- #include "DHTNode.h"
- #include "DHTBucket.h"
- #include "MockDHTTaskQueue.h"
- #include "MockDHTTaskFactory.h"
- #include "DHTTask.h"
- namespace aria2 {
- class DHTRoutingTableTest:public CppUnit::TestFixture {
- CPPUNIT_TEST_SUITE(DHTRoutingTableTest);
- CPPUNIT_TEST(testAddNode);
- CPPUNIT_TEST(testAddNode_localNode);
- CPPUNIT_TEST(testGetClosestKNodes);
- CPPUNIT_TEST_SUITE_END();
- public:
- void setUp() {}
- void tearDown() {}
- void testAddNode();
- void testAddNode_localNode();
- void testGetClosestKNodes();
- };
- CPPUNIT_TEST_SUITE_REGISTRATION(DHTRoutingTableTest);
- void DHTRoutingTableTest::testAddNode()
- {
- SharedHandle<DHTNode> localNode(new DHTNode());
- DHTRoutingTable table(localNode);
- SharedHandle<MockDHTTaskFactory> taskFactory(new MockDHTTaskFactory());
- table.setTaskFactory(taskFactory);
- SharedHandle<MockDHTTaskQueue> taskQueue(new MockDHTTaskQueue());
- table.setTaskQueue(taskQueue);
- uint32_t count = 0;
- for(int i = 0; i < 100; ++i) {
- SharedHandle<DHTNode> node(new DHTNode());
- if(table.addNode(node)) {
- ++count;
- }
- }
- table.showBuckets();
- }
- void DHTRoutingTableTest::testAddNode_localNode()
- {
- SharedHandle<DHTNode> localNode(new DHTNode());
- DHTRoutingTable table(localNode);
- SharedHandle<MockDHTTaskFactory> taskFactory(new MockDHTTaskFactory());
- table.setTaskFactory(taskFactory);
- SharedHandle<MockDHTTaskQueue> taskQueue(new MockDHTTaskQueue());
- table.setTaskQueue(taskQueue);
- SharedHandle<DHTNode> newNode(new DHTNode(localNode->getID()));
- CPPUNIT_ASSERT(!table.addNode(newNode));
- }
- namespace {
- void createID(unsigned char* id, unsigned char firstChar, unsigned char lastChar)
- {
- memset(id, 0, DHT_ID_LENGTH);
- id[0] = firstChar;
- id[DHT_ID_LENGTH-1] = lastChar;
- }
- } // namespace
- void DHTRoutingTableTest::testGetClosestKNodes()
- {
- unsigned char id[DHT_ID_LENGTH];
- createID(id, 0x81, 0);
- SharedHandle<DHTNode> localNode(new DHTNode(id));
- DHTRoutingTable table(localNode);
- SharedHandle<DHTNode> nodes1[8];
- SharedHandle<DHTNode> nodes2[8];
- SharedHandle<DHTNode> nodes3[8];
- for(size_t i = 0; i < DHTBucket::K; ++i) {
- createID(id, 0xf0, i);
- nodes1[i].reset(new DHTNode(id));
- CPPUNIT_ASSERT(table.addNode(nodes1[i]));
- }
- for(size_t i = 0; i < DHTBucket::K; ++i) {
- createID(id, 0x80, i);
- nodes2[i].reset(new DHTNode(id));
- CPPUNIT_ASSERT(table.addNode(nodes2[i]));
- }
- for(size_t i = 0; i < DHTBucket::K; ++i) {
- createID(id, 0x70, i);
- nodes3[i].reset(new DHTNode(id));
- CPPUNIT_ASSERT(table.addNode(nodes3[i]));
- }
- {
- createID(id, 0x80, 0x10);
- std::vector<SharedHandle<DHTNode> > nodes;
- table.getClosestKNodes(nodes, id);
- CPPUNIT_ASSERT_EQUAL((size_t)8, nodes.size());
- for(size_t i = 0; i < nodes.size(); ++i) {
- CPPUNIT_ASSERT(memcmp(nodes2[0]->getID(), nodes[0]->getID(), DHT_ID_LENGTH) == 0);
- }
- }
- }
- } // namespace aria2
|