mirror of
https://github.com/prometheus/prometheus.git
synced 2024-12-28 15:09:39 -08:00
165 lines
4.5 KiB
Go
165 lines
4.5 KiB
Go
// 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 remote
|
|
|
|
import (
|
|
"context"
|
|
|
|
"github.com/prometheus/common/model"
|
|
"github.com/prometheus/prometheus/pkg/labels"
|
|
"github.com/prometheus/prometheus/storage"
|
|
)
|
|
|
|
// Querier returns a new Querier on the storage.
|
|
func (r *Storage) Querier(ctx context.Context, mint, maxt int64) (storage.Querier, error) {
|
|
r.mtx.Lock()
|
|
defer r.mtx.Unlock()
|
|
|
|
queriers := make([]storage.Querier, 0, len(r.clients))
|
|
localStartTime, err := r.localStartTimeCallback()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
for _, c := range r.clients {
|
|
cmaxt := maxt
|
|
if !c.readRecent {
|
|
// Avoid queries whose timerange is later than the first timestamp in local DB.
|
|
if mint > localStartTime {
|
|
continue
|
|
}
|
|
// Query only samples older than the first timestamp in local DB.
|
|
if maxt > localStartTime {
|
|
cmaxt = localStartTime
|
|
}
|
|
}
|
|
queriers = append(queriers, &querier{
|
|
ctx: ctx,
|
|
mint: mint,
|
|
maxt: cmaxt,
|
|
client: c,
|
|
externalLabels: r.externalLabels,
|
|
})
|
|
}
|
|
return newMergeQueriers(queriers), nil
|
|
}
|
|
|
|
// Store it in variable to make it mockable in tests since a mergeQuerier is not publicly exposed.
|
|
var newMergeQueriers = storage.NewMergeQuerier
|
|
|
|
// Querier is an adapter to make a Client usable as a storage.Querier.
|
|
type querier struct {
|
|
ctx context.Context
|
|
mint, maxt int64
|
|
client *Client
|
|
externalLabels model.LabelSet
|
|
}
|
|
|
|
// Select returns a set of series that matches the given label matchers.
|
|
func (q *querier) Select(matchers ...*labels.Matcher) storage.SeriesSet {
|
|
m, added := q.addExternalLabels(matchers)
|
|
|
|
query, err := ToQuery(q.mint, q.maxt, m)
|
|
if err != nil {
|
|
return errSeriesSet{err: err}
|
|
}
|
|
|
|
res, err := q.client.Read(q.ctx, query)
|
|
if err != nil {
|
|
return errSeriesSet{err: err}
|
|
}
|
|
|
|
seriesSet := FromQueryResult(res)
|
|
|
|
return newSeriesSetFilter(seriesSet, added)
|
|
}
|
|
|
|
type byLabel []storage.Series
|
|
|
|
func (a byLabel) Len() int { return len(a) }
|
|
func (a byLabel) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
|
|
func (a byLabel) Less(i, j int) bool { return labels.Compare(a[i].Labels(), a[j].Labels()) < 0 }
|
|
|
|
// LabelValues returns all potential values for a label name.
|
|
func (q *querier) LabelValues(name string) ([]string, error) {
|
|
// TODO implement?
|
|
return nil, nil
|
|
}
|
|
|
|
// Close releases the resources of the Querier.
|
|
func (q *querier) Close() error {
|
|
return nil
|
|
}
|
|
|
|
// addExternalLabels adds matchers for each external label. External labels
|
|
// that already have a corresponding user-supplied matcher are skipped, as we
|
|
// assume that the user explicitly wants to select a different value for them.
|
|
// We return the new set of matchers, along with a map of labels for which
|
|
// matchers were added, so that these can later be removed from the result
|
|
// time series again.
|
|
func (q *querier) addExternalLabels(matchers []*labels.Matcher) ([]*labels.Matcher, model.LabelSet) {
|
|
el := make(model.LabelSet, len(q.externalLabels))
|
|
for k, v := range q.externalLabels {
|
|
el[k] = v
|
|
}
|
|
for _, m := range matchers {
|
|
if _, ok := el[model.LabelName(m.Name)]; ok {
|
|
delete(el, model.LabelName(m.Name))
|
|
}
|
|
}
|
|
for k, v := range el {
|
|
m, err := labels.NewMatcher(labels.MatchEqual, string(k), string(v))
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
matchers = append(matchers, m)
|
|
}
|
|
return matchers, el
|
|
}
|
|
|
|
func newSeriesSetFilter(ss storage.SeriesSet, toFilter model.LabelSet) storage.SeriesSet {
|
|
return &seriesSetFilter{
|
|
SeriesSet: ss,
|
|
toFilter: toFilter,
|
|
}
|
|
}
|
|
|
|
type seriesSetFilter struct {
|
|
storage.SeriesSet
|
|
toFilter model.LabelSet
|
|
}
|
|
|
|
func (ssf seriesSetFilter) At() storage.Series {
|
|
return seriesFilter{
|
|
Series: ssf.SeriesSet.At(),
|
|
toFilter: ssf.toFilter,
|
|
}
|
|
}
|
|
|
|
type seriesFilter struct {
|
|
storage.Series
|
|
toFilter model.LabelSet
|
|
}
|
|
|
|
func (sf seriesFilter) Labels() labels.Labels {
|
|
labels := sf.Series.Labels()
|
|
for i := 0; i < len(labels); {
|
|
if _, ok := sf.toFilter[model.LabelName(labels[i].Name)]; ok {
|
|
labels = labels[:i+copy(labels[i:], labels[i+1:])]
|
|
continue
|
|
}
|
|
i++
|
|
}
|
|
return labels
|
|
}
|