mudhorn/prometheus
1
0
Fork 0
mirror of https://github.com/prometheus/prometheus.git synced 2025-03-05 20:59:13 -08:00
Code Issues Actions 4 Packages Projects Releases Wiki Activity

Code Review: Last replacement wins.

Browse source
This commit is contained in:
Matt T. Proud 2013-06-05 16:29:05 +02:00
parent 9cde48754b
commit d4db3cf00b
1 changed files with 11 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
retrieval/targetpool.go
View file

@ -26,7 +26,7 @@ const (
intervalKey = "interval" intervalKey = "interval"
targetAddQueueSize = 100 targetAddQueueSize = 100
targetReplaceQueueSize = 100 targetReplaceQueueSize = 1
) )
type TargetPool struct { type TargetPool struct {
@ -82,7 +82,16 @@ func (p *TargetPool) addTarget(target Target) {
} }
func (p *TargetPool) ReplaceTargets(newTargets []Target) { func (p *TargetPool) ReplaceTargets(newTargets []Target) {
p.replaceTargetsQueue <- newTargets p.Lock()
defer p.Unlock()
// If there is anything remaining in the queue for effectuation, clear it out,
// because the last mutation should win.
select {
case <-p.replaceTargetsQueue:
default:
p.replaceTargetsQueue <- newTargets
}
} }
func (p *TargetPool) replaceTargets(newTargets []Target) { func (p *TargetPool) replaceTargets(newTargets []Target) {