github.com/aidoskuneen/adk-node@v0.0.0-20220315131952-2e32567cb7f4/core/state/iterator_test.go (about)

     1  // Copyright 2021 The adkgo Authors
     2  // This file is part of the adkgo library (adapted for adkgo from go--ethereum v1.10.8).
     3  //
     4  // the adkgo 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 adkgo 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 adkgo library. If not, see <http://www.gnu.org/licenses/>.
    16  
    17  package state
    18  
    19  import (
    20  	"bytes"
    21  	"testing"
    22  
    23  	"github.com/aidoskuneen/adk-node/common"
    24  	"github.com/aidoskuneen/adk-node/ethdb"
    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  	db.TrieDB().Commit(root, false, nil)
    32  
    33  	state, err := New(root, db, nil)
    34  	if err != nil {
    35  		t.Fatalf("failed to create state trie at %x: %v", root, err)
    36  	}
    37  	// Gather all the node hashes found by the iterator
    38  	hashes := make(map[common.Hash]struct{})
    39  	for it := NewNodeIterator(state); it.Next(); {
    40  		if it.Hash != (common.Hash{}) {
    41  			hashes[it.Hash] = struct{}{}
    42  		}
    43  	}
    44  	// Cross check the iterated hashes and the database/nodepool content
    45  	for hash := range hashes {
    46  		if _, err = db.TrieDB().Node(hash); err != nil {
    47  			_, err = db.ContractCode(common.Hash{}, hash)
    48  		}
    49  		if err != nil {
    50  			t.Errorf("failed to retrieve reported node %x", hash)
    51  		}
    52  	}
    53  	for _, hash := range db.TrieDB().Nodes() {
    54  		if _, ok := hashes[hash]; !ok {
    55  			t.Errorf("state entry not reported %x", hash)
    56  		}
    57  	}
    58  	it := db.TrieDB().DiskDB().(ethdb.Database).NewIterator(nil, nil)
    59  	for it.Next() {
    60  		key := it.Key()
    61  		if bytes.HasPrefix(key, []byte("secure-key-")) {
    62  			continue
    63  		}
    64  		if _, ok := hashes[common.BytesToHash(key)]; !ok {
    65  			t.Errorf("state entry not reported %x", key)
    66  		}
    67  	}
    68  	it.Release()
    69  }