2022-09-20 17:05:50 +00:00
|
|
|
// Copyright 2021 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 tsdb
|
|
|
|
|
|
|
|
|
|
import (
|
|
|
|
|
"fmt"
|
Use a linked list for memSeries.headChunk (#11818)
Currently memSeries holds a single head chunk in-memory and a slice of mmapped chunks.
When append() is called on memSeries it might decide that a new headChunk is needed to use for given append() call.
If that happens it will first mmap existing head chunk and only after that happens it will create a new empty headChunk and continue appending
our sample to it.
Since appending samples uses write lock on memSeries no other read or write can happen until any append is completed.
When we have an append() that must create a new head chunk the whole memSeries is blocked until mmapping of existing head chunk finishes.
Mmapping itself uses a lock as it needs to be serialised, which means that the more chunks to mmap we have the longer each chunk might wait
for it to be mmapped.
If there's enough chunks that require mmapping some memSeries will be locked for long enough that it will start affecting
queries and scrapes.
Queries might timeout, since by default they have a 2 minute timeout set.
Scrapes will be blocked inside append() call, which means there will be a gap between samples. This will first affect range queries
or calls using rate() and such, since the time range requested in the query might have too few samples to calculate anything.
To avoid this we need to remove mmapping from append path, since mmapping is blocking.
But this means that when we cut a new head chunk we need to keep the old one around, so we can mmap it later.
This change makes memSeries.headChunk a linked list, memSeries.headChunk still points to the 'open' head chunk that receives new samples,
while older, yet to be mmapped, chunks are linked to it.
Mmapping is done on a schedule by iterating all memSeries one by one. Thanks to this we control when mmapping is done, since we trigger
it manually, which reduces the risk that it will have to compete for mmap locks with other chunks.
Signed-off-by: Łukasz Mierzwa <l.mierzwa@gmail.com>
2023-07-31 09:10:24 +00:00
|
|
|
"sync"
|
2022-09-20 17:05:50 +00:00
|
|
|
"testing"
|
|
|
|
|
|
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
|
|
Use a linked list for memSeries.headChunk (#11818)
Currently memSeries holds a single head chunk in-memory and a slice of mmapped chunks.
When append() is called on memSeries it might decide that a new headChunk is needed to use for given append() call.
If that happens it will first mmap existing head chunk and only after that happens it will create a new empty headChunk and continue appending
our sample to it.
Since appending samples uses write lock on memSeries no other read or write can happen until any append is completed.
When we have an append() that must create a new head chunk the whole memSeries is blocked until mmapping of existing head chunk finishes.
Mmapping itself uses a lock as it needs to be serialised, which means that the more chunks to mmap we have the longer each chunk might wait
for it to be mmapped.
If there's enough chunks that require mmapping some memSeries will be locked for long enough that it will start affecting
queries and scrapes.
Queries might timeout, since by default they have a 2 minute timeout set.
Scrapes will be blocked inside append() call, which means there will be a gap between samples. This will first affect range queries
or calls using rate() and such, since the time range requested in the query might have too few samples to calculate anything.
To avoid this we need to remove mmapping from append path, since mmapping is blocking.
But this means that when we cut a new head chunk we need to keep the old one around, so we can mmap it later.
This change makes memSeries.headChunk a linked list, memSeries.headChunk still points to the 'open' head chunk that receives new samples,
while older, yet to be mmapped, chunks are linked to it.
Mmapping is done on a schedule by iterating all memSeries one by one. Thanks to this we control when mmapping is done, since we trigger
it manually, which reduces the risk that it will have to compete for mmap locks with other chunks.
Signed-off-by: Łukasz Mierzwa <l.mierzwa@gmail.com>
2023-07-31 09:10:24 +00:00
|
|
|
"github.com/prometheus/prometheus/model/labels"
|
2022-09-20 17:05:50 +00:00
|
|
|
"github.com/prometheus/prometheus/tsdb/chunkenc"
|
Use a linked list for memSeries.headChunk (#11818)
Currently memSeries holds a single head chunk in-memory and a slice of mmapped chunks.
When append() is called on memSeries it might decide that a new headChunk is needed to use for given append() call.
If that happens it will first mmap existing head chunk and only after that happens it will create a new empty headChunk and continue appending
our sample to it.
Since appending samples uses write lock on memSeries no other read or write can happen until any append is completed.
When we have an append() that must create a new head chunk the whole memSeries is blocked until mmapping of existing head chunk finishes.
Mmapping itself uses a lock as it needs to be serialised, which means that the more chunks to mmap we have the longer each chunk might wait
for it to be mmapped.
If there's enough chunks that require mmapping some memSeries will be locked for long enough that it will start affecting
queries and scrapes.
Queries might timeout, since by default they have a 2 minute timeout set.
Scrapes will be blocked inside append() call, which means there will be a gap between samples. This will first affect range queries
or calls using rate() and such, since the time range requested in the query might have too few samples to calculate anything.
To avoid this we need to remove mmapping from append path, since mmapping is blocking.
But this means that when we cut a new head chunk we need to keep the old one around, so we can mmap it later.
This change makes memSeries.headChunk a linked list, memSeries.headChunk still points to the 'open' head chunk that receives new samples,
while older, yet to be mmapped, chunks are linked to it.
Mmapping is done on a schedule by iterating all memSeries one by one. Thanks to this we control when mmapping is done, since we trigger
it manually, which reduces the risk that it will have to compete for mmap locks with other chunks.
Signed-off-by: Łukasz Mierzwa <l.mierzwa@gmail.com>
2023-07-31 09:10:24 +00:00
|
|
|
"github.com/prometheus/prometheus/tsdb/chunks"
|
2022-09-20 17:05:50 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
|
|
func TestBoundedChunk(t *testing.T) {
|
|
|
|
|
tests := []struct {
|
|
|
|
|
name string
|
|
|
|
|
inputChunk chunkenc.Chunk
|
|
|
|
|
inputMinT int64
|
|
|
|
|
inputMaxT int64
|
|
|
|
|
initialSeek int64
|
|
|
|
|
seekIsASuccess bool
|
|
|
|
|
expSamples []sample
|
|
|
|
|
}{
|
|
|
|
|
{
|
|
|
|
|
name: "if there are no samples it returns nothing",
|
|
|
|
|
inputChunk: newTestChunk(0),
|
|
|
|
|
expSamples: nil,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "bounds represent a single sample",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{0, 0, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if there are bounds set only samples within them are returned",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 1,
|
|
|
|
|
inputMaxT: 8,
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{1, 1, nil, nil},
|
|
|
|
|
{2, 2, nil, nil},
|
|
|
|
|
{3, 3, nil, nil},
|
|
|
|
|
{4, 4, nil, nil},
|
|
|
|
|
{5, 5, nil, nil},
|
|
|
|
|
{6, 6, nil, nil},
|
|
|
|
|
{7, 7, nil, nil},
|
|
|
|
|
{8, 8, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if bounds set and only maxt is less than actual maxt",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 0,
|
|
|
|
|
inputMaxT: 5,
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{0, 0, nil, nil},
|
|
|
|
|
{1, 1, nil, nil},
|
|
|
|
|
{2, 2, nil, nil},
|
|
|
|
|
{3, 3, nil, nil},
|
|
|
|
|
{4, 4, nil, nil},
|
|
|
|
|
{5, 5, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if bounds set and only mint is more than actual mint",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 5,
|
|
|
|
|
inputMaxT: 9,
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{5, 5, nil, nil},
|
|
|
|
|
{6, 6, nil, nil},
|
|
|
|
|
{7, 7, nil, nil},
|
|
|
|
|
{8, 8, nil, nil},
|
|
|
|
|
{9, 9, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if there are bounds set with seek before mint",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 3,
|
|
|
|
|
inputMaxT: 7,
|
|
|
|
|
initialSeek: 1,
|
|
|
|
|
seekIsASuccess: true,
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{3, 3, nil, nil},
|
|
|
|
|
{4, 4, nil, nil},
|
|
|
|
|
{5, 5, nil, nil},
|
|
|
|
|
{6, 6, nil, nil},
|
|
|
|
|
{7, 7, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if there are bounds set with seek between mint and maxt",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 3,
|
|
|
|
|
inputMaxT: 7,
|
|
|
|
|
initialSeek: 5,
|
|
|
|
|
seekIsASuccess: true,
|
|
|
|
|
expSamples: []sample{
|
2022-10-11 16:35:35 +00:00
|
|
|
{5, 5, nil, nil},
|
|
|
|
|
{6, 6, nil, nil},
|
|
|
|
|
{7, 7, nil, nil},
|
2022-09-20 17:05:50 +00:00
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "if there are bounds set with seek after maxt",
|
|
|
|
|
inputChunk: newTestChunk(10),
|
|
|
|
|
inputMinT: 3,
|
|
|
|
|
inputMaxT: 7,
|
|
|
|
|
initialSeek: 8,
|
|
|
|
|
seekIsASuccess: false,
|
|
|
|
|
},
|
|
|
|
|
}
|
|
|
|
|
for _, tc := range tests {
|
|
|
|
|
t.Run(fmt.Sprintf("name=%s", tc.name), func(t *testing.T) {
|
|
|
|
|
chunk := boundedChunk{tc.inputChunk, tc.inputMinT, tc.inputMaxT}
|
|
|
|
|
|
|
|
|
|
// Testing Bytes()
|
|
|
|
|
expChunk := chunkenc.NewXORChunk()
|
|
|
|
|
if tc.inputChunk.NumSamples() > 0 {
|
|
|
|
|
app, err := expChunk.Appender()
|
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
for ts := tc.inputMinT; ts <= tc.inputMaxT; ts++ {
|
|
|
|
|
app.Append(ts, float64(ts))
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
require.Equal(t, expChunk.Bytes(), chunk.Bytes())
|
|
|
|
|
|
|
|
|
|
var samples []sample
|
|
|
|
|
it := chunk.Iterator(nil)
|
|
|
|
|
|
|
|
|
|
if tc.initialSeek != 0 {
|
|
|
|
|
// Testing Seek()
|
2022-10-11 16:35:35 +00:00
|
|
|
val := it.Seek(tc.initialSeek)
|
|
|
|
|
require.Equal(t, tc.seekIsASuccess, val == chunkenc.ValFloat)
|
|
|
|
|
if val == chunkenc.ValFloat {
|
2022-09-20 17:05:50 +00:00
|
|
|
t, v := it.At()
|
2022-10-11 16:35:35 +00:00
|
|
|
samples = append(samples, sample{t, v, nil, nil})
|
2022-09-20 17:05:50 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Testing Next()
|
2022-10-11 16:35:35 +00:00
|
|
|
for it.Next() == chunkenc.ValFloat {
|
2022-09-20 17:05:50 +00:00
|
|
|
t, v := it.At()
|
2022-10-11 16:35:35 +00:00
|
|
|
samples = append(samples, sample{t, v, nil, nil})
|
2022-09-20 17:05:50 +00:00
|
|
|
}
|
|
|
|
|
|
2022-10-11 16:35:35 +00:00
|
|
|
// it.Next() should keep returning no value.
|
2022-09-20 17:05:50 +00:00
|
|
|
for i := 0; i < 10; i++ {
|
2022-10-11 16:35:35 +00:00
|
|
|
require.True(t, it.Next() == chunkenc.ValNone)
|
2022-09-20 17:05:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
require.Equal(t, tc.expSamples, samples)
|
|
|
|
|
})
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func newTestChunk(numSamples int) chunkenc.Chunk {
|
|
|
|
|
xor := chunkenc.NewXORChunk()
|
|
|
|
|
a, _ := xor.Appender()
|
|
|
|
|
for i := 0; i < numSamples; i++ {
|
|
|
|
|
a.Append(int64(i), float64(i))
|
|
|
|
|
}
|
|
|
|
|
return xor
|
|
|
|
|
}
|
Use a linked list for memSeries.headChunk (#11818)
Currently memSeries holds a single head chunk in-memory and a slice of mmapped chunks.
When append() is called on memSeries it might decide that a new headChunk is needed to use for given append() call.
If that happens it will first mmap existing head chunk and only after that happens it will create a new empty headChunk and continue appending
our sample to it.
Since appending samples uses write lock on memSeries no other read or write can happen until any append is completed.
When we have an append() that must create a new head chunk the whole memSeries is blocked until mmapping of existing head chunk finishes.
Mmapping itself uses a lock as it needs to be serialised, which means that the more chunks to mmap we have the longer each chunk might wait
for it to be mmapped.
If there's enough chunks that require mmapping some memSeries will be locked for long enough that it will start affecting
queries and scrapes.
Queries might timeout, since by default they have a 2 minute timeout set.
Scrapes will be blocked inside append() call, which means there will be a gap between samples. This will first affect range queries
or calls using rate() and such, since the time range requested in the query might have too few samples to calculate anything.
To avoid this we need to remove mmapping from append path, since mmapping is blocking.
But this means that when we cut a new head chunk we need to keep the old one around, so we can mmap it later.
This change makes memSeries.headChunk a linked list, memSeries.headChunk still points to the 'open' head chunk that receives new samples,
while older, yet to be mmapped, chunks are linked to it.
Mmapping is done on a schedule by iterating all memSeries one by one. Thanks to this we control when mmapping is done, since we trigger
it manually, which reduces the risk that it will have to compete for mmap locks with other chunks.
Signed-off-by: Łukasz Mierzwa <l.mierzwa@gmail.com>
2023-07-31 09:10:24 +00:00
|
|
|
|
|
|
|
|
// TestMemSeries_chunk runs a series of tests on memSeries.chunk() calls.
|
|
|
|
|
// It will simulate various conditions to ensure all code paths in that function are covered.
|
|
|
|
|
func TestMemSeries_chunk(t *testing.T) {
|
|
|
|
|
const chunkRange int64 = 100
|
|
|
|
|
const chunkStep int64 = 5
|
|
|
|
|
|
|
|
|
|
appendSamples := func(t *testing.T, s *memSeries, start, end int64, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
for i := start; i < end; i += chunkStep {
|
|
|
|
|
ok, _ := s.append(i, float64(i), 0, chunkOpts{
|
|
|
|
|
chunkDiskMapper: cdm,
|
|
|
|
|
chunkRange: chunkRange,
|
|
|
|
|
samplesPerChunk: DefaultSamplesPerChunk,
|
|
|
|
|
})
|
|
|
|
|
require.True(t, ok, "sample append failed")
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
type setupFn func(*testing.T, *memSeries, *chunks.ChunkDiskMapper)
|
|
|
|
|
|
|
|
|
|
type callOutput uint8
|
|
|
|
|
const (
|
|
|
|
|
outOpenHeadChunk callOutput = iota // memSeries.chunk() call returned memSeries.headChunks with headChunk=true & isOpen=true
|
|
|
|
|
outClosedHeadChunk // memSeries.chunk() call returned memSeries.headChunks with headChunk=true & isOpen=false
|
|
|
|
|
outMmappedChunk // memSeries.chunk() call returned a chunk from memSeries.mmappedChunks with headChunk=false
|
|
|
|
|
outErr // memSeries.chunk() call returned an error
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
tests := []struct {
|
|
|
|
|
name string
|
|
|
|
|
setup setupFn // optional function called just before the test memSeries.chunk() call
|
|
|
|
|
inputID chunks.HeadChunkID // requested chunk id for memSeries.chunk() call
|
|
|
|
|
expected callOutput
|
|
|
|
|
}{
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on empty memSeries",
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=1 on empty memSeries",
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "firstChunkID > ix",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, chunkRange-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
s.firstChunkID = 5
|
|
|
|
|
},
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on memSeries with no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, chunkRange-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outOpenHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=1 on memSeries with no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, chunkRange-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=10 on memSeries with no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, chunkRange-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 10,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on memSeries with 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=1 on memSeries with 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=3 on memSeries with 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 3,
|
|
|
|
|
expected: outOpenHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on memSeries with 3 mmapped chunks and no headChunk",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
s.headChunks = nil
|
|
|
|
|
},
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=2 on memSeries with 3 mmapped chunks and no headChunk",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
s.headChunks = nil
|
|
|
|
|
},
|
|
|
|
|
inputID: 2,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=3 on memSeries with 3 mmapped chunks and no headChunk",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
s.headChunks = nil
|
|
|
|
|
},
|
|
|
|
|
inputID: 3,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=1 on memSeries with 3 mmapped chunks and closed ChunkDiskMapper",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
cdm.Close()
|
|
|
|
|
},
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=3 on memSeries with 3 mmapped chunks and closed ChunkDiskMapper",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*4)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
cdm.Close()
|
|
|
|
|
},
|
|
|
|
|
inputID: 3,
|
|
|
|
|
expected: outOpenHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on memSeries with 3 head chunks and no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*3, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*3)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outClosedHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=1 on memSeries with 3 head chunks and no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*3, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*3)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 1,
|
|
|
|
|
expected: outClosedHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=10 on memSeries with 3 head chunks and no mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*3, cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 0, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Equal(t, int64(0), s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*3)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 10,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=0 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 0,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=2 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 2,
|
|
|
|
|
expected: outMmappedChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=3 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 3,
|
|
|
|
|
expected: outClosedHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=5 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 5,
|
|
|
|
|
expected: outOpenHeadChunk,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=6 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 6,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
|
|
|
|
|
{
|
|
|
|
|
name: "call ix=10 on memSeries with 3 head chunks and 3 mmapped chunks",
|
|
|
|
|
setup: func(t *testing.T, s *memSeries, cdm *chunks.ChunkDiskMapper) {
|
|
|
|
|
appendSamples(t, s, 0, chunkRange*4, cdm)
|
|
|
|
|
s.mmapChunks(cdm)
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 1, "wrong number of headChunks")
|
|
|
|
|
|
|
|
|
|
appendSamples(t, s, chunkRange*4, chunkRange*6, cdm)
|
|
|
|
|
require.Equal(t, s.headChunks.len(), 3, "wrong number of headChunks")
|
|
|
|
|
require.Len(t, s.mmappedChunks, 3, "wrong number of mmappedChunks")
|
|
|
|
|
require.Equal(t, chunkRange*3, s.headChunks.oldest().minTime, "wrong minTime on last headChunks element")
|
|
|
|
|
require.Equal(t, (chunkRange*6)-chunkStep, s.headChunks.maxTime, "wrong maxTime on first headChunks element")
|
|
|
|
|
},
|
|
|
|
|
inputID: 10,
|
|
|
|
|
expected: outErr,
|
|
|
|
|
},
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
memChunkPool := &sync.Pool{
|
|
|
|
|
New: func() interface{} {
|
|
|
|
|
return &memChunk{}
|
|
|
|
|
},
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for _, tc := range tests {
|
|
|
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
|
|
|
dir := t.TempDir()
|
|
|
|
|
chunkDiskMapper, err := chunks.NewChunkDiskMapper(nil, dir, chunkenc.NewPool(), chunks.DefaultWriteBufferSize, chunks.DefaultWriteQueueSize)
|
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
defer func() {
|
|
|
|
|
require.NoError(t, chunkDiskMapper.Close())
|
|
|
|
|
}()
|
|
|
|
|
|
|
|
|
|
series := newMemSeries(labels.EmptyLabels(), 1, true)
|
|
|
|
|
|
|
|
|
|
if tc.setup != nil {
|
|
|
|
|
tc.setup(t, series, chunkDiskMapper)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
chk, headChunk, isOpen, err := series.chunk(tc.inputID, chunkDiskMapper, memChunkPool)
|
|
|
|
|
switch tc.expected {
|
|
|
|
|
case outOpenHeadChunk:
|
|
|
|
|
require.NoError(t, err, "unexpected error")
|
|
|
|
|
require.True(t, headChunk, "expected a chunk with headChunk=true but got headChunk=%v", headChunk)
|
|
|
|
|
require.True(t, isOpen, "expected a chunk with isOpen=true but got isOpen=%v", isOpen)
|
|
|
|
|
case outClosedHeadChunk:
|
|
|
|
|
require.NoError(t, err, "unexpected error")
|
|
|
|
|
require.True(t, headChunk, "expected a chunk with headChunk=true but got headChunk=%v", headChunk)
|
|
|
|
|
require.False(t, isOpen, "expected a chunk with isOpen=false but got isOpen=%v", isOpen)
|
|
|
|
|
case outMmappedChunk:
|
|
|
|
|
require.NoError(t, err, "unexpected error")
|
|
|
|
|
require.False(t, headChunk, "expected a chunk with headChunk=false but got gc=%v", headChunk)
|
|
|
|
|
case outErr:
|
|
|
|
|
require.Nil(t, chk, "got a non-nil chunk reference returned with an error")
|
|
|
|
|
require.Error(t, err)
|
|
|
|
|
}
|
|
|
|
|
})
|
|
|
|
|
}
|
|
|
|
|
}
|
