@@ -26,7 +26,6 @@ import (
26
26
"github.com/ethereum/go-ethereum/core/types"
27
27
"github.com/ethereum/go-ethereum/crypto"
28
28
"github.com/ethereum/go-ethereum/ethdb"
29
- "github.com/ethereum/go-ethereum/ethdb/memorydb"
30
29
"github.com/ethereum/go-ethereum/rlp"
31
30
"github.com/ethereum/go-ethereum/trie"
32
31
)
@@ -134,7 +133,7 @@ func checkStateConsistency(db ethdb.Database, root common.Hash) error {
134
133
// Tests that an empty state is not scheduled for syncing.
135
134
func TestEmptyStateSync (t * testing.T ) {
136
135
empty := common .HexToHash ("56e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421" )
137
- sync := NewStateSync (empty , rawdb .NewMemoryDatabase (), trie . NewSyncBloom ( 1 , memorydb . New ()), nil )
136
+ sync := NewStateSync (empty , rawdb .NewMemoryDatabase (), nil )
138
137
if nodes , paths , codes := sync .Missing (1 ); len (nodes ) != 0 || len (paths ) != 0 || len (codes ) != 0 {
139
138
t .Errorf (" content requested for empty state: %v, %v, %v" , nodes , paths , codes )
140
139
}
@@ -171,7 +170,7 @@ func testIterativeStateSync(t *testing.T, count int, commit bool, bypath bool) {
171
170
172
171
// Create a destination state and sync with the scheduler
173
172
dstDb := rawdb .NewMemoryDatabase ()
174
- sched := NewStateSync (srcRoot , dstDb , trie . NewSyncBloom ( 1 , dstDb ), nil )
173
+ sched := NewStateSync (srcRoot , dstDb , nil )
175
174
176
175
nodes , paths , codes := sched .Missing (count )
177
176
var (
@@ -250,7 +249,7 @@ func TestIterativeDelayedStateSync(t *testing.T) {
250
249
251
250
// Create a destination state and sync with the scheduler
252
251
dstDb := rawdb .NewMemoryDatabase ()
253
- sched := NewStateSync (srcRoot , dstDb , trie . NewSyncBloom ( 1 , dstDb ), nil )
252
+ sched := NewStateSync (srcRoot , dstDb , nil )
254
253
255
254
nodes , _ , codes := sched .Missing (0 )
256
255
queue := append (append ([]common.Hash {}, nodes ... ), codes ... )
@@ -298,7 +297,7 @@ func testIterativeRandomStateSync(t *testing.T, count int) {
298
297
299
298
// Create a destination state and sync with the scheduler
300
299
dstDb := rawdb .NewMemoryDatabase ()
301
- sched := NewStateSync (srcRoot , dstDb , trie . NewSyncBloom ( 1 , dstDb ), nil )
300
+ sched := NewStateSync (srcRoot , dstDb , nil )
302
301
303
302
queue := make (map [common.Hash ]struct {})
304
303
nodes , _ , codes := sched .Missing (count )
@@ -348,7 +347,7 @@ func TestIterativeRandomDelayedStateSync(t *testing.T) {
348
347
349
348
// Create a destination state and sync with the scheduler
350
349
dstDb := rawdb .NewMemoryDatabase ()
351
- sched := NewStateSync (srcRoot , dstDb , trie . NewSyncBloom ( 1 , dstDb ), nil )
350
+ sched := NewStateSync (srcRoot , dstDb , nil )
352
351
353
352
queue := make (map [common.Hash ]struct {})
354
353
nodes , _ , codes := sched .Missing (0 )
@@ -415,7 +414,7 @@ func TestIncompleteStateSync(t *testing.T) {
415
414
416
415
// Create a destination state and sync with the scheduler
417
416
dstDb := rawdb .NewMemoryDatabase ()
418
- sched := NewStateSync (srcRoot , dstDb , trie . NewSyncBloom ( 1 , dstDb ), nil )
417
+ sched := NewStateSync (srcRoot , dstDb , nil )
419
418
420
419
var added []common.Hash
421
420
0 commit comments