Merge pull request #68 from stars-labs/bugfix/fix_missing_trie_node

fix missing trie node

trie/database.go

@@ -121,6 +121,14 @@ func (c *HashCache) PutIfAbsent(key []byte, value node) {
 	}
 }
 
+// Contains checks whether the key was cached
+func (c *HashCache) Contains(key []byte) bool {
+	c.lock.RLock()
+	defer c.lock.RUnlock()
+	_, exist := c.inner[common.BytesToHash(key)]
+	return exist
+}
+
 // Get reads value of given key from cache with lock protection
 func (c *HashCache) Get(key common.Hash) (node, bool) {
 	c.lock.RLock()

trie/hasher.go

@@ -76,6 +76,9 @@ func returnHasherToPool(h *hasher) {
 func (h *hasher) hash(n node, force bool) (hashed node, cached node) {
 	// Return the cached hash if it's available
 	if hash, _ := n.cache(); hash != nil {
+		if h.dirties != nil && !h.dirties.Contains(hash) {
+			h.dirties.Put(hash, n)
+		}
 		return hash, n
 	}
 	// Trie not processed yet, walk the children