mirror of
https://gitlab.com/pulsechaincom/go-pulse.git
synced 2024-12-23 03:51:09 +00:00
4d3525610e
This PR is a (superior) alternative to https://github.com/ethereum/go-ethereum/pull/26708, it handles deprecation, primarily two specific cases. `rand.Seed` is typically used in two ways - `rand.Seed(time.Now().UnixNano())` -- we seed it, just to be sure to get some random, and not always get the same thing on every run. This is not needed, with global seeding, so those are just removed. - `rand.Seed(1)` this is typically done to ensure we have a stable test. If we rely on this, we need to fix up the tests to use a deterministic prng-source. A few occurrences like this has been replaced with a proper custom source. `rand.Read` has been replaced by `crypto/rand`.`Read` in this PR.
352 lines
9.9 KiB
Go
352 lines
9.9 KiB
Go
// Copyright 2019 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 les
|
|
|
|
import (
|
|
crand "crypto/rand"
|
|
"encoding/binary"
|
|
"fmt"
|
|
"math/big"
|
|
"math/rand"
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/common/mclock"
|
|
"github.com/ethereum/go-ethereum/core/rawdb"
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
"github.com/ethereum/go-ethereum/crypto"
|
|
"github.com/ethereum/go-ethereum/les/flowcontrol"
|
|
"github.com/ethereum/go-ethereum/log"
|
|
"github.com/ethereum/go-ethereum/p2p"
|
|
"github.com/ethereum/go-ethereum/p2p/enode"
|
|
"github.com/ethereum/go-ethereum/params"
|
|
"github.com/ethereum/go-ethereum/rlp"
|
|
)
|
|
|
|
// requestBenchmark is an interface for different randomized request generators
|
|
type requestBenchmark interface {
|
|
// init initializes the generator for generating the given number of randomized requests
|
|
init(h *serverHandler, count int) error
|
|
// request initiates sending a single request to the given peer
|
|
request(peer *serverPeer, index int) error
|
|
}
|
|
|
|
// benchmarkBlockHeaders implements requestBenchmark
|
|
type benchmarkBlockHeaders struct {
|
|
amount, skip int
|
|
reverse, byHash bool
|
|
offset, randMax int64
|
|
hashes []common.Hash
|
|
}
|
|
|
|
func (b *benchmarkBlockHeaders) init(h *serverHandler, count int) error {
|
|
d := int64(b.amount-1) * int64(b.skip+1)
|
|
b.offset = 0
|
|
b.randMax = h.blockchain.CurrentHeader().Number.Int64() + 1 - d
|
|
if b.randMax < 0 {
|
|
return fmt.Errorf("chain is too short")
|
|
}
|
|
if b.reverse {
|
|
b.offset = d
|
|
}
|
|
if b.byHash {
|
|
b.hashes = make([]common.Hash, count)
|
|
for i := range b.hashes {
|
|
b.hashes[i] = rawdb.ReadCanonicalHash(h.chainDb, uint64(b.offset+rand.Int63n(b.randMax)))
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkBlockHeaders) request(peer *serverPeer, index int) error {
|
|
if b.byHash {
|
|
return peer.requestHeadersByHash(0, b.hashes[index], b.amount, b.skip, b.reverse)
|
|
}
|
|
return peer.requestHeadersByNumber(0, uint64(b.offset+rand.Int63n(b.randMax)), b.amount, b.skip, b.reverse)
|
|
}
|
|
|
|
// benchmarkBodiesOrReceipts implements requestBenchmark
|
|
type benchmarkBodiesOrReceipts struct {
|
|
receipts bool
|
|
hashes []common.Hash
|
|
}
|
|
|
|
func (b *benchmarkBodiesOrReceipts) init(h *serverHandler, count int) error {
|
|
randMax := h.blockchain.CurrentHeader().Number.Int64() + 1
|
|
b.hashes = make([]common.Hash, count)
|
|
for i := range b.hashes {
|
|
b.hashes[i] = rawdb.ReadCanonicalHash(h.chainDb, uint64(rand.Int63n(randMax)))
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkBodiesOrReceipts) request(peer *serverPeer, index int) error {
|
|
if b.receipts {
|
|
return peer.requestReceipts(0, []common.Hash{b.hashes[index]})
|
|
}
|
|
return peer.requestBodies(0, []common.Hash{b.hashes[index]})
|
|
}
|
|
|
|
// benchmarkProofsOrCode implements requestBenchmark
|
|
type benchmarkProofsOrCode struct {
|
|
code bool
|
|
headHash common.Hash
|
|
}
|
|
|
|
func (b *benchmarkProofsOrCode) init(h *serverHandler, count int) error {
|
|
b.headHash = h.blockchain.CurrentHeader().Hash()
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkProofsOrCode) request(peer *serverPeer, index int) error {
|
|
key := make([]byte, 32)
|
|
crand.Read(key)
|
|
if b.code {
|
|
return peer.requestCode(0, []CodeReq{{BHash: b.headHash, AccKey: key}})
|
|
}
|
|
return peer.requestProofs(0, []ProofReq{{BHash: b.headHash, Key: key}})
|
|
}
|
|
|
|
// benchmarkHelperTrie implements requestBenchmark
|
|
type benchmarkHelperTrie struct {
|
|
bloom bool
|
|
reqCount int
|
|
sectionCount, headNum uint64
|
|
}
|
|
|
|
func (b *benchmarkHelperTrie) init(h *serverHandler, count int) error {
|
|
if b.bloom {
|
|
b.sectionCount, b.headNum, _ = h.server.bloomTrieIndexer.Sections()
|
|
} else {
|
|
b.sectionCount, _, _ = h.server.chtIndexer.Sections()
|
|
b.headNum = b.sectionCount*params.CHTFrequency - 1
|
|
}
|
|
if b.sectionCount == 0 {
|
|
return fmt.Errorf("no processed sections available")
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkHelperTrie) request(peer *serverPeer, index int) error {
|
|
reqs := make([]HelperTrieReq, b.reqCount)
|
|
|
|
if b.bloom {
|
|
bitIdx := uint16(rand.Intn(2048))
|
|
for i := range reqs {
|
|
key := make([]byte, 10)
|
|
binary.BigEndian.PutUint16(key[:2], bitIdx)
|
|
binary.BigEndian.PutUint64(key[2:], uint64(rand.Int63n(int64(b.sectionCount))))
|
|
reqs[i] = HelperTrieReq{Type: htBloomBits, TrieIdx: b.sectionCount - 1, Key: key}
|
|
}
|
|
} else {
|
|
for i := range reqs {
|
|
key := make([]byte, 8)
|
|
binary.BigEndian.PutUint64(key[:], uint64(rand.Int63n(int64(b.headNum))))
|
|
reqs[i] = HelperTrieReq{Type: htCanonical, TrieIdx: b.sectionCount - 1, Key: key, AuxReq: htAuxHeader}
|
|
}
|
|
}
|
|
|
|
return peer.requestHelperTrieProofs(0, reqs)
|
|
}
|
|
|
|
// benchmarkTxSend implements requestBenchmark
|
|
type benchmarkTxSend struct {
|
|
txs types.Transactions
|
|
}
|
|
|
|
func (b *benchmarkTxSend) init(h *serverHandler, count int) error {
|
|
key, _ := crypto.GenerateKey()
|
|
addr := crypto.PubkeyToAddress(key.PublicKey)
|
|
signer := types.LatestSigner(h.server.chainConfig)
|
|
b.txs = make(types.Transactions, count)
|
|
|
|
for i := range b.txs {
|
|
data := make([]byte, txSizeCostLimit)
|
|
crand.Read(data)
|
|
tx, err := types.SignTx(types.NewTransaction(0, addr, new(big.Int), 0, new(big.Int), data), signer, key)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
b.txs[i] = tx
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkTxSend) request(peer *serverPeer, index int) error {
|
|
enc, _ := rlp.EncodeToBytes(types.Transactions{b.txs[index]})
|
|
return peer.sendTxs(0, 1, enc)
|
|
}
|
|
|
|
// benchmarkTxStatus implements requestBenchmark
|
|
type benchmarkTxStatus struct{}
|
|
|
|
func (b *benchmarkTxStatus) init(h *serverHandler, count int) error {
|
|
return nil
|
|
}
|
|
|
|
func (b *benchmarkTxStatus) request(peer *serverPeer, index int) error {
|
|
var hash common.Hash
|
|
crand.Read(hash[:])
|
|
return peer.requestTxStatus(0, []common.Hash{hash})
|
|
}
|
|
|
|
// benchmarkSetup stores measurement data for a single benchmark type
|
|
type benchmarkSetup struct {
|
|
req requestBenchmark
|
|
totalCount int
|
|
totalTime, avgTime time.Duration
|
|
maxInSize, maxOutSize uint32
|
|
err error
|
|
}
|
|
|
|
// runBenchmark runs a benchmark cycle for all benchmark types in the specified
|
|
// number of passes
|
|
func (h *serverHandler) runBenchmark(benchmarks []requestBenchmark, passCount int, targetTime time.Duration) []*benchmarkSetup {
|
|
setup := make([]*benchmarkSetup, len(benchmarks))
|
|
for i, b := range benchmarks {
|
|
setup[i] = &benchmarkSetup{req: b}
|
|
}
|
|
for i := 0; i < passCount; i++ {
|
|
log.Info("Running benchmark", "pass", i+1, "total", passCount)
|
|
todo := make([]*benchmarkSetup, len(benchmarks))
|
|
copy(todo, setup)
|
|
for len(todo) > 0 {
|
|
// select a random element
|
|
index := rand.Intn(len(todo))
|
|
next := todo[index]
|
|
todo[index] = todo[len(todo)-1]
|
|
todo = todo[:len(todo)-1]
|
|
|
|
if next.err == nil {
|
|
// calculate request count
|
|
count := 50
|
|
if next.totalTime > 0 {
|
|
count = int(uint64(next.totalCount) * uint64(targetTime) / uint64(next.totalTime))
|
|
}
|
|
if err := h.measure(next, count); err != nil {
|
|
next.err = err
|
|
}
|
|
}
|
|
}
|
|
}
|
|
log.Info("Benchmark completed")
|
|
|
|
for _, s := range setup {
|
|
if s.err == nil {
|
|
s.avgTime = s.totalTime / time.Duration(s.totalCount)
|
|
}
|
|
}
|
|
return setup
|
|
}
|
|
|
|
// meteredPipe implements p2p.MsgReadWriter and remembers the largest single
|
|
// message size sent through the pipe
|
|
type meteredPipe struct {
|
|
rw p2p.MsgReadWriter
|
|
maxSize uint32
|
|
}
|
|
|
|
func (m *meteredPipe) ReadMsg() (p2p.Msg, error) {
|
|
return m.rw.ReadMsg()
|
|
}
|
|
|
|
func (m *meteredPipe) WriteMsg(msg p2p.Msg) error {
|
|
if msg.Size > m.maxSize {
|
|
m.maxSize = msg.Size
|
|
}
|
|
return m.rw.WriteMsg(msg)
|
|
}
|
|
|
|
// measure runs a benchmark for a single type in a single pass, with the given
|
|
// number of requests
|
|
func (h *serverHandler) measure(setup *benchmarkSetup, count int) error {
|
|
clientPipe, serverPipe := p2p.MsgPipe()
|
|
clientMeteredPipe := &meteredPipe{rw: clientPipe}
|
|
serverMeteredPipe := &meteredPipe{rw: serverPipe}
|
|
var id enode.ID
|
|
crand.Read(id[:])
|
|
|
|
peer1 := newServerPeer(lpv2, NetworkId, false, p2p.NewPeer(id, "client", nil), clientMeteredPipe)
|
|
peer2 := newClientPeer(lpv2, NetworkId, p2p.NewPeer(id, "server", nil), serverMeteredPipe)
|
|
peer2.announceType = announceTypeNone
|
|
peer2.fcCosts = make(requestCostTable)
|
|
c := &requestCosts{}
|
|
for code := range requests {
|
|
peer2.fcCosts[code] = c
|
|
}
|
|
peer2.fcParams = flowcontrol.ServerParams{BufLimit: 1, MinRecharge: 1}
|
|
peer2.fcClient = flowcontrol.NewClientNode(h.server.fcManager, peer2.fcParams)
|
|
defer peer2.fcClient.Disconnect()
|
|
|
|
if err := setup.req.init(h, count); err != nil {
|
|
return err
|
|
}
|
|
|
|
errCh := make(chan error, 10)
|
|
start := mclock.Now()
|
|
|
|
go func() {
|
|
for i := 0; i < count; i++ {
|
|
if err := setup.req.request(peer1, i); err != nil {
|
|
errCh <- err
|
|
return
|
|
}
|
|
}
|
|
}()
|
|
go func() {
|
|
for i := 0; i < count; i++ {
|
|
if err := h.handleMsg(peer2, &sync.WaitGroup{}); err != nil {
|
|
errCh <- err
|
|
return
|
|
}
|
|
}
|
|
}()
|
|
go func() {
|
|
for i := 0; i < count; i++ {
|
|
msg, err := clientPipe.ReadMsg()
|
|
if err != nil {
|
|
errCh <- err
|
|
return
|
|
}
|
|
var i interface{}
|
|
msg.Decode(&i)
|
|
}
|
|
// at this point we can be sure that the other two
|
|
// goroutines finished successfully too
|
|
close(errCh)
|
|
}()
|
|
select {
|
|
case err := <-errCh:
|
|
if err != nil {
|
|
return err
|
|
}
|
|
case <-h.closeCh:
|
|
clientPipe.Close()
|
|
serverPipe.Close()
|
|
return fmt.Errorf("Benchmark cancelled")
|
|
}
|
|
|
|
setup.totalTime += time.Duration(mclock.Now() - start)
|
|
setup.totalCount += count
|
|
setup.maxInSize = clientMeteredPipe.maxSize
|
|
setup.maxOutSize = serverMeteredPipe.maxSize
|
|
clientPipe.Close()
|
|
serverPipe.Close()
|
|
return nil
|
|
}
|