solidity/main.cpp

93 lines
2.2 KiB
C++
Raw Normal View History

/*
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
2014-02-16 10:41:15 +00:00
along with cpp-ethereum. If not, see <http://www.gnu.org/licenses/>.
*/
/** @file main.cpp
* @author Gav Wood <i@gavwood.com>
* @date 2014
* Main test functions.
*/
2014-05-28 09:52:42 +00:00
#include <libethsupport/TrieDB.h>
#include "TrieHash.h"
#include "MemTrie.h"
2014-03-19 04:35:16 +00:00
#include <boost/test/unit_test.hpp>
2014-01-19 14:42:02 +00:00
int trieTest();
int rlpTest();
int daggerTest();
int cryptoTest();
int stateTest();
int vmTest();
2014-01-19 14:42:02 +00:00
int hexPrefixTest();
2014-01-22 14:08:18 +00:00
int peerTest(int argc, char** argv);
2014-01-19 14:42:02 +00:00
#include <libethsupport/Log.h>
#include <libethcore/BlockInfo.h>
2014-05-13 22:00:44 +00:00
using namespace std;
2014-02-01 15:00:17 +00:00
using namespace eth;
2014-03-19 04:35:16 +00:00
BOOST_AUTO_TEST_CASE(basic_tests)
2014-01-03 01:27:19 +00:00
{
cdebug << "Stress-testing Trie...";
2014-05-28 09:52:42 +00:00
{
BasicMap m;
EnforceRefs e(m, true);
2014-05-28 09:52:42 +00:00
GenericTrieDB<BasicMap> d(&m);
d.init(); // initialise as empty tree.
MemTrie t;
assert(d.check().empty());
for (int a = 0; a < 100; ++a)
2014-05-28 09:52:42 +00:00
{
StringMap m;
for (int i = 0; i < 100; ++i)
2014-05-28 09:52:42 +00:00
{
auto k = randomWord();
auto v = toString(i);
m.insert(make_pair(k, v));
t.insert(k, v);
d.insert(k, v);
assert(hash256(m) == t.hash256());
assert(hash256(m) == d.root());
assert(d.check().empty());
2014-05-28 09:52:42 +00:00
}
while (!m.empty())
{
auto k = m.begin()->first;
d.remove(k);
t.remove(k);
m.erase(k);
assert(hash256(m) == t.hash256());
assert(hash256(m) == d.root());
assert(d.check().empty());
2014-05-28 09:52:42 +00:00
}
}
}
2014-05-13 22:00:44 +00:00
/* RLPStream s;
2014-02-01 15:00:17 +00:00
BlockInfo::genesis().fillStream(s, false);
std::cout << RLP(s.out()) << std::endl;
2014-03-04 17:46:26 +00:00
std::cout << toHex(s.out()) << std::endl;
std::cout << sha3(s.out()) << std::endl;*/
2014-02-01 15:00:17 +00:00
// int r = 0;
2014-02-28 12:55:30 +00:00
// r += daggerTest();
// r += stateTest();
// r += peerTest(argc, argv);
// BOOST_REQUIRE(!r);
2014-01-03 01:27:19 +00:00
}