-
Notifications
You must be signed in to change notification settings - Fork 666
/
mempool.go
237 lines (192 loc) · 5.34 KB
/
mempool.go
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
// Copyright (C) 2019-2021, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package platformvm
import (
"errors"
"fmt"
"github.com/prometheus/client_golang/prometheus"
"github.com/ava-labs/avalanchego/cache"
"github.com/ava-labs/avalanchego/ids"
"github.com/ava-labs/avalanchego/utils/units"
)
const (
// droppedTxIDsCacheSize is the maximum number of dropped txIDs to cache
droppedTxIDsCacheSize = 50
initialConsumedUTXOsSize = 512
// maxMempoolSize is the maximum number of bytes allowed in the mempool
maxMempoolSize = 64 * units.MiB
)
var (
errUnknownTxType = errors.New("unknown transaction type")
errDuplicatedTx = errors.New("duplicated transaction")
errConflictingTx = errors.New("conflicting transaction")
errMempoolFull = errors.New("mempool is full")
_ Mempool = &mempool{}
)
type Mempool interface {
Add(tx *Tx) error
Has(txID ids.ID) bool
Get(txID ids.ID) *Tx
AddDecisionTx(tx *Tx)
AddProposalTx(tx *Tx)
HasDecisionTxs() bool
HasProposalTx() bool
RemoveDecisionTxs(txs []*Tx)
RemoveProposalTx(tx *Tx)
PopDecisionTxs(numTxs int) []*Tx
PopProposalTx() *Tx
MarkDropped(txID ids.ID)
WasDropped(txID ids.ID) bool
}
// Transactions from clients that have not yet been put into blocks and added to
// consensus
type mempool struct {
bytesAvailableMetric prometheus.Gauge
bytesAvailable int
unissuedDecisionTxs TxHeap
unissuedProposalTxs TxHeap
unknownTxs prometheus.Counter
droppedTxIDs *cache.LRU
consumedUTXOs ids.Set
}
func NewMempool(namespace string, registerer prometheus.Registerer) (Mempool, error) {
bytesAvailableMetric := prometheus.NewGauge(prometheus.GaugeOpts{
Namespace: namespace,
Name: "bytes_available",
Help: "Number of bytes of space currently available in the mempool",
})
if err := registerer.Register(bytesAvailableMetric); err != nil {
return nil, err
}
unissuedDecisionTxs, err := NewTxHeapWithMetrics(
NewTxHeapByAge(),
fmt.Sprintf("%s_decision_txs", namespace),
registerer,
)
if err != nil {
return nil, err
}
unissuedProposalTxs, err := NewTxHeapWithMetrics(
NewTxHeapByStartTime(),
fmt.Sprintf("%s_proposal_txs", namespace),
registerer,
)
if err != nil {
return nil, err
}
unknownTxs := prometheus.NewGauge(prometheus.GaugeOpts{
Namespace: namespace,
Name: "unknown_txs_count",
Help: "Number of unknown tx types seen by the mempool",
})
if err := registerer.Register(unknownTxs); err != nil {
return nil, err
}
bytesAvailableMetric.Set(maxMempoolSize)
return &mempool{
bytesAvailableMetric: bytesAvailableMetric,
bytesAvailable: maxMempoolSize,
unissuedDecisionTxs: unissuedDecisionTxs,
unissuedProposalTxs: unissuedProposalTxs,
unknownTxs: unknownTxs,
droppedTxIDs: &cache.LRU{Size: droppedTxIDsCacheSize},
consumedUTXOs: ids.NewSet(initialConsumedUTXOsSize),
}, nil
}
func (m *mempool) Add(tx *Tx) error {
// Note: a previously dropped tx can be re-added
txID := tx.ID()
if m.Has(txID) {
return errDuplicatedTx
}
if txBytes := tx.Bytes(); len(txBytes) > m.bytesAvailable {
return errMempoolFull
}
inputs := tx.InputIDs()
if m.consumedUTXOs.Overlaps(inputs) {
return errConflictingTx
}
switch tx.UnsignedTx.(type) {
case TimedTx:
m.AddProposalTx(tx)
case UnsignedDecisionTx:
m.AddDecisionTx(tx)
default:
m.unknownTxs.Inc()
return errUnknownTxType
}
// Mark these UTXOs as consumed in the mempool
m.consumedUTXOs.Union(inputs)
// ensure that a mempool tx is either dropped or available (not both)
m.droppedTxIDs.Evict(txID)
return nil
}
func (m *mempool) Has(txID ids.ID) bool {
return m.Get(txID) != nil
}
func (m *mempool) Get(txID ids.ID) *Tx {
if tx := m.unissuedDecisionTxs.Get(txID); tx != nil {
return tx
}
return m.unissuedProposalTxs.Get(txID)
}
func (m *mempool) AddDecisionTx(tx *Tx) {
m.unissuedDecisionTxs.Add(tx)
m.register(tx)
}
func (m *mempool) AddProposalTx(tx *Tx) {
m.unissuedProposalTxs.Add(tx)
m.register(tx)
}
func (m *mempool) HasDecisionTxs() bool { return m.unissuedDecisionTxs.Len() > 0 }
func (m *mempool) HasProposalTx() bool { return m.unissuedProposalTxs.Len() > 0 }
func (m *mempool) RemoveDecisionTxs(txs []*Tx) {
for _, tx := range txs {
txID := tx.ID()
if m.unissuedDecisionTxs.Remove(txID) != nil {
m.deregister(tx)
}
}
}
func (m *mempool) RemoveProposalTx(tx *Tx) {
txID := tx.ID()
if m.unissuedProposalTxs.Remove(txID) != nil {
m.deregister(tx)
}
}
func (m *mempool) PopDecisionTxs(numTxs int) []*Tx {
if maxLen := m.unissuedDecisionTxs.Len(); numTxs > maxLen {
numTxs = maxLen
}
txs := make([]*Tx, numTxs)
for i := range txs {
tx := m.unissuedDecisionTxs.RemoveTop()
m.deregister(tx)
txs[i] = tx
}
return txs
}
func (m *mempool) PopProposalTx() *Tx {
tx := m.unissuedProposalTxs.RemoveTop()
m.deregister(tx)
return tx
}
func (m *mempool) MarkDropped(txID ids.ID) {
m.droppedTxIDs.Put(txID, struct{}{})
}
func (m *mempool) WasDropped(txID ids.ID) bool {
_, exist := m.droppedTxIDs.Get(txID)
return exist
}
func (m *mempool) register(tx *Tx) {
txBytes := tx.Bytes()
m.bytesAvailable -= len(txBytes)
m.bytesAvailableMetric.Set(float64(m.bytesAvailable))
}
func (m *mempool) deregister(tx *Tx) {
txBytes := tx.Bytes()
m.bytesAvailable += len(txBytes)
m.bytesAvailableMetric.Set(float64(m.bytesAvailable))
inputs := tx.InputIDs()
m.consumedUTXOs.Difference(inputs)
}