forked from prometheus/blackbox_exporter
-
Notifications
You must be signed in to change notification settings - Fork 0
/
history.go
97 lines (85 loc) · 2.72 KB
/
history.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
// Copyright 2017 The Prometheus Authors
// 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 main
import (
"sync"
)
type result struct {
id int64
moduleName string
target string
debugOutput string
success bool
}
// resultHistory contains two history slices: `results` contains most recent `maxResults` results.
// After they expire out of `results`, failures will be saved in `preservedFailedResults`. This
// ensures that we are always able to see debug information about recent failures.
type resultHistory struct {
mu sync.Mutex
nextId int64
results []*result
preservedFailedResults []*result
maxResults uint
}
// Add a result to the history.
func (rh *resultHistory) Add(moduleName, target, debugOutput string, success bool) {
rh.mu.Lock()
defer rh.mu.Unlock()
r := &result{
id: rh.nextId,
moduleName: moduleName,
target: target,
debugOutput: debugOutput,
success: success,
}
rh.nextId++
rh.results = append(rh.results, r)
if uint(len(rh.results)) > rh.maxResults {
// If we are about to remove a failure, add it to the failed result history, then
// remove the oldest failed result, if needed.
if !rh.results[0].success {
rh.preservedFailedResults = append(rh.preservedFailedResults, rh.results[0])
if uint(len(rh.preservedFailedResults)) > rh.maxResults {
preservedFailedResults := make([]*result, len(rh.preservedFailedResults)-1)
copy(preservedFailedResults, rh.preservedFailedResults[1:])
rh.preservedFailedResults = preservedFailedResults
}
}
results := make([]*result, len(rh.results)-1)
copy(results, rh.results[1:])
rh.results = results
}
}
// List returns a list of all results.
func (rh *resultHistory) List() []*result {
rh.mu.Lock()
defer rh.mu.Unlock()
// Results in each slice are disjoint. We can simply concatenate the results.
return append(rh.preservedFailedResults[:], rh.results...)
}
// Get returns a given result.
func (rh *resultHistory) Get(id int64) *result {
rh.mu.Lock()
defer rh.mu.Unlock()
for _, r := range rh.preservedFailedResults {
if r.id == id {
return r
}
}
for _, r := range rh.results {
if r.id == id {
return r
}
}
return nil
}