github.com/ethereum/go-ethereum@v1.16.1/trie/trienode/node_test.go (about)

     1  // Copyright 2023 The go-ethereum Authors
     2  // This file is part of the go-ethereum library.
     3  //
     4  // The go-ethereum library is free software: you can redistribute it and/or modify
     5  // it under the terms of the GNU Lesser General Public License as published by
     6  // the Free Software Foundation, either version 3 of the License, or
     7  // (at your option) any later version.
     8  //
     9  // The go-ethereum library is distributed in the hope that it will be useful,
    10  // but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    12  // GNU Lesser General Public License for more details.
    13  //
    14  // You should have received a copy of the GNU Lesser General Public License
    15  // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>
    16  
    17  package trienode
    18  
    19  import (
    20  	"crypto/rand"
    21  	"testing"
    22  
    23  	"github.com/ethereum/go-ethereum/common"
    24  	"github.com/ethereum/go-ethereum/crypto"
    25  )
    26  
    27  func BenchmarkMerge(b *testing.B) {
    28  	b.Run("1K", func(b *testing.B) {
    29  		benchmarkMerge(b, 1000)
    30  	})
    31  	b.Run("10K", func(b *testing.B) {
    32  		benchmarkMerge(b, 10_000)
    33  	})
    34  }
    35  
    36  func benchmarkMerge(b *testing.B, count int) {
    37  	x := NewNodeSet(common.Hash{})
    38  	y := NewNodeSet(common.Hash{})
    39  	addNode := func(s *NodeSet) {
    40  		path := make([]byte, 4)
    41  		rand.Read(path)
    42  		blob := make([]byte, 32)
    43  		rand.Read(blob)
    44  		hash := crypto.Keccak256Hash(blob)
    45  		s.AddNode(path, New(hash, blob))
    46  	}
    47  	for i := 0; i < count; i++ {
    48  		// Random path of 4 nibbles
    49  		addNode(x)
    50  		addNode(y)
    51  	}
    52  	b.ResetTimer()
    53  	for i := 0; i < b.N; i++ {
    54  		// Store set x into a backup
    55  		z := NewNodeSet(common.Hash{})
    56  		z.Merge(common.Hash{}, x.Nodes)
    57  		// Merge y into x
    58  		x.Merge(common.Hash{}, y.Nodes)
    59  		x = z
    60  	}
    61  }