aboutsummaryrefslogtreecommitdiffstats
path: root/block_pool.go
blob: 25627eb5c58310dcbcaae7255085443a55a2b0c1 (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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
package eth

import (
    "math"
    "math/big"
    "sync"

    "github.com/ethereum/eth-go/ethchain"
    "github.com/ethereum/eth-go/ethutil"
)

type block struct {
    peer  *Peer
    block *ethchain.Block
}

type BlockPool struct {
    mut sync.Mutex

    eth *Ethereum

    hashPool [][]byte
    pool     map[string]*block

    td *big.Int
}

func NewBlockPool(eth *Ethereum) *BlockPool {
    return &BlockPool{
        eth:  eth,
        pool: make(map[string]*block),
        td:   ethutil.Big0,
    }
}

func (self *BlockPool) HasLatestHash() bool {
    return self.pool[string(self.eth.BlockChain().CurrentBlock.Hash())] != nil
}

func (self *BlockPool) HasCommonHash(hash []byte) bool {
    return self.eth.BlockChain().GetBlock(hash) != nil
}

func (self *BlockPool) AddHash(hash []byte) {
    if self.pool[string(hash)] == nil {
        self.pool[string(hash)] = &block{nil, nil}

        self.hashPool = append([][]byte{hash}, self.hashPool...)
    }
}

func (self *BlockPool) SetBlock(b *ethchain.Block, peer *Peer) {
    hash := string(b.Hash())

    if self.pool[hash] == nil {
        self.pool[hash] = &block{peer, nil}
    }

    self.pool[hash].block = b
}

func (self *BlockPool) CheckLinkAndProcess(f func(block *ethchain.Block)) bool {
    self.mut.Lock()
    defer self.mut.Unlock()

    if self.IsLinked() {
        for i, hash := range self.hashPool {
            if self.pool[string(hash)] == nil {
                continue
            }

            block := self.pool[string(hash)].block
            if block != nil {
                f(block)

                delete(self.pool, string(hash))
            } else {
                self.hashPool = self.hashPool[i:]

                return false
            }
        }

        return true
    }

    return false
}

func (self *BlockPool) IsLinked() bool {
    if len(self.hashPool) == 0 {
        return false
    }

    for i := 0; i < len(self.hashPool); i++ {
        item := self.pool[string(self.hashPool[i])]
        if item != nil && item.block != nil {
            if self.eth.BlockChain().HasBlock(item.block.PrevHash) {
                self.hashPool = self.hashPool[i:]

                return true
            }
        }
    }

    return false
}

func (self *BlockPool) Take(amount int, peer *Peer) (hashes [][]byte) {
    self.mut.Lock()
    defer self.mut.Unlock()

    num := int(math.Min(float64(amount), float64(len(self.pool))))
    j := 0
    for i := 0; i < len(self.hashPool) && j < num; i++ {
        hash := string(self.hashPool[i])
        if self.pool[hash] != nil && (self.pool[hash].peer == nil || self.pool[hash].peer == peer) && self.pool[hash].block == nil {
            self.pool[hash].peer = peer

            hashes = append(hashes, self.hashPool[i])
            j++
        }
    }

    return
}