5
0
mirror of https://github.com/cwinfo/matterbridge.git synced 2024-11-24 15:31:36 +00:00
matterbridge/vendor/github.com/jpillora/backoff/backoff.go

101 lines
2.4 KiB
Go
Raw Normal View History

2017-03-25 19:45:10 +00:00
// Package backoff provides an exponential-backoff implementation.
2016-04-10 21:39:38 +00:00
package backoff
import (
"math"
"math/rand"
2020-01-09 20:02:56 +00:00
"sync/atomic"
2016-04-10 21:39:38 +00:00
"time"
)
2017-03-25 19:45:10 +00:00
// Backoff is a time.Duration counter, starting at Min. After every call to
// the Duration method the current timing is multiplied by Factor, but it
// never exceeds Max.
2016-04-10 21:39:38 +00:00
//
2017-03-25 19:45:10 +00:00
// Backoff is not generally concurrent-safe, but the ForAttempt method can
// be used concurrently.
2016-04-10 21:39:38 +00:00
type Backoff struct {
2020-01-09 20:02:56 +00:00
attempt uint64
// Factor is the multiplying factor for each increment step
Factor float64
// Jitter eases contention by randomizing backoff steps
2016-04-10 21:39:38 +00:00
Jitter bool
2020-01-09 20:02:56 +00:00
// Min and Max are the minimum and maximum values of the counter
2016-04-10 21:39:38 +00:00
Min, Max time.Duration
}
2017-03-25 19:45:10 +00:00
// Duration returns the duration for the current attempt before incrementing
// the attempt counter. See ForAttempt.
2016-04-10 21:39:38 +00:00
func (b *Backoff) Duration() time.Duration {
2020-01-09 20:02:56 +00:00
d := b.ForAttempt(float64(atomic.AddUint64(&b.attempt, 1) - 1))
2016-04-10 21:39:38 +00:00
return d
}
2017-03-25 19:45:10 +00:00
const maxInt64 = float64(math.MaxInt64 - 512)
2016-04-10 21:39:38 +00:00
// ForAttempt returns the duration for a specific attempt. This is useful if
// you have a large number of independent Backoffs, but don't want use
// unnecessary memory storing the Backoff parameters per Backoff. The first
// attempt should be 0.
//
2017-03-25 19:45:10 +00:00
// ForAttempt is concurrent-safe.
2016-04-10 21:39:38 +00:00
func (b *Backoff) ForAttempt(attempt float64) time.Duration {
2017-03-25 19:45:10 +00:00
// Zero-values are nonsensical, so we use
// them to apply defaults
min := b.Min
if min <= 0 {
min = 100 * time.Millisecond
}
max := b.Max
if max <= 0 {
max = 10 * time.Second
2016-04-10 21:39:38 +00:00
}
2017-03-25 19:45:10 +00:00
if min >= max {
// short-circuit
return max
2016-04-10 21:39:38 +00:00
}
2017-03-25 19:45:10 +00:00
factor := b.Factor
if factor <= 0 {
factor = 2
2016-04-10 21:39:38 +00:00
}
//calculate this duration
2017-03-25 19:45:10 +00:00
minf := float64(min)
durf := minf * math.Pow(factor, attempt)
if b.Jitter {
durf = rand.Float64()*(durf-minf) + minf
}
//ensure float64 wont overflow int64
if durf > maxInt64 {
return max
2016-04-10 21:39:38 +00:00
}
2017-03-25 19:45:10 +00:00
dur := time.Duration(durf)
//keep within bounds
if dur < min {
return min
}
if dur > max {
2017-03-25 19:45:10 +00:00
return max
2016-04-10 21:39:38 +00:00
}
2017-03-25 19:45:10 +00:00
return dur
2016-04-10 21:39:38 +00:00
}
2017-03-25 19:45:10 +00:00
// Reset restarts the current attempt counter at zero.
2016-04-10 21:39:38 +00:00
func (b *Backoff) Reset() {
2020-01-09 20:02:56 +00:00
atomic.StoreUint64(&b.attempt, 0)
2017-03-25 19:45:10 +00:00
}
// Attempt returns the current attempt counter value.
func (b *Backoff) Attempt() float64 {
2020-01-09 20:02:56 +00:00
return float64(atomic.LoadUint64(&b.attempt))
2016-04-10 21:39:38 +00:00
}
// Copy returns a backoff with equals constraints as the original
func (b *Backoff) Copy() *Backoff {
return &Backoff{
Factor: b.Factor,
Jitter: b.Jitter,
Min: b.Min,
Max: b.Max,
}
}