321 lines
		
	
	
		
			12 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			321 lines
		
	
	
		
			12 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // Copyright 2018 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 rawdb
 | |
| 
 | |
| import (
 | |
| 	"bytes"
 | |
| 	"math/big"
 | |
| 	"testing"
 | |
| 
 | |
| 	"github.com/ethereum/go-ethereum/common"
 | |
| 	"github.com/ethereum/go-ethereum/core/types"
 | |
| 	"github.com/ethereum/go-ethereum/rlp"
 | |
| 	"golang.org/x/crypto/sha3"
 | |
| )
 | |
| 
 | |
| // Tests block header storage and retrieval operations.
 | |
| func TestHeaderStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	// Create a test header to move around the database and make sure it's really new
 | |
| 	header := &types.Header{Number: big.NewInt(42), Extra: []byte("test header")}
 | |
| 	if entry := ReadHeader(db, header.Hash(), header.Number.Uint64()); entry != nil {
 | |
| 		t.Fatalf("Non existent header returned: %v", entry)
 | |
| 	}
 | |
| 	// Write and verify the header in the database
 | |
| 	WriteHeader(db, header)
 | |
| 	if entry := ReadHeader(db, header.Hash(), header.Number.Uint64()); entry == nil {
 | |
| 		t.Fatalf("Stored header not found")
 | |
| 	} else if entry.Hash() != header.Hash() {
 | |
| 		t.Fatalf("Retrieved header mismatch: have %v, want %v", entry, header)
 | |
| 	}
 | |
| 	if entry := ReadHeaderRLP(db, header.Hash(), header.Number.Uint64()); entry == nil {
 | |
| 		t.Fatalf("Stored header RLP not found")
 | |
| 	} else {
 | |
| 		hasher := sha3.NewLegacyKeccak256()
 | |
| 		hasher.Write(entry)
 | |
| 
 | |
| 		if hash := common.BytesToHash(hasher.Sum(nil)); hash != header.Hash() {
 | |
| 			t.Fatalf("Retrieved RLP header mismatch: have %v, want %v", entry, header)
 | |
| 		}
 | |
| 	}
 | |
| 	// Delete the header and verify the execution
 | |
| 	DeleteHeader(db, header.Hash(), header.Number.Uint64())
 | |
| 	if entry := ReadHeader(db, header.Hash(), header.Number.Uint64()); entry != nil {
 | |
| 		t.Fatalf("Deleted header returned: %v", entry)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests block body storage and retrieval operations.
 | |
| func TestBodyStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	// Create a test body to move around the database and make sure it's really new
 | |
| 	body := &types.Body{Uncles: []*types.Header{{Extra: []byte("test header")}}}
 | |
| 
 | |
| 	hasher := sha3.NewLegacyKeccak256()
 | |
| 	rlp.Encode(hasher, body)
 | |
| 	hash := common.BytesToHash(hasher.Sum(nil))
 | |
| 
 | |
| 	if entry := ReadBody(db, hash, 0); entry != nil {
 | |
| 		t.Fatalf("Non existent body returned: %v", entry)
 | |
| 	}
 | |
| 	// Write and verify the body in the database
 | |
| 	WriteBody(db, hash, 0, body)
 | |
| 	if entry := ReadBody(db, hash, 0); entry == nil {
 | |
| 		t.Fatalf("Stored body not found")
 | |
| 	} else if types.DeriveSha(types.Transactions(entry.Transactions)) != types.DeriveSha(types.Transactions(body.Transactions)) || types.CalcUncleHash(entry.Uncles) != types.CalcUncleHash(body.Uncles) {
 | |
| 		t.Fatalf("Retrieved body mismatch: have %v, want %v", entry, body)
 | |
| 	}
 | |
| 	if entry := ReadBodyRLP(db, hash, 0); entry == nil {
 | |
| 		t.Fatalf("Stored body RLP not found")
 | |
| 	} else {
 | |
| 		hasher := sha3.NewLegacyKeccak256()
 | |
| 		hasher.Write(entry)
 | |
| 
 | |
| 		if calc := common.BytesToHash(hasher.Sum(nil)); calc != hash {
 | |
| 			t.Fatalf("Retrieved RLP body mismatch: have %v, want %v", entry, body)
 | |
| 		}
 | |
| 	}
 | |
| 	// Delete the body and verify the execution
 | |
| 	DeleteBody(db, hash, 0)
 | |
| 	if entry := ReadBody(db, hash, 0); entry != nil {
 | |
| 		t.Fatalf("Deleted body returned: %v", entry)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests block storage and retrieval operations.
 | |
| func TestBlockStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	// Create a test block to move around the database and make sure it's really new
 | |
| 	block := types.NewBlockWithHeader(&types.Header{
 | |
| 		Extra:       []byte("test block"),
 | |
| 		UncleHash:   types.EmptyUncleHash,
 | |
| 		TxHash:      types.EmptyRootHash,
 | |
| 		ReceiptHash: types.EmptyRootHash,
 | |
| 	})
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Non existent block returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadHeader(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Non existent header returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadBody(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Non existent body returned: %v", entry)
 | |
| 	}
 | |
| 	// Write and verify the block in the database
 | |
| 	WriteBlock(db, block)
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry == nil {
 | |
| 		t.Fatalf("Stored block not found")
 | |
| 	} else if entry.Hash() != block.Hash() {
 | |
| 		t.Fatalf("Retrieved block mismatch: have %v, want %v", entry, block)
 | |
| 	}
 | |
| 	if entry := ReadHeader(db, block.Hash(), block.NumberU64()); entry == nil {
 | |
| 		t.Fatalf("Stored header not found")
 | |
| 	} else if entry.Hash() != block.Header().Hash() {
 | |
| 		t.Fatalf("Retrieved header mismatch: have %v, want %v", entry, block.Header())
 | |
| 	}
 | |
| 	if entry := ReadBody(db, block.Hash(), block.NumberU64()); entry == nil {
 | |
| 		t.Fatalf("Stored body not found")
 | |
| 	} else if types.DeriveSha(types.Transactions(entry.Transactions)) != types.DeriveSha(block.Transactions()) || types.CalcUncleHash(entry.Uncles) != types.CalcUncleHash(block.Uncles()) {
 | |
| 		t.Fatalf("Retrieved body mismatch: have %v, want %v", entry, block.Body())
 | |
| 	}
 | |
| 	// Delete the block and verify the execution
 | |
| 	DeleteBlock(db, block.Hash(), block.NumberU64())
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Deleted block returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadHeader(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Deleted header returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadBody(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Deleted body returned: %v", entry)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests that partial block contents don't get reassembled into full blocks.
 | |
| func TestPartialBlockStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 	block := types.NewBlockWithHeader(&types.Header{
 | |
| 		Extra:       []byte("test block"),
 | |
| 		UncleHash:   types.EmptyUncleHash,
 | |
| 		TxHash:      types.EmptyRootHash,
 | |
| 		ReceiptHash: types.EmptyRootHash,
 | |
| 	})
 | |
| 	// Store a header and check that it's not recognized as a block
 | |
| 	WriteHeader(db, block.Header())
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Non existent block returned: %v", entry)
 | |
| 	}
 | |
| 	DeleteHeader(db, block.Hash(), block.NumberU64())
 | |
| 
 | |
| 	// Store a body and check that it's not recognized as a block
 | |
| 	WriteBody(db, block.Hash(), block.NumberU64(), block.Body())
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry != nil {
 | |
| 		t.Fatalf("Non existent block returned: %v", entry)
 | |
| 	}
 | |
| 	DeleteBody(db, block.Hash(), block.NumberU64())
 | |
| 
 | |
| 	// Store a header and a body separately and check reassembly
 | |
| 	WriteHeader(db, block.Header())
 | |
| 	WriteBody(db, block.Hash(), block.NumberU64(), block.Body())
 | |
| 
 | |
| 	if entry := ReadBlock(db, block.Hash(), block.NumberU64()); entry == nil {
 | |
| 		t.Fatalf("Stored block not found")
 | |
| 	} else if entry.Hash() != block.Hash() {
 | |
| 		t.Fatalf("Retrieved block mismatch: have %v, want %v", entry, block)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests block total difficulty storage and retrieval operations.
 | |
| func TestTdStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	// Create a test TD to move around the database and make sure it's really new
 | |
| 	hash, td := common.Hash{}, big.NewInt(314)
 | |
| 	if entry := ReadTd(db, hash, 0); entry != nil {
 | |
| 		t.Fatalf("Non existent TD returned: %v", entry)
 | |
| 	}
 | |
| 	// Write and verify the TD in the database
 | |
| 	WriteTd(db, hash, 0, td)
 | |
| 	if entry := ReadTd(db, hash, 0); entry == nil {
 | |
| 		t.Fatalf("Stored TD not found")
 | |
| 	} else if entry.Cmp(td) != 0 {
 | |
| 		t.Fatalf("Retrieved TD mismatch: have %v, want %v", entry, td)
 | |
| 	}
 | |
| 	// Delete the TD and verify the execution
 | |
| 	DeleteTd(db, hash, 0)
 | |
| 	if entry := ReadTd(db, hash, 0); entry != nil {
 | |
| 		t.Fatalf("Deleted TD returned: %v", entry)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests that canonical numbers can be mapped to hashes and retrieved.
 | |
| func TestCanonicalMappingStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	// Create a test canonical number and assinged hash to move around
 | |
| 	hash, number := common.Hash{0: 0xff}, uint64(314)
 | |
| 	if entry := ReadCanonicalHash(db, number); entry != (common.Hash{}) {
 | |
| 		t.Fatalf("Non existent canonical mapping returned: %v", entry)
 | |
| 	}
 | |
| 	// Write and verify the TD in the database
 | |
| 	WriteCanonicalHash(db, hash, number)
 | |
| 	if entry := ReadCanonicalHash(db, number); entry == (common.Hash{}) {
 | |
| 		t.Fatalf("Stored canonical mapping not found")
 | |
| 	} else if entry != hash {
 | |
| 		t.Fatalf("Retrieved canonical mapping mismatch: have %v, want %v", entry, hash)
 | |
| 	}
 | |
| 	// Delete the TD and verify the execution
 | |
| 	DeleteCanonicalHash(db, number)
 | |
| 	if entry := ReadCanonicalHash(db, number); entry != (common.Hash{}) {
 | |
| 		t.Fatalf("Deleted canonical mapping returned: %v", entry)
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests that head headers and head blocks can be assigned, individually.
 | |
| func TestHeadStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	blockHead := types.NewBlockWithHeader(&types.Header{Extra: []byte("test block header")})
 | |
| 	blockFull := types.NewBlockWithHeader(&types.Header{Extra: []byte("test block full")})
 | |
| 	blockFast := types.NewBlockWithHeader(&types.Header{Extra: []byte("test block fast")})
 | |
| 
 | |
| 	// Check that no head entries are in a pristine database
 | |
| 	if entry := ReadHeadHeaderHash(db); entry != (common.Hash{}) {
 | |
| 		t.Fatalf("Non head header entry returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadHeadBlockHash(db); entry != (common.Hash{}) {
 | |
| 		t.Fatalf("Non head block entry returned: %v", entry)
 | |
| 	}
 | |
| 	if entry := ReadHeadFastBlockHash(db); entry != (common.Hash{}) {
 | |
| 		t.Fatalf("Non fast head block entry returned: %v", entry)
 | |
| 	}
 | |
| 	// Assign separate entries for the head header and block
 | |
| 	WriteHeadHeaderHash(db, blockHead.Hash())
 | |
| 	WriteHeadBlockHash(db, blockFull.Hash())
 | |
| 	WriteHeadFastBlockHash(db, blockFast.Hash())
 | |
| 
 | |
| 	// Check that both heads are present, and different (i.e. two heads maintained)
 | |
| 	if entry := ReadHeadHeaderHash(db); entry != blockHead.Hash() {
 | |
| 		t.Fatalf("Head header hash mismatch: have %v, want %v", entry, blockHead.Hash())
 | |
| 	}
 | |
| 	if entry := ReadHeadBlockHash(db); entry != blockFull.Hash() {
 | |
| 		t.Fatalf("Head block hash mismatch: have %v, want %v", entry, blockFull.Hash())
 | |
| 	}
 | |
| 	if entry := ReadHeadFastBlockHash(db); entry != blockFast.Hash() {
 | |
| 		t.Fatalf("Fast head block hash mismatch: have %v, want %v", entry, blockFast.Hash())
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests that receipts associated with a single block can be stored and retrieved.
 | |
| func TestBlockReceiptStorage(t *testing.T) {
 | |
| 	db := NewMemoryDatabase()
 | |
| 
 | |
| 	receipt1 := &types.Receipt{
 | |
| 		Status:            types.ReceiptStatusFailed,
 | |
| 		CumulativeGasUsed: 1,
 | |
| 		Logs: []*types.Log{
 | |
| 			{Address: common.BytesToAddress([]byte{0x11})},
 | |
| 			{Address: common.BytesToAddress([]byte{0x01, 0x11})},
 | |
| 		},
 | |
| 		TxHash:          common.BytesToHash([]byte{0x11, 0x11}),
 | |
| 		ContractAddress: common.BytesToAddress([]byte{0x01, 0x11, 0x11}),
 | |
| 		GasUsed:         111111,
 | |
| 	}
 | |
| 	receipt1.Bloom = types.CreateBloom(types.Receipts{receipt1})
 | |
| 	receipt2 := &types.Receipt{
 | |
| 		PostState:         common.Hash{2}.Bytes(),
 | |
| 		CumulativeGasUsed: 2,
 | |
| 		Logs: []*types.Log{
 | |
| 			{Address: common.BytesToAddress([]byte{0x22})},
 | |
| 			{Address: common.BytesToAddress([]byte{0x02, 0x22})},
 | |
| 		},
 | |
| 		TxHash:          common.BytesToHash([]byte{0x22, 0x22}),
 | |
| 		ContractAddress: common.BytesToAddress([]byte{0x02, 0x22, 0x22}),
 | |
| 		GasUsed:         222222,
 | |
| 	}
 | |
| 	receipt2.Bloom = types.CreateBloom(types.Receipts{receipt2})
 | |
| 	receipts := []*types.Receipt{receipt1, receipt2}
 | |
| 
 | |
| 	// Check that no receipt entries are in a pristine database
 | |
| 	hash := common.BytesToHash([]byte{0x03, 0x14})
 | |
| 	if rs := ReadReceipts(db, hash, 0); len(rs) != 0 {
 | |
| 		t.Fatalf("non existent receipts returned: %v", rs)
 | |
| 	}
 | |
| 	// Insert the receipt slice into the database and check presence
 | |
| 	WriteReceipts(db, hash, 0, receipts)
 | |
| 	if rs := ReadReceipts(db, hash, 0); len(rs) == 0 {
 | |
| 		t.Fatalf("no receipts returned")
 | |
| 	} else {
 | |
| 		for i := 0; i < len(receipts); i++ {
 | |
| 			rlpHave, _ := rlp.EncodeToBytes(rs[i])
 | |
| 			rlpWant, _ := rlp.EncodeToBytes(receipts[i])
 | |
| 
 | |
| 			if !bytes.Equal(rlpHave, rlpWant) {
 | |
| 				t.Fatalf("receipt #%d: receipt mismatch: have %v, want %v", i, rs[i], receipts[i])
 | |
| 			}
 | |
| 		}
 | |
| 	}
 | |
| 	// Delete the receipt slice and check purge
 | |
| 	DeleteReceipts(db, hash, 0)
 | |
| 	if rs := ReadReceipts(db, hash, 0); len(rs) != 0 {
 | |
| 		t.Fatalf("deleted receipts returned: %v", rs)
 | |
| 	}
 | |
| }
 |