2016-03-10 03:29:02 +00:00
|
|
|
// 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.
|
|
|
|
|
2024-04-29 12:14:18 +00:00
|
|
|
package promql_test
|
2016-03-10 03:29:02 +00:00
|
|
|
|
2017-08-07 16:15:38 +00:00
|
|
|
import (
|
|
|
|
"context"
|
|
|
|
"testing"
|
2018-01-09 16:44:23 +00:00
|
|
|
"time"
|
2017-08-07 16:15:38 +00:00
|
|
|
|
2020-10-29 09:43:23 +00:00
|
|
|
"github.com/stretchr/testify/require"
|
2020-10-22 09:00:08 +00:00
|
|
|
|
2021-11-08 14:23:17 +00:00
|
|
|
"github.com/prometheus/prometheus/model/labels"
|
|
|
|
"github.com/prometheus/prometheus/model/timestamp"
|
2024-04-29 12:14:18 +00:00
|
|
|
"github.com/prometheus/prometheus/promql"
|
2020-02-21 11:43:30 +00:00
|
|
|
"github.com/prometheus/prometheus/promql/parser"
|
2024-07-14 11:28:59 +00:00
|
|
|
"github.com/prometheus/prometheus/promql/promqltest"
|
2019-08-09 01:35:39 +00:00
|
|
|
"github.com/prometheus/prometheus/util/teststorage"
|
2017-08-07 16:15:38 +00:00
|
|
|
)
|
2016-03-10 03:29:02 +00:00
|
|
|
|
2017-08-07 16:15:38 +00:00
|
|
|
func TestDeriv(t *testing.T) {
|
|
|
|
// https://github.com/prometheus/prometheus/issues/2674#issuecomment-315439393
|
|
|
|
// This requires more precision than the usual test system offers,
|
|
|
|
// so we test it by hand.
|
2019-08-09 01:35:39 +00:00
|
|
|
storage := teststorage.New(t)
|
2017-08-10 14:28:49 +00:00
|
|
|
defer storage.Close()
|
2024-04-29 12:14:18 +00:00
|
|
|
opts := promql.EngineOpts{
|
2020-01-28 20:38:49 +00:00
|
|
|
Logger: nil,
|
|
|
|
Reg: nil,
|
|
|
|
MaxSamples: 10000,
|
|
|
|
Timeout: 10 * time.Second,
|
2018-10-02 11:59:19 +00:00
|
|
|
}
|
2024-07-14 11:28:59 +00:00
|
|
|
engine := promqltest.NewTestEngineWithOpts(t, opts)
|
2017-08-07 16:15:38 +00:00
|
|
|
|
2020-07-24 14:10:51 +00:00
|
|
|
a := storage.Appender(context.Background())
|
2017-08-10 14:28:49 +00:00
|
|
|
|
2022-03-29 14:13:54 +00:00
|
|
|
var start, interval, i int64
|
2017-08-10 14:28:49 +00:00
|
|
|
metric := labels.FromStrings("__name__", "foo")
|
2022-03-29 14:13:54 +00:00
|
|
|
start = 1493712816939
|
|
|
|
interval = 30 * 1000
|
2021-11-15 23:03:22 +00:00
|
|
|
// Introduce some timestamp jitter to test 0 slope case.
|
|
|
|
// https://github.com/prometheus/prometheus/issues/7180
|
2022-03-29 14:13:54 +00:00
|
|
|
for i = 0; i < 15; i++ {
|
2021-11-15 23:03:22 +00:00
|
|
|
jitter := 12 * i % 2
|
2023-04-09 07:08:40 +00:00
|
|
|
a.Append(0, metric, start+interval*i+jitter, 1)
|
2021-11-15 23:03:22 +00:00
|
|
|
}
|
2017-08-10 14:28:49 +00:00
|
|
|
|
2020-10-29 09:43:23 +00:00
|
|
|
require.NoError(t, a.Commit())
|
2017-08-07 16:15:38 +00:00
|
|
|
|
2023-04-18 04:32:38 +00:00
|
|
|
ctx := context.Background()
|
|
|
|
query, err := engine.NewInstantQuery(ctx, storage, nil, "deriv(foo[30m])", timestamp.Time(1493712846939))
|
2020-10-29 09:43:23 +00:00
|
|
|
require.NoError(t, err)
|
2018-04-27 12:11:16 +00:00
|
|
|
|
2023-04-18 04:32:38 +00:00
|
|
|
result := query.Exec(ctx)
|
2020-10-29 09:43:23 +00:00
|
|
|
require.NoError(t, result.Err)
|
2018-04-27 12:11:16 +00:00
|
|
|
|
2017-08-07 16:15:38 +00:00
|
|
|
vec, _ := result.Vector()
|
2023-12-07 11:35:01 +00:00
|
|
|
require.Len(t, vec, 1, "Expected 1 result, got %d", len(vec))
|
promql: Separate `Point` into `FPoint` and `HPoint`
In other words: Instead of having a “polymorphous” `Point` that can
either contain a float value or a histogram value, use an `FPoint` for
floats and an `HPoint` for histograms.
This seemingly small change has a _lot_ of repercussions throughout
the codebase.
The idea here is to avoid the increase in size of `Point` arrays that
happened after native histograms had been added.
The higher-level data structures (`Sample`, `Series`, etc.) are still
“polymorphous”. The same idea could be applied to them, but at each
step the trade-offs needed to be evaluated.
The idea with this change is to do the minimum necessary to get back
to pre-histogram performance for functions that do not touch
histograms. Here are comparisons for the `changes` function. The test
data doesn't include histograms yet. Ideally, there would be no change
in the benchmark result at all.
First runtime v2.39 compared to directly prior to this commit:
```
name old time/op new time/op delta
RangeQuery/expr=changes(a_one[1d]),steps=1-16 391µs ± 2% 542µs ± 1% +38.58% (p=0.000 n=9+8)
RangeQuery/expr=changes(a_one[1d]),steps=10-16 452µs ± 2% 617µs ± 2% +36.48% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_one[1d]),steps=100-16 1.12ms ± 1% 1.36ms ± 2% +21.58% (p=0.000 n=8+10)
RangeQuery/expr=changes(a_one[1d]),steps=1000-16 7.83ms ± 1% 8.94ms ± 1% +14.21% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_ten[1d]),steps=1-16 2.98ms ± 0% 3.30ms ± 1% +10.67% (p=0.000 n=9+10)
RangeQuery/expr=changes(a_ten[1d]),steps=10-16 3.66ms ± 1% 4.10ms ± 1% +11.82% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_ten[1d]),steps=100-16 10.5ms ± 0% 11.8ms ± 1% +12.50% (p=0.000 n=8+10)
RangeQuery/expr=changes(a_ten[1d]),steps=1000-16 77.6ms ± 1% 87.4ms ± 1% +12.63% (p=0.000 n=9+9)
RangeQuery/expr=changes(a_hundred[1d]),steps=1-16 30.4ms ± 2% 32.8ms ± 1% +8.01% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=10-16 37.1ms ± 2% 40.6ms ± 2% +9.64% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=100-16 105ms ± 1% 117ms ± 1% +11.69% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=1000-16 783ms ± 3% 876ms ± 1% +11.83% (p=0.000 n=9+10)
```
And then runtime v2.39 compared to after this commit:
```
name old time/op new time/op delta
RangeQuery/expr=changes(a_one[1d]),steps=1-16 391µs ± 2% 547µs ± 1% +39.84% (p=0.000 n=9+8)
RangeQuery/expr=changes(a_one[1d]),steps=10-16 452µs ± 2% 616µs ± 2% +36.15% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_one[1d]),steps=100-16 1.12ms ± 1% 1.26ms ± 1% +12.20% (p=0.000 n=8+10)
RangeQuery/expr=changes(a_one[1d]),steps=1000-16 7.83ms ± 1% 7.95ms ± 1% +1.59% (p=0.000 n=10+8)
RangeQuery/expr=changes(a_ten[1d]),steps=1-16 2.98ms ± 0% 3.38ms ± 2% +13.49% (p=0.000 n=9+10)
RangeQuery/expr=changes(a_ten[1d]),steps=10-16 3.66ms ± 1% 4.02ms ± 1% +9.80% (p=0.000 n=10+9)
RangeQuery/expr=changes(a_ten[1d]),steps=100-16 10.5ms ± 0% 10.8ms ± 1% +3.08% (p=0.000 n=8+10)
RangeQuery/expr=changes(a_ten[1d]),steps=1000-16 77.6ms ± 1% 78.1ms ± 1% +0.58% (p=0.035 n=9+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=1-16 30.4ms ± 2% 33.5ms ± 4% +10.18% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=10-16 37.1ms ± 2% 40.0ms ± 1% +7.98% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=100-16 105ms ± 1% 107ms ± 1% +1.92% (p=0.000 n=10+10)
RangeQuery/expr=changes(a_hundred[1d]),steps=1000-16 783ms ± 3% 775ms ± 1% -1.02% (p=0.019 n=9+9)
```
In summary, the runtime doesn't really improve with this change for
queries with just a few steps. For queries with many steps, this
commit essentially reinstates the old performance. This is good
because the many-step queries are the one that matter most (longest
absolute runtime).
In terms of allocations, though, this commit doesn't make a dent at
all (numbers not shown). The reason is that most of the allocations
happen in the sampleRingIterator (in the storage package), which has
to be addressed in a separate commit.
Signed-off-by: beorn7 <beorn@grafana.com>
2022-10-28 14:58:40 +00:00
|
|
|
require.Equal(t, 0.0, vec[0].F, "Expected 0.0 as value, got %f", vec[0].F)
|
2017-08-07 16:15:38 +00:00
|
|
|
}
|
2020-02-21 11:43:30 +00:00
|
|
|
|
|
|
|
func TestFunctionList(t *testing.T) {
|
2020-02-25 12:57:30 +00:00
|
|
|
// Test that Functions and parser.Functions list the same functions.
|
2024-04-29 12:14:18 +00:00
|
|
|
for i := range promql.FunctionCalls {
|
2020-02-21 11:43:30 +00:00
|
|
|
_, ok := parser.Functions[i]
|
2020-10-29 09:43:23 +00:00
|
|
|
require.True(t, ok, "function %s exists in promql package, but not in parser package", i)
|
2020-02-21 11:43:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for i := range parser.Functions {
|
2024-04-29 12:14:18 +00:00
|
|
|
_, ok := promql.FunctionCalls[i]
|
2020-10-29 09:43:23 +00:00
|
|
|
require.True(t, ok, "function %s exists in parser package, but not in promql package", i)
|
2020-02-21 11:43:30 +00:00
|
|
|
}
|
|
|
|
}
|