mirror of https://github.com/prometheus/prometheus
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
999 lines
27 KiB
999 lines
27 KiB
// Copyright 2013 Prometheus Team
|
|
// 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 ast
|
|
|
|
import (
|
|
"errors"
|
|
"flag"
|
|
"fmt"
|
|
"hash/fnv"
|
|
"math"
|
|
"sort"
|
|
"time"
|
|
|
|
clientmodel "github.com/prometheus/client_golang/model"
|
|
|
|
"github.com/prometheus/prometheus/stats"
|
|
"github.com/prometheus/prometheus/storage/local"
|
|
"github.com/prometheus/prometheus/storage/metric"
|
|
)
|
|
|
|
var stalenessDelta = flag.Duration("query.staleness-delta", 300*time.Second, "Staleness delta allowance during expression evaluations.")
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Raw data value types.
|
|
|
|
// SampleStream is a stream of Values belonging to an attached COWMetric.
|
|
type SampleStream struct {
|
|
Metric clientmodel.COWMetric
|
|
Values metric.Values
|
|
}
|
|
|
|
// Sample is a single sample belonging to a COWMetric.
|
|
type Sample struct {
|
|
Metric clientmodel.COWMetric
|
|
Value clientmodel.SampleValue
|
|
Timestamp clientmodel.Timestamp
|
|
}
|
|
|
|
// Vector is basically only an alias for clientmodel.Samples, but the
|
|
// contract is that in a Vector, all Samples have the same timestamp.
|
|
type Vector []*Sample
|
|
|
|
// Matrix is a slice of SampleStreams that implements sort.Interface and
|
|
// has a String method.
|
|
// BUG(julius): Pointerize this.
|
|
type Matrix []SampleStream
|
|
|
|
type groupedAggregation struct {
|
|
labels clientmodel.COWMetric
|
|
value clientmodel.SampleValue
|
|
groupCount int
|
|
}
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Enums.
|
|
|
|
// ExprType is an enum for the rule language expression types.
|
|
type ExprType int
|
|
|
|
// Possible language expression types. We define these as integer constants
|
|
// because sometimes we need to pass around just the type without an object of
|
|
// that type.
|
|
const (
|
|
ScalarType ExprType = iota
|
|
VectorType
|
|
MatrixType
|
|
StringType
|
|
)
|
|
|
|
// BinOpType is an enum for binary operator types.
|
|
type BinOpType int
|
|
|
|
// Possible binary operator types.
|
|
const (
|
|
Add BinOpType = iota
|
|
Sub
|
|
Mul
|
|
Div
|
|
Mod
|
|
NE
|
|
EQ
|
|
GT
|
|
LT
|
|
GE
|
|
LE
|
|
And
|
|
Or
|
|
)
|
|
|
|
// shouldDropMetric indicates whether the metric name should be dropped after
|
|
// applying this operator to a vector.
|
|
func (opType BinOpType) shouldDropMetric() bool {
|
|
switch opType {
|
|
case Add, Sub, Mul, Div, Mod:
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
// AggrType is an enum for aggregation types.
|
|
type AggrType int
|
|
|
|
// Possible aggregation types.
|
|
const (
|
|
Sum AggrType = iota
|
|
Avg
|
|
Min
|
|
Max
|
|
Count
|
|
)
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Interfaces.
|
|
|
|
// Nodes is a slice of any mix of node types as all node types
|
|
// implement the Node interface.
|
|
type Nodes []Node
|
|
|
|
// Node is the top-level interface for any kind of nodes. Each node
|
|
// type implements one of the ...Node interfaces, each of which embeds
|
|
// this Node interface.
|
|
type Node interface {
|
|
Type() ExprType
|
|
Children() Nodes
|
|
NodeTreeToDotGraph() string
|
|
String() string
|
|
}
|
|
|
|
// ScalarNode is a Node for scalar values.
|
|
type ScalarNode interface {
|
|
Node
|
|
// Eval evaluates and returns the value of the scalar represented by this node.
|
|
Eval(timestamp clientmodel.Timestamp) clientmodel.SampleValue
|
|
}
|
|
|
|
// VectorNode is a Node for vector values.
|
|
type VectorNode interface {
|
|
Node
|
|
// Eval evaluates the node recursively and returns the result
|
|
// as a Vector (i.e. a slice of Samples all at the given
|
|
// Timestamp).
|
|
Eval(timestamp clientmodel.Timestamp) Vector
|
|
}
|
|
|
|
// MatrixNode is a Node for matrix values.
|
|
type MatrixNode interface {
|
|
Node
|
|
// Eval evaluates the node recursively and returns the result as a Matrix.
|
|
Eval(timestamp clientmodel.Timestamp) Matrix
|
|
// Eval evaluates the node recursively and returns the result
|
|
// as a Matrix that only contains the boundary values.
|
|
EvalBoundaries(timestamp clientmodel.Timestamp) Matrix
|
|
}
|
|
|
|
// StringNode is a Node for string values.
|
|
type StringNode interface {
|
|
Node
|
|
// Eval evaluates and returns the value of the string
|
|
// represented by this node.
|
|
Eval(timestamp clientmodel.Timestamp) string
|
|
}
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// ScalarNode types.
|
|
|
|
type (
|
|
// ScalarLiteral represents a numeric selector.
|
|
ScalarLiteral struct {
|
|
value clientmodel.SampleValue
|
|
}
|
|
|
|
// ScalarFunctionCall represents a function with a numeric
|
|
// return type.
|
|
ScalarFunctionCall struct {
|
|
function *Function
|
|
args Nodes
|
|
}
|
|
|
|
// ScalarArithExpr represents an arithmetic expression of
|
|
// numeric type.
|
|
ScalarArithExpr struct {
|
|
opType BinOpType
|
|
lhs ScalarNode
|
|
rhs ScalarNode
|
|
}
|
|
)
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// VectorNode types.
|
|
|
|
type (
|
|
// A VectorSelector represents a metric name plus labelset.
|
|
VectorSelector struct {
|
|
labelMatchers metric.LabelMatchers
|
|
// The series iterators are populated at query analysis time.
|
|
iterators map[clientmodel.Fingerprint]local.SeriesIterator
|
|
metrics map[clientmodel.Fingerprint]clientmodel.COWMetric
|
|
// Fingerprints are populated from label matchers at query analysis time.
|
|
fingerprints clientmodel.Fingerprints
|
|
}
|
|
|
|
// VectorFunctionCall represents a function with vector return
|
|
// type.
|
|
VectorFunctionCall struct {
|
|
function *Function
|
|
args Nodes
|
|
}
|
|
|
|
// A VectorAggregation with vector return type.
|
|
VectorAggregation struct {
|
|
aggrType AggrType
|
|
groupBy clientmodel.LabelNames
|
|
keepExtraLabels bool
|
|
vector VectorNode
|
|
}
|
|
|
|
// VectorArithExpr represents an arithmetic expression of vector type. At
|
|
// least one of the two operand Nodes must be a VectorNode. The other may be
|
|
// a VectorNode or ScalarNode. Both criteria are checked at runtime.
|
|
VectorArithExpr struct {
|
|
opType BinOpType
|
|
lhs Node
|
|
rhs Node
|
|
}
|
|
)
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// MatrixNode types.
|
|
|
|
type (
|
|
// A MatrixSelector represents a metric name plus labelset and
|
|
// timerange.
|
|
MatrixSelector struct {
|
|
labelMatchers metric.LabelMatchers
|
|
// The series iterators are populated at query analysis time.
|
|
iterators map[clientmodel.Fingerprint]local.SeriesIterator
|
|
metrics map[clientmodel.Fingerprint]clientmodel.COWMetric
|
|
// Fingerprints are populated from label matchers at query analysis time.
|
|
fingerprints clientmodel.Fingerprints
|
|
interval time.Duration
|
|
}
|
|
)
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// StringNode types.
|
|
|
|
type (
|
|
// A StringLiteral is what you think it is.
|
|
StringLiteral struct {
|
|
str string
|
|
}
|
|
|
|
// StringFunctionCall represents a function with string return
|
|
// type.
|
|
StringFunctionCall struct {
|
|
function *Function
|
|
args Nodes
|
|
}
|
|
)
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Implementations.
|
|
|
|
// Type implements the Node interface.
|
|
func (node ScalarLiteral) Type() ExprType { return ScalarType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node ScalarFunctionCall) Type() ExprType { return ScalarType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node ScalarArithExpr) Type() ExprType { return ScalarType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node VectorSelector) Type() ExprType { return VectorType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node VectorFunctionCall) Type() ExprType { return VectorType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node VectorAggregation) Type() ExprType { return VectorType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node VectorArithExpr) Type() ExprType { return VectorType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node MatrixSelector) Type() ExprType { return MatrixType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node StringLiteral) Type() ExprType { return StringType }
|
|
|
|
// Type implements the Node interface.
|
|
func (node StringFunctionCall) Type() ExprType { return StringType }
|
|
|
|
// Children implements the Node interface and returns an empty slice.
|
|
func (node ScalarLiteral) Children() Nodes { return Nodes{} }
|
|
|
|
// Children implements the Node interface and returns the args of the
|
|
// function call.
|
|
func (node ScalarFunctionCall) Children() Nodes { return node.args }
|
|
|
|
// Children implements the Node interface and returns the LHS and the RHS
|
|
// of the expression.
|
|
func (node ScalarArithExpr) Children() Nodes { return Nodes{node.lhs, node.rhs} }
|
|
|
|
// Children implements the Node interface and returns an empty slice.
|
|
func (node VectorSelector) Children() Nodes { return Nodes{} }
|
|
|
|
// Children implements the Node interface and returns the args of the
|
|
// function call.
|
|
func (node VectorFunctionCall) Children() Nodes { return node.args }
|
|
|
|
// Children implements the Node interface and returns the vector to be
|
|
// aggregated.
|
|
func (node VectorAggregation) Children() Nodes { return Nodes{node.vector} }
|
|
|
|
// Children implements the Node interface and returns the LHS and the RHS
|
|
// of the expression.
|
|
func (node VectorArithExpr) Children() Nodes { return Nodes{node.lhs, node.rhs} }
|
|
|
|
// Children implements the Node interface and returns an empty slice.
|
|
func (node MatrixSelector) Children() Nodes { return Nodes{} }
|
|
|
|
// Children implements the Node interface and returns an empty slice.
|
|
func (node StringLiteral) Children() Nodes { return Nodes{} }
|
|
|
|
// Children implements the Node interface and returns the args of the
|
|
// function call.
|
|
func (node StringFunctionCall) Children() Nodes { return node.args }
|
|
|
|
// Eval implements the ScalarNode interface and returns the selector
|
|
// value.
|
|
func (node *ScalarLiteral) Eval(timestamp clientmodel.Timestamp) clientmodel.SampleValue {
|
|
return node.value
|
|
}
|
|
|
|
// Eval implements the ScalarNode interface and returns the result of
|
|
// the expression.
|
|
func (node *ScalarArithExpr) Eval(timestamp clientmodel.Timestamp) clientmodel.SampleValue {
|
|
lhs := node.lhs.Eval(timestamp)
|
|
rhs := node.rhs.Eval(timestamp)
|
|
return evalScalarBinop(node.opType, lhs, rhs)
|
|
}
|
|
|
|
// Eval implements the ScalarNode interface and returns the result of
|
|
// the function call.
|
|
func (node *ScalarFunctionCall) Eval(timestamp clientmodel.Timestamp) clientmodel.SampleValue {
|
|
return node.function.callFn(timestamp, node.args).(clientmodel.SampleValue)
|
|
}
|
|
|
|
func (node *VectorAggregation) labelsToGroupingKey(labels clientmodel.Metric) uint64 {
|
|
summer := fnv.New64a()
|
|
for _, label := range node.groupBy {
|
|
fmt.Fprint(summer, labels[label])
|
|
}
|
|
|
|
return summer.Sum64()
|
|
}
|
|
|
|
func labelsToKey(labels clientmodel.Metric) uint64 {
|
|
pairs := metric.LabelPairs{}
|
|
|
|
for label, value := range labels {
|
|
pairs = append(pairs, &metric.LabelPair{
|
|
Name: label,
|
|
Value: value,
|
|
})
|
|
}
|
|
|
|
sort.Sort(pairs)
|
|
|
|
summer := fnv.New64a()
|
|
|
|
for _, pair := range pairs {
|
|
fmt.Fprint(summer, pair.Name, pair.Value)
|
|
}
|
|
|
|
return summer.Sum64()
|
|
}
|
|
|
|
// EvalVectorInstant evaluates a VectorNode with an instant query.
|
|
func EvalVectorInstant(node VectorNode, timestamp clientmodel.Timestamp, storage local.Storage, queryStats *stats.TimerGroup) (Vector, error) {
|
|
closer, err := prepareInstantQuery(node, timestamp, storage, queryStats)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer closer.Close()
|
|
return node.Eval(timestamp), nil
|
|
}
|
|
|
|
// EvalVectorRange evaluates a VectorNode with a range query.
|
|
func EvalVectorRange(node VectorNode, start clientmodel.Timestamp, end clientmodel.Timestamp, interval time.Duration, storage local.Storage, queryStats *stats.TimerGroup) (Matrix, error) {
|
|
// Explicitly initialize to an empty matrix since a nil Matrix encodes to
|
|
// null in JSON.
|
|
matrix := Matrix{}
|
|
|
|
prepareTimer := queryStats.GetTimer(stats.TotalQueryPreparationTime).Start()
|
|
closer, err := prepareRangeQuery(node, start, end, interval, storage, queryStats)
|
|
prepareTimer.Stop()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer closer.Close()
|
|
|
|
// TODO implement watchdog timer for long-running queries.
|
|
evalTimer := queryStats.GetTimer(stats.InnerEvalTime).Start()
|
|
sampleStreams := map[uint64]*SampleStream{}
|
|
for t := start; !t.After(end); t = t.Add(interval) {
|
|
vector := node.Eval(t)
|
|
for _, sample := range vector {
|
|
samplePair := metric.SamplePair{
|
|
Value: sample.Value,
|
|
Timestamp: sample.Timestamp,
|
|
}
|
|
groupingKey := labelsToKey(sample.Metric.Metric)
|
|
if sampleStreams[groupingKey] == nil {
|
|
sampleStreams[groupingKey] = &SampleStream{
|
|
Metric: sample.Metric,
|
|
Values: metric.Values{samplePair},
|
|
}
|
|
} else {
|
|
sampleStreams[groupingKey].Values = append(sampleStreams[groupingKey].Values, samplePair)
|
|
}
|
|
}
|
|
}
|
|
evalTimer.Stop()
|
|
|
|
appendTimer := queryStats.GetTimer(stats.ResultAppendTime).Start()
|
|
for _, sampleStream := range sampleStreams {
|
|
matrix = append(matrix, *sampleStream)
|
|
}
|
|
appendTimer.Stop()
|
|
|
|
return matrix, nil
|
|
}
|
|
|
|
func labelIntersection(metric1, metric2 clientmodel.COWMetric) clientmodel.COWMetric {
|
|
for label, value := range metric1.Metric {
|
|
if metric2.Metric[label] != value {
|
|
metric1.Delete(label)
|
|
}
|
|
}
|
|
return metric1
|
|
}
|
|
|
|
func (node *VectorAggregation) groupedAggregationsToVector(aggregations map[uint64]*groupedAggregation, timestamp clientmodel.Timestamp) Vector {
|
|
vector := Vector{}
|
|
for _, aggregation := range aggregations {
|
|
switch node.aggrType {
|
|
case Avg:
|
|
aggregation.value = aggregation.value / clientmodel.SampleValue(aggregation.groupCount)
|
|
case Count:
|
|
aggregation.value = clientmodel.SampleValue(aggregation.groupCount)
|
|
default:
|
|
// For other aggregations, we already have the right value.
|
|
}
|
|
sample := &Sample{
|
|
Metric: aggregation.labels,
|
|
Value: aggregation.value,
|
|
Timestamp: timestamp,
|
|
}
|
|
vector = append(vector, sample)
|
|
}
|
|
return vector
|
|
}
|
|
|
|
// Eval implements the VectorNode interface and returns the aggregated
|
|
// Vector.
|
|
func (node *VectorAggregation) Eval(timestamp clientmodel.Timestamp) Vector {
|
|
vector := node.vector.Eval(timestamp)
|
|
result := map[uint64]*groupedAggregation{}
|
|
for _, sample := range vector {
|
|
groupingKey := node.labelsToGroupingKey(sample.Metric.Metric)
|
|
if groupedResult, ok := result[groupingKey]; ok {
|
|
if node.keepExtraLabels {
|
|
groupedResult.labels = labelIntersection(groupedResult.labels, sample.Metric)
|
|
}
|
|
|
|
switch node.aggrType {
|
|
case Sum:
|
|
groupedResult.value += sample.Value
|
|
case Avg:
|
|
groupedResult.value += sample.Value
|
|
groupedResult.groupCount++
|
|
case Max:
|
|
if groupedResult.value < sample.Value {
|
|
groupedResult.value = sample.Value
|
|
}
|
|
case Min:
|
|
if groupedResult.value > sample.Value {
|
|
groupedResult.value = sample.Value
|
|
}
|
|
case Count:
|
|
groupedResult.groupCount++
|
|
default:
|
|
panic("Unknown aggregation type")
|
|
}
|
|
} else {
|
|
var m clientmodel.COWMetric
|
|
if node.keepExtraLabels {
|
|
m = sample.Metric
|
|
m.Delete(clientmodel.MetricNameLabel)
|
|
} else {
|
|
m = clientmodel.COWMetric{
|
|
Metric: clientmodel.Metric{},
|
|
Copied: true,
|
|
}
|
|
for _, l := range node.groupBy {
|
|
if v, ok := sample.Metric.Metric[l]; ok {
|
|
m.Set(l, v)
|
|
}
|
|
}
|
|
}
|
|
result[groupingKey] = &groupedAggregation{
|
|
labels: m,
|
|
value: sample.Value,
|
|
groupCount: 1,
|
|
}
|
|
}
|
|
}
|
|
|
|
return node.groupedAggregationsToVector(result, timestamp)
|
|
}
|
|
|
|
// Eval implements the VectorNode interface and returns the value of
|
|
// the selector.
|
|
func (node *VectorSelector) Eval(timestamp clientmodel.Timestamp) Vector {
|
|
//// timer := v.stats.GetTimer(stats.GetValueAtTimeTime).Start()
|
|
samples := Vector{}
|
|
for fp, it := range node.iterators {
|
|
sampleCandidates := it.GetValueAtTime(timestamp)
|
|
samplePair := chooseClosestSample(sampleCandidates, timestamp)
|
|
if samplePair != nil {
|
|
samples = append(samples, &Sample{
|
|
Metric: node.metrics[fp],
|
|
Value: samplePair.Value,
|
|
Timestamp: timestamp,
|
|
})
|
|
}
|
|
}
|
|
//// timer.Stop()
|
|
return samples
|
|
}
|
|
|
|
// chooseClosestSample chooses the closest sample of a list of samples
|
|
// surrounding a given target time. If samples are found both before and after
|
|
// the target time, the sample value is interpolated between these. Otherwise,
|
|
// the single closest sample is returned verbatim.
|
|
func chooseClosestSample(samples metric.Values, timestamp clientmodel.Timestamp) *metric.SamplePair {
|
|
var closestBefore *metric.SamplePair
|
|
var closestAfter *metric.SamplePair
|
|
for _, candidate := range samples {
|
|
delta := candidate.Timestamp.Sub(timestamp)
|
|
// Samples before target time.
|
|
if delta < 0 {
|
|
// Ignore samples outside of staleness policy window.
|
|
if -delta > *stalenessDelta {
|
|
continue
|
|
}
|
|
// Ignore samples that are farther away than what we've seen before.
|
|
if closestBefore != nil && candidate.Timestamp.Before(closestBefore.Timestamp) {
|
|
continue
|
|
}
|
|
sample := candidate
|
|
closestBefore = &sample
|
|
}
|
|
|
|
// Samples after target time.
|
|
if delta >= 0 {
|
|
// Ignore samples outside of staleness policy window.
|
|
if delta > *stalenessDelta {
|
|
continue
|
|
}
|
|
// Ignore samples that are farther away than samples we've seen before.
|
|
if closestAfter != nil && candidate.Timestamp.After(closestAfter.Timestamp) {
|
|
continue
|
|
}
|
|
sample := candidate
|
|
closestAfter = &sample
|
|
}
|
|
}
|
|
|
|
switch {
|
|
case closestBefore != nil && closestAfter != nil:
|
|
return interpolateSamples(closestBefore, closestAfter, timestamp)
|
|
case closestBefore != nil:
|
|
return closestBefore
|
|
default:
|
|
return closestAfter
|
|
}
|
|
}
|
|
|
|
// interpolateSamples interpolates a value at a target time between two
|
|
// provided sample pairs.
|
|
func interpolateSamples(first, second *metric.SamplePair, timestamp clientmodel.Timestamp) *metric.SamplePair {
|
|
dv := second.Value - first.Value
|
|
dt := second.Timestamp.Sub(first.Timestamp)
|
|
|
|
dDt := dv / clientmodel.SampleValue(dt)
|
|
offset := clientmodel.SampleValue(timestamp.Sub(first.Timestamp))
|
|
|
|
return &metric.SamplePair{
|
|
Value: first.Value + (offset * dDt),
|
|
Timestamp: timestamp,
|
|
}
|
|
}
|
|
|
|
// Eval implements the VectorNode interface and returns the result of
|
|
// the function call.
|
|
func (node *VectorFunctionCall) Eval(timestamp clientmodel.Timestamp) Vector {
|
|
return node.function.callFn(timestamp, node.args).(Vector)
|
|
}
|
|
|
|
func evalScalarBinop(opType BinOpType,
|
|
lhs clientmodel.SampleValue,
|
|
rhs clientmodel.SampleValue) clientmodel.SampleValue {
|
|
switch opType {
|
|
case Add:
|
|
return lhs + rhs
|
|
case Sub:
|
|
return lhs - rhs
|
|
case Mul:
|
|
return lhs * rhs
|
|
case Div:
|
|
if rhs != 0 {
|
|
return lhs / rhs
|
|
}
|
|
return clientmodel.SampleValue(math.Inf(int(rhs)))
|
|
case Mod:
|
|
if rhs != 0 {
|
|
return clientmodel.SampleValue(int(lhs) % int(rhs))
|
|
}
|
|
return clientmodel.SampleValue(math.Inf(int(rhs)))
|
|
case EQ:
|
|
if lhs == rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
case NE:
|
|
if lhs != rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
case GT:
|
|
if lhs > rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
case LT:
|
|
if lhs < rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
case GE:
|
|
if lhs >= rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
case LE:
|
|
if lhs <= rhs {
|
|
return 1
|
|
}
|
|
return 0
|
|
}
|
|
panic("Not all enum values enumerated in switch")
|
|
}
|
|
|
|
func evalVectorBinop(opType BinOpType,
|
|
lhs clientmodel.SampleValue,
|
|
rhs clientmodel.SampleValue) (clientmodel.SampleValue, bool) {
|
|
switch opType {
|
|
case Add:
|
|
return lhs + rhs, true
|
|
case Sub:
|
|
return lhs - rhs, true
|
|
case Mul:
|
|
return lhs * rhs, true
|
|
case Div:
|
|
if rhs != 0 {
|
|
return lhs / rhs, true
|
|
}
|
|
return clientmodel.SampleValue(math.Inf(int(rhs))), true
|
|
case Mod:
|
|
if rhs != 0 {
|
|
return clientmodel.SampleValue(int(lhs) % int(rhs)), true
|
|
}
|
|
return clientmodel.SampleValue(math.Inf(int(rhs))), true
|
|
case EQ:
|
|
if lhs == rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case NE:
|
|
if lhs != rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case GT:
|
|
if lhs > rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case LT:
|
|
if lhs < rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case GE:
|
|
if lhs >= rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case LE:
|
|
if lhs <= rhs {
|
|
return lhs, true
|
|
}
|
|
return 0, false
|
|
case And:
|
|
return lhs, true
|
|
case Or:
|
|
return lhs, true // TODO: implement OR
|
|
}
|
|
panic("Not all enum values enumerated in switch")
|
|
}
|
|
|
|
func labelsEqual(labels1, labels2 clientmodel.Metric) bool {
|
|
for label, value := range labels1 {
|
|
if labels2[label] != value && label != clientmodel.MetricNameLabel {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Eval implements the VectorNode interface and returns the result of
|
|
// the expression.
|
|
func (node *VectorArithExpr) Eval(timestamp clientmodel.Timestamp) Vector {
|
|
result := Vector{}
|
|
if node.lhs.Type() == ScalarType && node.rhs.Type() == VectorType {
|
|
lhs := node.lhs.(ScalarNode).Eval(timestamp)
|
|
rhs := node.rhs.(VectorNode).Eval(timestamp)
|
|
for _, rhsSample := range rhs {
|
|
value, keep := evalVectorBinop(node.opType, lhs, rhsSample.Value)
|
|
if keep {
|
|
rhsSample.Value = value
|
|
if node.opType.shouldDropMetric() {
|
|
rhsSample.Metric.Delete(clientmodel.MetricNameLabel)
|
|
}
|
|
result = append(result, rhsSample)
|
|
}
|
|
}
|
|
return result
|
|
} else if node.lhs.Type() == VectorType && node.rhs.Type() == ScalarType {
|
|
lhs := node.lhs.(VectorNode).Eval(timestamp)
|
|
rhs := node.rhs.(ScalarNode).Eval(timestamp)
|
|
for _, lhsSample := range lhs {
|
|
value, keep := evalVectorBinop(node.opType, lhsSample.Value, rhs)
|
|
if keep {
|
|
lhsSample.Value = value
|
|
if node.opType.shouldDropMetric() {
|
|
lhsSample.Metric.Delete(clientmodel.MetricNameLabel)
|
|
}
|
|
result = append(result, lhsSample)
|
|
}
|
|
}
|
|
return result
|
|
} else if node.lhs.Type() == VectorType && node.rhs.Type() == VectorType {
|
|
lhs := node.lhs.(VectorNode).Eval(timestamp)
|
|
rhs := node.rhs.(VectorNode).Eval(timestamp)
|
|
for _, lhsSample := range lhs {
|
|
for _, rhsSample := range rhs {
|
|
if labelsEqual(lhsSample.Metric.Metric, rhsSample.Metric.Metric) {
|
|
value, keep := evalVectorBinop(node.opType, lhsSample.Value, rhsSample.Value)
|
|
if keep {
|
|
lhsSample.Value = value
|
|
if node.opType.shouldDropMetric() {
|
|
lhsSample.Metric.Delete(clientmodel.MetricNameLabel)
|
|
}
|
|
result = append(result, lhsSample)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
panic("Invalid vector arithmetic expression operands")
|
|
}
|
|
|
|
// Eval implements the MatrixNode interface and returns the value of
|
|
// the selector.
|
|
func (node *MatrixSelector) Eval(timestamp clientmodel.Timestamp) Matrix {
|
|
interval := &metric.Interval{
|
|
OldestInclusive: timestamp.Add(-node.interval),
|
|
NewestInclusive: timestamp,
|
|
}
|
|
|
|
//// timer := v.stats.GetTimer(stats.GetRangeValuesTime).Start()
|
|
sampleStreams := []SampleStream{}
|
|
for fp, it := range node.iterators {
|
|
samplePairs := it.GetRangeValues(*interval)
|
|
if len(samplePairs) == 0 {
|
|
continue
|
|
}
|
|
|
|
sampleStream := SampleStream{
|
|
Metric: node.metrics[fp],
|
|
Values: samplePairs,
|
|
}
|
|
sampleStreams = append(sampleStreams, sampleStream)
|
|
}
|
|
//// timer.Stop()
|
|
return sampleStreams
|
|
}
|
|
|
|
// EvalBoundaries implements the MatrixNode interface and returns the
|
|
// boundary values of the selector.
|
|
func (node *MatrixSelector) EvalBoundaries(timestamp clientmodel.Timestamp) Matrix {
|
|
interval := &metric.Interval{
|
|
OldestInclusive: timestamp.Add(-node.interval),
|
|
NewestInclusive: timestamp,
|
|
}
|
|
|
|
//// timer := v.stats.GetTimer(stats.GetBoundaryValuesTime).Start()
|
|
sampleStreams := []SampleStream{}
|
|
for fp, it := range node.iterators {
|
|
samplePairs := it.GetBoundaryValues(*interval)
|
|
if len(samplePairs) == 0 {
|
|
continue
|
|
}
|
|
|
|
sampleStream := SampleStream{
|
|
Metric: node.metrics[fp],
|
|
Values: samplePairs,
|
|
}
|
|
sampleStreams = append(sampleStreams, sampleStream)
|
|
}
|
|
//// timer.Stop()
|
|
return sampleStreams
|
|
}
|
|
|
|
// Len implements sort.Interface.
|
|
func (matrix Matrix) Len() int {
|
|
return len(matrix)
|
|
}
|
|
|
|
// Less implements sort.Interface.
|
|
func (matrix Matrix) Less(i, j int) bool {
|
|
return matrix[i].Metric.String() < matrix[j].Metric.String()
|
|
}
|
|
|
|
// Swap implements sort.Interface.
|
|
func (matrix Matrix) Swap(i, j int) {
|
|
matrix[i], matrix[j] = matrix[j], matrix[i]
|
|
}
|
|
|
|
// Eval implements the StringNode interface and returns the value of
|
|
// the selector.
|
|
func (node *StringLiteral) Eval(timestamp clientmodel.Timestamp) string {
|
|
return node.str
|
|
}
|
|
|
|
// Eval implements the StringNode interface and returns the result of
|
|
// the function call.
|
|
func (node *StringFunctionCall) Eval(timestamp clientmodel.Timestamp) string {
|
|
return node.function.callFn(timestamp, node.args).(string)
|
|
}
|
|
|
|
// ----------------------------------------------------------------------------
|
|
// Constructors.
|
|
|
|
// NewScalarLiteral returns a ScalarLiteral with the given value.
|
|
func NewScalarLiteral(value clientmodel.SampleValue) *ScalarLiteral {
|
|
return &ScalarLiteral{
|
|
value: value,
|
|
}
|
|
}
|
|
|
|
// NewVectorSelector returns a (not yet evaluated) VectorSelector with
|
|
// the given LabelSet.
|
|
func NewVectorSelector(m metric.LabelMatchers) *VectorSelector {
|
|
return &VectorSelector{
|
|
labelMatchers: m,
|
|
iterators: map[clientmodel.Fingerprint]local.SeriesIterator{},
|
|
metrics: map[clientmodel.Fingerprint]clientmodel.COWMetric{},
|
|
}
|
|
}
|
|
|
|
// NewVectorAggregation returns a (not yet evaluated)
|
|
// VectorAggregation, aggregating the given VectorNode using the given
|
|
// AggrType, grouping by the given LabelNames.
|
|
func NewVectorAggregation(aggrType AggrType, vector VectorNode, groupBy clientmodel.LabelNames, keepExtraLabels bool) *VectorAggregation {
|
|
return &VectorAggregation{
|
|
aggrType: aggrType,
|
|
groupBy: groupBy,
|
|
keepExtraLabels: keepExtraLabels,
|
|
vector: vector,
|
|
}
|
|
}
|
|
|
|
// NewFunctionCall returns a (not yet evaluated) function call node
|
|
// (of type ScalarFunctionCall, VectorFunctionCall, or
|
|
// StringFunctionCall).
|
|
func NewFunctionCall(function *Function, args Nodes) (Node, error) {
|
|
if err := function.CheckArgTypes(args); err != nil {
|
|
return nil, err
|
|
}
|
|
switch function.returnType {
|
|
case ScalarType:
|
|
return &ScalarFunctionCall{
|
|
function: function,
|
|
args: args,
|
|
}, nil
|
|
case VectorType:
|
|
return &VectorFunctionCall{
|
|
function: function,
|
|
args: args,
|
|
}, nil
|
|
case StringType:
|
|
return &StringFunctionCall{
|
|
function: function,
|
|
args: args,
|
|
}, nil
|
|
}
|
|
panic("Function with invalid return type")
|
|
}
|
|
|
|
func nodesHaveTypes(nodes Nodes, exprTypes []ExprType) bool {
|
|
for _, node := range nodes {
|
|
correctType := false
|
|
for _, exprType := range exprTypes {
|
|
if node.Type() == exprType {
|
|
correctType = true
|
|
}
|
|
}
|
|
if !correctType {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// NewArithExpr returns a (not yet evaluated) expression node (of type
|
|
// VectorArithExpr or ScalarArithExpr).
|
|
func NewArithExpr(opType BinOpType, lhs Node, rhs Node) (Node, error) {
|
|
if !nodesHaveTypes(Nodes{lhs, rhs}, []ExprType{ScalarType, VectorType}) {
|
|
return nil, errors.New("binary operands must be of vector or scalar type")
|
|
}
|
|
|
|
if opType == And || opType == Or {
|
|
if lhs.Type() == ScalarType || rhs.Type() == ScalarType {
|
|
return nil, errors.New("AND and OR operators may only be used between vectors")
|
|
}
|
|
}
|
|
|
|
if lhs.Type() == VectorType || rhs.Type() == VectorType {
|
|
return &VectorArithExpr{
|
|
opType: opType,
|
|
lhs: lhs,
|
|
rhs: rhs,
|
|
}, nil
|
|
}
|
|
|
|
return &ScalarArithExpr{
|
|
opType: opType,
|
|
lhs: lhs.(ScalarNode),
|
|
rhs: rhs.(ScalarNode),
|
|
}, nil
|
|
}
|
|
|
|
// NewMatrixSelector returns a (not yet evaluated) MatrixSelector with
|
|
// the given VectorSelector and Duration.
|
|
func NewMatrixSelector(vector *VectorSelector, interval time.Duration) *MatrixSelector {
|
|
return &MatrixSelector{
|
|
labelMatchers: vector.labelMatchers,
|
|
interval: interval,
|
|
iterators: map[clientmodel.Fingerprint]local.SeriesIterator{},
|
|
metrics: map[clientmodel.Fingerprint]clientmodel.COWMetric{},
|
|
}
|
|
}
|
|
|
|
// NewStringLiteral returns a StringLiteral with the given string as
|
|
// value.
|
|
func NewStringLiteral(str string) *StringLiteral {
|
|
return &StringLiteral{
|
|
str: str,
|
|
}
|
|
}
|