123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687 |
- // 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 miner
- import (
- "testing"
- "github.com/ethereum/go-ethereum/core/types"
- )
- // noopChainRetriever is an implementation of headerRetriever that always
- // returns nil for any requested headers.
- type noopChainRetriever struct{}
- func (r *noopChainRetriever) GetHeaderByNumber(number uint64) *types.Header {
- return nil
- }
- func (r *noopChainRetriever) GetBlockByNumber(number uint64) *types.Block {
- return nil
- }
- // Tests that inserting blocks into the unconfirmed set accumulates them until
- // the desired depth is reached, after which they begin to be dropped.
- func TestUnconfirmedInsertBounds(t *testing.T) {
- limit := uint(10)
- pool := newUnconfirmedBlocks(new(noopChainRetriever), limit)
- for depth := uint64(0); depth < 2*uint64(limit); depth++ {
- // Insert multiple blocks for the same level just to stress it
- for i := 0; i < int(depth); i++ {
- pool.Insert(depth, [32]byte{byte(depth), byte(i)})
- }
- // Validate that no blocks below the depth allowance are left in
- pool.blocks.Do(func(block interface{}) {
- if block := block.(*unconfirmedBlock); block.index+uint64(limit) <= depth {
- t.Errorf("depth %d: block %x not dropped", depth, block.hash)
- }
- })
- }
- }
- // Tests that shifting blocks out of the unconfirmed set works both for normal
- // cases as well as for corner cases such as empty sets, empty shifts or full
- // shifts.
- func TestUnconfirmedShifts(t *testing.T) {
- // Create a pool with a few blocks on various depths
- limit, start := uint(10), uint64(25)
- pool := newUnconfirmedBlocks(new(noopChainRetriever), limit)
- for depth := start; depth < start+uint64(limit); depth++ {
- pool.Insert(depth, [32]byte{byte(depth)})
- }
- // Try to shift below the limit and ensure no blocks are dropped
- pool.Shift(start + uint64(limit) - 1)
- if n := pool.blocks.Len(); n != int(limit) {
- t.Errorf("unconfirmed count mismatch: have %d, want %d", n, limit)
- }
- // Try to shift half the blocks out and verify remainder
- pool.Shift(start + uint64(limit) - 1 + uint64(limit/2))
- if n := pool.blocks.Len(); n != int(limit)/2 {
- t.Errorf("unconfirmed count mismatch: have %d, want %d", n, limit/2)
- }
- // Try to shift all the remaining blocks out and verify emptyness
- pool.Shift(start + 2*uint64(limit))
- if n := pool.blocks.Len(); n != 0 {
- t.Errorf("unconfirmed count mismatch: have %d, want %d", n, 0)
- }
- // Try to shift out from the empty set and make sure it doesn't break
- pool.Shift(start + 3*uint64(limit))
- if n := pool.blocks.Len(); n != 0 {
- t.Errorf("unconfirmed count mismatch: have %d, want %d", n, 0)
- }
- }
|