-
Notifications
You must be signed in to change notification settings - Fork 175
/
testutils.go
408 lines (361 loc) · 11.9 KB
/
testutils.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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
package utils
import (
"encoding/binary"
"encoding/hex"
"fmt"
"io"
"math"
"math/rand"
l "github.com/onflow/flow-go/ledger"
"github.com/onflow/flow-go/ledger/common/hash"
)
// MaxUint16 returns the max value of two uint16
func MaxUint16(a, b uint16) uint16 {
if a > b {
return a
}
return b
}
// Uint16ToBinary converst a uint16 to a byte slice (big endian)
func Uint16ToBinary(integer uint16) []byte {
b := make([]byte, 2)
binary.BigEndian.PutUint16(b, integer)
return b
}
// Uint64ToBinary converst a uint64 to a byte slice (big endian)
func Uint64ToBinary(integer uint64) []byte {
b := make([]byte, 8)
binary.BigEndian.PutUint64(b, integer)
return b
}
// AppendUint8 appends the value byte to the input slice
func AppendUint8(input []byte, value uint8) []byte {
return append(input, value)
}
// AppendUint16 appends the value bytes to the input slice (big endian)
func AppendUint16(input []byte, value uint16) []byte {
buffer := make([]byte, 2)
binary.BigEndian.PutUint16(buffer, value)
return append(input, buffer...)
}
// AppendUint32 appends the value bytes to the input slice (big endian)
func AppendUint32(input []byte, value uint32) []byte {
buffer := make([]byte, 4)
binary.BigEndian.PutUint32(buffer, value)
return append(input, buffer...)
}
// AppendUint64 appends the value bytes to the input slice (big endian)
func AppendUint64(input []byte, value uint64) []byte {
buffer := make([]byte, 8)
binary.BigEndian.PutUint64(buffer, value)
return append(input, buffer...)
}
// AppendShortData appends data shorter than 16kB
func AppendShortData(input []byte, data []byte) []byte {
if len(data) > math.MaxUint16 {
panic(fmt.Sprintf("short data too long! %d", len(data)))
}
input = AppendUint16(input, uint16(len(data)))
input = append(input, data...)
return input
}
// AppendLongData appends data shorter than 32MB
func AppendLongData(input []byte, data []byte) []byte {
if len(data) > math.MaxUint32 {
panic(fmt.Sprintf("long data too long! %d", len(data)))
}
input = AppendUint32(input, uint32(len(data)))
input = append(input, data...)
return input
}
// ReadSlice reads `size` bytes from the input
func ReadSlice(input []byte, size int) (value []byte, rest []byte, err error) {
if len(input) < size {
return nil, input, fmt.Errorf("input size is too small to be splited %d < %d ", len(input), size)
}
return input[:size], input[size:], nil
}
// ReadUint8 reads a uint8 from the input and returns the rest
func ReadUint8(input []byte) (value uint8, rest []byte, err error) {
if len(input) < 1 {
return 0, input, fmt.Errorf("input size (%d) is too small to read a uint8", len(input))
}
return input[0], input[1:], nil
}
// ReadUint16 reads a uint16 from the input and returns the rest
func ReadUint16(input []byte) (value uint16, rest []byte, err error) {
if len(input) < 2 {
return 0, input, fmt.Errorf("input size (%d) is too small to read a uint16", len(input))
}
return binary.BigEndian.Uint16(input[:2]), input[2:], nil
}
// ReadUint32 reads a uint32 from the input and returns the rest
func ReadUint32(input []byte) (value uint32, rest []byte, err error) {
if len(input) < 4 {
return 0, input, fmt.Errorf("input size (%d) is too small to read a uint32", len(input))
}
return binary.BigEndian.Uint32(input[:4]), input[4:], nil
}
// ReadUint64 reads a uint64 from the input and returns the rest
func ReadUint64(input []byte) (value uint64, rest []byte, err error) {
if len(input) < 8 {
return 0, input, fmt.Errorf("input size (%d) is too small to read a uint64", len(input))
}
return binary.BigEndian.Uint64(input[:8]), input[8:], nil
}
// ReadShortData read data shorter than 16kB and return the rest of bytes
func ReadShortData(input []byte) (data []byte, rest []byte, err error) {
var size uint16
size, rest, err = ReadUint16(input)
if err != nil {
return nil, rest, err
}
data = rest[:size]
rest = rest[size:]
return
}
// ReadShortDataFromReader reads data shorter than 16kB from reader
func ReadShortDataFromReader(reader io.Reader) ([]byte, error) {
buf, err := ReadFromBuffer(reader, 2)
if err != nil {
return nil, fmt.Errorf("cannot read short data length: %w", err)
}
size, _, err := ReadUint16(buf)
if err != nil {
return nil, fmt.Errorf("cannot read short data length: %w", err)
}
buf, err = ReadFromBuffer(reader, int(size))
if err != nil {
return nil, fmt.Errorf("cannot read short data: %w", err)
}
return buf, nil
}
// ReadLongDataFromReader reads data shorter than 16kB from reader
func ReadLongDataFromReader(reader io.Reader) ([]byte, error) {
buf, err := ReadFromBuffer(reader, 4)
if err != nil {
return nil, fmt.Errorf("cannot read long data length: %w", err)
}
size, _, err := ReadUint32(buf)
if err != nil {
return nil, fmt.Errorf("cannot read long data length: %w", err)
}
buf, err = ReadFromBuffer(reader, int(size))
if err != nil {
return nil, fmt.Errorf("cannot read long data: %w", err)
}
return buf, nil
}
// ReadFromBuffer reads 'length' bytes from the input
func ReadFromBuffer(reader io.Reader, length int) ([]byte, error) {
if length == 0 {
return nil, nil
}
buf := make([]byte, length)
_, err := io.ReadFull(reader, buf)
if err != nil {
return nil, fmt.Errorf("cannot read data: %w", err)
}
return buf, nil
}
// TrieUpdateFixture returns a trie update fixture
func TrieUpdateFixture(n int, minPayloadByteSize int, maxPayloadByteSize int) *l.TrieUpdate {
return &l.TrieUpdate{
RootHash: RootHashFixture(),
Paths: RandomPaths(n),
Payloads: RandomPayloads(n, minPayloadByteSize, maxPayloadByteSize),
}
}
// QueryFixture returns a query fixture
func QueryFixture() *l.Query {
scBytes, _ := hex.DecodeString("6a7a565add94fb36069d79e8725c221cd1e5740742501ef014ea6db999fd98ad")
var sc l.State
copy(sc[:], scBytes)
k1p1 := l.NewKeyPart(uint16(1), []byte("1"))
k1p2 := l.NewKeyPart(uint16(22), []byte("2"))
k1 := l.NewKey([]l.KeyPart{k1p1, k1p2})
k2p1 := l.NewKeyPart(uint16(1), []byte("3"))
k2p2 := l.NewKeyPart(uint16(22), []byte("4"))
k2 := l.NewKey([]l.KeyPart{k2p1, k2p2})
u, _ := l.NewQuery(sc, []l.Key{k1, k2})
return u
}
// LightPayload returns a payload with 2 byte key and 2 byte value
func LightPayload(key uint16, value uint16) *l.Payload {
k := l.Key{KeyParts: []l.KeyPart{{Type: 0, Value: Uint16ToBinary(key)}}}
v := l.Value(Uint16ToBinary(value))
return &l.Payload{Key: k, Value: v}
}
// LightPayload8 returns a payload with 1 byte key and 1 byte value
func LightPayload8(key uint8, value uint8) *l.Payload {
k := l.Key{KeyParts: []l.KeyPart{{Type: 0, Value: []byte{key}}}}
v := l.Value([]byte{value})
return &l.Payload{Key: k, Value: v}
}
// PathByUint8 returns a path (32 bytes) given a uint8
func PathByUint8(inp uint8) l.Path {
var b l.Path
b[0] = inp
return b
}
// PathByUint16 returns a path (32 bytes) given a uint16 (big endian)
func PathByUint16(inp uint16) l.Path {
var b l.Path
binary.BigEndian.PutUint16(b[:], inp)
return b
}
// PathByUint16LeftPadded returns a path (32 bytes) given a uint16 (left padded big endian)
func PathByUint16LeftPadded(inp uint16) l.Path {
var b l.Path
binary.BigEndian.PutUint16(b[30:], inp)
return b
}
// KeyPartFixture returns a key part fixture
func KeyPartFixture(typ uint16, val string) l.KeyPart {
kp1t := typ
kp1v := []byte(val)
return l.NewKeyPart(kp1t, kp1v)
}
// UpdateFixture returns an update fixture
func UpdateFixture() *l.Update {
scBytes, _ := hex.DecodeString("6a7a565add94fb36069d79e8725c221cd1e5740742501ef014ea6db999fd98ad")
var sc l.State
copy(sc[:], scBytes)
k1p1 := l.NewKeyPart(uint16(1), []byte("1"))
k1p2 := l.NewKeyPart(uint16(22), []byte("2"))
k1 := l.NewKey([]l.KeyPart{k1p1, k1p2})
v1 := l.Value([]byte{'A'})
k2p1 := l.NewKeyPart(uint16(1), []byte("3"))
k2p2 := l.NewKeyPart(uint16(22), []byte("4"))
k2 := l.NewKey([]l.KeyPart{k2p1, k2p2})
v2 := l.Value([]byte{'B'})
u, _ := l.NewUpdate(sc, []l.Key{k1, k2}, []l.Value{v1, v2})
return u
}
// RootHashFixture returns a root hash fixture
func RootHashFixture() l.RootHash {
rootBytes, _ := hex.DecodeString("6a7a565add94fb36069d79e8725c221cd1e5740742501ef014ea6db999fd98ad")
var root l.RootHash
copy(root[:], rootBytes)
return root
}
// TrieProofFixture returns a trie proof fixture
func TrieProofFixture() (*l.TrieProof, l.State) {
p := l.NewTrieProof()
p.Path = PathByUint16(330)
p.Payload = LightPayload8('A', 'A')
p.Inclusion = true
p.Flags = []byte{byte(130), byte(0)}
p.Interims = make([]hash.Hash, 0)
interim1Bytes, _ := hex.DecodeString("accb0399dd2b3a7a48618b2376f5e61d822e0c7736b044c364a05c2904a2f315")
interim2Bytes, _ := hex.DecodeString("f3fba426a2f01c342304e3ca7796c3980c62c625f7fd43105ad5afd92b165542")
var interim1, interim2 hash.Hash
copy(interim1[:], interim1Bytes)
copy(interim2[:], interim2Bytes)
p.Interims = append(p.Interims, interim1)
p.Interims = append(p.Interims, interim2)
p.Steps = uint8(7)
scBytes, _ := hex.DecodeString("4a9f3a15d7257b624b645955576f62edcceff5e125f49585cdf077d9f37c7ac0")
var sc l.State
copy(sc[:], scBytes)
return p, sc
}
// TrieBatchProofFixture returns a trie batch proof fixture
func TrieBatchProofFixture() (*l.TrieBatchProof, l.State) {
p, s := TrieProofFixture()
bp := l.NewTrieBatchProof()
bp.Proofs = append(bp.Proofs, p)
bp.Proofs = append(bp.Proofs, p)
return bp, s
}
// RandomPathsRandLen generate m random paths.
// the number of paths, m, is also randomly selected from the range [1, maxN]
func RandomPathsRandLen(maxN int) []l.Path {
numberOfPaths := rand.Intn(maxN) + 1
return RandomPaths(numberOfPaths)
}
// RandomPaths generates n random (no repetition)
func RandomPaths(n int) []l.Path {
paths := make([]l.Path, 0, n)
alreadySelectPaths := make(map[l.Path]bool)
i := 0
for i < n {
var path l.Path
rand.Read(path[:])
// deduplicate
if _, found := alreadySelectPaths[path]; !found {
paths = append(paths, path)
alreadySelectPaths[path] = true
i++
}
}
return paths
}
// RandomPayload returns a random payload
func RandomPayload(minByteSize int, maxByteSize int) *l.Payload {
keyByteSize := minByteSize + rand.Intn(maxByteSize-minByteSize)
keydata := make([]byte, keyByteSize)
rand.Read(keydata)
key := l.Key{KeyParts: []l.KeyPart{{Type: 0, Value: keydata}}}
valueByteSize := minByteSize + rand.Intn(maxByteSize-minByteSize)
valuedata := make([]byte, valueByteSize)
rand.Read(valuedata)
value := l.Value(valuedata)
return &l.Payload{Key: key, Value: value}
}
// RandomPayloads returns n random payloads
func RandomPayloads(n int, minByteSize int, maxByteSize int) []*l.Payload {
res := make([]*l.Payload, 0)
for i := 0; i < n; i++ {
res = append(res, RandomPayload(minByteSize, maxByteSize))
}
return res
}
// RandomValues returns n random values with variable sizes (minByteSize <= size < maxByteSize)
func RandomValues(n int, minByteSize, maxByteSize int) []l.Value {
if minByteSize > maxByteSize {
panic("minByteSize cannot be smaller then maxByteSize")
}
values := make([]l.Value, 0)
for i := 0; i < n; i++ {
var byteSize = maxByteSize
if minByteSize < maxByteSize {
byteSize = minByteSize + rand.Intn(maxByteSize-minByteSize)
}
value := make([]byte, byteSize)
rand.Read(value)
values = append(values, value)
}
return values
}
// RandomUniqueKeys generates n random keys (each with m random key parts)
func RandomUniqueKeys(n, m, minByteSize, maxByteSize int) []l.Key {
if minByteSize > maxByteSize {
panic("minByteSize cannot be smaller then maxByteSize")
}
keys := make([]l.Key, 0)
alreadySelectKeys := make(map[string]bool)
i := 0
for i < n {
keyParts := make([]l.KeyPart, 0)
for j := 0; j < m; j++ {
byteSize := maxByteSize
if minByteSize < maxByteSize {
byteSize = minByteSize + rand.Intn(maxByteSize-minByteSize)
}
keyPartData := make([]byte, byteSize)
rand.Read(keyPartData)
keyParts = append(keyParts, l.NewKeyPart(uint16(j), keyPartData))
}
key := l.NewKey(keyParts)
// deduplicate
if _, found := alreadySelectKeys[key.String()]; !found {
keys = append(keys, key)
alreadySelectKeys[key.String()] = true
i++
} else {
fmt.Println("Already existing")
}
}
return keys
}