aboutsummaryrefslogtreecommitdiffstats
path: root/core/state/iterator_test.go
blob: 9e46c851cdcb84f087d8ec0f8204bf1705bd6c94 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// Copyright 2016 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 state

import (
    "bytes"
    "testing"

    "github.com/ethereum/go-ethereum/common"
    "github.com/ethereum/go-ethereum/ethdb"
)

// Tests that the node iterator indeed walks over the entire database contents.
func TestNodeIteratorCoverage(t *testing.T) {
    // Create some arbitrary test state to iterate
    db, root, _ := makeTestState()

    state, err := New(root, db)
    if err != nil {
        t.Fatalf("failed to create state trie at %x: %v", root, err)
    }
    // Gather all the node hashes found by the iterator
    hashes := make(map[common.Hash]struct{})
    for it := NewNodeIterator(state); it.Next(); {
        if it.Hash != (common.Hash{}) {
            hashes[it.Hash] = struct{}{}
        }
    }
    // Cross check the iterated hashes and the database/nodepool content
    for hash := range hashes {
        if _, err := db.TrieDB().Node(hash); err != nil {
            t.Errorf("failed to retrieve reported node %x", hash)
        }
    }
    for _, hash := range db.TrieDB().Nodes() {
        if _, ok := hashes[hash]; !ok {
            t.Errorf("state entry not reported %x", hash)
        }
    }
    for _, key := range db.TrieDB().DiskDB().(*ethdb.MemDatabase).Keys() {
        if bytes.HasPrefix(key, []byte("secure-key-")) {
            continue
        }
        if _, ok := hashes[common.BytesToHash(key)]; !ok {
            t.Errorf("state entry not reported %x", key)
        }
    }
}