4535230059
* cmd, core, eth: init tx lookup in background * core/rawdb: tiny log fixes to make it clearer what's happening * core, eth: fix rebase errors * core/rawdb: make reindexing less generic, but more optimal * rlp: implement rlp list iterator * core/rawdb: new implementation of tx indexing/unindex using generic tx iterator and hashing rlp-data * core/rawdb, cmd/utils: fix review concerns * cmd/utils: fix merge issue * core/rawdb: add some log formatting polishes Co-authored-by: rjl493456442 <garyrong0905@gmail.com> Co-authored-by: Péter Szilágyi <peterke@gmail.com>
83 lines
2.6 KiB
Go
83 lines
2.6 KiB
Go
// Copyright 2019 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 (
|
|
"math/big"
|
|
"reflect"
|
|
"sort"
|
|
"testing"
|
|
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/core/types"
|
|
)
|
|
|
|
func TestChainIterator(t *testing.T) {
|
|
// Construct test chain db
|
|
chainDb := NewMemoryDatabase()
|
|
|
|
var block *types.Block
|
|
var txs []*types.Transaction
|
|
for i := uint64(0); i <= 10; i++ {
|
|
if i == 0 {
|
|
block = types.NewBlock(&types.Header{Number: big.NewInt(int64(i))}, nil, nil, nil) // Empty genesis block
|
|
} else {
|
|
tx := types.NewTransaction(i, common.BytesToAddress([]byte{0x11}), big.NewInt(111), 1111, big.NewInt(11111), []byte{0x11, 0x11, 0x11})
|
|
txs = append(txs, tx)
|
|
block = types.NewBlock(&types.Header{Number: big.NewInt(int64(i))}, []*types.Transaction{tx}, nil, nil)
|
|
}
|
|
WriteBlock(chainDb, block)
|
|
WriteCanonicalHash(chainDb, block.Hash(), block.NumberU64())
|
|
}
|
|
|
|
var cases = []struct {
|
|
from, to uint64
|
|
reverse bool
|
|
expect []int
|
|
}{
|
|
{0, 11, true, []int{10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}},
|
|
{0, 0, true, nil},
|
|
{0, 5, true, []int{4, 3, 2, 1, 0}},
|
|
{10, 11, true, []int{10}},
|
|
{0, 11, false, []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}},
|
|
{0, 0, false, nil},
|
|
{10, 11, false, []int{10}},
|
|
}
|
|
for i, c := range cases {
|
|
var numbers []int
|
|
hashCh, _ := iterateTransactions(chainDb, c.from, c.to, c.reverse)
|
|
if hashCh != nil {
|
|
for h := range hashCh {
|
|
numbers = append(numbers, int(h.number))
|
|
if len(h.hashes) > 0 {
|
|
if got, exp := h.hashes[0], txs[h.number-1].Hash(); got != exp {
|
|
t.Fatalf("hash wrong, got %x exp %x", got, exp)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if !c.reverse {
|
|
sort.Ints(numbers)
|
|
} else {
|
|
sort.Sort(sort.Reverse(sort.IntSlice(numbers)))
|
|
}
|
|
if !reflect.DeepEqual(numbers, c.expect) {
|
|
t.Fatalf("Case %d failed, visit element mismatch, want %v, got %v", i, c.expect, numbers)
|
|
}
|
|
}
|
|
}
|