-
Notifications
You must be signed in to change notification settings - Fork 142
/
generator.go
137 lines (121 loc) · 2.96 KB
/
generator.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
/*
Copyright NetFoundry Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package loop3
import (
"crypto/sha512"
"github.com/michaelquigley/pfxlog"
"github.com/openziti/foundation/v2/info"
"math/rand"
)
type randomHashedBlockGenerator struct {
count int
minSize int
maxSize int
latencyFreq int
blocks chan Block
pool [][]byte
}
func newRandomHashedBlockGenerator(count, minSize, maxSize, latencyFreq int) *randomHashedBlockGenerator {
g := &randomHashedBlockGenerator{
count: count,
minSize: minSize,
maxSize: maxSize,
latencyFreq: latencyFreq,
blocks: make(chan Block),
pool: newPool(),
}
return g
}
func (g *randomHashedBlockGenerator) run() {
log := pfxlog.Logger()
log.Debug("started")
defer log.Debug("complete")
for i := 0; i < g.count; i++ {
size := g.minSize
distance := g.maxSize - g.minSize
if distance > 0 {
size += rand.Intn(distance)
}
data := make([]byte, size)
for idx := 0; idx < size; {
bucket := g.pool[rand.Intn(len(g.pool))]
for i := 0; i < len(bucket) && idx < size; i++ {
data[idx] = bucket[i]
idx++
}
}
hash := sha512.Sum512(data)
blockType := BlockTypePlain
if g.latencyFreq > 0 && i%g.latencyFreq == 0 {
blockType = BlockTypeLatencyRequest
}
g.blocks <- &RandHashedBlock{
Type: blockType,
Sequence: uint32(i),
Data: data,
Hash: hash[:],
}
}
}
func newPool() [][]byte {
log := pfxlog.Logger()
start := info.NowInMilliseconds()
log.Debug("building")
defer func() {
log.Debugf("complete (%d)", info.NowInMilliseconds()-start)
}()
buckets := 64
pool := make([][]byte, buckets)
for i := 0; i < buckets; i++ {
length := 4096
pool[i] = make([]byte, 0)
for j := 0; j < length; j++ {
pool[i] = append(pool[i], byte(rand.Intn(255)))
}
}
return pool
}
func newSeqGenerator(count, minSize, maxSize int) *seqGenerator {
g := &seqGenerator{
count: count,
minSize: minSize,
maxSize: maxSize,
blocks: make(chan Block),
}
return g
}
func (g *seqGenerator) run() {
log := pfxlog.Logger()
log.Debug("started")
defer log.Debug("complete")
var seq uint64
for i := 0; i < g.count; i++ {
size := g.minSize
distance := g.maxSize - g.minSize
if distance > 0 {
size += rand.Intn(distance)
}
data := make([]byte, size)
for idx := 0; idx < size; idx++ {
data[idx] = byte(seq)
seq++
}
g.blocks <- SeqBlock(data)
}
}
type seqGenerator struct {
count int
minSize int
maxSize int
blocks chan Block
}