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
|
package muxer_test
import (
"bufio"
"bytes"
"testing"
"git.onurgunduz.com/muxer"
)
func BenchmarkWriter_64B(b *testing.B) {
benchWriter(b, 64)
}
func BenchmarkWriter_4KB(b *testing.B) {
benchWriter(b, 4*1024)
}
func BenchmarkWriter_1MB(b *testing.B) {
benchWriter(b, 1024*1024)
}
func benchWriter(b *testing.B, payloadSize int) {
payload := make([]byte, payloadSize)
msg := muxer.NewMessage(1, 'X', payload)
buf := new(bytes.Buffer)
bw := bufio.NewWriter(buf)
w := muxer.NewWriter(bw)
b.SetBytes(int64(payloadSize))
b.ReportAllocs()
b.ResetTimer()
for i := 0; i < b.N; i++ {
buf.Reset()
bw.Reset(buf)
w.WriteMessage(msg)
bw.Flush()
}
}
func BenchmarkReader_64B(b *testing.B) {
benchReader(b, 64)
}
func BenchmarkReader_4KB(b *testing.B) {
benchReader(b, 4*1024)
}
func BenchmarkReader_1MB(b *testing.B) {
benchReader(b, 1024*1024)
}
func benchReader(b *testing.B, payloadSize int) {
// Encode message once
payload := make([]byte, payloadSize)
msg := muxer.NewMessage(1, 'X', payload)
buf := new(bytes.Buffer)
bw := bufio.NewWriter(buf)
w := muxer.NewWriter(bw)
w.WriteMessage(msg)
bw.Flush()
encoded := buf.Bytes()
// Buffer size must be larger than encoded message size
bufSize := 32 * 1024
if len(encoded) > bufSize {
bufSize = len(encoded) + 1024 // Add some headroom
}
source := &repeatReader{data: encoded}
reader := muxer.NewReaderSize(source, bufSize)
b.SetBytes(int64(payloadSize))
b.ReportAllocs()
b.ResetTimer()
m := &muxer.Message{}
for i := 0; i < b.N; i++ {
err := reader.ReadMessage(m)
if err != nil {
b.Fatal(err)
}
}
}
// repeatReader repeats the same data indefinitely.
type repeatReader struct {
data []byte
pos int
}
func (r *repeatReader) Read(p []byte) (n int, err error) {
if len(r.data) == 0 {
return 0, nil
}
for n < len(p) && n < len(r.data) {
toCopy := len(p) - n
remaining := len(r.data) - r.pos
if toCopy > remaining {
toCopy = remaining
}
copy(p[n:], r.data[r.pos:r.pos+toCopy])
n += toCopy
r.pos += toCopy
if r.pos >= len(r.data) {
r.pos = 0
}
}
return n, nil
}
|