mirror of
https://github.com/prometheus/prometheus.git
synced 2024-11-10 07:34:04 -08:00
b93bafeee1
- Remove datarace in the exported highest scrape timestamp. - Backoff on enqueue should be per-sample - reset the result for each sample. - Remove diffKeys, unused ctx and cancelfunc in WALWatcher, 'name' from writeTo interface, and pass it to constructor. - Reorder functions in WALWatcher depth-first according to call graph. - Fix vendor/modules.txt. - Split out the various timer periods into consts at the top of the file. - Move w.currentSegmentMetric.Set close to where we set the currentSegment. - Combine r.Next() and isClosed(w.quit) into a single loop. - Unnest some ifs in WALWatcher.watch, propagate erros in decodeRecord, add some new lines to make it easier to read. - Reorganise checkpoint handling to reduce nesting and make it easier to follow. Signed-off-by: Tom Wilkie <tom.wilkie@gmail.com>
199 lines
5.6 KiB
Go
199 lines
5.6 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"
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/go-kit/kit/log"
|
|
|
|
"github.com/prometheus/client_golang/prometheus"
|
|
"github.com/prometheus/common/model"
|
|
"github.com/prometheus/prometheus/config"
|
|
"github.com/prometheus/prometheus/pkg/labels"
|
|
"github.com/prometheus/prometheus/pkg/timestamp"
|
|
"github.com/prometheus/prometheus/storage"
|
|
)
|
|
|
|
// startTimeCallback is a callback func that return the oldest timestamp stored in a storage.
|
|
type startTimeCallback func() (int64, error)
|
|
|
|
// Storage represents all the remote read and write endpoints. It implements
|
|
// storage.Storage.
|
|
type Storage struct {
|
|
logger log.Logger
|
|
mtx sync.RWMutex
|
|
|
|
// For writes
|
|
walDir string
|
|
queues []*QueueManager
|
|
samplesIn *ewmaRate
|
|
samplesInMetric prometheus.Counter
|
|
highestTimestampMtx sync.Mutex
|
|
highestTimestamp int64
|
|
highestTimestampMetric prometheus.Gauge
|
|
|
|
// For reads
|
|
queryables []storage.Queryable
|
|
localStartTimeCallback startTimeCallback
|
|
flushDeadline time.Duration
|
|
}
|
|
|
|
// NewStorage returns a remote.Storage.
|
|
func NewStorage(l log.Logger, reg prometheus.Registerer, stCallback startTimeCallback, walDir string, flushDeadline time.Duration) *Storage {
|
|
if l == nil {
|
|
l = log.NewNopLogger()
|
|
}
|
|
shardUpdateDuration := 10 * time.Second
|
|
s := &Storage{
|
|
logger: l,
|
|
localStartTimeCallback: stCallback,
|
|
flushDeadline: flushDeadline,
|
|
walDir: walDir,
|
|
// queues: make(map[*QueueManager]struct{}),
|
|
samplesIn: newEWMARate(ewmaWeight, shardUpdateDuration),
|
|
samplesInMetric: prometheus.NewCounter(prometheus.CounterOpts{
|
|
Name: "prometheus_remote_storage_samples_in_total",
|
|
Help: "Samples in to remote storage, compare to samples out for queue managers.",
|
|
}),
|
|
highestTimestampMetric: prometheus.NewGauge(prometheus.GaugeOpts{
|
|
Name: "prometheus_remote_storage_highest_timestamp_in",
|
|
Help: "Highest timestamp that has come into the remote storage via the Appender interface.",
|
|
}),
|
|
}
|
|
reg.MustRegister(s.samplesInMetric)
|
|
reg.MustRegister(s.highestTimestampMetric)
|
|
return s
|
|
}
|
|
|
|
// ApplyConfig updates the state as the new config requires.
|
|
func (s *Storage) ApplyConfig(conf *config.Config) error {
|
|
s.mtx.Lock()
|
|
defer s.mtx.Unlock()
|
|
|
|
// Update write queues
|
|
newQueues := []*QueueManager{}
|
|
// TODO: we should only stop & recreate queues which have changes,
|
|
// as this can be quite disruptive.
|
|
for i, rwConf := range conf.RemoteWriteConfigs {
|
|
c, err := NewClient(i, &ClientConfig{
|
|
URL: rwConf.URL,
|
|
Timeout: rwConf.RemoteTimeout,
|
|
HTTPClientConfig: rwConf.HTTPClientConfig,
|
|
})
|
|
if err != nil {
|
|
return err
|
|
}
|
|
// Convert to int64 for comparison with timestamps from samples
|
|
// we will eventually read from the WAL on startup.
|
|
startTime := timestamp.FromTime(time.Now())
|
|
newQueues = append(newQueues, NewQueueManager(
|
|
s.logger,
|
|
s.walDir,
|
|
s.samplesIn,
|
|
&s.highestTimestamp,
|
|
rwConf.QueueConfig,
|
|
conf.GlobalConfig.ExternalLabels,
|
|
rwConf.WriteRelabelConfigs,
|
|
c,
|
|
s.flushDeadline,
|
|
startTime,
|
|
))
|
|
}
|
|
|
|
for _, q := range s.queues {
|
|
q.Stop()
|
|
}
|
|
|
|
s.queues = newQueues
|
|
for _, q := range s.queues {
|
|
q.Start()
|
|
}
|
|
|
|
// Update read clients
|
|
|
|
s.queryables = make([]storage.Queryable, 0, len(conf.RemoteReadConfigs))
|
|
for i, rrConf := range conf.RemoteReadConfigs {
|
|
c, err := NewClient(i, &ClientConfig{
|
|
URL: rrConf.URL,
|
|
Timeout: rrConf.RemoteTimeout,
|
|
HTTPClientConfig: rrConf.HTTPClientConfig,
|
|
})
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
q := QueryableClient(c)
|
|
q = ExternalLabelsHandler(q, conf.GlobalConfig.ExternalLabels)
|
|
if len(rrConf.RequiredMatchers) > 0 {
|
|
q = RequiredMatchersFilter(q, labelsToEqualityMatchers(rrConf.RequiredMatchers))
|
|
}
|
|
if !rrConf.ReadRecent {
|
|
q = PreferLocalStorageFilter(q, s.localStartTimeCallback)
|
|
}
|
|
s.queryables = append(s.queryables, q)
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
// StartTime implements the Storage interface.
|
|
func (s *Storage) StartTime() (int64, error) {
|
|
return int64(model.Latest), nil
|
|
}
|
|
|
|
// Querier returns a storage.MergeQuerier combining the remote client queriers
|
|
// of each configured remote read endpoint.
|
|
func (s *Storage) Querier(ctx context.Context, mint, maxt int64) (storage.Querier, error) {
|
|
s.mtx.Lock()
|
|
queryables := s.queryables
|
|
s.mtx.Unlock()
|
|
|
|
queriers := make([]storage.Querier, 0, len(queryables))
|
|
for _, queryable := range queryables {
|
|
q, err := queryable.Querier(ctx, mint, maxt)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
queriers = append(queriers, q)
|
|
}
|
|
return storage.NewMergeQuerier(nil, queriers), nil
|
|
}
|
|
|
|
// Close the background processing of the storage queues.
|
|
func (s *Storage) Close() error {
|
|
s.mtx.Lock()
|
|
defer s.mtx.Unlock()
|
|
|
|
for _, q := range s.queues {
|
|
q.Stop()
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func labelsToEqualityMatchers(ls model.LabelSet) []*labels.Matcher {
|
|
ms := make([]*labels.Matcher, 0, len(ls))
|
|
for k, v := range ls {
|
|
ms = append(ms, &labels.Matcher{
|
|
Type: labels.MatchEqual,
|
|
Name: string(k),
|
|
Value: string(v),
|
|
})
|
|
}
|
|
return ms
|
|
}
|