alertmanager/provider/mem/mem.go

291 lines
7.0 KiB
Go
Raw Normal View History

2016-08-09 12:13:05 +00:00
// Copyright 2016 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
2016-08-09 12:13:05 +00:00
//
// 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 mem
import (
"context"
2016-08-09 12:13:05 +00:00
"sync"
"time"
"github.com/go-kit/log"
"github.com/go-kit/log/level"
"github.com/prometheus/client_golang/prometheus"
"github.com/prometheus/common/model"
2016-08-09 12:13:05 +00:00
"github.com/prometheus/alertmanager/provider"
"github.com/prometheus/alertmanager/store"
2016-08-09 12:13:05 +00:00
"github.com/prometheus/alertmanager/types"
)
const alertChannelLength = 200
2016-08-09 12:13:05 +00:00
// Alerts gives access to a set of alerts. All methods are goroutine-safe.
type Alerts struct {
cancel context.CancelFunc
mtx sync.Mutex
alerts *store.Alerts
marker types.AlertMarker
listeners map[int]listeningAlerts
next int
callback AlertStoreCallback
logger log.Logger
}
2016-08-09 12:13:05 +00:00
type AlertStoreCallback interface {
// PreStore is called before alert is stored into the store. If this method returns error,
// alert is not stored.
// Existing flag indicates whether alert has existed before (and is only updated) or not.
// If alert has existed before, then alert passed to PreStore is result of merging existing alert with new alert.
PreStore(alert *types.Alert, existing bool) error
// PostStore is called after alert has been put into store.
PostStore(alert *types.Alert, existing bool)
// PostDelete is called after alert has been removed from the store due to alert garbage collection.
PostDelete(alert *types.Alert)
}
type listeningAlerts struct {
alerts chan *types.Alert
done chan struct{}
2016-08-09 12:13:05 +00:00
}
func (a *Alerts) registerMetrics(r prometheus.Registerer) {
newMemAlertByStatus := func(s types.AlertState) prometheus.GaugeFunc {
return prometheus.NewGaugeFunc(
prometheus.GaugeOpts{
Name: "alertmanager_alerts",
Help: "How many alerts by state.",
ConstLabels: prometheus.Labels{"state": string(s)},
},
func() float64 {
return float64(a.count(s))
},
)
}
r.MustRegister(newMemAlertByStatus(types.AlertStateActive))
r.MustRegister(newMemAlertByStatus(types.AlertStateSuppressed))
r.MustRegister(newMemAlertByStatus(types.AlertStateUnprocessed))
}
2016-08-09 12:13:05 +00:00
// NewAlerts returns a new alert provider.
func NewAlerts(ctx context.Context, m types.AlertMarker, intervalGC time.Duration, alertCallback AlertStoreCallback, l log.Logger, r prometheus.Registerer) (*Alerts, error) {
if alertCallback == nil {
alertCallback = noopCallback{}
}
ctx, cancel := context.WithCancel(ctx)
2016-08-09 12:13:05 +00:00
a := &Alerts{
marker: m,
alerts: store.NewAlerts(),
cancel: cancel,
listeners: map[int]listeningAlerts{},
next: 0,
logger: log.With(l, "component", "provider"),
callback: alertCallback,
2016-08-09 12:13:05 +00:00
}
if r != nil {
a.registerMetrics(r)
}
go a.gcLoop(ctx, intervalGC)
return a, nil
2016-08-09 12:13:05 +00:00
}
func (a *Alerts) gcLoop(ctx context.Context, interval time.Duration) {
t := time.NewTicker(interval)
defer t.Stop()
for {
select {
case <-ctx.Done():
return
case <-t.C:
a.gc()
}
}
}
func (a *Alerts) gc() {
a.mtx.Lock()
defer a.mtx.Unlock()
deleted := a.alerts.GC()
for _, alert := range deleted {
// As we don't persist alerts, we no longer consider them after
// they are resolved. Alerts waiting for resolved notifications are
// held in memory in aggregation groups redundantly.
a.marker.Delete(alert.Fingerprint())
a.callback.PostDelete(&alert)
}
for i, l := range a.listeners {
select {
case <-l.done:
delete(a.listeners, i)
close(l.alerts)
default:
// listener is not closed yet, hence proceed.
}
}
}
2016-08-09 12:13:05 +00:00
// Close the alert provider.
func (a *Alerts) Close() {
if a.cancel != nil {
a.cancel()
}
2016-08-09 12:13:05 +00:00
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
2016-08-09 12:13:05 +00:00
// Subscribe returns an iterator over active alerts that have not been
// resolved and successfully notified about.
// They are not guaranteed to be in chronological order.
func (a *Alerts) Subscribe() provider.AlertIterator {
a.mtx.Lock()
defer a.mtx.Unlock()
2016-08-09 12:13:05 +00:00
var (
done = make(chan struct{})
alerts = a.alerts.List()
ch = make(chan *types.Alert, max(len(alerts), alertChannelLength))
2016-08-09 12:13:05 +00:00
)
for _, a := range alerts {
ch <- a
}
2016-08-09 12:13:05 +00:00
a.listeners[a.next] = listeningAlerts{alerts: ch, done: done}
2016-08-09 12:13:05 +00:00
a.next++
return provider.NewAlertIterator(ch, done, nil)
2016-08-09 12:13:05 +00:00
}
// GetPending returns an iterator over all the alerts that have
2016-08-09 12:13:05 +00:00
// pending notifications.
func (a *Alerts) GetPending() provider.AlertIterator {
var (
ch = make(chan *types.Alert, alertChannelLength)
2016-08-09 12:13:05 +00:00
done = make(chan struct{})
)
a.mtx.Lock()
defer a.mtx.Unlock()
alerts := a.alerts.List()
2016-08-09 12:13:05 +00:00
go func() {
defer close(ch)
for _, a := range alerts {
2016-08-09 12:13:05 +00:00
select {
case ch <- a:
case <-done:
return
}
}
}()
return provider.NewAlertIterator(ch, done, nil)
2016-08-09 12:13:05 +00:00
}
// Get returns the alert for a given fingerprint.
func (a *Alerts) Get(fp model.Fingerprint) (*types.Alert, error) {
a.mtx.Lock()
defer a.mtx.Unlock()
return a.alerts.Get(fp)
2016-08-09 12:13:05 +00:00
}
// Put adds the given alert to the set.
func (a *Alerts) Put(alerts ...*types.Alert) error {
a.mtx.Lock()
defer a.mtx.Unlock()
2016-08-09 12:13:05 +00:00
for _, alert := range alerts {
fp := alert.Fingerprint()
existing := false
// Check that there's an alert existing within the store before
// trying to merge.
if old, err := a.alerts.Get(fp); err == nil {
existing = true
2016-08-09 12:13:05 +00:00
// Merge alerts if there is an overlap in activity range.
if (alert.EndsAt.After(old.StartsAt) && alert.EndsAt.Before(old.EndsAt)) ||
(alert.StartsAt.After(old.StartsAt) && alert.StartsAt.Before(old.EndsAt)) {
alert = old.Merge(alert)
}
}
if err := a.callback.PreStore(alert, existing); err != nil {
level.Error(a.logger).Log("msg", "pre-store callback returned error on set alert", "err", err)
continue
}
if err := a.alerts.Set(alert); err != nil {
level.Error(a.logger).Log("msg", "error on set alert", "err", err)
continue
}
2016-08-09 12:13:05 +00:00
a.callback.PostStore(alert, existing)
for _, l := range a.listeners {
select {
case l.alerts <- alert:
case <-l.done:
}
2016-08-09 12:13:05 +00:00
}
}
return nil
}
// count returns the number of non-resolved alerts we currently have stored filtered by the provided state.
func (a *Alerts) count(state types.AlertState) int {
a.mtx.Lock()
defer a.mtx.Unlock()
var count int
for _, alert := range a.alerts.List() {
if alert.Resolved() {
continue
}
status := a.marker.Status(alert.Fingerprint())
if status.State != state {
continue
}
count++
}
return count
}
type noopCallback struct{}
func (n noopCallback) PreStore(_ *types.Alert, _ bool) error { return nil }
func (n noopCallback) PostStore(_ *types.Alert, _ bool) {}
func (n noopCallback) PostDelete(_ *types.Alert) {}