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
package clsync
import (
"container/heap"
"testing"
"github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/log"
"github.com/stretchr/testify/require"
"github.com/ethereum-optimism/optimism/op-service/eth"
"github.com/ethereum-optimism/optimism/op-service/testlog"
)
func TestPayloadsByNumber(t *testing.T) {
p := payloadsByNumber{}
mk := func(i uint64) payloadAndSize {
return payloadAndSize{
envelope: ð.ExecutionPayloadEnvelope{
ExecutionPayload: ð.ExecutionPayload{
BlockNumber: eth.Uint64Quantity(i),
},
},
}
}
// add payload A, check it was added
a := mk(123)
heap.Push(&p, a)
require.Equal(t, p.Len(), 1)
require.Equal(t, p[0], a)
// add payload B, check it was added in top-priority spot
b := mk(100)
heap.Push(&p, b)
require.Equal(t, p.Len(), 2)
require.Equal(t, p[0], b)
// add payload C, check it did not get first like B, since block num is higher
c := mk(150)
heap.Push(&p, c)
require.Equal(t, p.Len(), 3)
require.Equal(t, p[0], b) // still b
// pop b
heap.Pop(&p)
require.Equal(t, p.Len(), 2)
require.Equal(t, p[0], a)
// pop a
heap.Pop(&p)
require.Equal(t, p.Len(), 1)
require.Equal(t, p[0], c)
// pop c
heap.Pop(&p)
require.Equal(t, p.Len(), 0)
// duplicate entry
heap.Push(&p, b)
require.Equal(t, p.Len(), 1)
heap.Push(&p, b)
require.Equal(t, p.Len(), 2)
heap.Pop(&p)
require.Equal(t, p.Len(), 1)
}
func TestPayloadMemSize(t *testing.T) {
require.Equal(t, payloadMemFixedCost, payloadMemSize(nil), "nil is same fixed cost")
require.Equal(t, payloadMemFixedCost, payloadMemSize(ð.ExecutionPayloadEnvelope{ExecutionPayload: ð.ExecutionPayload{}}), "empty payload fixed cost")
require.Equal(t, payloadMemFixedCost+payloadTxMemOverhead, payloadMemSize(ð.ExecutionPayloadEnvelope{ExecutionPayload: ð.ExecutionPayload{Transactions: []eth.Data{nil}}}), "nil tx counts")
require.Equal(t, payloadMemFixedCost+payloadTxMemOverhead, payloadMemSize(ð.ExecutionPayloadEnvelope{ExecutionPayload: ð.ExecutionPayload{Transactions: []eth.Data{make([]byte, 0)}}}), "empty tx counts")
require.Equal(t, payloadMemFixedCost+4*payloadTxMemOverhead+42+1337+0+1,
payloadMemSize(ð.ExecutionPayloadEnvelope{ExecutionPayload: ð.ExecutionPayload{Transactions: []eth.Data{
make([]byte, 42),
make([]byte, 1337),
make([]byte, 0),
make([]byte, 1),
}}}), "mixed txs")
}
func envelope(payload *eth.ExecutionPayload) *eth.ExecutionPayloadEnvelope {
return ð.ExecutionPayloadEnvelope{ExecutionPayload: payload}
}
func TestPayloadsQueue(t *testing.T) {
pq := NewPayloadsQueue(testlog.Logger(t, log.LvlInfo), payloadMemFixedCost*3, payloadMemSize)
require.Equal(t, 0, pq.Len())
require.Nil(t, pq.Peek())
require.Nil(t, pq.Pop())
a := envelope(ð.ExecutionPayload{BlockNumber: 3, BlockHash: common.Hash{3}})
b := envelope(ð.ExecutionPayload{BlockNumber: 4, BlockHash: common.Hash{4}})
c := envelope(ð.ExecutionPayload{BlockNumber: 5, BlockHash: common.Hash{5}})
d := envelope(ð.ExecutionPayload{BlockNumber: 6, BlockHash: common.Hash{6}})
bAlt := envelope(ð.ExecutionPayload{BlockNumber: 4, BlockHash: common.Hash{0xff}})
bDup := envelope(ð.ExecutionPayload{BlockNumber: 4, BlockHash: common.Hash{4}})
require.NoError(t, pq.Push(b))
require.Equal(t, pq.Len(), 1)
require.Equal(t, pq.Peek(), b)
require.Error(t, pq.Push(nil), "cannot add nil payloads")
require.NoError(t, pq.Push(c))
require.Equal(t, pq.Len(), 2)
require.Equal(t, pq.MemSize(), 2*payloadMemFixedCost)
require.Equal(t, pq.Peek(), b, "expecting b to still be the lowest number payload")
require.NoError(t, pq.Push(a))
require.Equal(t, pq.Len(), 3)
require.Equal(t, pq.MemSize(), 3*payloadMemFixedCost)
require.Equal(t, pq.Peek(), a, "expecting a to be new lowest number")
require.Equal(t, pq.Pop(), a)
require.Equal(t, pq.Len(), 2, "expecting to pop the lowest")
require.Equal(t, pq.Peek(), b, "expecting b to be lowest, compared to c")
require.Equal(t, pq.Pop(), b)
require.Equal(t, pq.Len(), 1)
require.Equal(t, pq.MemSize(), payloadMemFixedCost)
require.Equal(t, pq.Pop(), c)
require.Equal(t, pq.Len(), 0, "expecting no items to remain")
e := envelope(ð.ExecutionPayload{BlockNumber: 5, Transactions: []eth.Data{make([]byte, payloadMemFixedCost*3+1)}})
require.Error(t, pq.Push(e), "cannot add payloads that are too large")
require.NoError(t, pq.Push(b))
require.Equal(t, pq.Len(), 1, "expecting b")
require.Equal(t, pq.Peek(), b)
require.NoError(t, pq.Push(c))
require.Equal(t, pq.Len(), 2, "expecting b, c")
require.Equal(t, pq.Peek(), b)
require.NoError(t, pq.Push(a))
require.Equal(t, pq.Len(), 3, "expecting a, b, c")
require.Equal(t, pq.Peek(), a)
// No duplicates allowed
require.Error(t, pq.Push(bDup))
// But reorg data allowed
require.NoError(t, pq.Push(bAlt))
require.NoError(t, pq.Push(d))
require.Equal(t, pq.Len(), 3)
require.Equal(t, pq.Peek(), b, "expecting b, c, d")
require.NotContainsf(t, pq.pq[:], a, "a should be dropped after 3 items already exist under max size constraint")
}