mirror of
https://github.com/prometheus/prometheus.git
synced 2025-03-05 20:59:13 -08:00
scrape: use LabelsRange instead of Labels, for performance
Includes a rewrite of `resolveConflictingExposedLabels` to use `labels.Builder.Get`, which simplifies it considerably. Signed-off-by: Bryan Boreham <bjboreham@gmail.com>
This commit is contained in:
parent
2fde2fb37d
commit
0dfa1e73f8
|
@ -500,7 +500,10 @@ func (sp *scrapePool) Sync(tgs []*targetgroup.Group) {
|
||||||
}
|
}
|
||||||
targetSyncFailed.WithLabelValues(sp.config.JobName).Add(float64(len(failures)))
|
targetSyncFailed.WithLabelValues(sp.config.JobName).Add(float64(len(failures)))
|
||||||
for _, t := range targets {
|
for _, t := range targets {
|
||||||
if !t.Labels().IsEmpty() {
|
// Replicate .Labels().IsEmpty() with a loop here to avoid generating garbage.
|
||||||
|
nonEmpty := false
|
||||||
|
t.LabelsRange(func(l labels.Label) { nonEmpty = true })
|
||||||
|
if nonEmpty {
|
||||||
all = append(all, t)
|
all = append(all, t)
|
||||||
} else if !t.DiscoveredLabels().IsEmpty() {
|
} else if !t.DiscoveredLabels().IsEmpty() {
|
||||||
sp.droppedTargets = append(sp.droppedTargets, t)
|
sp.droppedTargets = append(sp.droppedTargets, t)
|
||||||
|
@ -666,17 +669,16 @@ func verifyLabelLimits(lset labels.Labels, limits *labelLimits) error {
|
||||||
|
|
||||||
func mutateSampleLabels(lset labels.Labels, target *Target, honor bool, rc []*relabel.Config) labels.Labels {
|
func mutateSampleLabels(lset labels.Labels, target *Target, honor bool, rc []*relabel.Config) labels.Labels {
|
||||||
lb := labels.NewBuilder(lset)
|
lb := labels.NewBuilder(lset)
|
||||||
targetLabels := target.Labels()
|
|
||||||
|
|
||||||
if honor {
|
if honor {
|
||||||
targetLabels.Range(func(l labels.Label) {
|
target.LabelsRange(func(l labels.Label) {
|
||||||
if !lset.Has(l.Name) {
|
if !lset.Has(l.Name) {
|
||||||
lb.Set(l.Name, l.Value)
|
lb.Set(l.Name, l.Value)
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
} else {
|
} else {
|
||||||
var conflictingExposedLabels []labels.Label
|
var conflictingExposedLabels []labels.Label
|
||||||
targetLabels.Range(func(l labels.Label) {
|
target.LabelsRange(func(l labels.Label) {
|
||||||
existingValue := lset.Get(l.Name)
|
existingValue := lset.Get(l.Name)
|
||||||
if existingValue != "" {
|
if existingValue != "" {
|
||||||
conflictingExposedLabels = append(conflictingExposedLabels, labels.Label{Name: l.Name, Value: existingValue})
|
conflictingExposedLabels = append(conflictingExposedLabels, labels.Label{Name: l.Name, Value: existingValue})
|
||||||
|
@ -686,7 +688,7 @@ func mutateSampleLabels(lset labels.Labels, target *Target, honor bool, rc []*re
|
||||||
})
|
})
|
||||||
|
|
||||||
if len(conflictingExposedLabels) > 0 {
|
if len(conflictingExposedLabels) > 0 {
|
||||||
resolveConflictingExposedLabels(lb, lset, targetLabels, conflictingExposedLabels)
|
resolveConflictingExposedLabels(lb, conflictingExposedLabels)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -699,42 +701,27 @@ func mutateSampleLabels(lset labels.Labels, target *Target, honor bool, rc []*re
|
||||||
return res
|
return res
|
||||||
}
|
}
|
||||||
|
|
||||||
func resolveConflictingExposedLabels(lb *labels.Builder, exposedLabels, targetLabels labels.Labels, conflictingExposedLabels []labels.Label) {
|
func resolveConflictingExposedLabels(lb *labels.Builder, conflictingExposedLabels []labels.Label) {
|
||||||
sort.SliceStable(conflictingExposedLabels, func(i, j int) bool {
|
sort.SliceStable(conflictingExposedLabels, func(i, j int) bool {
|
||||||
return len(conflictingExposedLabels[i].Name) < len(conflictingExposedLabels[j].Name)
|
return len(conflictingExposedLabels[i].Name) < len(conflictingExposedLabels[j].Name)
|
||||||
})
|
})
|
||||||
|
|
||||||
for i, l := range conflictingExposedLabels {
|
for _, l := range conflictingExposedLabels {
|
||||||
newName := l.Name
|
newName := l.Name
|
||||||
for {
|
for {
|
||||||
newName = model.ExportedLabelPrefix + newName
|
newName = model.ExportedLabelPrefix + newName
|
||||||
if !exposedLabels.Has(newName) &&
|
if lb.Get(newName) == "" {
|
||||||
!targetLabels.Has(newName) &&
|
lb.Set(newName, l.Value)
|
||||||
!labelSliceHas(conflictingExposedLabels[:i], newName) {
|
|
||||||
conflictingExposedLabels[i].Name = newName
|
|
||||||
break
|
break
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for _, l := range conflictingExposedLabels {
|
|
||||||
lb.Set(l.Name, l.Value)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func labelSliceHas(lbls []labels.Label, name string) bool {
|
|
||||||
for _, l := range lbls {
|
|
||||||
if l.Name == name {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func mutateReportSampleLabels(lset labels.Labels, target *Target) labels.Labels {
|
func mutateReportSampleLabels(lset labels.Labels, target *Target) labels.Labels {
|
||||||
lb := labels.NewBuilder(lset)
|
lb := labels.NewBuilder(lset)
|
||||||
|
|
||||||
target.Labels().Range(func(l labels.Label) {
|
target.LabelsRange(func(l labels.Label) {
|
||||||
lb.Set(model.ExportedLabelPrefix+l.Name, lset.Get(l.Name))
|
lb.Set(model.ExportedLabelPrefix+l.Name, lset.Get(l.Name))
|
||||||
lb.Set(l.Name, l.Value)
|
lb.Set(l.Name, l.Value)
|
||||||
})
|
})
|
||||||
|
|
Loading…
Reference in a new issue