github.com/aquanetwork/aquachain@v1.7.8/core/state/iterator_test.go (about)

     1  // Copyright 2016 The aquachain Authors
     2  // This file is part of the aquachain library.
     3  //
     4  // The aquachain 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 aquachain 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 aquachain library. If not, see <http://www.gnu.org/licenses/>.
    16  
    17  package state
    18  
    19  import (
    20  	"bytes"
    21  	"testing"
    22  
    23  	"gitlab.com/aquachain/aquachain/aquadb"
    24  	"gitlab.com/aquachain/aquachain/common"
    25  )
    26  
    27  // Tests that the node iterator indeed walks over the entire database contents.
    28  func TestNodeIteratorCoverage(t *testing.T) {
    29  	// Create some arbitrary test state to iterate
    30  	db, root, _ := makeTestState()
    31  
    32  	state, err := New(root, db)
    33  	if err != nil {
    34  		t.Fatalf("failed to create state trie at %x: %v", root, err)
    35  	}
    36  	// Gather all the node hashes found by the iterator
    37  	hashes := make(map[common.Hash]struct{})
    38  	for it := NewNodeIterator(state); it.Next(); {
    39  		if it.Hash != (common.Hash{}) {
    40  			hashes[it.Hash] = struct{}{}
    41  		}
    42  	}
    43  	// Cross check the iterated hashes and the database/nodepool content
    44  	for hash := range hashes {
    45  		if _, err := db.TrieDB().Node(hash); err != nil {
    46  			t.Errorf("failed to retrieve reported node %x", hash)
    47  		}
    48  	}
    49  	for _, hash := range db.TrieDB().Nodes() {
    50  		if _, ok := hashes[hash]; !ok {
    51  			t.Errorf("state entry not reported %x", hash)
    52  		}
    53  	}
    54  	for _, key := range db.TrieDB().DiskDB().(*aquadb.MemDatabase).Keys() {
    55  		if bytes.HasPrefix(key, []byte("secure-key-")) {
    56  			continue
    57  		}
    58  		if _, ok := hashes[common.BytesToHash(key)]; !ok {
    59  			t.Errorf("state entry not reported %x", key)
    60  		}
    61  	}
    62  }