-
Notifications
You must be signed in to change notification settings - Fork 451
/
types.go
417 lines (357 loc) · 10.9 KB
/
types.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
// Copyright (c) 2018 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package promql
import (
"fmt"
"github.com/m3db/m3/src/query/block"
"github.com/m3db/m3/src/query/functions"
"github.com/m3db/m3/src/query/functions/aggregation"
"github.com/m3db/m3/src/query/functions/binary"
"github.com/m3db/m3/src/query/functions/linear"
"github.com/m3db/m3/src/query/functions/scalar"
"github.com/m3db/m3/src/query/functions/tag"
"github.com/m3db/m3/src/query/functions/temporal"
"github.com/m3db/m3/src/query/functions/unconsolidated"
"github.com/m3db/m3/src/query/models"
"github.com/m3db/m3/src/query/parser"
"github.com/m3db/m3/src/query/parser/common"
"github.com/prometheus/prometheus/pkg/labels"
"github.com/prometheus/prometheus/promql"
)
// NewSelectorFromVector creates a new fetchop.
func NewSelectorFromVector(
n *promql.VectorSelector,
tagOpts models.TagOptions,
) (parser.Params, error) {
matchers, err := LabelMatchersToModelMatcher(n.LabelMatchers, tagOpts)
if err != nil {
return nil, err
}
return functions.FetchOp{
Name: n.Name,
Offset: n.Offset,
Matchers: matchers,
}, nil
}
// NewSelectorFromMatrix creates a new fetchop.
func NewSelectorFromMatrix(
n *promql.MatrixSelector,
tagOpts models.TagOptions,
) (parser.Params, error) {
matchers, err := LabelMatchersToModelMatcher(n.LabelMatchers, tagOpts)
if err != nil {
return nil, err
}
return functions.FetchOp{
Name: n.Name,
Offset: n.Offset,
Matchers: matchers,
Range: n.Range,
}, nil
}
// NewAggregationOperator creates a new aggregation operator based on the type.
func NewAggregationOperator(expr *promql.AggregateExpr) (parser.Params, error) {
opType := expr.Op
byteMatchers := make([][]byte, len(expr.Grouping))
for i, grouping := range expr.Grouping {
byteMatchers[i] = []byte(grouping)
}
nodeInformation := aggregation.NodeParams{
MatchingTags: byteMatchers,
Without: expr.Without,
}
op := getAggOpType(opType)
if op == common.UnknownOpType {
return nil, fmt.Errorf("operator not supported: %s", opType)
}
if op == aggregation.BottomKType || op == aggregation.TopKType {
val, err := resolveScalarArgument(expr.Param)
if err != nil {
return nil, err
}
nodeInformation.Parameter = val
return aggregation.NewTakeOp(op, nodeInformation)
}
if op == aggregation.CountValuesType {
nodeInformation.StringParameter = expr.Param.String()
return aggregation.NewCountValuesOp(op, nodeInformation)
}
return aggregation.NewAggregationOp(op, nodeInformation)
}
func getAggOpType(opType promql.ItemType) string {
switch opType {
case promql.ItemSum:
return aggregation.SumType
case promql.ItemMin:
return aggregation.MinType
case promql.ItemMax:
return aggregation.MaxType
case promql.ItemAvg:
return aggregation.AverageType
case promql.ItemStddev:
return aggregation.StandardDeviationType
case promql.ItemStdvar:
return aggregation.StandardVarianceType
case promql.ItemCount:
return aggregation.CountType
case promql.ItemTopK:
return aggregation.TopKType
case promql.ItemBottomK:
return aggregation.BottomKType
case promql.ItemQuantile:
return aggregation.QuantileType
case promql.ItemCountValues:
return aggregation.CountValuesType
default:
return common.UnknownOpType
}
}
func newScalarOperator(
expr *promql.NumberLiteral,
tagOpts models.TagOptions,
) (parser.Params, error) {
return scalar.NewScalarOp(expr.Val, tagOpts)
}
// NewBinaryOperator creates a new binary operator based on the type.
func NewBinaryOperator(expr *promql.BinaryExpr,
lhs, rhs parser.NodeID) (parser.Params, error) {
matcherBuilder := promMatchingToM3(expr.VectorMatching)
nodeParams := binary.NodeParams{
LNode: lhs,
RNode: rhs,
ReturnBool: expr.ReturnBool,
VectorMatcherBuilder: matcherBuilder,
}
op := getBinaryOpType(expr.Op)
return binary.NewOp(op, nodeParams)
}
var dateFuncs = []string{linear.DayOfMonthType, linear.DayOfWeekType,
linear.DaysInMonthType, linear.HourType, linear.MinuteType,
linear.MonthType, linear.YearType}
func isDateFunc(name string) bool {
for _, n := range dateFuncs {
if name == n {
return true
}
}
return false
}
// NewFunctionExpr creates a new function expr based on the type.
func NewFunctionExpr(
name string,
argValues []interface{},
stringValues []string,
hasArgValue bool,
tagOptions models.TagOptions,
) (parser.Params, bool, error) {
var (
p parser.Params
err error
)
if isDateFunc(name) {
p, err = linear.NewDateOp(name, hasArgValue)
return p, true, err
}
switch name {
case linear.AbsType, linear.CeilType, linear.ExpType,
linear.FloorType, linear.LnType, linear.Log10Type,
linear.Log2Type, linear.SqrtType:
p, err = linear.NewMathOp(name)
return p, true, err
case aggregation.AbsentType:
p = aggregation.NewAbsentOp()
return p, true, err
case linear.ClampMinType, linear.ClampMaxType:
p, err = linear.NewClampOp(argValues, name)
return p, true, err
case linear.HistogramQuantileType:
p, err = linear.NewHistogramQuantileOp(argValues, name)
return p, true, err
case linear.RoundType:
p, err = linear.NewRoundOp(argValues)
return p, true, err
case tag.TagJoinType, tag.TagReplaceType:
p, err = tag.NewTagOp(name, stringValues)
return p, true, err
case temporal.AvgType, temporal.CountType, temporal.MinType,
temporal.MaxType, temporal.SumType, temporal.StdDevType,
temporal.StdVarType:
p, err = temporal.NewAggOp(argValues, name)
return p, true, err
case temporal.QuantileType:
p, err = temporal.NewQuantileOp(argValues, name)
return p, true, err
case temporal.HoltWintersType:
p, err = temporal.NewHoltWintersOp(argValues)
return p, true, err
case temporal.IRateType, temporal.IDeltaType,
temporal.RateType, temporal.IncreaseType,
temporal.DeltaType:
p, err = temporal.NewRateOp(argValues, name)
return p, true, err
case temporal.PredictLinearType, temporal.DerivType:
p, err = temporal.NewLinearRegressionOp(argValues, name)
return p, true, err
case temporal.ResetsType, temporal.ChangesType:
p, err = temporal.NewFunctionOp(argValues, name)
return p, true, err
case unconsolidated.TimestampType:
p, err = unconsolidated.NewTimestampOp(name)
return p, true, err
case scalar.TimeType:
p, err = scalar.NewTimeOp(tagOptions)
return p, true, err
// NB: no-ops.
case linear.SortType, linear.SortDescType:
return nil, false, err
case scalar.ScalarType:
return nil, false, err
default:
return nil, false, fmt.Errorf("function not supported: %s", name)
}
}
func getBinaryOpType(opType promql.ItemType) string {
switch opType {
case promql.ItemLAND:
return binary.AndType
case promql.ItemLOR:
return binary.OrType
case promql.ItemLUnless:
return binary.UnlessType
case promql.ItemADD:
return binary.PlusType
case promql.ItemSUB:
return binary.MinusType
case promql.ItemMUL:
return binary.MultiplyType
case promql.ItemDIV:
return binary.DivType
case promql.ItemPOW:
return binary.ExpType
case promql.ItemMOD:
return binary.ModType
case promql.ItemEQL:
return binary.EqType
case promql.ItemNEQ:
return binary.NotEqType
case promql.ItemGTR:
return binary.GreaterType
case promql.ItemLSS:
return binary.LesserType
case promql.ItemGTE:
return binary.GreaterEqType
case promql.ItemLTE:
return binary.LesserEqType
default:
return common.UnknownOpType
}
}
// getUnaryOpType returns the M3 unary op type based on the Prom op type.
func getUnaryOpType(opType promql.ItemType) (string, error) {
switch opType {
case promql.ItemADD:
return binary.PlusType, nil
case promql.ItemSUB:
return binary.MinusType, nil
default:
return "", fmt.Errorf(
"only + and - operators allowed for unary expressions, received: %s",
opType.String(),
)
}
}
const promDefaultName = "__name__"
// LabelMatchersToModelMatcher parses promql matchers to model matchers.
func LabelMatchersToModelMatcher(
lMatchers []*labels.Matcher,
tagOpts models.TagOptions,
) (models.Matchers, error) {
matchers := make(models.Matchers, len(lMatchers))
for i, m := range lMatchers {
modelType, err := promTypeToM3(m.Type)
if err != nil {
return nil, err
}
var name []byte
if m.Name == promDefaultName {
name = tagOpts.MetricName()
} else {
name = []byte(m.Name)
}
match, err := models.NewMatcher(modelType, name, []byte(m.Value))
if err != nil {
return nil, err
}
matchers[i] = match
}
return matchers, nil
}
// promTypeToM3 converts a prometheus label type to m3 matcher type.
// TODO(nikunj): Consider merging with prompb code.
func promTypeToM3(labelType labels.MatchType) (models.MatchType, error) {
switch labelType {
case labels.MatchEqual:
return models.MatchEqual, nil
case labels.MatchNotEqual:
return models.MatchNotEqual, nil
case labels.MatchRegexp:
return models.MatchRegexp, nil
case labels.MatchNotRegexp:
return models.MatchNotRegexp, nil
default:
return 0, fmt.Errorf("unknown match type %v", labelType)
}
}
func promVectorCardinalityToM3(
card promql.VectorMatchCardinality,
) binary.VectorMatchCardinality {
switch card {
case promql.CardOneToOne:
return binary.CardOneToOne
case promql.CardManyToMany:
return binary.CardManyToMany
case promql.CardManyToOne:
return binary.CardManyToOne
case promql.CardOneToMany:
return binary.CardOneToMany
}
panic(fmt.Sprintf("unknown prom cardinality %d", card))
}
func promMatchingToM3(
vectorMatching *promql.VectorMatching,
) binary.VectorMatcherBuilder {
// vectorMatching can be nil iff at least one of the sides is a scalar.
if vectorMatching == nil {
return nil
}
byteMatchers := make([][]byte, len(vectorMatching.MatchingLabels))
for i, label := range vectorMatching.MatchingLabels {
byteMatchers[i] = []byte(label)
}
return func(_, _ block.Block) binary.VectorMatching {
return binary.VectorMatching{
Set: true,
Card: promVectorCardinalityToM3(vectorMatching.Card),
MatchingLabels: byteMatchers,
On: vectorMatching.On,
Include: vectorMatching.Include,
}
}
}