|
|
|
// Copyright 2021 The go-ethereum Authors
|
|
|
|
// This file is part of go-ethereum.
|
|
|
|
//
|
|
|
|
// go-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.
|
|
|
|
//
|
|
|
|
// go-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 go-ethereum. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
package ethtest
|
|
|
|
|
|
|
|
import (
|
|
|
|
"os"
|
|
|
|
"testing"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/ethereum/go-ethereum/eth"
|
|
|
|
"github.com/ethereum/go-ethereum/eth/ethconfig"
|
|
|
|
"github.com/ethereum/go-ethereum/internal/utesting"
|
|
|
|
"github.com/ethereum/go-ethereum/node"
|
|
|
|
"github.com/ethereum/go-ethereum/p2p"
|
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
genesisFile = "./testdata/genesis.json"
|
|
|
|
halfchainFile = "./testdata/halfchain.rlp"
|
|
|
|
fullchainFile = "./testdata/chain.rlp"
|
|
|
|
)
|
|
|
|
|
|
|
|
func TestEthSuite(t *testing.T) {
|
|
|
|
geth, err := runGeth()
|
|
|
|
if err != nil {
|
|
|
|
t.Fatalf("could not run geth: %v", err)
|
|
|
|
}
|
|
|
|
defer geth.Close()
|
|
|
|
|
|
|
|
suite, err := NewSuite(geth.Server().Self(), fullchainFile, genesisFile)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatalf("could not create new test suite: %v", err)
|
|
|
|
}
|
|
|
|
for _, test := range suite.EthTests() {
|
|
|
|
t.Run(test.Name, func(t *testing.T) {
|
|
|
|
result := utesting.RunTAP([]utesting.Test{{Name: test.Name, Fn: test.Fn}}, os.Stdout)
|
|
|
|
if result[0].Failed {
|
|
|
|
t.Fatal()
|
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSnapSuite(t *testing.T) {
|
|
|
|
geth, err := runGeth()
|
|
|
|
if err != nil {
|
|
|
|
t.Fatalf("could not run geth: %v", err)
|
|
|
|
}
|
|
|
|
defer geth.Close()
|
|
|
|
|
|
|
|
suite, err := NewSuite(geth.Server().Self(), fullchainFile, genesisFile)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatalf("could not create new test suite: %v", err)
|
|
|
|
}
|
|
|
|
for _, test := range suite.SnapTests() {
|
|
|
|
t.Run(test.Name, func(t *testing.T) {
|
|
|
|
result := utesting.RunTAP([]utesting.Test{{Name: test.Name, Fn: test.Fn}}, os.Stdout)
|
|
|
|
if result[0].Failed {
|
|
|
|
t.Fatal()
|
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// runGeth creates and starts a geth node
|
|
|
|
func runGeth() (*node.Node, error) {
|
|
|
|
stack, err := node.New(&node.Config{
|
|
|
|
P2P: p2p.Config{
|
|
|
|
ListenAddr: "127.0.0.1:0",
|
|
|
|
NoDiscovery: true,
|
|
|
|
MaxPeers: 10, // in case a test requires multiple connections, can be changed in the future
|
|
|
|
NoDial: true,
|
|
|
|
},
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
err = setupGeth(stack)
|
|
|
|
if err != nil {
|
|
|
|
stack.Close()
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if err = stack.Start(); err != nil {
|
|
|
|
stack.Close()
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return stack, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func setupGeth(stack *node.Node) error {
|
|
|
|
chain, err := loadChain(halfchainFile, genesisFile)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
backend, err := eth.New(stack, ðconfig.Config{
|
cmd, core, eth, graphql, trie: no persisted clean trie cache file (#27525)
The clean trie cache is persisted periodically, therefore Geth can
quickly warmup the cache in next restart.
However it will reduce the robustness of system. The assumption is
held in Geth that if the parent trie node is present, then the entire
sub-trie associated with the parent are all prensent.
Imagine the scenario that Geth rewinds itself to a past block and
restart, but Geth finds the root node of "future state" in clean
cache then regard this state is present in disk, while is not in fact.
Another example is offline pruning tool. Whenever an offline pruning
is performed, the clean cache file has to be removed to aviod hitting
the root node of "deleted states" in clean cache.
All in all, compare with the minor performance gain, system robustness
is something we care more.
1 year ago
|
|
|
Genesis: &chain.genesis,
|
|
|
|
NetworkId: chain.genesis.Config.ChainID.Uint64(), // 19763
|
|
|
|
DatabaseCache: 10,
|
|
|
|
TrieCleanCache: 10,
|
|
|
|
TrieDirtyCache: 16,
|
|
|
|
TrieTimeout: 60 * time.Minute,
|
|
|
|
SnapshotCache: 10,
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
_, err = backend.BlockChain().InsertChain(chain.blocks[1:])
|
|
|
|
return err
|
|
|
|
}
|