forked from nakagami/firebirdsql
/
remoteEvent.go
132 lines (116 loc) · 2.75 KB
/
remoteEvent.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
package firebirdsql
import (
"bytes"
"errors"
"sync"
"sync/atomic"
)
var (
ErrEventAlreadyRunning = errors.New("events are already running")
ErrEventNeed = errors.New("at least one event is needed")
ErrWrongLengthEvent = errors.New("length name events are longer than 255")
ErrEventBufferLarge = errors.New("whole events buffer is bigger than 65535")
)
const (
maxEpbLength = 65535
maxEventNameLength = 255
)
type remoteEvent struct {
mu sync.RWMutex
id int32
rid int32
events []string
counts map[string]int
prevCounts map[string]int
running int32
}
func newRemoteEvent() *remoteEvent {
newEvent := &remoteEvent{
events: []string{},
}
return newEvent
}
func (e *remoteEvent) queueEvents(events ...string) error {
if atomic.LoadInt32(&e.running) == 1 {
return ErrEventAlreadyRunning
}
if len(events) == 0 {
return ErrEventNeed
}
for _, event := range events {
if len(event) > maxEventNameLength {
return ErrWrongLengthEvent
}
}
if len(buildEpbSlice(events, map[string]int{})) > maxEpbLength {
return ErrEventBufferLarge
}
atomic.StoreInt32(&e.running, 1)
e.counts = make(map[string]int, len(events))
e.prevCounts = make(map[string]int, len(events))
for _, event := range events {
e.events = append(e.events, event)
e.counts[event] = 0
e.prevCounts[event] = 0
}
return nil
}
func (e *remoteEvent) cancelEvents() {
e.mu.Lock()
defer e.mu.Unlock()
e.events = make([]string, 0)
e.counts = nil
e.prevCounts = nil
atomic.StoreInt32(&e.running, 0)
}
func (e *remoteEvent) getEventCounts(data []byte) []Event {
e.mu.Lock()
e.prevCounts = make(map[string]int, len(e.events))
for k, v := range e.counts {
e.prevCounts[k] = v
e.counts[k] = 0
}
for i := 1; i < len(data); {
length := int(data[i])
i++
eventName := string(data[i : i+length])
i += length
_, found := e.counts[eventName]
if found {
e.counts[eventName] = int(bytes_to_int32(data[i:]) - 1)
}
i += 4
}
e.mu.Unlock()
e.mu.RLock()
defer e.mu.RUnlock()
var result []Event
for i := 0; i < len(e.events); i++ {
count := e.counts[e.events[i]] - e.prevCounts[e.events[i]]
if count == 0 {
continue
}
result = append(result, Event{
Name: e.events[i],
Count: count,
ID: atomic.LoadInt32(&e.id),
RemoteID: atomic.LoadInt32(&e.rid),
})
}
return result
}
func buildEpbSlice(events []string, counts map[string]int) []byte {
buf := &bytes.Buffer{}
buf.WriteByte(byte(EPB_version1))
for _, event := range events {
buf.WriteByte(byte(len(event)))
buf.WriteString(event)
buf.Write(int32_to_bytes(int32(counts[event] + 1)))
}
return buf.Bytes()
}
func (e *remoteEvent) buildEpb() []byte {
e.mu.RLock()
defer e.mu.RUnlock()
return buildEpbSlice(e.events, e.counts)
}