solidity/main.cpp

/*
	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 main.cpp
 * @author Gav Wood <i@gavwood.com>
 * @date 2014
 * Main test functions.
 */

#include <libethsupport/TrieDB.h>
#include "TrieHash.h"
#include "MemTrie.h"

#include <boost/test/unit_test.hpp>

int trieTest();
int rlpTest();
int daggerTest();
int cryptoTest();
int stateTest();
int vmTest();
int hexPrefixTest();
int peerTest(int argc, char** argv);

#include <libethsupport/Log.h>
#include <libethcore/BlockInfo.h>
using namespace std;
using namespace eth;

BOOST_AUTO_TEST_CASE(basic_tests)
{
	cdebug << "Stress-testing Trie...";
	{
		BasicMap m;
		BasicMap dm;
		EnforceRefs e(dm, true);
		GenericTrieDB<BasicMap> d(&dm);
		d.init();	// initialise as empty tree.
		MemTrie t;
		BOOST_REQUIRE(d.check());
		for (int a = 0; a < 100; ++a)
		{
			StringMap m;
			for (int i = 0; i < 100; ++i)
			{
				auto k = randomWord();
				auto v = toString(i);
				cdebug << k << v;
				m[k] = v;
				t.insert(k, v);
				d.insert(k, v);
				BOOST_REQUIRE_EQUAL(hash256(m), t.hash256());
				BOOST_REQUIRE_EQUAL(hash256(m), d.root());
				BOOST_REQUIRE(d.check());
			}
			while (!m.empty())
			{
				auto k = m.begin()->first;
				auto v = m.begin()->second;
				cdebug << k << m.size();
				d.remove(k);
				t.remove(k);
				m.erase(k);
				if (!d.check())
				{
					cwarn << m;
					for (auto i: d)
						cwarn << i.first.toString() << i.second.toString();

					BasicMap dm2;
					EnforceRefs e2(dm2, true);
					GenericTrieDB<BasicMap> d2(&dm2);
					d2.init();	// initialise as empty tree.
					for (auto i: d)
						d2.insert(i.first, i.second);

					cwarn << "Good:" << d2.root();
					for (auto i: dm2.get())
						cwarn << i.first.abridged() << ": " << RLP(i.second);
					cwarn << "Broken:" << d.root();	// Leaves an extension -> extension (3c1... -> 742...)
					for (auto i: dm.get())
						cwarn << i.first.abridged() << ": " << RLP(i.second);

					d2.insert(k, v);
					cwarn << "Pres:" << d2.root();
					for (auto i: dm2.get())
						cwarn << i.first.abridged() << ": " << RLP(i.second);
					g_logVerbosity = 99;
					d2.remove(k);
					g_logVerbosity = 4;

					cwarn << "Good?" << d2.root();
				}
				BOOST_REQUIRE(d.check());
				BOOST_REQUIRE_EQUAL(hash256(m), t.hash256());
				BOOST_REQUIRE_EQUAL(hash256(m), d.root());
			}
		}
	}

/*	RLPStream s;
	BlockInfo::genesis().fillStream(s, false);
	std::cout << RLP(s.out()) << std::endl;
	std::cout << toHex(s.out()) << std::endl;
	std::cout << sha3(s.out()) << std::endl;*/

//	int r = 0;
//	r += daggerTest();
//	r += stateTest();
//	r += peerTest(argc, argv);
//	BOOST_REQUIRE(!r);
}