-
Notifications
You must be signed in to change notification settings - Fork 8
/
subscription_filter.go
231 lines (182 loc) · 4.73 KB
/
subscription_filter.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
package kcache
import (
"context"
lifecycle "github.com/boz/go-lifecycle"
logutil "github.com/boz/go-logutil"
"github.com/boz/kcache/filter"
"github.com/pkg/errors"
)
type FilterSubscription interface {
Subscription
Refilter(filter.Filter) error
}
type filterSubscription struct {
parent Subscription
deferReady bool
refilterch chan filter.Filter
outch chan Event
readych chan struct{}
filter filter.Filter
cache cache
lc lifecycle.Lifecycle
log logutil.Log
}
func newFilterSubscription(log logutil.Log, parent Subscription, f filter.Filter, deferReady bool) FilterSubscription {
ctx := context.Background()
lc := lifecycle.New()
s := &filterSubscription{
parent: parent,
refilterch: make(chan filter.Filter),
outch: make(chan Event, EventBufsiz),
readych: make(chan struct{}),
deferReady: deferReady,
filter: f,
cache: newCache(ctx, log, lc.ShuttingDown(), f),
lc: lc,
log: log,
}
go s.run()
return s
}
func (s *filterSubscription) Cache() CacheReader {
return s.cache
}
func (s *filterSubscription) Ready() <-chan struct{} {
return s.readych
}
func (s *filterSubscription) Events() <-chan Event {
return s.outch
}
func (s *filterSubscription) Close() {
s.parent.Close()
}
func (s *filterSubscription) Done() <-chan struct{} {
return s.lc.Done()
}
func (s *filterSubscription) Error() error {
if err := s.lc.Error(); err != nil {
return err
}
return s.parent.Error()
}
func (s *filterSubscription) Refilter(filter filter.Filter) error {
select {
case s.refilterch <- filter:
return nil
case <-s.lc.ShuttingDown():
return errors.WithStack(ErrNotRunning)
}
}
func (s *filterSubscription) run() {
defer s.lc.ShutdownCompleted()
preadych := s.parent.Ready()
pending := false
ready := false
loop:
for {
select {
case err := <-s.lc.ShutdownRequest():
s.log.Debugf("shutdown requested: %v", err)
s.lc.ShutdownInitiated(err)
break loop
case <-preadych:
preadych = nil
if s.deferReady && !pending {
s.log.Debugf("parent ready: deferring ready")
continue
}
list, err := s.parent.Cache().List()
if err != nil {
s.log.Debugf("parent ready: cache list error: %v", err)
s.lc.ShutdownInitiated(errors.Wrap(err, "parent ready: cache list"))
break loop
}
if _, err := s.cache.sync(list); err != nil {
s.log.Debugf("parent ready: cache sync error: %v", err)
s.lc.ShutdownInitiated(errors.Wrap(err, "parent ready: cache sync"))
break loop
}
s.log.Debugf("parent ready: making ready")
close(s.readych)
ready = true
case f := <-s.refilterch:
s.log.Debugf("refiltering...")
isNew := !filter.FiltersEqual(s.filter, f)
switch {
case preadych != nil && !isNew:
s.log.Debugf("refilter: deferring ready (filter unchanged)")
pending = true
continue
case preadych != nil && isNew:
if _, err := s.cache.refilter(nil, f); err != nil {
s.log.Debugf("refilter: cache refilter (not ready): %v", err)
s.lc.ShutdownInitiated(errors.Wrap(err, "refilter: cache refilter (not ready)"))
break loop
}
s.log.Debugf("refilter: deferring ready (filter changed)")
s.filter = f
pending = true
continue
case ready && !isNew:
s.log.Debugf("refilter: filter unchanged")
continue
case !ready && !isNew:
s.log.Debugf("refilter: making ready (filter unchanged)")
close(s.readych)
ready = true
continue
}
// pready == nil && isNew
list, err := s.parent.Cache().List()
if err != nil {
s.log.Debugf("refilter: cache list error: %v", err)
s.lc.ShutdownInitiated(errors.Wrap(err, "refilter: cache list"))
break loop
}
events, err := s.cache.refilter(list, f)
if err != nil {
s.log.Debugf("refilter: cache refilter error: %v", err)
s.lc.ShutdownInitiated(errors.Wrap(err, "refilter: cache refilter"))
break loop
}
s.filter = f
if !ready {
s.log.Debugf("refilter: making ready (filter changed)")
close(s.readych)
ready = true
continue
}
s.log.Debugf("refilter: %v events", len(events))
s.distributeEvents(events)
case evt, ok := <-s.parent.Events():
switch {
case !ok:
s.log.Debugf("update: parent closed")
s.lc.ShutdownInitiated(nil)
break loop
case !ready:
continue
}
events, err := s.cache.update(evt)
if err != nil {
s.log.Debugf("update: cache update error %v", err)
s.lc.ShutdownInitiated(nil)
break loop
}
s.log.Debugf("update: %v events", len(events))
s.distributeEvents(events)
}
}
s.parent.Close()
close(s.outch)
<-s.parent.Done()
}
func (s *filterSubscription) distributeEvents(events []Event) {
for _, evt := range events {
select {
case s.outch <- evt:
default:
s.log.Warnf("event buffer overrun")
}
}
}