forked from influxdata/kapacitor
-
Notifications
You must be signed in to change notification settings - Fork 0
/
derivative.go
145 lines (133 loc) · 3.48 KB
/
derivative.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
package kapacitor
import (
"log"
"sync"
"time"
"github.com/influxdata/kapacitor/expvar"
"github.com/influxdata/kapacitor/models"
"github.com/influxdata/kapacitor/pipeline"
)
type DerivativeNode struct {
node
d *pipeline.DerivativeNode
}
// Create a new derivative node.
func newDerivativeNode(et *ExecutingTask, n *pipeline.DerivativeNode, l *log.Logger) (*DerivativeNode, error) {
dn := &DerivativeNode{
node: node{Node: n, et: et, logger: l},
d: n,
}
// Create stateful expressions
dn.node.runF = dn.runDerivative
return dn, nil
}
func (d *DerivativeNode) runDerivative([]byte) error {
switch d.Provides() {
case pipeline.StreamEdge:
var mu sync.RWMutex
previous := make(map[models.GroupID]models.Point)
valueF := func() int64 {
mu.RLock()
l := len(previous)
mu.RUnlock()
return int64(l)
}
d.statMap.Set(statCardinalityGauge, expvar.NewIntFuncGauge(valueF))
for p, ok := d.ins[0].NextPoint(); ok; p, ok = d.ins[0].NextPoint() {
d.timer.Start()
mu.RLock()
pr := previous[p.Group]
mu.RUnlock()
value, store, emit := d.derivative(pr.Fields, p.Fields, pr.Time, p.Time)
if store {
mu.Lock()
previous[p.Group] = p
mu.Unlock()
}
if emit {
fields := p.Fields.Copy()
fields[d.d.As] = value
p.Fields = fields
d.timer.Pause()
for _, child := range d.outs {
err := child.CollectPoint(p)
if err != nil {
return err
}
}
d.timer.Resume()
}
d.timer.Stop()
}
case pipeline.BatchEdge:
for b, ok := d.ins[0].NextBatch(); ok; b, ok = d.ins[0].NextBatch() {
d.timer.Start()
b.Points = b.ShallowCopyPoints()
var pr, p models.BatchPoint
for i := 0; i < len(b.Points); i++ {
p = b.Points[i]
value, store, emit := d.derivative(pr.Fields, p.Fields, pr.Time, p.Time)
if store {
pr = p
}
if emit {
fields := p.Fields.Copy()
fields[d.d.As] = value
b.Points[i].Fields = fields
} else {
b.Points = append(b.Points[:i], b.Points[i+1:]...)
i--
}
}
d.timer.Stop()
for _, child := range d.outs {
err := child.CollectBatch(b)
if err != nil {
return err
}
}
}
}
return nil
}
// derivative calculates the derivative between prev and cur.
// Return is the resulting derivative, whether the current point should be
// stored as previous, and whether the point result should be emitted.
func (d *DerivativeNode) derivative(prev, curr models.Fields, prevTime, currTime time.Time) (float64, bool, bool) {
f1, ok := numToFloat(curr[d.d.Field])
if !ok {
d.incrementErrorCount()
d.logger.Printf("E! cannot apply derivative to type %T", curr[d.d.Field])
return 0, false, false
}
f0, ok := numToFloat(prev[d.d.Field])
if !ok {
// The only time this will fail to parse is if there is no previous.
// Because we only return `store=true` if current parses successfully, we will
// never get a previous which doesn't parse.
return 0, true, false
}
elapsed := float64(currTime.Sub(prevTime))
if elapsed == 0 {
d.incrementErrorCount()
d.logger.Printf("E! cannot perform derivative elapsed time was 0")
return 0, true, false
}
diff := f1 - f0
// Drop negative values for non-negative derivatives
if d.d.NonNegativeFlag && diff < 0 {
return 0, true, false
}
value := float64(diff) / (elapsed / float64(d.d.Unit))
return value, true, true
}
func numToFloat(num interface{}) (float64, bool) {
switch n := num.(type) {
case int64:
return float64(n), true
case float64:
return n, true
default:
return 0, false
}
}