prometheus/head.go

224 lines
5.0 KiB
Go
Raw Normal View History

2016-12-04 12:16:11 +00:00
package tsdb
import (
"math"
2016-12-19 21:37:03 +00:00
"os"
"sort"
2016-12-04 12:16:11 +00:00
"sync"
"github.com/fabxc/tsdb/chunks"
2016-12-21 08:39:01 +00:00
"github.com/fabxc/tsdb/labels"
2016-12-04 12:16:11 +00:00
)
// HeadBlock handles reads and writes of time series data within a time window.
type HeadBlock struct {
2016-12-22 00:12:28 +00:00
mtx sync.RWMutex
// descs holds all chunk descs for the head block. Each chunk implicitly
// is assigned the index as its ID.
descs []*chunkDesc
// hashes contains a collision map of label set hashes of chunks
// to their position in the chunk desc slice.
hashes map[uint64][]int
symbols []string // all seen strings
values map[string]stringset // label names to possible values
postings *memPostings // postings lists for terms
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{
2016-12-22 00:12:28 +00:00
descs: []*chunkDesc{},
hashes: map[uint64][]int{},
values: map[string]stringset{},
postings: &memPostings{m: make(map[term][]uint32)},
}
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) {
2016-12-22 00:12:28 +00:00
if int(ref) >= len(h.descs) {
return nil, errNotFound
}
2016-12-22 00:12:28 +00:00
return h.descs[int(ref)].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
2016-12-22 00:12:28 +00:00
for s := range h.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) {
2016-12-22 00:12:28 +00:00
return h.postings.get(term{name: name, value: value}), nil
}
// Series returns the series for the given reference.
func (h *HeadBlock) Series(ref uint32, mint, maxt int64) (Series, error) {
2016-12-22 00:12:28 +00:00
if int(ref) >= len(h.descs) {
return nil, errNotFound
}
2016-12-22 00:12:28 +00:00
cd := h.descs[ref]
if !intervalOverlap(cd.firsTimestamp, cd.lastTimestamp, mint, maxt) {
return nil, nil
}
s := &chunkSeries{
labels: cd.lset,
chunks: []ChunkMeta{
{MinTime: h.stats.MinTime, Ref: 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-21 08:39:01 +00:00
func (h *HeadBlock) get(hash uint64, lset labels.Labels) *chunkDesc {
2016-12-22 00:12:28 +00:00
refs := h.hashes[hash]
for _, ref := range refs {
if cd := h.descs[ref]; 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)),
}
2016-12-22 00:12:28 +00:00
// Index the new chunk.
ref := len(h.descs)
h.descs = append(h.descs, cd)
h.hashes[hash] = append(refs, ref)
// Add each label pair as a term to the inverted index.
terms := make([]term, 0, len(lset))
for _, l := range lset {
terms = append(terms, term{name: l.Name, value: l.Value})
valset, ok := h.values[l.Name]
if !ok {
valset = stringset{}
h.values[l.Name] = valset
}
valset.set(l.Value)
}
h.postings.add(uint32(ref), terms...)
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-09 09:00:14 +00:00
return cd
2016-12-04 12:16:11 +00:00
}
2016-12-22 00:12:28 +00:00
func (h *HeadBlock) appendBatch(samples []hashedSample) error {
var merr MultiError
for _, s := range samples {
merr.Add(h.append(s.hash, s.labels, s.t, s.v))
}
return merr.Err()
}
2016-12-09 09:00:14 +00:00
// append adds the sample to the headblock.
2016-12-21 08:39:01 +00:00
func (h *HeadBlock) append(hash uint64, lset labels.Labels, ts int64, v float64) error {
2016-12-09 09:00:14 +00:00
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
}
2016-12-19 21:37:03 +00:00
func (h *HeadBlock) persist(p string) (int64, error) {
sf, err := os.Create(chunksFileName(p))
if err != nil {
return 0, err
}
xf, err := os.Create(indexFileName(p))
if err != nil {
return 0, err
}
iw := newIndexWriter(xf)
sw := newSeriesWriter(sf, iw, h.stats.MinTime)
defer sw.Close()
defer iw.Close()
2016-12-22 00:12:28 +00:00
for ref, cd := range h.descs {
if err := sw.WriteSeries(uint32(ref), cd.lset, []*chunkDesc{cd}); err != nil {
2016-12-19 21:37:03 +00:00
return 0, err
}
}
if err := iw.WriteStats(h.stats); err != nil {
2016-12-19 21:37:03 +00:00
return 0, err
}
2016-12-22 00:12:28 +00:00
for n, v := range h.values {
s := make([]string, 0, len(v))
for x := range v {
s = append(s, x)
}
if err := iw.WriteLabelIndex([]string{n}, s); err != nil {
2016-12-19 21:37:03 +00:00
return 0, err
}
}
2016-12-22 00:12:28 +00:00
for t := range h.postings.m {
if err := iw.WritePostings(t.name, t.value, h.postings.get(t)); err != nil {
2016-12-19 21:37:03 +00:00
return 0, err
}
}
2016-12-19 21:37:03 +00:00
return iw.Size() + sw.Size(), nil
}