126 lines
3.3 KiB
Go
126 lines
3.3 KiB
Go
// Copyright 2015 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 types
|
|
|
|
import (
|
|
"fmt"
|
|
"regexp"
|
|
|
|
"github.com/prometheus/common/model"
|
|
)
|
|
|
|
// Matcher defines a matching rule for the value of a given label.
|
|
type Matcher struct {
|
|
Name string `json:"name"`
|
|
Value string `json:"value"`
|
|
IsRegex bool `json:"isRegex"`
|
|
|
|
regex *regexp.Regexp
|
|
}
|
|
|
|
// Init internals of the Matcher. Must be called before using Match.
|
|
func (m *Matcher) Init() error {
|
|
if !m.IsRegex {
|
|
return nil
|
|
}
|
|
re, err := regexp.Compile(m.Value)
|
|
if err == nil {
|
|
m.regex = re
|
|
}
|
|
return err
|
|
}
|
|
|
|
func (m *Matcher) String() string {
|
|
if m.IsRegex {
|
|
return fmt.Sprintf("<RegexMatcher %s:%q>", m.Name, m.Value)
|
|
}
|
|
return fmt.Sprintf("<Matcher %s:%q>", m.Name, m.Value)
|
|
}
|
|
|
|
// Match checks whether the label of the matcher has the specified
|
|
// matching value.
|
|
func (m *Matcher) Match(lset model.LabelSet) bool {
|
|
// Unset labels are treated as unset labels globally. Thus, if a
|
|
// label is not set we retrieve the empty label which is correct
|
|
// for the comparison below.
|
|
v := lset[model.LabelName(m.Name)]
|
|
|
|
if m.IsRegex {
|
|
return m.regex.MatchString(string(v))
|
|
}
|
|
return string(v) == m.Value
|
|
}
|
|
|
|
// NewMatcher returns a new matcher that compares against equality of
|
|
// the given value.
|
|
func NewMatcher(name model.LabelName, value string) *Matcher {
|
|
return &Matcher{
|
|
Name: string(name),
|
|
Value: value,
|
|
IsRegex: false,
|
|
}
|
|
}
|
|
|
|
// NewRegexMatcher returns a new matcher that compares values against
|
|
// a regular expression. The matcher is already initialized.
|
|
//
|
|
// TODO(fabxc): refactor usage.
|
|
func NewRegexMatcher(name model.LabelName, re *regexp.Regexp) *Matcher {
|
|
return &Matcher{
|
|
Name: string(name),
|
|
Value: re.String(),
|
|
IsRegex: true,
|
|
regex: re,
|
|
}
|
|
}
|
|
|
|
// Matchers provides the Match and Fingerprint methods for a slice of Matchers.
|
|
type Matchers []*Matcher
|
|
|
|
// Match checks whether all matchers are fulfilled against the given label set.
|
|
func (ms Matchers) Match(lset model.LabelSet) bool {
|
|
for _, m := range ms {
|
|
if !m.Match(lset) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Validate returns true iff all fields of the matcher have valid values.
|
|
func (m *Matcher) Validate() error {
|
|
if !model.LabelName(m.Name).IsValid() {
|
|
return fmt.Errorf("invalid name %q", m.Name)
|
|
}
|
|
if m.IsRegex {
|
|
if _, err := regexp.Compile(m.Value); err != nil {
|
|
return fmt.Errorf("invalid regular expression %q", m.Value)
|
|
}
|
|
} else if !model.LabelValue(m.Value).IsValid() || len(m.Value) == 0 {
|
|
return fmt.Errorf("invalid value %q", m.Value)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Fingerprint returns a quasi-unique fingerprint for the matchers.
|
|
func (ms Matchers) Fingerprint() model.Fingerprint {
|
|
lset := make(model.LabelSet, 3*len(ms))
|
|
|
|
for _, m := range ms {
|
|
lset[model.LabelName(fmt.Sprintf("%s-%s-%v", m.Name, m.Value, m.IsRegex))] = ""
|
|
}
|
|
|
|
return lset.Fingerprint()
|
|
}
|