aboutsummaryrefslogtreecommitdiffstats
path: root/miner/unconfirmed_test.go
blob: 70fa3a5d40f53be56b4292bb18660467670aa517 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// 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/tangerine-network/go-tangerine/common"
    "github.com/tangerine-network/go-tangerine/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, common.Hash([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, common.Hash([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)
    }
}