1
0
Fork 0
telegraf/testutil/metric.go
Daniel Baumann 4978089aab
Adding upstream version 1.34.4.
Signed-off-by: Daniel Baumann <daniel@debian.org>
2025-05-24 07:26:29 +02:00

399 lines
9.8 KiB
Go

package testutil
import (
"reflect"
"sort"
"testing"
"time"
"github.com/google/go-cmp/cmp"
"github.com/google/go-cmp/cmp/cmpopts"
"github.com/influxdata/telegraf"
"github.com/influxdata/telegraf/metric"
)
type metricDiff struct {
Measurement string
Tags []*telegraf.Tag
Fields []*telegraf.Field
Type telegraf.ValueType
Time time.Time
}
type helper interface {
Helper()
}
func lessFunc(lhs, rhs *metricDiff) bool {
if lhs.Measurement != rhs.Measurement {
return lhs.Measurement < rhs.Measurement
}
for i := 0; ; i++ {
if i >= len(lhs.Tags) && i >= len(rhs.Tags) {
break
} else if i >= len(lhs.Tags) {
return true
} else if i >= len(rhs.Tags) {
return false
}
if lhs.Tags[i].Key != rhs.Tags[i].Key {
return lhs.Tags[i].Key < rhs.Tags[i].Key
}
if lhs.Tags[i].Value != rhs.Tags[i].Value {
return lhs.Tags[i].Value < rhs.Tags[i].Value
}
}
for i := 0; ; i++ {
if i >= len(lhs.Fields) && i >= len(rhs.Fields) {
break
} else if i >= len(lhs.Fields) {
return true
} else if i >= len(rhs.Fields) {
return false
}
if lhs.Fields[i].Key != rhs.Fields[i].Key {
return lhs.Fields[i].Key < rhs.Fields[i].Key
}
if lhs.Fields[i].Value != rhs.Fields[i].Value {
ltype := reflect.TypeOf(lhs.Fields[i].Value)
rtype := reflect.TypeOf(rhs.Fields[i].Value)
if ltype.Kind() != rtype.Kind() {
return ltype.Kind() < rtype.Kind()
}
switch v := lhs.Fields[i].Value.(type) {
case int64:
return v < rhs.Fields[i].Value.(int64)
case uint64:
return v < rhs.Fields[i].Value.(uint64)
case float64:
return v < rhs.Fields[i].Value.(float64)
case string:
return v < rhs.Fields[i].Value.(string)
case bool:
return !v
default:
panic("unknown type")
}
}
}
if lhs.Type != rhs.Type {
return lhs.Type < rhs.Type
}
if lhs.Time.UnixNano() != rhs.Time.UnixNano() {
return lhs.Time.UnixNano() < rhs.Time.UnixNano()
}
return false
}
func newMetricDiff(telegrafMetric telegraf.Metric) *metricDiff {
if telegrafMetric == nil {
return nil
}
m := &metricDiff{}
m.Measurement = telegrafMetric.Name()
m.Tags = append(m.Tags, telegrafMetric.TagList()...)
sort.Slice(m.Tags, func(i, j int) bool {
return m.Tags[i].Key < m.Tags[j].Key
})
m.Fields = append(m.Fields, telegrafMetric.FieldList()...)
sort.Slice(m.Fields, func(i, j int) bool {
return m.Fields[i].Key < m.Fields[j].Key
})
m.Type = telegrafMetric.Type()
m.Time = telegrafMetric.Time()
return m
}
func newMetricStructureDiff(telegrafMetric telegraf.Metric) *metricDiff {
if telegrafMetric == nil {
return nil
}
m := &metricDiff{}
m.Measurement = telegrafMetric.Name()
m.Tags = append(m.Tags, telegrafMetric.TagList()...)
sort.Slice(m.Tags, func(i, j int) bool {
return m.Tags[i].Key < m.Tags[j].Key
})
for _, f := range telegrafMetric.FieldList() {
sf := &telegraf.Field{
Key: f.Key,
Value: reflect.Zero(reflect.TypeOf(f.Value)).Interface(),
}
m.Fields = append(m.Fields, sf)
}
sort.Slice(m.Fields, func(i, j int) bool {
return m.Fields[i].Key < m.Fields[j].Key
})
m.Type = telegrafMetric.Type()
m.Time = telegrafMetric.Time()
return m
}
// SortMetrics enables sorting metrics before comparison.
func SortMetrics() cmp.Option {
return cmpopts.SortSlices(lessFunc)
}
// IgnoreTime disables comparison of timestamp.
func IgnoreTime() cmp.Option {
return cmpopts.IgnoreFields(metricDiff{}, "Time")
}
func IgnoreType() cmp.Option {
return cmpopts.IgnoreFields(metricDiff{}, "Type")
}
// IgnoreFields disables comparison of the fields with the given names.
// The field-names are case-sensitive!
func IgnoreFields(names ...string) cmp.Option {
return cmpopts.IgnoreSliceElements(
func(f *telegraf.Field) bool {
for _, n := range names {
if f.Key == n {
return true
}
}
return false
},
)
}
// IgnoreTags disables comparison of the tags with the given names.
// The tag-names are case-sensitive!
func IgnoreTags(names ...string) cmp.Option {
return cmpopts.IgnoreSliceElements(
func(f *telegraf.Tag) bool {
for _, n := range names {
if f.Key == n {
return true
}
}
return false
},
)
}
// MetricEqual returns true if the metrics are equal.
func MetricEqual(expected, actual telegraf.Metric, opts ...cmp.Option) bool {
var lhs, rhs *metricDiff
if expected != nil {
lhs = newMetricDiff(expected)
}
if actual != nil {
rhs = newMetricDiff(actual)
}
opts = append(opts, cmpopts.EquateNaNs())
return cmp.Equal(lhs, rhs, opts...)
}
// RequireMetricEqual halts the test with an error if the metrics are not
// equal.
func RequireMetricEqual(t testing.TB, expected, actual telegraf.Metric, opts ...cmp.Option) {
if x, ok := t.(helper); ok {
x.Helper()
}
var lhs, rhs *metricDiff
if expected != nil {
lhs = newMetricDiff(expected)
}
if actual != nil {
rhs = newMetricDiff(actual)
}
opts = append(opts, cmpopts.EquateNaNs())
if diff := cmp.Diff(lhs, rhs, opts...); diff != "" {
t.Fatalf("telegraf.Metric\n--- expected\n+++ actual\n%s", diff)
}
}
// RequireMetricsEqual halts the test with an error if the array of metrics
// are not equal.
func RequireMetricsEqual(t testing.TB, expected, actual []telegraf.Metric, opts ...cmp.Option) {
if x, ok := t.(helper); ok {
x.Helper()
}
lhs := make([]*metricDiff, 0, len(expected))
for _, m := range expected {
lhs = append(lhs, newMetricDiff(m))
}
rhs := make([]*metricDiff, 0, len(actual))
for _, m := range actual {
rhs = append(rhs, newMetricDiff(m))
}
opts = append(opts, cmpopts.EquateNaNs())
if diff := cmp.Diff(lhs, rhs, opts...); diff != "" {
t.Fatalf("[]telegraf.Metric\n--- expected\n+++ actual\n%s", diff)
}
}
// RequireMetricsSubset halts the test with an error if the expected array
// of metrics is not a subset of the actual metrics.
func RequireMetricsSubset(t testing.TB, expected, actual []telegraf.Metric, opts ...cmp.Option) {
if x, ok := t.(helper); ok {
x.Helper()
}
lhs := make([]*metricDiff, 0, len(expected))
for _, m := range expected {
lhs = append(lhs, newMetricDiff(m))
}
rhs := make([]*metricDiff, 0, len(actual))
for _, m := range actual {
rhs = append(rhs, newMetricDiff(m))
}
// Sort the metrics
sort.SliceStable(lhs, func(i, j int) bool {
return lessFunc(lhs[i], lhs[j])
})
sort.SliceStable(rhs, func(i, j int) bool {
return lessFunc(rhs[i], rhs[j])
})
// Filter the right-hand-side (aka actual) by being contained in the
// left-hand-side (aka expected).
rhsFiltered := make([]*metricDiff, 0, len(rhs))
for _, r := range rhs {
// Find the next element in the sorted list that might match
for _, l := range lhs {
if cmp.Equal(l, r, opts...) {
rhsFiltered = append(rhsFiltered, r)
break
}
}
}
opts = append(opts, cmpopts.EquateNaNs())
if diff := cmp.Diff(lhs, rhsFiltered, opts...); diff != "" {
t.Fatalf("[]telegraf.Metric\n--- expected\n+++ actual\n%s", diff)
}
}
// RequireMetricsStructureEqual halts the test with an error if the array of
// metrics is structural different. Structure means that the metric differs
// in either name, tag key/values, time (if not ignored) or fields. For fields
// ONLY the name and type are compared NOT the value.
func RequireMetricsStructureEqual(t testing.TB, expected, actual []telegraf.Metric, opts ...cmp.Option) {
if x, ok := t.(helper); ok {
x.Helper()
}
lhs := make([]*metricDiff, 0, len(expected))
for _, m := range expected {
lhs = append(lhs, newMetricStructureDiff(m))
}
rhs := make([]*metricDiff, 0, len(actual))
for _, m := range actual {
rhs = append(rhs, newMetricStructureDiff(m))
}
opts = append(opts, cmpopts.EquateNaNs())
if diff := cmp.Diff(lhs, rhs, opts...); diff != "" {
t.Fatalf("[]telegraf.Metric\n--- expected\n+++ actual\n%s", diff)
}
}
// RequireMetricsStructureSubset halts the test with an error if the expected
// array of metrics is not a subset of the actual metrics. The equality here
// is only based on the structure (i.e. key name and value types) and NOT on
// the actual value.
func RequireMetricsStructureSubset(t testing.TB, expected, actual []telegraf.Metric, opts ...cmp.Option) {
if x, ok := t.(helper); ok {
x.Helper()
}
lhs := make([]*metricDiff, 0, len(expected))
for _, m := range expected {
lhs = append(lhs, newMetricStructureDiff(m))
}
rhs := make([]*metricDiff, 0, len(actual))
for _, m := range actual {
rhs = append(rhs, newMetricStructureDiff(m))
}
// Sort the metrics
sort.SliceStable(lhs, func(i, j int) bool {
return lessFunc(lhs[i], lhs[j])
})
sort.SliceStable(rhs, func(i, j int) bool {
return lessFunc(rhs[i], rhs[j])
})
// Filter the right-hand-side (aka actual) by being contained in the
// left-hand-side (aka expected).
rhsFiltered := make([]*metricDiff, 0, len(rhs))
for _, r := range rhs {
// Find the next element in the sorted list that might match
for _, l := range lhs {
if cmp.Equal(l, r, opts...) {
rhsFiltered = append(rhsFiltered, r)
break
}
}
}
opts = append(opts, cmpopts.EquateNaNs())
if diff := cmp.Diff(lhs, rhsFiltered, opts...); diff != "" {
t.Fatalf("[]telegraf.Metric\n--- expected\n+++ actual\n%s", diff)
}
}
// MustMetric creates a new metric.
func MustMetric(
name string,
tags map[string]string,
fields map[string]interface{},
tm time.Time,
tp ...telegraf.ValueType,
) telegraf.Metric {
m := metric.New(name, tags, fields, tm, tp...)
return m
}
func FromTestMetric(met *Metric) telegraf.Metric {
m := metric.New(met.Measurement, met.Tags, met.Fields, met.Time, met.Type)
return m
}
func ToTestMetric(tm telegraf.Metric) *Metric {
tags := make(map[string]string, len(tm.TagList()))
for _, t := range tm.TagList() {
tags[t.Key] = t.Value
}
fields := make(map[string]interface{}, len(tm.FieldList()))
for _, f := range tm.FieldList() {
fields[f.Key] = f.Value
}
return &Metric{
Measurement: tm.Name(),
Fields: fields,
Tags: tags,
Time: tm.Time(),
Type: tm.Type(),
}
}