forked from bshang/heka
-
Notifications
You must be signed in to change notification settings - Fork 0
/
router.go
393 lines (365 loc) · 10.9 KB
/
router.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
/***** BEGIN LICENSE BLOCK *****
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this file,
# You can obtain one at http://mozilla.org/MPL/2.0/.
#
# The Initial Developer of the Original Code is the Mozilla Foundation.
# Portions created by the Initial Developer are Copyright (C) 2013-2015
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Rob Miller ([email protected])
# Mike Trinkala ([email protected])
#
# ***** END LICENSE BLOCK *****/
package pipeline
import (
"errors"
"fmt"
"math/rand"
"runtime"
"strings"
"sync"
"sync/atomic"
"time"
"github.com/mozilla-services/heka/message"
)
// Public interface exposed by the Heka message router. The message router
// accepts packs on its input channel and then runs them through the
// message_matcher for every running Filter and Output plugin. For plugins
// with a positive match, the pack (and any relevant match group captures)
// will be placed on the plugin's input channel.
type MessageRouter interface {
// Input channel from which the router gets messages to test against the
// registered plugin message_matchers.
InChan() chan *PipelinePack
// Inject message for matching and possible delivery to all filter and
// output plugins.
Inject(pack *PipelinePack) error
// Channel to facilitate adding a matcher to the router which starts the
// message flow to the associated filter.
AddFilterMatcher() chan *MatchRunner
// Channel to facilitate removing a Filter. If the matcher exists it will
// be removed from the router, the matcher channel closed and drained, the
// filter channel closed and drained, and the filter exited.
RemoveFilterMatcher() chan *MatchRunner
// Channel to facilitate removing an Output. If the matcher exists it will
// be removed from the router, the matcher channel closed and drained, the
// output channel closed and drained, and the output exited.
RemoveOutputMatcher() chan *MatchRunner
}
type messageRouter struct {
processMessageCount int64
inChan chan *PipelinePack
addFilterMatcher chan *MatchRunner
removeFilterMatcher chan *MatchRunner
removeOutputMatcher chan *MatchRunner
fMatchers []*MatchRunner
oMatchers []*MatchRunner
// These are used during initialization time only to prevent false
// duplicate matchers, they will *not* be kept up to date as matchers are
// added to / removed from the router. The slices defined above contain
// the definitive list of active matchers.
fMatcherMap map[string]*MatchRunner
oMatcherMap map[string]*MatchRunner
abortChan chan struct{}
}
// Creates and returns a (not yet started) Heka message router.
func NewMessageRouter(chanSize int, abortChan chan struct{}) (router *messageRouter) {
router = new(messageRouter)
router.inChan = make(chan *PipelinePack, chanSize)
router.addFilterMatcher = make(chan *MatchRunner, 0)
router.removeFilterMatcher = make(chan *MatchRunner, 0)
router.removeOutputMatcher = make(chan *MatchRunner, 0)
router.fMatcherMap = make(map[string]*MatchRunner)
router.oMatcherMap = make(map[string]*MatchRunner)
return router
}
func (self *messageRouter) InChan() chan *PipelinePack {
return self.inChan
}
func (self *messageRouter) AddFilterMatcher() chan *MatchRunner {
return self.addFilterMatcher
}
func (self *messageRouter) RemoveFilterMatcher() chan *MatchRunner {
return self.removeFilterMatcher
}
func (self *messageRouter) RemoveOutputMatcher() chan *MatchRunner {
return self.removeOutputMatcher
}
func (self *messageRouter) Inject(pack *PipelinePack) error {
select {
case self.inChan <- pack:
return nil
case <-self.abortChan:
return AbortError
}
}
// initMatchSlices creates the `fMatchers` and `oMatchers` MatchRunner slices
// and populates them with the matchers that are in the respective matcher
// maps. Should be called exactly once after all of the config has been loaded
// but before the router is started.
func (self *messageRouter) initMatchSlices() {
self.fMatchers = make([]*MatchRunner, 0, len(self.fMatcherMap))
self.oMatchers = make([]*MatchRunner, 0, len(self.oMatcherMap))
for _, matcher := range self.fMatcherMap {
self.fMatchers = append(self.fMatchers, matcher)
}
for _, matcher := range self.oMatcherMap {
self.oMatchers = append(self.oMatchers, matcher)
}
}
// Spawns a goroutine within which the router listens for messages on the
// input channel and performs its routing magic. Spawned goroutine continues
// until the router is shut down, triggered by closing the router's input
// channel.
func (self *messageRouter) Start() {
go func() {
var matcher *MatchRunner
var ok = true
var pack *PipelinePack
for ok {
runtime.Gosched()
select {
case matcher = <-self.addFilterMatcher:
if matcher != nil {
exists := false
available := -1
for i, m := range self.fMatchers {
if m == nil {
available = i
}
if matcher == m {
exists = true
break
}
}
if !exists {
if available != -1 {
self.fMatchers[available] = matcher
} else {
self.fMatchers = append(self.fMatchers, matcher)
}
}
}
case matcher = <-self.removeFilterMatcher:
if matcher != nil {
for i, m := range self.fMatchers {
if matcher == m {
m.Close()
self.fMatchers[i] = nil
break
}
}
}
case matcher = <-self.removeOutputMatcher:
if matcher != nil {
for i, m := range self.oMatchers {
if matcher == m {
m.Close()
self.oMatchers[i] = nil
break
}
}
}
case pack, ok = <-self.inChan:
if !ok {
break
}
pack.diagnostics.Reset()
atomic.AddInt64(&self.processMessageCount, 1)
for _, matcher = range self.fMatchers {
if matcher != nil {
atomic.AddInt32(&pack.RefCount, 1)
matcher.inChan <- pack
}
}
for _, matcher = range self.oMatchers {
if matcher != nil {
atomic.AddInt32(&pack.RefCount, 1)
matcher.inChan <- pack
}
}
pack.recycle()
}
}
for _, matcher = range self.fMatchers {
if matcher != nil {
matcher.Close()
}
}
for _, matcher = range self.oMatchers {
matcher.Close()
}
LogInfo.Println("MessageRouter stopped.")
}()
LogInfo.Println("MessageRouter started.")
}
// Encapsulates the mechanics of testing messages against a specific plugin's
// message_matcher value.
type MatchRunner struct {
closing int32
matchSamples int64
matchDuration int64
spec *message.MatcherSpecification
signer string
inChan chan *PipelinePack
matchChan chan *PipelinePack
stopChan chan bool
pluginRunner PluginRunner
reportLock sync.Mutex
bufFeeder *BufferFeeder
globals *GlobalConfigStruct
retry *RetryHelper
}
// Creates and returns a new MatchRunner if possible, or a relevant error if
// not.
func NewMatchRunner(filter, signer string, runner PluginRunner, chanSize int,
matchChan chan *PipelinePack) (matcher *MatchRunner, err error) {
var spec *message.MatcherSpecification
if spec, err = message.CreateMatcherSpecification(filter); err != nil {
return
}
retry, _ := NewRetryHelper(RetryOptions{
MaxDelay: "1s",
Delay: "50ms",
MaxRetries: -1,
})
matcher = &MatchRunner{
spec: spec,
signer: signer,
inChan: make(chan *PipelinePack, chanSize),
matchChan: matchChan,
pluginRunner: runner,
retry: retry,
}
return
}
// Returns the runner's MatcherSpecification object.
func (mr *MatchRunner) MatcherSpecification() *message.MatcherSpecification {
return mr.spec
}
// Returns the Matcher InChan length for backpresure detection and reporting
func (mr *MatchRunner) InChanLen() int {
return len(mr.inChan)
}
func (mr *MatchRunner) Close() {
atomic.StoreInt32(&mr.closing, 1)
close(mr.inChan)
}
// Returns the runner's average match duration in nanoseconds
func (mr *MatchRunner) GetAvgDuration() (duration int64) {
mr.reportLock.Lock()
if mr.matchSamples != 0 {
duration = mr.matchDuration / mr.matchSamples
}
mr.reportLock.Unlock()
return
}
func (mr *MatchRunner) run(sampleDenom int) {
defer func() {
if r := recover(); r != nil {
var err error
var ok bool
if err, ok = r.(error); !ok {
panic(r)
}
if !strings.Contains(err.Error(), "send on closed channel") {
panic(r)
}
}
}()
var (
startTime time.Time
random int = rand.Intn(1000) + sampleDenom
// Don't have everyone sample at the same time. We always start with
// a sample so there will be a ballpark figure immediately. We could
// use a ticker to sample at a regular interval but that seems like
// overkill at this point.
counter int = random
match bool
duration int64
)
var capacity int64 = int64(cap(mr.inChan))
for pack := range mr.inChan {
if len(mr.signer) != 0 && mr.signer != pack.Signer {
pack.recycle()
continue
}
// We may want to keep separate samples for match/nomatch conditions.
// In most cases the random sampling will capture the most common
// condition which is usesful for the overall system health but not
// matcher tuning. Capturing the duration adds ~40ns
if counter == random {
startTime = time.Now()
match = mr.spec.Match(pack.Message)
duration = time.Since(startTime).Nanoseconds()
mr.reportLock.Lock()
mr.matchDuration += duration
mr.matchSamples++
mr.reportLock.Unlock()
if mr.matchSamples > capacity {
// the timings can vary greatly, so we need to establish a
// decent baseline before we start sampling
counter = 0
}
} else {
match = mr.spec.Match(pack.Message)
counter++
}
if match {
pack.diagnostics.AddStamp(mr.pluginRunner)
err := mr.deliver(pack)
if err != nil {
mr.pluginRunner.LogError(fmt.Errorf("can't deliver matched message: %s",
err))
}
} else {
pack.recycle()
}
}
if mr.matchChan != nil {
close(mr.matchChan)
}
if mr.stopChan != nil {
close(mr.stopChan)
}
}
// Starts the runner listening for messages on its input channel. Any message
// that is a match will be placed on the provided matchChan, or written out to
// the disk queue if buffering is in play. Any messages that are not a match
// will be immediately recycled.
func (mr *MatchRunner) Start(sampleDenom int) {
go mr.run(sampleDenom)
}
func (mr *MatchRunner) deliver(pack *PipelinePack) error {
if mr.bufFeeder != nil {
err := mr.bufFeeder.QueueRecord(pack)
if err == QueueIsFull {
switch mr.bufFeeder.Config.FullAction {
case "shutdown":
mr.globals.ShutDown(1)
case "block":
for {
err = mr.bufFeeder.QueueRecord(pack)
if err != QueueIsFull {
break
}
if atomic.LoadInt32(&mr.closing) != 0 {
break
}
mr.retry.Wait()
}
mr.retry.Reset()
case "drop":
}
}
pack.recycle()
return err
}
if mr.matchChan != nil {
mr.matchChan <- pack
return nil
}
return errors.New("no queue buffer or match chan for delivery")
}