trie: make hasher parallel when number of changes are large (#20488)

* trie: make hasher parallel when number of changes are large * trie: remove unused field dirtyCount * trie: rename unhashedCount/unhashed
2020-02-04 13:02:38 +01:00
parent 711ed74e09
commit a1313b5b1e
5 changed files with 42 additions and 15 deletions
--- a/trie/proof.go
+++ b/trie/proof.go
@ -64,7 +64,7 @@ func (t *Trie) Prove(key []byte, fromLevel uint, proofDb ethdb.KeyValueWriter) e
 			panic(fmt.Sprintf("%T: invalid node: %v", tn, tn))
 		}
 	}
-	hasher := newHasher()
+	hasher := newHasher(false)
 	defer returnHasherToPool(hasher)

 	for i, n := range nodes {