prometheus/head.go

134 lines
2.9 KiB
Go
Raw Normal View History

2016-12-04 12:16:11 +00:00
package tsdb
import (
"math"
"sort"
2016-12-04 12:16:11 +00:00
"sync"
"github.com/fabxc/tsdb/chunks"
)
// HeadBlock handles reads and writes of time series data within a time window.
type HeadBlock struct {
mtx sync.RWMutex
descs map[uint64][]*chunkDesc // labels hash to possible chunks descs
index *memIndex
stats BlockStats
2016-12-04 12:16:11 +00:00
}
2016-12-09 12:41:38 +00:00
// NewHeadBlock creates a new empty head block.
func NewHeadBlock(baseTime int64) *HeadBlock {
b := &HeadBlock{
descs: make(map[uint64][]*chunkDesc, 2048),
index: newMemIndex(),
}
b.stats.MinTime = baseTime
return b
}
// Querier returns a new querier over the head block.
func (h *HeadBlock) Querier(mint, maxt int64) Querier {
return newBlockQuerier(h, h, mint, maxt)
}
// Chunk returns the chunk for the reference number.
func (h *HeadBlock) Chunk(ref uint32) (chunks.Chunk, error) {
c, ok := h.index.forward[ref]
if !ok {
return nil, errNotFound
}
return c.chunk, nil
}
func (h *HeadBlock) interval() (int64, int64) {
return h.stats.MinTime, h.stats.MaxTime
}
// Stats returns statisitics about the indexed data.
func (h *HeadBlock) Stats() (BlockStats, error) {
return h.stats, nil
}
// LabelValues returns the possible label values
func (h *HeadBlock) LabelValues(names ...string) (StringTuples, error) {
if len(names) != 1 {
return nil, errInvalidSize
}
var sl []string
for s := range h.index.values[names[0]] {
sl = append(sl, s)
}
sort.Strings(sl)
t := &stringTuples{
l: len(names),
s: sl,
}
return t, nil
}
// Postings returns the postings list iterator for the label pair.
2016-12-14 20:58:29 +00:00
func (h *HeadBlock) Postings(name, value string) (Postings, error) {
return h.index.Postings(term{name, value}), nil
}
// Series returns the series for the given reference.
func (h *HeadBlock) Series(ref uint32) (Series, error) {
cd, ok := h.index.forward[ref]
if !ok {
return nil, errNotFound
}
s := &series{
labels: cd.lset,
offsets: []ChunkOffset{
{Value: h.stats.MinTime, Offset: 0},
},
chunk: func(ref uint32) (chunks.Chunk, error) {
return cd.chunk, nil
},
}
return s, nil
}
2016-12-04 12:16:11 +00:00
// get retrieves the chunk with the hash and label set and creates
// a new one if it doesn't exist yet.
2016-12-09 09:00:14 +00:00
func (h *HeadBlock) get(hash uint64, lset Labels) *chunkDesc {
2016-12-04 12:16:11 +00:00
cds := h.descs[hash]
for _, cd := range cds {
if cd.lset.Equals(lset) {
2016-12-09 09:00:14 +00:00
return cd
2016-12-04 12:16:11 +00:00
}
}
// None of the given chunks was for the series, create a new one.
cd := &chunkDesc{
lset: lset,
chunk: chunks.NewXORChunk(int(math.MaxInt64)),
}
h.index.add(cd)
2016-12-04 12:16:11 +00:00
// For the head block there's exactly one chunk per series.
h.stats.ChunkCount++
h.stats.SeriesCount++
2016-12-04 12:16:11 +00:00
h.descs[hash] = append(cds, cd)
2016-12-09 09:00:14 +00:00
return cd
2016-12-04 12:16:11 +00:00
}
2016-12-09 09:00:14 +00:00
// append adds the sample to the headblock.
func (h *HeadBlock) append(hash uint64, lset Labels, ts int64, v float64) error {
if err := h.get(hash, lset).append(ts, v); err != nil {
return err
}
h.stats.SampleCount++
if ts > h.stats.MaxTime {
h.stats.MaxTime = ts
2016-12-09 09:00:14 +00:00
}
return nil
}