forked from erigontech/erigon
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlogsfilter.go
177 lines (160 loc) · 5 KB
/
logsfilter.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
package rpchelper
import (
"sync"
"github.com/ledgerwatch/erigon-lib/gointerfaces"
"github.com/ledgerwatch/erigon-lib/gointerfaces/remote"
"github.com/ledgerwatch/erigon/common"
types2 "github.com/ledgerwatch/erigon/core/types"
)
type LogsFilterAggregator struct {
aggLogsFilter LogsFilter // Aggregation of all current log filters
logsFilters map[LogsSubID]*LogsFilter // Filter for each subscriber, keyed by filterID
logsFilterLock sync.RWMutex
nextFilterId LogsSubID
}
// LogsFilter is used for both representing log filter for a specific subscriber (RPC daemon usually)
// and "aggregated" log filter representing a union of all subscribers. Therefore, the values in
// the mappings are counters (of type int) and they get deleted when counter goes back to 0
// Also, addAddr and allTopic are int instead of bool because they are also counter, counting
// how many subscribers have this set on
type LogsFilter struct {
allAddrs int
addrs map[common.Address]int
allTopics int
topics map[common.Hash]int
topicsOriginal [][]common.Hash // Original topic filters to be applied before distributing to individual subscribers
sender chan *types2.Log // nil for aggregate subscriber, for appropriate stream server otherwise
}
func NewLogsFilterAggregator() *LogsFilterAggregator {
return &LogsFilterAggregator{
aggLogsFilter: LogsFilter{
addrs: make(map[common.Address]int),
topics: make(map[common.Hash]int),
},
logsFilters: make(map[LogsSubID]*LogsFilter),
nextFilterId: 0,
}
}
func (a *LogsFilterAggregator) insertLogsFilter(sender chan *types2.Log) (LogsSubID, *LogsFilter) {
a.logsFilterLock.Lock()
defer a.logsFilterLock.Unlock()
filterId := a.nextFilterId
a.nextFilterId++
filter := &LogsFilter{addrs: map[common.Address]int{}, topics: map[common.Hash]int{}, sender: sender}
a.logsFilters[filterId] = filter
return filterId, filter
}
func (a *LogsFilterAggregator) removeLogsFilter(filterId LogsSubID) bool {
a.logsFilterLock.Lock()
defer a.logsFilterLock.Unlock()
if filter, ok := a.logsFilters[filterId]; ok {
a.subtractLogFilters(filter)
close(filter.sender)
delete(a.logsFilters, filterId)
return true
}
return false
}
func (a *LogsFilterAggregator) subtractLogFilters(f *LogsFilter) {
a.aggLogsFilter.allAddrs -= f.allAddrs
for addr, count := range f.addrs {
a.aggLogsFilter.addrs[addr] -= count
if a.aggLogsFilter.addrs[addr] == 0 {
delete(a.aggLogsFilter.addrs, addr)
}
}
a.aggLogsFilter.allTopics -= f.allTopics
for topic, count := range f.topics {
a.aggLogsFilter.topics[topic] -= count
if a.aggLogsFilter.topics[topic] == 0 {
delete(a.aggLogsFilter.topics, topic)
}
}
}
func (a *LogsFilterAggregator) addLogsFilters(f *LogsFilter) {
a.logsFilterLock.Lock()
defer a.logsFilterLock.Unlock()
a.aggLogsFilter.allAddrs += f.allAddrs
for addr, count := range f.addrs {
a.aggLogsFilter.addrs[addr] += count
}
a.aggLogsFilter.allTopics += f.allTopics
for topic, count := range f.topics {
a.aggLogsFilter.topics[topic] += count
}
}
func (a *LogsFilterAggregator) getAggMaps() (map[common.Address]int, map[common.Hash]int) {
a.logsFilterLock.RLock()
defer a.logsFilterLock.RUnlock()
addresses := make(map[common.Address]int)
for k, v := range a.aggLogsFilter.addrs {
addresses[k] = v
}
topics := make(map[common.Hash]int)
for k, v := range a.aggLogsFilter.topics {
topics[k] = v
}
return addresses, topics
}
func (a *LogsFilterAggregator) distributeLog(eventLog *remote.SubscribeLogsReply) error {
a.logsFilterLock.Lock()
defer a.logsFilterLock.Unlock()
for _, filter := range a.logsFilters {
if filter.allAddrs == 0 {
_, addrOk := filter.addrs[gointerfaces.ConvertH160toAddress(eventLog.Address)]
if !addrOk {
continue
}
}
var topics []common.Hash
for _, topic := range eventLog.Topics {
topics = append(topics, gointerfaces.ConvertH256ToHash(topic))
}
if filter.allTopics == 0 {
if !a.chooseTopics(filter, topics) {
continue
}
}
lg := &types2.Log{
Address: gointerfaces.ConvertH160toAddress(eventLog.Address),
Topics: topics,
Data: eventLog.Data,
BlockNumber: eventLog.BlockNumber,
TxHash: gointerfaces.ConvertH256ToHash(eventLog.TransactionHash),
TxIndex: uint(eventLog.TransactionIndex),
BlockHash: gointerfaces.ConvertH256ToHash(eventLog.BlockHash),
Index: uint(eventLog.LogIndex),
Removed: eventLog.Removed,
}
filter.sender <- lg
}
return nil
}
func (a *LogsFilterAggregator) chooseTopics(filter *LogsFilter, logTopics []common.Hash) bool {
var found bool
for _, logTopic := range logTopics {
if _, ok := filter.topics[logTopic]; ok {
found = true
break
}
}
if !found {
return false
}
if len(filter.topicsOriginal) > len(logTopics) {
return false
}
for i, sub := range filter.topicsOriginal {
match := len(sub) == 0 // empty rule set == wildcard
for _, topic := range sub {
if logTopics[i] == topic {
match = true
break
}
}
if !match {
return false
}
}
return true
}