mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-02-26 07:37:20 +00:00
01b39c96bf
### Description Add a new `OnStateUpdate` hook which gets invoked after state is committed. ### Rationale For our particular use case, we need to obtain the state size metrics at every single block when fuly syncing from genesis. With the current state sizer, whenever the node is stopped, the background process must be freshly initialized. During this re-initialization, it can skip some blocks while the node continues executing blocks, causing gaps in the recorded metrics. Using this state update hook allows us to customize our own data persistence logic, and we would never skip blocks upon node restart. --------- Co-authored-by: Gary Rong <garyrong0905@gmail.com>
111 lines
3.8 KiB
Go
111 lines
3.8 KiB
Go
// Copyright 2020 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library 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 Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package core
|
|
|
|
import (
|
|
"errors"
|
|
"fmt"
|
|
"math/big"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/ethereum/go-ethereum/consensus"
|
|
"github.com/ethereum/go-ethereum/consensus/ethash"
|
|
"github.com/ethereum/go-ethereum/core/rawdb"
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
"github.com/ethereum/go-ethereum/params"
|
|
"github.com/ethereum/go-ethereum/triedb"
|
|
)
|
|
|
|
func verifyUnbrokenCanonchain(hc *HeaderChain) error {
|
|
h := hc.CurrentHeader()
|
|
for {
|
|
canonHash := rawdb.ReadCanonicalHash(hc.chainDb, h.Number.Uint64())
|
|
if exp := h.Hash(); canonHash != exp {
|
|
return fmt.Errorf("Canon hash chain broken, block %d got %x, expected %x",
|
|
h.Number, canonHash[:8], exp[:8])
|
|
}
|
|
if h.Number.Uint64() == 0 {
|
|
break
|
|
}
|
|
h = hc.GetHeader(h.ParentHash, h.Number.Uint64()-1)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func testInsert(t *testing.T, hc *HeaderChain, chain []*types.Header, wantStatus WriteStatus, wantErr error) {
|
|
t.Helper()
|
|
|
|
status, err := hc.InsertHeaderChain(chain, time.Now())
|
|
if status != wantStatus {
|
|
t.Errorf("wrong write status from InsertHeaderChain: got %v, want %v", status, wantStatus)
|
|
}
|
|
// Always verify that the header chain is unbroken
|
|
if err := verifyUnbrokenCanonchain(hc); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !errors.Is(err, wantErr) {
|
|
t.Fatalf("unexpected error from InsertHeaderChain: %v", err)
|
|
}
|
|
}
|
|
|
|
// This test checks status reporting of InsertHeaderChain.
|
|
func TestHeaderInsertion(t *testing.T) {
|
|
var (
|
|
db = rawdb.NewMemoryDatabase()
|
|
gspec = &Genesis{BaseFee: big.NewInt(params.InitialBaseFee), Config: params.AllEthashProtocolChanges}
|
|
)
|
|
gspec.Commit(db, triedb.NewDatabase(db, nil), nil)
|
|
hc, err := NewHeaderChain(db, gspec.Config, ethash.NewFaker(), func() bool { return false })
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// chain A: G->A1->A2...A128
|
|
genDb, chainA := makeHeaderChainWithGenesis(gspec, 128, ethash.NewFaker(), 10)
|
|
// chain B: G->A1->B1...B128
|
|
chainB := makeHeaderChain(gspec.Config, chainA[0], 128, ethash.NewFaker(), genDb, 10)
|
|
|
|
// Inserting 64 headers on an empty chain, expecting
|
|
// 1 callbacks, 1 canon-status, 0 sidestatus,
|
|
testInsert(t, hc, chainA[:64], CanonStatTy, nil)
|
|
|
|
// Inserting 64 identical headers, expecting
|
|
// 0 callbacks, 0 canon-status, 0 sidestatus,
|
|
testInsert(t, hc, chainA[:64], NonStatTy, nil)
|
|
|
|
// Inserting the same some old, some new headers
|
|
// 1 callbacks, 1 canon, 0 side
|
|
testInsert(t, hc, chainA[32:96], CanonStatTy, nil)
|
|
|
|
// Inserting headers from chain B, overtaking the canon chain blindly
|
|
testInsert(t, hc, chainB[0:32], CanonStatTy, nil)
|
|
|
|
// Inserting more headers on chain B, but we don't have the parent
|
|
testInsert(t, hc, chainB[34:36], NonStatTy, consensus.ErrUnknownAncestor)
|
|
|
|
// Inserting more headers on chain B, extend the canon chain
|
|
testInsert(t, hc, chainB[32:97], CanonStatTy, nil)
|
|
|
|
// Inserting more headers on chain A, taking back the canonicality
|
|
testInsert(t, hc, chainA[90:100], CanonStatTy, nil)
|
|
|
|
// And B becomes canon again
|
|
testInsert(t, hc, chainB[97:107], CanonStatTy, nil)
|
|
|
|
// And B becomes even longer
|
|
testInsert(t, hc, chainB[107:128], CanonStatTy, nil)
|
|
}
|