224 lines
7.5 KiB
Go
224 lines
7.5 KiB
Go
package tsdb
|
|
|
|
// import (
|
|
// "errors"
|
|
// "fmt"
|
|
// "time"
|
|
|
|
// "github.com/prometheus/common/model"
|
|
// "github.com/prometheus/prometheus/storage/local"
|
|
// "github.com/prometheus/prometheus/storage/metric"
|
|
// "golang.org/x/net/context"
|
|
// )
|
|
|
|
// type DefaultSeriesIterator struct {
|
|
// s Series
|
|
// it SeriesIterator
|
|
// }
|
|
|
|
// func (it *DefaultSeriesIterator) ValueAtOrBeforeTime(ts model.Time) model.SamplePair {
|
|
// ok := it.it.Seek(int64(ts))
|
|
// if !ok {
|
|
// return model.SamplePair{Timestamp: model.Earliest}
|
|
// }
|
|
// t, v := it.it.Values()
|
|
// return model.SamplePair{Timestamp: model.Time(t), Value: model.SampleValue(v)}
|
|
// }
|
|
|
|
// func (it *DefaultSeriesIterator) Metric() metric.Metric {
|
|
// ls := it.s.Labels()
|
|
// met := make(model.Metric, len(ls))
|
|
// for _, l := range ls {
|
|
// met[model.LabelName(l.Name)] = model.LabelValue(l.Value)
|
|
// }
|
|
// return metric.Metric{Metric: met, Copied: true}
|
|
// }
|
|
|
|
// func (it *DefaultSeriesIterator) RangeValues(interval metric.Interval) []model.SamplePair {
|
|
// var res []model.SamplePair
|
|
|
|
// for ok := it.it.Seek(int64(interval.NewestInclusive)); ok; ok = it.it.Next() {
|
|
// t, v := it.it.Values()
|
|
// if model.Time(t) > interval.OldestInclusive {
|
|
// break
|
|
// }
|
|
// res = append(res, model.SamplePair{Timestamp: model.Time(t), Value: model.SampleValue(v)})
|
|
// }
|
|
// return res
|
|
// }
|
|
|
|
// func (it *DefaultSeriesIterator) Close() {
|
|
// }
|
|
|
|
// // DefaultAdapter wraps a tsdb storage to implement the default
|
|
// // storage interface.
|
|
// type DefaultAdapter struct {
|
|
// db *DB
|
|
// }
|
|
|
|
// func NewDefaultAdapter(db *DB) *DefaultAdapter {
|
|
// return &DefaultAdapter{db: db}
|
|
// }
|
|
|
|
// // Drop all time series associated with the given label matchers. Returns
|
|
// // the number series that were dropped.
|
|
// func (da *DefaultAdapter) DropMetricsForLabelMatchers(context.Context, ...*metric.LabelMatcher) (int, error) {
|
|
// return 0, fmt.Errorf("not implemented")
|
|
// }
|
|
|
|
// // Start the various maintenance loops in goroutines. Returns when the
|
|
// // storage is ready to use. Keeps everything running in the background
|
|
// // until Stop is called.
|
|
// func (da *DefaultAdapter) Start() error {
|
|
// return nil
|
|
// }
|
|
|
|
// // Stop shuts down the Storage gracefully, flushes all pending
|
|
// // operations, stops all maintenance loops,and frees all resources.
|
|
// func (da *DefaultAdapter) Stop() error {
|
|
// return da.db.Close()
|
|
// }
|
|
|
|
// // WaitForIndexing returns once all samples in the storage are
|
|
// // indexed. Indexing is needed for FingerprintsForLabelMatchers and
|
|
// // LabelValuesForLabelName and may lag behind.
|
|
// func (da *DefaultAdapter) WaitForIndexing() {
|
|
// }
|
|
|
|
// func (da *DefaultAdapter) Append(s *model.Sample) error {
|
|
// labels := make([]Label, len(s.Metric))
|
|
// for k, v := range s.Metric {
|
|
// labels = append(labels, Label{Name: string(k), Value: string(v)})
|
|
// }
|
|
// // Ignore the Scrape batching for now.
|
|
// return da.db.appendSingle(labels, int64(s.Timestamp), float64(s.Value))
|
|
// }
|
|
|
|
// func (da *DefaultAdapter) NeedsThrottling() bool {
|
|
// return false
|
|
// }
|
|
|
|
// func (da *DefaultAdapter) Querier() (local.Querier, error) {
|
|
// // q, err := da.db.Querier()
|
|
// // if err != nil {
|
|
// // return nil, err
|
|
// // }
|
|
|
|
// return defaultQuerierAdapter{q: q}, nil
|
|
// }
|
|
|
|
// type defaultQuerierAdapter struct {
|
|
// q Querier
|
|
// }
|
|
|
|
// func (da defaultQuerierAdapter) Close() error {
|
|
// return da.q.Close()
|
|
// }
|
|
|
|
// // QueryRange returns a list of series iterators for the selected
|
|
// // time range and label matchers. The iterators need to be closed
|
|
// // after usage.
|
|
// func (da defaultQuerierAdapter) QueryRange(ctx context.Context, from, through model.Time, matchers ...*metric.LabelMatcher) ([]local.SeriesIterator, error) {
|
|
// it, err := labelMatchersIter(da.q, matchers...)
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// its, err := da.q.Series(it)
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// var defaultIts []local.SeriesIterator
|
|
// for _, it := range its {
|
|
// defaultIts = append(defaultIts, &DefaultSeriesIterator{it: it})
|
|
// }
|
|
// return defaultIts, nil
|
|
// }
|
|
|
|
// // QueryInstant returns a list of series iterators for the selected
|
|
// // instant and label matchers. The iterators need to be closed after usage.
|
|
// func (da defaultQuerierAdapter) QueryInstant(ctx context.Context, ts model.Time, stalenessDelta time.Duration, matchers ...*metric.LabelMatcher) ([]local.SeriesIterator, error) {
|
|
// return da.QueryRange(ctx, ts.Add(-stalenessDelta), ts, matchers...)
|
|
// }
|
|
|
|
// // MetricsForLabelMatchers returns the metrics from storage that satisfy
|
|
// // the given sets of label matchers. Each set of matchers must contain at
|
|
// // least one label matcher that does not match the empty string. Otherwise,
|
|
// // an empty list is returned. Within one set of matchers, the intersection
|
|
// // of matching series is computed. The final return value will be the union
|
|
// // of the per-set results. The times from and through are hints for the
|
|
// // storage to optimize the search. The storage MAY exclude metrics that
|
|
// // have no samples in the specified interval from the returned map. In
|
|
// // doubt, specify model.Earliest for from and model.Latest for through.
|
|
// func (da defaultQuerierAdapter) MetricsForLabelMatchers(ctx context.Context, from, through model.Time, matcherSets ...metric.LabelMatchers) ([]metric.Metric, error) {
|
|
// var mits []index.Iterator
|
|
// for _, ms := range matcherSets {
|
|
// it, err := labelMatchersIter(da.q, ms...)
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// mits = append(mits, it)
|
|
// }
|
|
|
|
// res, err := da.q.Metrics(index.Merge(mits...))
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// var mres []metric.Metric
|
|
// for _, m := range res {
|
|
// met := make(model.Metric, len(m))
|
|
// for k, v := range m {
|
|
// met[model.LabelName(k)] = model.LabelValue(v)
|
|
// }
|
|
// mres = append(mres, metric.Metric{Metric: met, Copied: true})
|
|
// }
|
|
// return mres, nil
|
|
// }
|
|
|
|
// func labelMatchersIter(q *Querier, ms ...*metric.LabelMatcher) (index.Iterator, error) {
|
|
// var its []index.Iterator
|
|
// for _, m := range ms {
|
|
// var matcher index.Matcher
|
|
// switch m.Type {
|
|
// case metric.Equal:
|
|
// matcher = index.NewEqualMatcher(string(m.Value))
|
|
// case metric.RegexMatch:
|
|
// var err error
|
|
// matcher, err = index.NewRegexpMatcher(string(m.Value))
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// default:
|
|
// return nil, fmt.Errorf("matcher type %q not supported", m.Type)
|
|
// }
|
|
// it, err := q.Iterator(string(m.Name), matcher)
|
|
// if err != nil {
|
|
// return nil, err
|
|
// }
|
|
// its = append(its, it)
|
|
// }
|
|
// if len(its) == 0 {
|
|
// return nil, errors.New("not found")
|
|
// }
|
|
// return index.Intersect(its...), nil
|
|
// }
|
|
|
|
// // LastSampleForFingerprint returns the last sample that has been
|
|
// // ingested for the given sets of label matchers. If this instance of the
|
|
// // Storage has never ingested a sample for the provided fingerprint (or
|
|
// // the last ingestion is so long ago that the series has been archived),
|
|
// // ZeroSample is returned. The label matching behavior is the same as in
|
|
// // MetricsForLabelMatchers.
|
|
// func (da defaultQuerierAdapter) LastSampleForLabelMatchers(ctx context.Context, cutoff model.Time, matcherSets ...metric.LabelMatchers) (model.Vector, error) {
|
|
// return nil, fmt.Errorf("not implemented")
|
|
// }
|
|
|
|
// // Get all of the label values that are associated with a given label name.
|
|
// func (da defaultQuerierAdapter) LabelValuesForLabelName(ctx context.Context, ln model.LabelName) (model.LabelValues, error) {
|
|
// res := da.q.iq.Terms(string(ln), nil)
|
|
// resv := model.LabelValues{}
|
|
// for _, lv := range res {
|
|
// resv = append(resv, model.LabelValue(lv))
|
|
// }
|
|
// return resv, nil
|
|
// }
|