-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathstream_query.go
431 lines (365 loc) · 9.33 KB
/
stream_query.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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
// Copyright 2022 The NATS Authors
// 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
//
// http://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 jsm
import (
"regexp"
"strings"
"time"
)
type streamQuery struct {
Server *regexp.Regexp
Cluster *regexp.Regexp
ConsumersLimit *int
Empty *bool
IdlePeriod *time.Duration
CreatedPeriod *time.Duration
Invert bool
Subject string
}
type StreamQueryOpt func(query *streamQuery) error
// StreamQuerySubjectWildcard limits results to streams with subject interest matching standard a nats wildcard
func StreamQuerySubjectWildcard(s string) StreamQueryOpt {
return func(q *streamQuery) error {
q.Subject = s
return nil
}
}
// StreamQueryServerName limits results to servers matching a regular expression
func StreamQueryServerName(s string) StreamQueryOpt {
return func(q *streamQuery) error {
if s == "" {
return nil
}
re, err := regexp.Compile(s)
if err != nil {
return err
}
q.Server = re
return nil
}
}
// StreamQueryClusterName limits results to servers within a cluster matched by a regular expression
func StreamQueryClusterName(c string) StreamQueryOpt {
return func(q *streamQuery) error {
if c == "" {
return nil
}
re, err := regexp.Compile(c)
if err != nil {
return err
}
q.Cluster = re
return nil
}
}
// StreamQueryFewerConsumersThan limits results to streams with fewer than or equal consumers than c
func StreamQueryFewerConsumersThan(c uint) StreamQueryOpt {
return func(q *streamQuery) error {
i := int(c)
q.ConsumersLimit = &i
return nil
}
}
// StreamQueryWithoutMessages limits results to streams with no messages
func StreamQueryWithoutMessages() StreamQueryOpt {
return func(q *streamQuery) error {
t := true
q.Empty = &t
return nil
}
}
// StreamQueryIdleLongerThan limits results to streams that has not received messages for a period longer than p
func StreamQueryIdleLongerThan(p time.Duration) StreamQueryOpt {
return func(q *streamQuery) error {
q.IdlePeriod = &p
return nil
}
}
// StreamQueryOlderThan limits the results to streams older than p
func StreamQueryOlderThan(p time.Duration) StreamQueryOpt {
return func(q *streamQuery) error {
q.CreatedPeriod = &p
return nil
}
}
// StreamQueryInvert inverts the logic of filters, older than becomes newer than and so forth
func StreamQueryInvert() StreamQueryOpt {
return func(q *streamQuery) error {
q.Invert = true
return nil
}
}
// QueryStreams filters the streams found in JetStream using various filter options
func (m *Manager) QueryStreams(opts ...StreamQueryOpt) ([]*Stream, error) {
q := &streamQuery{}
for _, opt := range opts {
err := opt(q)
if err != nil {
return nil, err
}
}
streams, err := m.Streams(nil)
if err != nil {
return nil, err
}
return q.Filter(streams)
}
func (q *streamQuery) Filter(streams []*Stream) ([]*Stream, error) {
return q.matchCreatedPeriod(
q.matchIdlePeriod(
q.matchEmpty(
q.matchConsumerLimit(
q.matchCluster(
q.matchSubjectWildcard(
q.matchServer(streams, nil),
),
),
),
),
),
)
}
func (q *streamQuery) matchSubjectWildcard(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.Subject == "" {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
match := false
for _, subj := range stream.Configuration().Subjects {
subMatch := SubjectIsSubsetMatch(subj, q.Subject)
if q.Invert {
if !subMatch {
match = true
}
} else {
if subMatch {
match = true
break
}
}
}
if match {
matched = append(matched, stream)
}
}
return matched, nil
}
func (q *streamQuery) matchCreatedPeriod(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.CreatedPeriod == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
nfo, err := stream.LatestInformation()
if err != nil {
return nil, err
}
if (!q.Invert && time.Since(nfo.Created) >= *q.CreatedPeriod) || (q.Invert && time.Since(nfo.Created) <= *q.CreatedPeriod) {
matched = append(matched, stream)
}
}
return matched, nil
}
// note: ideally we match in addition for ones where no consumer had any messages in this period
// but today that means doing a consumer info on every consumer on every stream thats not viable
func (q *streamQuery) matchIdlePeriod(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.IdlePeriod == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
state, err := stream.LatestState()
if err != nil {
return nil, err
}
lt := time.Since(state.LastTime)
should := lt > *q.IdlePeriod
if (!q.Invert && should) || (q.Invert && !should) {
matched = append(matched, stream)
}
}
return matched, nil
}
func (q *streamQuery) matchEmpty(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.Empty == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
state, err := stream.LatestState()
if err != nil {
return nil, err
}
if (!q.Invert && state.Msgs == 0) || (q.Invert && state.Msgs > 0) {
matched = append(matched, stream)
}
}
return matched, nil
}
func (q *streamQuery) matchConsumerLimit(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.ConsumersLimit == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
state, err := stream.LatestState()
if err != nil {
return nil, err
}
if (q.Invert && state.Consumers >= *q.ConsumersLimit) || !q.Invert && state.Consumers <= *q.ConsumersLimit {
matched = append(matched, stream)
}
}
return matched, nil
}
func (q *streamQuery) matchCluster(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.Cluster == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
nfo, err := stream.LatestInformation()
if err != nil {
return nil, err
}
should := false
if nfo.Cluster != nil {
should = q.Cluster.MatchString(nfo.Cluster.Name)
}
// without cluster info its included if inverted
if (!q.Invert && should) || (q.Invert && !should) {
matched = append(matched, stream)
}
}
return matched, nil
}
func (q *streamQuery) matchServer(streams []*Stream, err error) ([]*Stream, error) {
if err != nil {
return nil, err
}
if q.Server == nil {
return streams, nil
}
var matched []*Stream
for _, stream := range streams {
nfo, err := stream.LatestInformation()
if err != nil {
return nil, err
}
should := false
if nfo.Cluster != nil {
for _, r := range nfo.Cluster.Replicas {
if q.Server.MatchString(r.Name) {
should = true
break
}
}
if q.Server.MatchString(nfo.Cluster.Leader) {
should = true
}
}
// if no cluster info was present we wont include the stream
// unless invert is set then we can
if (!q.Invert && should) || (q.Invert && !should) {
matched = append(matched, stream)
}
}
return matched, nil
}
const (
btsep = '.'
fwc = '>'
pwc = '*'
)
// SubjectIsSubsetMatch tests if a subject matches a standard nats wildcard
func SubjectIsSubsetMatch(subject, test string) bool {
tsa := [32]string{}
tts := tokenizeSubjectIntoSlice(tsa[:0], subject)
return isSubsetMatch(tts, test)
}
// This will test a subject as an array of tokens against a test subject
// Calls into the function isSubsetMatchTokenized
func isSubsetMatch(tokens []string, test string) bool {
tsa := [32]string{}
tts := tokenizeSubjectIntoSlice(tsa[:0], test)
return isSubsetMatchTokenized(tokens, tts)
}
// use similar to append. meaning, the updated slice will be returned
func tokenizeSubjectIntoSlice(tts []string, subject string) []string {
start := 0
for i := 0; i < len(subject); i++ {
if subject[i] == btsep {
tts = append(tts, subject[start:i])
start = i + 1
}
}
tts = append(tts, subject[start:])
return tts
}
// This will test a subject as an array of tokens against a test subject (also encoded as array of tokens)
// and determine if the tokens are matched. Both test subject and tokens
// may contain wildcards. So foo.* is a subset match of [">", "*.*", "foo.*"],
// but not of foo.bar, etc.
func isSubsetMatchTokenized(tokens, test []string) bool {
// Walk the target tokens
for i, t2 := range test {
if i >= len(tokens) {
return false
}
l := len(t2)
if l == 0 {
return false
}
if t2[0] == fwc && l == 1 {
return true
}
t1 := tokens[i]
l = len(t1)
if l == 0 || t1[0] == fwc && l == 1 {
return false
}
if t1[0] == pwc && len(t1) == 1 {
m := t2[0] == pwc && len(t2) == 1
if !m {
return false
}
if i >= len(test) {
return true
}
continue
}
if t2[0] != pwc && strings.Compare(t1, t2) != 0 {
return false
}
}
return len(tokens) == len(test)
}