forked from influxdata/kapacitor
-
Notifications
You must be signed in to change notification settings - Fork 0
/
eval.go
223 lines (202 loc) · 5.3 KB
/
eval.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
package kapacitor
import (
"errors"
"fmt"
"github.com/influxdata/kapacitor/edge"
"github.com/influxdata/kapacitor/models"
"github.com/influxdata/kapacitor/pipeline"
"github.com/influxdata/kapacitor/tick/ast"
"github.com/influxdata/kapacitor/tick/stateful"
)
type EvalNode struct {
node
e *pipeline.EvalNode
expressions []stateful.Expression
refVarList [][]string
scopePool stateful.ScopePool
tags map[string]bool
}
// Create a new EvalNode which applies a transformation func to each point in a stream and returns a single point.
func newEvalNode(et *ExecutingTask, n *pipeline.EvalNode, d NodeDiagnostic) (*EvalNode, error) {
if len(n.AsList) != len(n.Lambdas) {
return nil, errors.New("must provide one name per expression via the 'As' property")
}
en := &EvalNode{
node: node{Node: n, et: et, diag: d},
e: n,
}
// Create stateful expressions
en.expressions = make([]stateful.Expression, len(n.Lambdas))
en.refVarList = make([][]string, len(n.Lambdas))
expressions := make([]ast.Node, len(n.Lambdas))
for i, lambda := range n.Lambdas {
expressions[i] = lambda.Expression
statefulExpr, err := stateful.NewExpression(lambda.Expression)
if err != nil {
return nil, fmt.Errorf("Failed to compile %v expression: %v", i, err)
}
en.expressions[i] = statefulExpr
refVars := ast.FindReferenceVariables(lambda.Expression)
en.refVarList[i] = refVars
}
// Create a single pool for the combination of all expressions
en.scopePool = stateful.NewScopePool(ast.FindReferenceVariables(expressions...))
// Create map of tags
if l := len(n.TagsList); l > 0 {
en.tags = make(map[string]bool, l)
for _, tag := range n.TagsList {
en.tags[tag] = true
}
}
en.node.runF = en.runEval
return en, nil
}
func (n *EvalNode) runEval(snapshot []byte) error {
consumer := edge.NewGroupedConsumer(
n.ins[0],
n,
)
n.statMap.Set(statCardinalityGauge, consumer.CardinalityVar())
return consumer.Consume()
}
func (n *EvalNode) NewGroup(group edge.GroupInfo, first edge.PointMeta) (edge.Receiver, error) {
return edge.NewReceiverFromForwardReceiverWithStats(
n.outs,
edge.NewTimedForwardReceiver(n.timer, n.newGroup()),
), nil
}
func (n *EvalNode) newGroup() *evalGroup {
expressions := make([]stateful.Expression, len(n.expressions))
for i, exp := range n.expressions {
expressions[i] = exp.CopyReset()
}
return &evalGroup{
n: n,
expressions: expressions,
}
}
func (n *EvalNode) eval(expressions []stateful.Expression, p edge.FieldsTagsTimeSetter) (err error) {
vars := n.scopePool.Get()
defer n.scopePool.Put(vars)
for i, expr := range expressions {
err := fillScope(vars, n.refVarList[i], p)
if err != nil {
return err
}
v, err := expr.Eval(vars)
if err != nil {
return err
}
name := n.e.AsList[i]
vars.Set(name, v)
}
fields := p.Fields()
tags := p.Tags()
newTags := tags
if len(n.tags) > 0 {
newTags = newTags.Copy()
for tag := range n.tags {
v, err := vars.Get(tag)
if err != nil {
return err
}
if s, ok := v.(string); !ok {
return fmt.Errorf("result of a tag expression must be of type string, got %T", v)
} else {
newTags[tag] = s
}
}
}
var newFields models.Fields
if n.e.KeepFlag {
if l := len(n.e.KeepList); l != 0 {
newFields = make(models.Fields, l)
for _, f := range n.e.KeepList {
// Try the vars scope first
if vars.Has(f) {
v, err := vars.Get(f)
if err != nil {
return err
}
newFields[f] = v
} else if v, ok := fields[f]; ok {
// Try the raw fields next, since it may not have been a referenced var.
newFields[f] = v
} else {
return fmt.Errorf("cannot keep field %q, field does not exist", f)
}
}
} else {
newFields = make(models.Fields, len(fields)+len(n.e.AsList))
for f, v := range fields {
newFields[f] = v
}
for _, f := range n.e.AsList {
v, err := vars.Get(f)
if err != nil {
return err
}
newFields[f] = v
}
}
} else {
newFields = make(models.Fields, len(n.e.AsList)-len(n.tags))
for _, f := range n.e.AsList {
if n.tags[f] {
continue
}
v, err := vars.Get(f)
if err != nil {
return err
}
newFields[f] = v
}
}
p.SetFields(newFields)
p.SetTags(newTags)
return
}
type evalGroup struct {
n *EvalNode
expressions []stateful.Expression
}
func (g *evalGroup) BeginBatch(begin edge.BeginBatchMessage) (edge.Message, error) {
begin = begin.ShallowCopy()
begin.SetSizeHint(0)
return begin, nil
}
func (g *evalGroup) BatchPoint(bp edge.BatchPointMessage) (edge.Message, error) {
bp = bp.ShallowCopy()
if g.doEval(bp) {
return bp, nil
}
return nil, nil
}
func (g *evalGroup) EndBatch(end edge.EndBatchMessage) (edge.Message, error) {
return end, nil
}
func (g *evalGroup) Point(p edge.PointMessage) (edge.Message, error) {
p = p.ShallowCopy()
if g.doEval(p) {
return p, nil
}
return nil, nil
}
func (g *evalGroup) doEval(p edge.FieldsTagsTimeSetter) bool {
err := g.n.eval(g.expressions, p)
if err != nil {
if !g.n.e.QuietFlag {
g.n.diag.Error("error evaluating expression", err)
}
// Skip bad point
return false
}
return true
}
func (g *evalGroup) Barrier(b edge.BarrierMessage) (edge.Message, error) {
return b, nil
}
func (g *evalGroup) DeleteGroup(d edge.DeleteGroupMessage) (edge.Message, error) {
return d, nil
}
func (g *evalGroup) Done() {}