|
|
|
// Copyright 2015 The Prometheus Authors
|
|
|
|
// 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 promql
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"io/ioutil"
|
|
|
|
"math"
|
|
|
|
"regexp"
|
|
|
|
"strconv"
|
|
|
|
"strings"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/fabxc/tsdb/labels"
|
|
|
|
"github.com/prometheus/common/model"
|
promql: Allow per-query contexts.
For Weaveworks' Frankenstein, we need to support multitenancy. In
Frankenstein, we initially solved this without modifying the promql
package at all: we constructed a new promql.Engine for every
query and injected a storage implementation into that engine which would
be primed to only collect data for a given user.
This is problematic to upstream, however. Prometheus assumes that there
is only one engine: the query concurrency gate is part of the engine,
and the engine contains one central cancellable context to shut down all
queries. Also, creating a new engine for every query seems like overkill.
Thus, we want to be able to pass per-query contexts into a single engine.
This change gets rid of the promql.Engine's built-in base context and
allows passing in a per-query context instead. Central cancellation of
all queries is still possible by deriving all passed-in contexts from
one central one, but this is now the responsibility of the caller. The
central query context is now created in main() and passed into the
relevant components (web handler / API, rule manager).
In a next step, the per-query context would have to be passed to the
storage implementation, so that the storage can implement multi-tenancy
or other features based on the contextual information.
8 years ago
|
|
|
"golang.org/x/net/context"
|
|
|
|
|
|
|
|
"github.com/prometheus/prometheus/storage"
|
|
|
|
"github.com/prometheus/prometheus/storage/local"
|
|
|
|
"github.com/prometheus/prometheus/util/testutil"
|
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
minNormal = math.Float64frombits(0x0010000000000000) // The smallest positive normal value of type float64.
|
|
|
|
|
|
|
|
patSpace = regexp.MustCompile("[\t ]+")
|
|
|
|
patLoad = regexp.MustCompile(`^load\s+(.+?)$`)
|
|
|
|
patEvalInstant = regexp.MustCompile(`^eval(?:_(fail|ordered))?\s+instant\s+(?:at\s+(.+?))?\s+(.+)$`)
|
|
|
|
)
|
|
|
|
|
|
|
|
const (
|
|
|
|
epsilon = 0.000001 // Relative error allowed for sample values.
|
|
|
|
)
|
|
|
|
|
|
|
|
var testStartTime = time.Time{}
|
|
|
|
|
|
|
|
// Test is a sequence of read and write commands that are run
|
|
|
|
// against a test storage.
|
|
|
|
type Test struct {
|
|
|
|
testutil.T
|
|
|
|
|
|
|
|
cmds []testCommand
|
|
|
|
|
|
|
|
storage local.Storage
|
|
|
|
closeStorage func()
|
|
|
|
queryEngine *Engine
|
|
|
|
context context.Context
|
|
|
|
cancelCtx context.CancelFunc
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewTest returns an initialized empty Test.
|
|
|
|
func NewTest(t testutil.T, input string) (*Test, error) {
|
|
|
|
test := &Test{
|
|
|
|
T: t,
|
|
|
|
cmds: []testCommand{},
|
|
|
|
}
|
|
|
|
err := test.parse(input)
|
|
|
|
test.clear()
|
|
|
|
|
|
|
|
return test, err
|
|
|
|
}
|
|
|
|
|
|
|
|
func newTestFromFile(t testutil.T, filename string) (*Test, error) {
|
|
|
|
content, err := ioutil.ReadFile(filename)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
return NewTest(t, string(content))
|
|
|
|
}
|
|
|
|
|
|
|
|
// QueryEngine returns the test's query engine.
|
|
|
|
func (t *Test) QueryEngine() *Engine {
|
|
|
|
return t.queryEngine
|
|
|
|
}
|
|
|
|
|
|
|
|
// Context returns the test's context.
|
promql: Allow per-query contexts.
For Weaveworks' Frankenstein, we need to support multitenancy. In
Frankenstein, we initially solved this without modifying the promql
package at all: we constructed a new promql.Engine for every
query and injected a storage implementation into that engine which would
be primed to only collect data for a given user.
This is problematic to upstream, however. Prometheus assumes that there
is only one engine: the query concurrency gate is part of the engine,
and the engine contains one central cancellable context to shut down all
queries. Also, creating a new engine for every query seems like overkill.
Thus, we want to be able to pass per-query contexts into a single engine.
This change gets rid of the promql.Engine's built-in base context and
allows passing in a per-query context instead. Central cancellation of
all queries is still possible by deriving all passed-in contexts from
one central one, but this is now the responsibility of the caller. The
central query context is now created in main() and passed into the
relevant components (web handler / API, rule manager).
In a next step, the per-query context would have to be passed to the
storage implementation, so that the storage can implement multi-tenancy
or other features based on the contextual information.
8 years ago
|
|
|
func (t *Test) Context() context.Context {
|
|
|
|
return t.context
|
promql: Allow per-query contexts.
For Weaveworks' Frankenstein, we need to support multitenancy. In
Frankenstein, we initially solved this without modifying the promql
package at all: we constructed a new promql.Engine for every
query and injected a storage implementation into that engine which would
be primed to only collect data for a given user.
This is problematic to upstream, however. Prometheus assumes that there
is only one engine: the query concurrency gate is part of the engine,
and the engine contains one central cancellable context to shut down all
queries. Also, creating a new engine for every query seems like overkill.
Thus, we want to be able to pass per-query contexts into a single engine.
This change gets rid of the promql.Engine's built-in base context and
allows passing in a per-query context instead. Central cancellation of
all queries is still possible by deriving all passed-in contexts from
one central one, but this is now the responsibility of the caller. The
central query context is now created in main() and passed into the
relevant components (web handler / API, rule manager).
In a next step, the per-query context would have to be passed to the
storage implementation, so that the storage can implement multi-tenancy
or other features based on the contextual information.
8 years ago
|
|
|
}
|
|
|
|
|
|
|
|
// Storage returns the test's storage.
|
|
|
|
func (t *Test) Storage() local.Storage {
|
|
|
|
return t.storage
|
|
|
|
}
|
|
|
|
|
|
|
|
func raise(line int, format string, v ...interface{}) error {
|
|
|
|
return &ParseErr{
|
|
|
|
Line: line + 1,
|
|
|
|
Err: fmt.Errorf(format, v...),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *Test) parseLoad(lines []string, i int) (int, *loadCmd, error) {
|
|
|
|
if !patLoad.MatchString(lines[i]) {
|
|
|
|
return i, nil, raise(i, "invalid load command. (load <step:duration>)")
|
|
|
|
}
|
|
|
|
parts := patLoad.FindStringSubmatch(lines[i])
|
|
|
|
|
|
|
|
gap, err := model.ParseDuration(parts[1])
|
|
|
|
if err != nil {
|
|
|
|
return i, nil, raise(i, "invalid step definition %q: %s", parts[1], err)
|
|
|
|
}
|
|
|
|
cmd := newLoadCmd(time.Duration(gap))
|
|
|
|
for i+1 < len(lines) {
|
|
|
|
i++
|
|
|
|
defLine := lines[i]
|
|
|
|
if len(defLine) == 0 {
|
|
|
|
i--
|
|
|
|
break
|
|
|
|
}
|
|
|
|
metric, vals, err := parseSeriesDesc(defLine)
|
|
|
|
if err != nil {
|
|
|
|
if perr, ok := err.(*ParseErr); ok {
|
|
|
|
perr.Line = i + 1
|
|
|
|
}
|
|
|
|
return i, nil, err
|
|
|
|
}
|
|
|
|
cmd.set(metric, vals...)
|
|
|
|
}
|
|
|
|
return i, cmd, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *Test) parseEval(lines []string, i int) (int, *evalCmd, error) {
|
|
|
|
if !patEvalInstant.MatchString(lines[i]) {
|
|
|
|
return i, nil, raise(i, "invalid evaluation command. (eval[_fail|_ordered] instant [at <offset:duration>] <query>")
|
|
|
|
}
|
|
|
|
parts := patEvalInstant.FindStringSubmatch(lines[i])
|
|
|
|
var (
|
|
|
|
mod = parts[1]
|
|
|
|
at = parts[2]
|
|
|
|
qry = parts[3]
|
|
|
|
)
|
|
|
|
expr, err := ParseExpr(qry)
|
|
|
|
if err != nil {
|
|
|
|
if perr, ok := err.(*ParseErr); ok {
|
|
|
|
perr.Line = i + 1
|
|
|
|
perr.Pos += strings.Index(lines[i], qry)
|
|
|
|
}
|
|
|
|
return i, nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
offset, err := model.ParseDuration(at)
|
|
|
|
if err != nil {
|
|
|
|
return i, nil, raise(i, "invalid step definition %q: %s", parts[1], err)
|
|
|
|
}
|
|
|
|
ts := testStartTime.Add(time.Duration(offset))
|
|
|
|
|
|
|
|
cmd := newEvalCmd(expr, ts, ts, 0)
|
|
|
|
switch mod {
|
|
|
|
case "ordered":
|
|
|
|
cmd.ordered = true
|
|
|
|
case "fail":
|
|
|
|
cmd.fail = true
|
|
|
|
}
|
|
|
|
|
|
|
|
for j := 1; i+1 < len(lines); j++ {
|
|
|
|
i++
|
|
|
|
defLine := lines[i]
|
|
|
|
if len(defLine) == 0 {
|
|
|
|
i--
|
|
|
|
break
|
|
|
|
}
|
|
|
|
if f, err := parseNumber(defLine); err == nil {
|
|
|
|
cmd.expect(0, nil, sequenceValue{value: f})
|
|
|
|
break
|
|
|
|
}
|
|
|
|
metric, vals, err := parseSeriesDesc(defLine)
|
|
|
|
if err != nil {
|
|
|
|
if perr, ok := err.(*ParseErr); ok {
|
|
|
|
perr.Line = i + 1
|
|
|
|
}
|
|
|
|
return i, nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Currently, we are not expecting any matrices.
|
|
|
|
if len(vals) > 1 {
|
|
|
|
return i, nil, raise(i, "expecting multiple values in instant evaluation not allowed")
|
|
|
|
}
|
|
|
|
cmd.expect(j, metric, vals...)
|
|
|
|
}
|
|
|
|
return i, cmd, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// parse the given command sequence and appends it to the test.
|
|
|
|
func (t *Test) parse(input string) error {
|
|
|
|
// Trim lines and remove comments.
|
|
|
|
lines := strings.Split(input, "\n")
|
|
|
|
for i, l := range lines {
|
|
|
|
l = strings.TrimSpace(l)
|
|
|
|
if strings.HasPrefix(l, "#") {
|
|
|
|
l = ""
|
|
|
|
}
|
|
|
|
lines[i] = l
|
|
|
|
}
|
|
|
|
var err error
|
|
|
|
|
|
|
|
// Scan for steps line by line.
|
|
|
|
for i := 0; i < len(lines); i++ {
|
|
|
|
l := lines[i]
|
|
|
|
if len(l) == 0 {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
var cmd testCommand
|
|
|
|
|
|
|
|
switch c := strings.ToLower(patSpace.Split(l, 2)[0]); {
|
|
|
|
case c == "clear":
|
|
|
|
cmd = &clearCmd{}
|
|
|
|
case c == "load":
|
|
|
|
i, cmd, err = t.parseLoad(lines, i)
|
|
|
|
case strings.HasPrefix(c, "eval"):
|
|
|
|
i, cmd, err = t.parseEval(lines, i)
|
|
|
|
default:
|
|
|
|
return raise(i, "invalid command %q", l)
|
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
t.cmds = append(t.cmds, cmd)
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// testCommand is an interface that ensures that only the package internal
|
|
|
|
// types can be a valid command for a test.
|
|
|
|
type testCommand interface {
|
|
|
|
testCmd()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (*clearCmd) testCmd() {}
|
|
|
|
func (*loadCmd) testCmd() {}
|
|
|
|
func (*evalCmd) testCmd() {}
|
|
|
|
|
|
|
|
// loadCmd is a command that loads sequences of sample values for specific
|
|
|
|
// metrics into the storage.
|
|
|
|
type loadCmd struct {
|
|
|
|
gap time.Duration
|
|
|
|
metrics map[uint64]labels.Labels
|
|
|
|
defs map[uint64][]samplePair
|
|
|
|
}
|
|
|
|
|
|
|
|
func newLoadCmd(gap time.Duration) *loadCmd {
|
|
|
|
return &loadCmd{
|
|
|
|
gap: gap,
|
|
|
|
metrics: map[uint64]labels.Labels{},
|
|
|
|
defs: map[uint64][]samplePair{},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (cmd loadCmd) String() string {
|
|
|
|
return "load"
|
|
|
|
}
|
|
|
|
|
|
|
|
// set a sequence of sample values for the given metric.
|
|
|
|
func (cmd *loadCmd) set(m labels.Labels, vals ...sequenceValue) {
|
|
|
|
h := m.Hash()
|
|
|
|
|
|
|
|
samples := make([]samplePair, 0, len(vals))
|
|
|
|
ts := testStartTime
|
|
|
|
for _, v := range vals {
|
|
|
|
if !v.omitted {
|
|
|
|
samples = append(samples, samplePair{
|
|
|
|
t: ts.UnixNano() / int64(time.Millisecond/time.Nanosecond),
|
|
|
|
v: v.value,
|
|
|
|
})
|
|
|
|
}
|
|
|
|
ts = ts.Add(cmd.gap)
|
|
|
|
}
|
|
|
|
cmd.defs[h] = samples
|
|
|
|
cmd.metrics[h] = m
|
|
|
|
}
|
|
|
|
|
|
|
|
// append the defined time series to the storage.
|
|
|
|
func (cmd *loadCmd) append(a storage.SampleAppender) {
|
|
|
|
// TODO(fabxc): commented out until Appender refactoring.
|
|
|
|
// for fp, samples := range cmd.defs {
|
|
|
|
// met := cmd.metrics[fp]
|
|
|
|
// for _, smpl := range samples {
|
|
|
|
// s := &model.Sample{
|
|
|
|
// Metric: met,
|
|
|
|
// Value: smpl.Value,
|
|
|
|
// Timestamp: smpl.Timestamp,
|
|
|
|
// }
|
|
|
|
// a.Append(s)
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
}
|
|
|
|
|
|
|
|
// evalCmd is a command that evaluates an expression for the given time (range)
|
|
|
|
// and expects a specific result.
|
|
|
|
type evalCmd struct {
|
|
|
|
expr Expr
|
|
|
|
start, end time.Time
|
|
|
|
interval time.Duration
|
|
|
|
|
|
|
|
instant bool
|
|
|
|
fail, ordered bool
|
|
|
|
|
|
|
|
metrics map[uint64]labels.Labels
|
|
|
|
expected map[uint64]entry
|
|
|
|
}
|
|
|
|
|
|
|
|
type entry struct {
|
|
|
|
pos int
|
|
|
|
vals []sequenceValue
|
|
|
|
}
|
|
|
|
|
|
|
|
func (e entry) String() string {
|
|
|
|
return fmt.Sprintf("%d: %s", e.pos, e.vals)
|
|
|
|
}
|
|
|
|
|
|
|
|
func newEvalCmd(expr Expr, start, end time.Time, interval time.Duration) *evalCmd {
|
|
|
|
return &evalCmd{
|
|
|
|
expr: expr,
|
|
|
|
start: start,
|
|
|
|
end: end,
|
|
|
|
interval: interval,
|
|
|
|
instant: start == end && interval == 0,
|
|
|
|
|
|
|
|
metrics: map[uint64]labels.Labels{},
|
|
|
|
expected: map[uint64]entry{},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ev *evalCmd) String() string {
|
|
|
|
return "eval"
|
|
|
|
}
|
|
|
|
|
|
|
|
// expect adds a new metric with a sequence of values to the set of expected
|
|
|
|
// results for the query.
|
|
|
|
func (ev *evalCmd) expect(pos int, m labels.Labels, vals ...sequenceValue) {
|
|
|
|
if m == nil {
|
|
|
|
ev.expected[0] = entry{pos: pos, vals: vals}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
h := m.Hash()
|
|
|
|
ev.metrics[h] = m
|
|
|
|
ev.expected[h] = entry{pos: pos, vals: vals}
|
|
|
|
}
|
|
|
|
|
|
|
|
// compareResult compares the result value with the defined expectation.
|
|
|
|
func (ev *evalCmd) compareResult(result Value) error {
|
|
|
|
switch val := result.(type) {
|
|
|
|
case Matrix:
|
|
|
|
if ev.instant {
|
|
|
|
return fmt.Errorf("received range result on instant evaluation")
|
|
|
|
}
|
|
|
|
seen := map[uint64]bool{}
|
|
|
|
for pos, v := range val {
|
|
|
|
fp := v.Metric.Hash()
|
|
|
|
if _, ok := ev.metrics[fp]; !ok {
|
|
|
|
return fmt.Errorf("unexpected metric %s in result", v.Metric)
|
|
|
|
}
|
|
|
|
exp := ev.expected[fp]
|
|
|
|
if ev.ordered && exp.pos != pos+1 {
|
|
|
|
return fmt.Errorf("expected metric %s with %v at position %d but was at %d", v.Metric, exp.vals, exp.pos, pos+1)
|
|
|
|
}
|
|
|
|
for i, expVal := range exp.vals {
|
|
|
|
if !almostEqual(expVal.value, v.Values[i].v) {
|
|
|
|
return fmt.Errorf("expected %v for %s but got %v", expVal, v.Metric, v.Values)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
seen[fp] = true
|
|
|
|
}
|
|
|
|
for fp, expVals := range ev.expected {
|
|
|
|
if !seen[fp] {
|
|
|
|
return fmt.Errorf("expected metric %s with %v not found", ev.metrics[fp], expVals)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
case Vector:
|
|
|
|
if !ev.instant {
|
|
|
|
return fmt.Errorf("received instant result on range evaluation")
|
|
|
|
}
|
|
|
|
seen := map[uint64]bool{}
|
|
|
|
for pos, v := range val {
|
|
|
|
fp := v.Metric.Hash()
|
|
|
|
if _, ok := ev.metrics[fp]; !ok {
|
|
|
|
return fmt.Errorf("unexpected metric %s in result", v.Metric)
|
|
|
|
}
|
|
|
|
exp := ev.expected[fp]
|
|
|
|
if ev.ordered && exp.pos != pos+1 {
|
|
|
|
return fmt.Errorf("expected metric %s with %v at position %d but was at %d", v.Metric, exp.vals, exp.pos, pos+1)
|
|
|
|
}
|
|
|
|
if !almostEqual(float64(exp.vals[0].value), float64(v.Value)) {
|
|
|
|
return fmt.Errorf("expected %v for %s but got %v", exp.vals[0].value, v.Metric, v.Value)
|
|
|
|
}
|
|
|
|
|
|
|
|
seen[fp] = true
|
|
|
|
}
|
|
|
|
for fp, expVals := range ev.expected {
|
|
|
|
if !seen[fp] {
|
|
|
|
return fmt.Errorf("expected metric %s with %v not found", ev.metrics[fp], expVals)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
case Scalar:
|
|
|
|
if !almostEqual(ev.expected[0].vals[0].value, val.v) {
|
|
|
|
return fmt.Errorf("expected Scalar %v but got %v", val.v, ev.expected[0].vals[0].value)
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
panic(fmt.Errorf("promql.Test.compareResult: unexpected result type %T", result))
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// clearCmd is a command that wipes the test's storage state.
|
|
|
|
type clearCmd struct{}
|
|
|
|
|
|
|
|
func (cmd clearCmd) String() string {
|
|
|
|
return "clear"
|
|
|
|
}
|
|
|
|
|
|
|
|
// RunAsBenchmark runs the test in benchmark mode.
|
|
|
|
// This will not count any loads or non eval functions.
|
|
|
|
func (t *Test) RunAsBenchmark(b *Benchmark) error {
|
|
|
|
for _, cmd := range t.cmds {
|
|
|
|
|
|
|
|
switch cmd.(type) {
|
|
|
|
// Only time the "eval" command.
|
|
|
|
case *evalCmd:
|
|
|
|
err := t.exec(cmd)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
if b.iterCount == 0 {
|
|
|
|
b.b.StopTimer()
|
|
|
|
err := t.exec(cmd)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
b.b.StartTimer()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Run executes the command sequence of the test. Until the maximum error number
|
|
|
|
// is reached, evaluation errors do not terminate execution.
|
|
|
|
func (t *Test) Run() error {
|
|
|
|
for _, cmd := range t.cmds {
|
|
|
|
err := t.exec(cmd)
|
|
|
|
// TODO(fabxc): aggregate command errors, yield diffs for result
|
|
|
|
// comparison errors.
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// exec processes a single step of the test.
|
|
|
|
func (t *Test) exec(tc testCommand) error {
|
|
|
|
switch cmd := tc.(type) {
|
|
|
|
case *clearCmd:
|
|
|
|
t.clear()
|
|
|
|
|
|
|
|
case *loadCmd:
|
|
|
|
cmd.append(t.storage)
|
|
|
|
t.storage.WaitForIndexing()
|
|
|
|
|
|
|
|
case *evalCmd:
|
|
|
|
q := t.queryEngine.newQuery(cmd.expr, cmd.start, cmd.end, cmd.interval)
|
|
|
|
res := q.Exec(t.context)
|
|
|
|
if res.Err != nil {
|
|
|
|
if cmd.fail {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return fmt.Errorf("error evaluating query: %s", res.Err)
|
|
|
|
}
|
|
|
|
if res.Err == nil && cmd.fail {
|
|
|
|
return fmt.Errorf("expected error evaluating query but got none")
|
|
|
|
}
|
|
|
|
|
|
|
|
err := cmd.compareResult(res.Value)
|
|
|
|
if err != nil {
|
|
|
|
return fmt.Errorf("error in %s %s: %s", cmd, cmd.expr, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
panic("promql.Test.exec: unknown test command type")
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// clear the current test storage of all inserted samples.
|
|
|
|
func (t *Test) clear() {
|
|
|
|
if t.closeStorage != nil {
|
|
|
|
t.closeStorage()
|
|
|
|
}
|
|
|
|
if t.cancelCtx != nil {
|
|
|
|
t.cancelCtx()
|
|
|
|
}
|
|
|
|
|
|
|
|
var closer testutil.Closer
|
|
|
|
t.storage, closer = local.NewTestStorage(t, 2)
|
|
|
|
|
|
|
|
t.closeStorage = closer.Close
|
|
|
|
// TODO(fabxc): add back
|
|
|
|
// t.queryEngine = NewEngine(t.storage, nil)
|
|
|
|
t.context, t.cancelCtx = context.WithCancel(context.Background())
|
|
|
|
}
|
|
|
|
|
|
|
|
// Close closes resources associated with the Test.
|
|
|
|
func (t *Test) Close() {
|
|
|
|
t.cancelCtx()
|
|
|
|
t.closeStorage()
|
|
|
|
}
|
|
|
|
|
|
|
|
// samplesAlmostEqual returns true if the two sample lines only differ by a
|
|
|
|
// small relative error in their sample value.
|
|
|
|
func almostEqual(a, b float64) bool {
|
|
|
|
// NaN has no equality but for testing we still want to know whether both values
|
|
|
|
// are NaN.
|
|
|
|
if math.IsNaN(a) && math.IsNaN(b) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
// Cf. http://floating-point-gui.de/errors/comparison/
|
|
|
|
if a == b {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
diff := math.Abs(a - b)
|
|
|
|
|
|
|
|
if a == 0 || b == 0 || diff < minNormal {
|
|
|
|
return diff < epsilon*minNormal
|
|
|
|
}
|
|
|
|
return diff/(math.Abs(a)+math.Abs(b)) < epsilon
|
|
|
|
}
|
|
|
|
|
|
|
|
func parseNumber(s string) (float64, error) {
|
|
|
|
n, err := strconv.ParseInt(s, 0, 64)
|
|
|
|
f := float64(n)
|
|
|
|
if err != nil {
|
|
|
|
f, err = strconv.ParseFloat(s, 64)
|
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
return 0, fmt.Errorf("error parsing number: %s", err)
|
|
|
|
}
|
|
|
|
return f, nil
|
|
|
|
}
|