mirror of
https://github.com/prometheus/prometheus.git
synced 2025-01-06 03:17:26 -08:00
01f652cb4c
This was initially motivated by wanting to distribute the rule checker tool under `tools/rule_checker`. However, this was not possible without also distributing the LevelDB dynamic libraries because the tool transitively depended on Levigo: rule checker -> query layer -> tiered storage layer -> leveldb This change separates external storage interfaces from the implementation (tiered storage, leveldb storage, memory storage) by putting them into separate packages: - storage/metric: public, implementation-agnostic interfaces - storage/metric/tiered: tiered storage implementation, including memory and LevelDB storage. I initially also considered splitting up the implementation into separate packages for tiered storage, memory storage, and LevelDB storage, but these are currently so intertwined that it would be another major project in itself. The query layers and most other parts of Prometheus now have notion of the storage implementation anymore and just use whatever implementation they get passed in via interfaces. The rule_checker is now a static binary :) Change-Id: I793bbf631a8648ca31790e7e772ecf9c2b92f7a0
142 lines
4.1 KiB
Go
142 lines
4.1 KiB
Go
// Copyright 2013 Prometheus Team
|
|
// 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 tiered
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"code.google.com/p/goprotobuf/proto"
|
|
|
|
clientmodel "github.com/prometheus/client_golang/model"
|
|
|
|
"github.com/prometheus/prometheus/coding/indexable"
|
|
"github.com/prometheus/prometheus/storage/metric"
|
|
|
|
dto "github.com/prometheus/prometheus/model/generated"
|
|
)
|
|
|
|
// SampleKey models the business logic around the data-transfer object
|
|
// SampleKey.
|
|
type SampleKey struct {
|
|
Fingerprint *clientmodel.Fingerprint
|
|
FirstTimestamp clientmodel.Timestamp
|
|
LastTimestamp clientmodel.Timestamp
|
|
SampleCount uint32
|
|
}
|
|
|
|
// Constrain merges the underlying SampleKey to fit within the keyspace of
|
|
// the provided first and last keys and returns whether the key was modified.
|
|
func (s *SampleKey) Constrain(first, last *SampleKey) bool {
|
|
switch {
|
|
case s.Before(first.Fingerprint, first.FirstTimestamp):
|
|
*s = *first
|
|
return true
|
|
case last.Before(s.Fingerprint, s.FirstTimestamp):
|
|
*s = *last
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
// Equal returns true if this SampleKey and o have equal fingerprints,
|
|
// timestamps, and sample counts.
|
|
func (s *SampleKey) Equal(o *SampleKey) bool {
|
|
if s == o {
|
|
return true
|
|
}
|
|
|
|
if !s.Fingerprint.Equal(o.Fingerprint) {
|
|
return false
|
|
}
|
|
if !s.FirstTimestamp.Equal(o.FirstTimestamp) {
|
|
return false
|
|
}
|
|
if !s.LastTimestamp.Equal(o.LastTimestamp) {
|
|
return false
|
|
}
|
|
|
|
return s.SampleCount == o.SampleCount
|
|
}
|
|
|
|
// MayContain indicates whether the given SampleKey could potentially contain a
|
|
// value at the provided time. Even if true is emitted, that does not mean a
|
|
// satisfactory value, in fact, exists.
|
|
func (s *SampleKey) MayContain(t clientmodel.Timestamp) bool {
|
|
switch {
|
|
case t.Before(s.FirstTimestamp):
|
|
return false
|
|
case t.After(s.LastTimestamp):
|
|
return false
|
|
default:
|
|
return true
|
|
}
|
|
}
|
|
|
|
// Before returns true if the Fingerprint of this SampleKey is less than fp and
|
|
// false if it is greater. If both fingerprints are equal, the FirstTimestamp of
|
|
// this SampleKey is checked in the same way against t. If the timestamps are
|
|
// eqal, the LastTimestamp of this SampleKey is checked against t (and false is
|
|
// returned if they are equal again).
|
|
func (s *SampleKey) Before(fp *clientmodel.Fingerprint, t clientmodel.Timestamp) bool {
|
|
if s.Fingerprint.Less(fp) {
|
|
return true
|
|
}
|
|
if !s.Fingerprint.Equal(fp) {
|
|
return false
|
|
}
|
|
|
|
if s.FirstTimestamp.Before(t) {
|
|
return true
|
|
}
|
|
|
|
return s.LastTimestamp.Before(t)
|
|
}
|
|
|
|
// Dump converts this SampleKey into a DTO for use in serialization purposes.
|
|
func (s *SampleKey) Dump(d *dto.SampleKey) {
|
|
d.Reset()
|
|
fp := &dto.Fingerprint{}
|
|
dumpFingerprint(fp, s.Fingerprint)
|
|
|
|
d.Fingerprint = fp
|
|
d.Timestamp = indexable.EncodeTime(s.FirstTimestamp)
|
|
d.LastTimestamp = proto.Int64(s.LastTimestamp.Unix())
|
|
d.SampleCount = proto.Uint32(s.SampleCount)
|
|
}
|
|
|
|
func (s *SampleKey) String() string {
|
|
return fmt.Sprintf("SampleKey for %s at %s to %s with %d values.", s.Fingerprint, s.FirstTimestamp, s.LastTimestamp, s.SampleCount)
|
|
}
|
|
|
|
// Load deserializes this SampleKey from a DTO.
|
|
func (s *SampleKey) Load(d *dto.SampleKey) {
|
|
f := &clientmodel.Fingerprint{}
|
|
loadFingerprint(f, d.GetFingerprint())
|
|
s.Fingerprint = f
|
|
s.FirstTimestamp = indexable.DecodeTime(d.Timestamp)
|
|
s.LastTimestamp = clientmodel.TimestampFromUnix(d.GetLastTimestamp())
|
|
s.SampleCount = d.GetSampleCount()
|
|
}
|
|
|
|
// buildSampleKey returns the SampleKey for the given Fingerprint and Values.
|
|
func buildSampleKey(f *clientmodel.Fingerprint, v metric.Values) *SampleKey {
|
|
return &SampleKey{
|
|
Fingerprint: f,
|
|
FirstTimestamp: v[0].Timestamp,
|
|
LastTimestamp: v[len(v)-1].Timestamp,
|
|
SampleCount: uint32(len(v)),
|
|
}
|
|
}
|