mirror/erigon-pulse
1
0
Fork 0
mirror of https://gitlab.com/pulsechaincom/erigon-pulse.git synced 2024-12-21 19:20:39 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

turbo: run tests in parallel (#8738)

Browse Source 
Tests that don't affect each other should run in parallel
This commit is contained in:
Håvard Anda Estensen 2023-11-16 12:29:31 +03:00 committed by GitHub
parent def2457b1c
commit 4873502818
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
11 changed files with 62 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
turbo/builder/latest_block_built_test.go
View File

@ -8,6 +8,7 @@ import (
)
func TestLatestBlockBuilt(t *testing.T) {
t.Parallel()
s := NewLatestBlockBuiltStore()
b := types.NewBlockWithHeader(&types.Header{})
s.AddBlockBuilt(b)

1
turbo/rlphacks/bytes_test.go
View File

@ -10,6 +10,7 @@ import (
)
func TestFastDoubleRlpForByteArrays(t *testing.T) {
t.Parallel()
for i := 0; i < 256; i++ {
doTestWithByte(t, byte(i), 1)
}

1
turbo/rpchelper/filters_deadlock_test.go
View File

@ -16,6 +16,7 @@ import (
)
func TestFiltersDeadlock_Test(t *testing.T) {
t.Parallel()
logger := log.New()
f := rpchelper.New(context.TODO(), nil, nil, nil, func() {}, logger)
crit := filters.FilterCriteria{

6
turbo/rpchelper/filters_test.go
View File

@ -36,6 +36,7 @@ var (
)
func TestFilters_GenerateSubscriptionID(t *testing.T) {
t.Parallel()
sz := 1000
subs := make(chan SubscriptionID, sz)
for i := 0; i < sz; i++ {
@ -56,6 +57,7 @@ func TestFilters_GenerateSubscriptionID(t *testing.T) {
}
func TestFilters_SingleSubscription_OnlyTopicsSubscribedAreBroadcast(t *testing.T) {
t.Parallel()
f := New(context.TODO(), nil, nil, nil, func() {}, log.New())
subbedTopic := libcommon.BytesToHash([]byte{10, 20})
@ -87,6 +89,7 @@ func TestFilters_SingleSubscription_OnlyTopicsSubscribedAreBroadcast(t *testing.
}
func TestFilters_SingleSubscription_EmptyTopicsInCriteria_OnlyTopicsSubscribedAreBroadcast(t *testing.T) {
t.Parallel()
f := New(context.TODO(), nil, nil, nil, func() {}, log.New())
var nilTopic libcommon.Hash
@ -119,6 +122,7 @@ func TestFilters_SingleSubscription_EmptyTopicsInCriteria_OnlyTopicsSubscribedAr
}
func TestFilters_TwoSubscriptionsWithDifferentCriteria(t *testing.T) {
t.Parallel()
f := New(context.TODO(), nil, nil, nil, func() {}, log.New())
criteria1 := filters.FilterCriteria{
@ -158,6 +162,7 @@ func TestFilters_TwoSubscriptionsWithDifferentCriteria(t *testing.T) {
}
func TestFilters_ThreeSubscriptionsWithDifferentCriteria(t *testing.T) {
t.Parallel()
f := New(context.TODO(), nil, nil, nil, func() {}, log.New())
criteria1 := filters.FilterCriteria{
@ -226,6 +231,7 @@ func TestFilters_ThreeSubscriptionsWithDifferentCriteria(t *testing.T) {
}
func TestFilters_SubscribeLogsGeneratesCorrectLogFilterRequest(t *testing.T) {
t.Parallel()
var lastFilterRequest *remote.LogsFilterRequest
loadRequester := func(r *remote.LogsFilterRequest) error {
lastFilterRequest = r

14
turbo/shards/state_cache_test.go
View File

@ -14,6 +14,7 @@ import (
)
func TestCacheBtreeOrderAccountStorage2(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(128*accountItemSize))
var a1 libcommon.Address
a1[0] = 1
@ -25,6 +26,7 @@ func TestCacheBtreeOrderAccountStorage2(t *testing.T) {
}
func TestCacheBtreeOrderAccountStorage(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(128*accountItemSize))
var a1, a2 libcommon.Address
a1[0] = 1
@ -79,6 +81,7 @@ func TestCacheBtreeOrderAccountStorage(t *testing.T) {
}
func TestAccountReads(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(4*accountItemSize))
var account1 accounts.Account
account1.Balance.SetUint64(1)
@ -123,6 +126,7 @@ func TestAccountReads(t *testing.T) {
}
func TestAccountReadWrites(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(9*accountItemSize))
var account1 accounts.Account
account1.Balance.SetUint64(1)
@ -219,6 +223,7 @@ func TestAccountReadWrites(t *testing.T) {
}
func TestReplaceAccountReadsWithWrites(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(6*accountItemSize))
for i := 1; i <= 4; i++ {
var addr libcommon.Address
@ -268,6 +273,7 @@ func TestReplaceAccountReadsWithWrites(t *testing.T) {
}
func TestReadAccountExisting(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*accountItemSize))
var account1 accounts.Account
account1.Balance.SetUint64(1)
@ -283,6 +289,7 @@ func TestReadAccountExisting(t *testing.T) {
}
func TestWriteAccountExceedLimit(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*accountItemSize))
defer func() {
//nolint:staticcheck
@ -299,6 +306,7 @@ func TestWriteAccountExceedLimit(t *testing.T) {
}
func TestGetDeletedAccount(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(4*accountItemSize))
var account1 accounts.Account
account1.Balance.SetUint64(1)
@ -324,6 +332,7 @@ func TestGetDeletedAccount(t *testing.T) {
}
func TestReadWriteAbsentDeleteStorage(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(4*storageItemSize))
// Add absents
for i := 1; i <= 4; i++ {
@ -423,6 +432,7 @@ func TestReadWriteAbsentDeleteStorage(t *testing.T) {
}
func TestReadStorageExisting(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*storageItemSize))
var addr1 libcommon.Address
addr1[0] = 1
@ -440,6 +450,7 @@ func TestReadStorageExisting(t *testing.T) {
}
func TestWriteStorageExceedLimit(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*storageItemSize))
defer func() {
//nolint:staticcheck
@ -458,6 +469,7 @@ func TestWriteStorageExceedLimit(t *testing.T) {
}
func TestCodeReadWriteAbsentDelete(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(4*(codeItemSize+3)))
// Add absents
for i := 1; i <= 4; i++ {
@ -537,6 +549,7 @@ func TestCodeReadWriteAbsentDelete(t *testing.T) {
}
func TestReadCodeExisting(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*(codeItemSize+3)))
var addr1 libcommon.Address
addr1[0] = 1
@ -552,6 +565,7 @@ func TestReadCodeExisting(t *testing.T) {
}
func TestWriteCodeExceedLimit(t *testing.T) {
t.Parallel()
sc := NewStateCache(32, datasize.ByteSize(2*(codeItemSize+3)))
defer func() {
//nolint:staticcheck

29
turbo/stages/blockchain_test.go
View File

@ -21,11 +21,12 @@ import (
"encoding/binary"
"errors"
"fmt"
"github.com/ledgerwatch/erigon-lib/common/hexutil"
"math"
"math/big"
"testing"
"github.com/ledgerwatch/erigon-lib/common/hexutil"
"github.com/holiman/uint256"
"github.com/ledgerwatch/log/v3"
"github.com/stretchr/testify/assert"
@ -170,6 +171,7 @@ func testFork(t *testing.T, m *mock.MockSentry, i, n int, comparator func(td1, t
}
func TestLastBlock(t *testing.T) {
t.Parallel()
m := newCanonical(t, 0)
var err error
@ -192,6 +194,7 @@ func TestLastBlock(t *testing.T) {
func TestExtendCanonicalBlocks(t *testing.T) { testExtendCanonical(t) }
func testExtendCanonical(t *testing.T) {
t.Parallel()
length := 5
// Make first chain starting from genesis
@ -213,11 +216,13 @@ func testExtendCanonical(t *testing.T) {
// Tests that given a starting canonical chain of a given size, creating shorter
// forks do not take canonical ownership.
func TestShorterForkBlocks(t *testing.T) {
t.Parallel()
t.Skip("Erigon does not insert shorter forks")
testShorterFork(t)
}
func testShorterFork(t *testing.T) {
t.Parallel()
length := 10
// Make first chain starting from genesis
@ -268,6 +273,7 @@ func testLongerFork(t *testing.T, full bool) {
func TestBrokenBlockChain(t *testing.T) { testBrokenChain(t) }
func testBrokenChain(t *testing.T) {
t.Parallel()
// Make chain starting from genesis
m := newCanonical(t, 10)
@ -285,6 +291,7 @@ func testBrokenChain(t *testing.T) {
func TestReorgLongBlocks(t *testing.T) { testReorgLong(t) }
func testReorgLong(t *testing.T) {
t.Parallel()
testReorg(t, []int64{0, 0, -9}, []int64{0, 0, 0, -9}, 393280)
}
@ -293,6 +300,7 @@ func testReorgLong(t *testing.T) {
func TestReorgShortBlocks(t *testing.T) { testReorgShort(t) }
func testReorgShort(t *testing.T) {
t.Parallel()
// Create a long easy chain vs. a short heavy one. Due to difficulty adjustment
// we need a fairly long chain of blocks with different difficulties for a short
// one to become heavyer than a long one. The 96 is an empirical value.
@ -367,6 +375,7 @@ func testReorg(t *testing.T, first, second []int64, td int64) {
func TestBadBlockHashes(t *testing.T) { testBadHashes(t) }
func testBadHashes(t *testing.T) {
t.Parallel()
t.Skip("to support this error in Erigon")
// Create a pristine chain and database
m := newCanonical(t, 0)
@ -386,6 +395,7 @@ func testBadHashes(t *testing.T) {
// Tests that chain reorganisations handle transaction removals and reinsertions.
func TestChainTxReorgs(t *testing.T) {
t.Parallel()
var (
key1, _ = crypto.HexToECDSA("b71c71a67e1177ad4e901695e1b4b9ee17ae16c6668d313eac2f96dbcda3f291")
key2, _ = crypto.HexToECDSA("8a1f9a8f95be41cd7ccb6168179afb4504aefe388d1e14474d32c45c72ce7b7a")
@ -556,6 +566,7 @@ func readReceipt(db kv.Tx, txHash libcommon.Hash, br services.FullBlockReader) (
// Tests if the canonical block can be fetched from the database during chain insertion.
func TestCanonicalBlockRetrieval(t *testing.T) {
t.Parallel()
m := newCanonical(t, 0)
chain, err2 := core.GenerateChain(m.ChainConfig, m.Genesis, m.Engine, m.DB, 10, func(i int, gen *core.BlockGen) {})
@ -596,6 +607,7 @@ func TestCanonicalBlockRetrieval(t *testing.T) {
}
func TestEIP155Transition(t *testing.T) {
t.Parallel()
// Configure and generate a sample block chai
var (
@ -701,6 +713,7 @@ func TestEIP155Transition(t *testing.T) {
}
func TestModes(t *testing.T) {
t.Parallel()
// run test on all combination of flags
runWithModesPermuations(
t,
@ -709,6 +722,7 @@ func TestModes(t *testing.T) {
}
func TestBeforeModes(t *testing.T) {
t.Parallel()
mode := prune.DefaultMode
mode.History = prune.Before(0)
mode.Receipts = prune.Before(1)
@ -937,6 +951,7 @@ func runPermutation(t *testing.T, testFunc func(*testing.T, prune.Mode) error, c
}
func TestEIP161AccountRemoval(t *testing.T) {
t.Parallel()
// Configure and generate a sample block chain
var (
key, _ = crypto.HexToECDSA("b71c71a67e1177ad4e901695e1b4b9ee17ae16c6668d313eac2f96dbcda3f291")
@ -1025,6 +1040,7 @@ func TestEIP161AccountRemoval(t *testing.T) {
}
func TestDoubleAccountRemoval(t *testing.T) {
t.Parallel()
var (
signer = types.LatestSignerForChainID(nil)
bankKey, _ = crypto.HexToECDSA("b71c71a67e1177ad4e901695e1b4b9ee17ae16c6668d313eac2f96dbcda3f291")
@ -1101,6 +1117,7 @@ func TestDoubleAccountRemoval(t *testing.T) {
//
// https://github.com/ethereum/go-ethereum/pull/15941
func TestBlockchainHeaderchainReorgConsistency(t *testing.T) {
t.Parallel()
// Generate a canonical chain to act as the main dataset
m, m2 := mock.Mock(t), mock.Mock(t)
@ -1163,6 +1180,7 @@ func TestBlockchainHeaderchainReorgConsistency(t *testing.T) {
// Tests that doing large reorgs works even if the state associated with the
// forking point is not available any more.
func TestLargeReorgTrieGC(t *testing.T) {
t.Parallel()
// Generate the original common chain segment and the two competing forks
m, m2 := mock.Mock(t), mock.Mock(t)
@ -1222,6 +1240,7 @@ func TestLargeReorgTrieGC(t *testing.T) {
// - https://github.com/ethereum/go-ethereum/issues/18977
// - https://github.com/ethereum/go-ethereum/pull/18988
func TestLowDiffLongChain(t *testing.T) {
t.Parallel()
// Generate a canonical chain to act as the main dataset
m := mock.Mock(t)
@ -1293,6 +1312,7 @@ func TestLowDiffLongChain(t *testing.T) {
// each transaction, so this works ok. The rework accumulated writes in memory
// first, but the journal wiped the entire state object on create-revert.
func TestDeleteCreateRevert(t *testing.T) {
t.Parallel()
var (
aa = libcommon.HexToAddress("0x000000000000000000000000000000000000aaaa")
bb = libcommon.HexToAddress("0x000000000000000000000000000000000000bbbb")
@ -1361,6 +1381,7 @@ func TestDeleteCreateRevert(t *testing.T) {
// Expected outcome is that _all_ slots are cleared from A, due to the selfdestruct,
// and then the new slots exist
func TestDeleteRecreateSlots(t *testing.T) {
t.Parallel()
var (
// Generate a canonical chain to act as the main dataset
// A sender who makes transactions, has some funds
@ -1488,6 +1509,7 @@ func TestDeleteRecreateSlots(t *testing.T) {
}
func TestCVE2020_26265(t *testing.T) {
t.Parallel()
var (
// Generate a canonical chain to act as the main dataset
// A sender who makes transactions, has some funds
@ -1592,6 +1614,7 @@ func TestCVE2020_26265(t *testing.T) {
// regular value-transfer
// Expected outcome is that _all_ slots are cleared from A
func TestDeleteRecreateAccount(t *testing.T) {
t.Parallel()
var (
// Generate a canonical chain to act as the main dataset
// A sender who makes transactions, has some funds
@ -1669,6 +1692,7 @@ func TestDeleteRecreateAccount(t *testing.T) {
// Expected outcome is that _all_ slots are cleared from A, due to the selfdestruct,
// and then the new slots exist
func TestDeleteRecreateSlotsAcrossManyBlocks(t *testing.T) {
t.Parallel()
var (
// Generate a canonical chain to act as the main dataset
// A sender who makes transactions, has some funds
@ -1876,6 +1900,7 @@ func TestDeleteRecreateSlotsAcrossManyBlocks(t *testing.T) {
// We need to either roll back the snapDestructs, or not place it into snapDestructs
// in the first place.
func TestInitThenFailCreateContract(t *testing.T) {
t.Parallel()
var (
// Generate a canonical chain to act as the main dataset
// A sender who makes transactions, has some funds
@ -1986,6 +2011,7 @@ func TestInitThenFailCreateContract(t *testing.T) {
// checking that the gas usage of a hot SLOAD and a cold SLOAD are calculated
// correctly.
func TestEIP2718Transition(t *testing.T) {
t.Parallel()
var (
aa = libcommon.HexToAddress("0x000000000000000000000000000000000000aaaa")
@ -2076,6 +2102,7 @@ func TestEIP2718Transition(t *testing.T) {
// feeCap - tip < baseFee.
// 6. Legacy transaction behave as expected (e.g. gasPrice = feeCap = tip).
func TestEIP1559Transition(t *testing.T) {
t.Parallel()
t.Skip("needs fixing")
var (
aa = libcommon.HexToAddress("0x000000000000000000000000000000000000aaaa")

1
turbo/stages/bodydownload/body_test.go
View File

@ -11,6 +11,7 @@ import (
)
func TestCreateBodyDownload(t *testing.T) {
t.Parallel()
m := mock.Mock(t)
tx, err := m.DB.BeginRo(m.Ctx)
require.NoError(t, err)

1
turbo/stages/chain_makers_test.go
View File

@ -35,6 +35,7 @@ import (
)
func TestGenerateChain(t *testing.T) {
t.Parallel()
var (
key1, _ = crypto.HexToECDSA("b71c71a67e1177ad4e901695e1b4b9ee17ae16c6668d313eac2f96dbcda3f291")
key2, _ = crypto.HexToECDSA("8a1f9a8f95be41cd7ccb6168179afb4504aefe388d1e14474d32c45c72ce7b7a")

2
turbo/stages/genesis_test.go
View File

@ -39,6 +39,7 @@ import (
)
func TestSetupGenesis(t *testing.T) {
t.Parallel()
var (
customghash = libcommon.HexToHash("0x89c99d90b79719238d2645c7642f2c9295246e80775b38cfd162b696817fbd50")
customg = types.Genesis{
@ -143,6 +144,7 @@ func TestSetupGenesis(t *testing.T) {
for _, test := range tests {
test := test
t.Run(test.name, func(t *testing.T) {
t.Parallel()
_, db, _ := temporal.NewTestDB(t, datadir.New(tmpdir), nil)
blockReader := freezeblocks.NewBlockReader(freezeblocks.NewRoSnapshots(ethconfig.BlocksFreezing{Enabled: false}, "", log.New()), freezeblocks.NewBorRoSnapshots(ethconfig.BlocksFreezing{Enabled: false}, "", log.New()))
config, genesis, err := test.fn(db)

1
turbo/stages/headerdownload/header_algo_test.go
View File

@ -19,6 +19,7 @@ import (
)
func TestSideChainInsert(t *testing.T) {
t.Parallel()
funds := big.NewInt(1000000000)
key, _ := crypto.HexToECDSA("b71c71a67e1177ad4e901695e1b4b9ee17ae16c6668d313eac2f96dbcda3f291")
address := crypto.PubkeyToAddress(key.PublicKey)

6
turbo/stages/mock/sentry_mock_test.go
View File

@ -21,10 +21,12 @@ import (
)
func TestEmptyStageSync(t *testing.T) {
t.Parallel()
mock.Mock(t)
}
func TestHeaderStep(t *testing.T) {
t.Parallel()
m := mock.Mock(t)
chain, err := core.GenerateChain(m.ChainConfig, m.Genesis, m.Engine, m.DB, 100, func(i int, b *core.BlockGen) {
@ -62,6 +64,7 @@ func TestHeaderStep(t *testing.T) {
}
func TestMineBlockWith1Tx(t *testing.T) {
t.Parallel()
t.Skip("revive me")
require, m := require.New(t), mock.Mock(t)
@ -126,6 +129,7 @@ func TestMineBlockWith1Tx(t *testing.T) {
}
func TestReorg(t *testing.T) {
t.Parallel()
m := mock.Mock(t)
chain, err := core.GenerateChain(m.ChainConfig, m.Genesis, m.Engine, m.DB, 10, func(i int, b *core.BlockGen) {
@ -301,6 +305,7 @@ func TestReorg(t *testing.T) {
}
func TestAnchorReplace(t *testing.T) {
t.Parallel()
m := mock.Mock(t)
chain, err := core.GenerateChain(m.ChainConfig, m.Genesis, m.Engine, m.DB, 10, func(i int, b *core.BlockGen) {
@ -397,6 +402,7 @@ func TestAnchorReplace(t *testing.T) {
}
func TestAnchorReplace2(t *testing.T) {
t.Parallel()
m := mock.Mock(t)
chain, err := core.GenerateChain(m.ChainConfig, m.Genesis, m.Engine, m.DB, 10, func(i int, b *core.BlockGen) {
b.SetCoinbase(libcommon.Address{1})