|
|
|
// Copyright 2017 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 storage
|
|
|
|
|
|
|
|
import (
|
|
|
|
"math/rand"
|
|
|
|
"testing"
|
|
|
|
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
|
Style cleanup of all the changes in sparsehistogram so far
A lot of this code was hacked together, literally during a
hackathon. This commit intends not to change the code substantially,
but just make the code obey the usual style practices.
A (possibly incomplete) list of areas:
* Generally address linter warnings.
* The `pgk` directory is deprecated as per dev-summit. No new packages should
be added to it. I moved the new `pkg/histogram` package to `model`
anticipating what's proposed in #9478.
* Make the naming of the Sparse Histogram more consistent. Including
abbreviations, there were just too many names for it: SparseHistogram,
Histogram, Histo, hist, his, shs, h. The idea is to call it "Histogram" in
general. Only add "Sparse" if it is needed to avoid confusion with
conventional Histograms (which is rare because the TSDB really has no notion
of conventional Histograms). Use abbreviations only in local scope, and then
really abbreviate (not just removing three out of seven letters like in
"Histo"). This is in the spirit of
https://github.com/golang/go/wiki/CodeReviewComments#variable-names
* Several other minor name changes.
* A lot of formatting of doc comments. For one, following
https://github.com/golang/go/wiki/CodeReviewComments#comment-sentences
, but also layout question, anticipating how things will look like
when rendered by `godoc` (even where `godoc` doesn't render them
right now because they are for unexported types or not a doc comment
at all but just a normal code comment - consistency is queen!).
* Re-enabled `TestQueryLog` and `TestEndopints` (they pass now,
leaving them disabled was presumably an oversight).
* Bucket iterator for histogram.Histogram is now created with a
method.
* HistogramChunk.iterator now allows iterator recycling. (I think
@dieterbe only commented it out because he was confused by the
question in the comment.)
* HistogramAppender.Append panics now because we decided to treat
staleness marker differently.
Signed-off-by: beorn7 <beorn@grafana.com>
3 years ago
|
|
|
"github.com/prometheus/prometheus/model/histogram"
|
|
|
|
"github.com/prometheus/prometheus/tsdb/chunkenc"
|
|
|
|
)
|
|
|
|
|
|
|
|
func TestSampleRing(t *testing.T) {
|
|
|
|
cases := []struct {
|
|
|
|
input []int64
|
|
|
|
delta int64
|
|
|
|
size int
|
|
|
|
}{
|
|
|
|
{
|
|
|
|
input: []int64{1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
|
|
|
|
delta: 2,
|
|
|
|
size: 1,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
input: []int64{1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
|
|
|
|
delta: 2,
|
|
|
|
size: 2,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
input: []int64{1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
|
|
|
|
delta: 7,
|
|
|
|
size: 3,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
input: []int64{1, 2, 3, 4, 5, 16, 17, 18, 19, 20},
|
|
|
|
delta: 7,
|
|
|
|
size: 1,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
input: []int64{1, 2, 3, 4, 6},
|
|
|
|
delta: 4,
|
|
|
|
size: 4,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
for _, c := range cases {
|
|
|
|
r := newSampleRing(c.delta, c.size)
|
|
|
|
|
|
|
|
input := []sample{}
|
|
|
|
for _, t := range c.input {
|
|
|
|
input = append(input, sample{
|
|
|
|
t: t,
|
|
|
|
v: float64(rand.Intn(100)),
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
for i, s := range input {
|
|
|
|
r.add(s)
|
|
|
|
buffered := r.samples()
|
|
|
|
|
|
|
|
for _, sold := range input[:i] {
|
|
|
|
found := false
|
|
|
|
for _, bs := range buffered {
|
|
|
|
if bs.t == sold.t && bs.v == sold.v {
|
|
|
|
found = true
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if found {
|
|
|
|
require.GreaterOrEqual(t, sold.t, s.t-c.delta, "%d: unexpected sample %d in buffer; buffer %v", i, sold.t, buffered)
|
|
|
|
} else {
|
|
|
|
require.Less(t, sold.t, s.t-c.delta, "%d: expected sample %d to be in buffer but was not; buffer %v", i, sold.t, buffered)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestBufferedSeriesIterator(t *testing.T) {
|
|
|
|
var it *BufferedSeriesIterator
|
|
|
|
|
|
|
|
bufferEq := func(exp []sample) {
|
|
|
|
var b []sample
|
|
|
|
bit := it.Buffer()
|
|
|
|
for bit.Next() == chunkenc.ValFloat {
|
|
|
|
t, v := bit.At()
|
|
|
|
b = append(b, sample{t: t, v: v})
|
|
|
|
}
|
|
|
|
require.Equal(t, exp, b, "buffer mismatch")
|
|
|
|
}
|
|
|
|
sampleEq := func(ets int64, ev float64) {
|
|
|
|
ts, v := it.At()
|
|
|
|
require.Equal(t, ets, ts, "timestamp mismatch")
|
|
|
|
require.Equal(t, ev, v, "value mismatch")
|
|
|
|
}
|
|
|
|
prevSampleEq := func(ets int64, ev float64, eok bool) {
|
|
|
|
ts, v, _, ok := it.PeekBack(1)
|
|
|
|
require.Equal(t, eok, ok, "exist mismatch")
|
|
|
|
require.Equal(t, ets, ts, "timestamp mismatch")
|
|
|
|
require.Equal(t, ev, v, "value mismatch")
|
|
|
|
}
|
|
|
|
|
|
|
|
it = NewBufferIterator(NewListSeriesIterator(samples{
|
|
|
|
sample{t: 1, v: 2},
|
|
|
|
sample{t: 2, v: 3},
|
|
|
|
sample{t: 3, v: 4},
|
|
|
|
sample{t: 4, v: 5},
|
|
|
|
sample{t: 5, v: 6},
|
|
|
|
sample{t: 99, v: 8},
|
|
|
|
sample{t: 100, v: 9},
|
|
|
|
sample{t: 101, v: 10},
|
|
|
|
}), 2)
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Seek(-123), "seek failed")
|
|
|
|
sampleEq(1, 2)
|
|
|
|
prevSampleEq(0, 0, false)
|
|
|
|
bufferEq(nil)
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Next(), "next failed")
|
|
|
|
sampleEq(2, 3)
|
|
|
|
prevSampleEq(1, 2, true)
|
|
|
|
bufferEq([]sample{{t: 1, v: 2}})
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Next(), "next failed")
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Next(), "next failed")
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Next(), "next failed")
|
|
|
|
sampleEq(5, 6)
|
|
|
|
prevSampleEq(4, 5, true)
|
|
|
|
bufferEq([]sample{{t: 2, v: 3}, {t: 3, v: 4}, {t: 4, v: 5}})
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Seek(5), "seek failed")
|
|
|
|
sampleEq(5, 6)
|
|
|
|
prevSampleEq(4, 5, true)
|
|
|
|
bufferEq([]sample{{t: 2, v: 3}, {t: 3, v: 4}, {t: 4, v: 5}})
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValFloat, it.Seek(101), "seek failed")
|
|
|
|
sampleEq(101, 10)
|
|
|
|
prevSampleEq(100, 9, true)
|
|
|
|
bufferEq([]sample{{t: 99, v: 8}, {t: 100, v: 9}})
|
|
|
|
|
|
|
|
require.Equal(t, chunkenc.ValNone, it.Next(), "next succeeded unexpectedly")
|
|
|
|
}
|
|
|
|
|
|
|
|
// At() should not be called once Next() returns false.
|
|
|
|
func TestBufferedSeriesIteratorNoBadAt(t *testing.T) {
|
|
|
|
done := false
|
|
|
|
|
|
|
|
m := &mockSeriesIterator{
|
|
|
|
seek: func(int64) chunkenc.ValueType { return chunkenc.ValNone },
|
|
|
|
at: func() (int64, float64) {
|
|
|
|
require.False(t, done, "unexpectedly done")
|
|
|
|
done = true
|
|
|
|
return 0, 0
|
|
|
|
},
|
|
|
|
next: func() chunkenc.ValueType {
|
|
|
|
if done {
|
|
|
|
return chunkenc.ValNone
|
|
|
|
}
|
|
|
|
return chunkenc.ValFloat
|
|
|
|
},
|
|
|
|
err: func() error { return nil },
|
|
|
|
}
|
|
|
|
|
|
|
|
it := NewBufferIterator(m, 60)
|
|
|
|
it.Next()
|
|
|
|
it.Next()
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkBufferedSeriesIterator(b *testing.B) {
|
|
|
|
// Simulate a 5 minute rate.
|
|
|
|
it := NewBufferIterator(newFakeSeriesIterator(int64(b.N), 30), 5*60)
|
|
|
|
|
|
|
|
b.SetBytes(int64(b.N * 16))
|
|
|
|
b.ReportAllocs()
|
|
|
|
b.ResetTimer()
|
|
|
|
|
|
|
|
for it.Next() != chunkenc.ValNone {
|
|
|
|
// scan everything
|
|
|
|
}
|
|
|
|
require.NoError(b, it.Err())
|
|
|
|
}
|
|
|
|
|
|
|
|
type mockSeriesIterator struct {
|
|
|
|
seek func(int64) chunkenc.ValueType
|
|
|
|
at func() (int64, float64)
|
|
|
|
next func() chunkenc.ValueType
|
|
|
|
err func() error
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *mockSeriesIterator) Seek(t int64) chunkenc.ValueType { return m.seek(t) }
|
|
|
|
func (m *mockSeriesIterator) At() (int64, float64) { return m.at() }
|
|
|
|
func (m *mockSeriesIterator) Next() chunkenc.ValueType { return m.next() }
|
|
|
|
func (m *mockSeriesIterator) Err() error { return m.err() }
|
|
|
|
|
|
|
|
func (m *mockSeriesIterator) AtHistogram() (int64, *histogram.Histogram) {
|
|
|
|
return 0, nil // Not really mocked.
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *mockSeriesIterator) AtFloatHistogram() (int64, *histogram.FloatHistogram) {
|
|
|
|
return 0, nil // Not really mocked.
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m *mockSeriesIterator) AtT() int64 {
|
|
|
|
return 0 // Not really mocked.
|
|
|
|
}
|
|
|
|
|
|
|
|
type fakeSeriesIterator struct {
|
|
|
|
nsamples int64
|
|
|
|
step int64
|
|
|
|
idx int64
|
|
|
|
}
|
|
|
|
|
|
|
|
func newFakeSeriesIterator(nsamples, step int64) *fakeSeriesIterator {
|
|
|
|
return &fakeSeriesIterator{nsamples: nsamples, step: step, idx: -1}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) At() (int64, float64) {
|
|
|
|
return it.idx * it.step, 123 // Value doesn't matter.
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) AtHistogram() (int64, *histogram.Histogram) {
|
|
|
|
return it.idx * it.step, &histogram.Histogram{} // Value doesn't matter.
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) AtFloatHistogram() (int64, *histogram.FloatHistogram) {
|
|
|
|
return it.idx * it.step, &histogram.FloatHistogram{} // Value doesn't matter.
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) AtT() int64 {
|
|
|
|
return it.idx * it.step
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) Next() chunkenc.ValueType {
|
|
|
|
it.idx++
|
|
|
|
if it.idx >= it.nsamples {
|
|
|
|
return chunkenc.ValNone
|
|
|
|
}
|
|
|
|
return chunkenc.ValFloat
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) Seek(t int64) chunkenc.ValueType {
|
|
|
|
it.idx = t / it.step
|
|
|
|
if it.idx >= it.nsamples {
|
|
|
|
return chunkenc.ValNone
|
|
|
|
}
|
|
|
|
return chunkenc.ValFloat
|
|
|
|
}
|
|
|
|
|
|
|
|
func (it *fakeSeriesIterator) Err() error { return nil }
|