2017-06-20 04:34:11 +00:00
|
|
|
package api
|
|
|
|
|
|
|
|
import (
|
|
|
|
"errors"
|
2017-06-26 21:21:58 +00:00
|
|
|
"math/rand"
|
2017-06-20 04:34:11 +00:00
|
|
|
"sync"
|
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
2017-06-20 22:57:34 +00:00
|
|
|
var (
|
|
|
|
ErrRenewerMissingInput = errors.New("missing input to renewer")
|
|
|
|
ErrRenewerMissingSecret = errors.New("missing secret to renew")
|
|
|
|
ErrRenewerNotRenewable = errors.New("secret is not renewable")
|
|
|
|
ErrRenewerNoSecretData = errors.New("returned empty secret data")
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2017-06-29 00:19:00 +00:00
|
|
|
// DefaultRenewerRenewBuffer is the default size of the buffer for renew
|
|
|
|
// messages on the channel.
|
|
|
|
DefaultRenewerRenewBuffer = 5
|
2017-06-20 22:57:34 +00:00
|
|
|
)
|
2017-06-20 04:34:11 +00:00
|
|
|
|
|
|
|
// Renewer is a process for renewing a secret.
|
|
|
|
//
|
|
|
|
// renewer, err := client.NewRenewer(&RenewerInput{
|
|
|
|
// Secret: mySecret,
|
|
|
|
// })
|
|
|
|
// go renewer.Renew()
|
|
|
|
// defer renewer.Stop()
|
|
|
|
//
|
|
|
|
// for {
|
|
|
|
// select {
|
2017-07-07 21:15:43 +00:00
|
|
|
// case err := <-renewer.DoneCh():
|
2017-06-20 04:34:11 +00:00
|
|
|
// if err != nil {
|
|
|
|
// log.Fatal(err)
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// // Renewal is now over
|
2017-07-07 21:15:43 +00:00
|
|
|
// case renewal := <-renewer.RenewCh():
|
2017-06-20 23:06:08 +00:00
|
|
|
// log.Printf("Successfully renewed: %#v", renewal)
|
2017-06-20 04:34:11 +00:00
|
|
|
// }
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// The `DoneCh` will return if renewal fails or if the remaining lease duration
|
|
|
|
// after a renewal is less than or equal to the grace (in number of seconds). In
|
|
|
|
// both cases, the caller should attempt a re-read of the secret. Clients should
|
|
|
|
// check the return value of the channel to see if renewal was successful.
|
|
|
|
type Renewer struct {
|
2017-06-29 00:13:24 +00:00
|
|
|
l sync.Mutex
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2017-12-18 15:09:59 +00:00
|
|
|
client *Client
|
|
|
|
secret *Secret
|
|
|
|
grace time.Duration
|
|
|
|
random *rand.Rand
|
|
|
|
increment int
|
|
|
|
doneCh chan error
|
|
|
|
renewCh chan *RenewOutput
|
2017-06-20 04:34:11 +00:00
|
|
|
|
|
|
|
stopped bool
|
|
|
|
stopCh chan struct{}
|
|
|
|
}
|
|
|
|
|
2017-06-20 22:57:34 +00:00
|
|
|
// RenewerInput is used as input to the renew function.
|
|
|
|
type RenewerInput struct {
|
|
|
|
// Secret is the secret to renew
|
|
|
|
Secret *Secret
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2018-05-09 14:02:06 +00:00
|
|
|
// DEPRECATED: this does not do anything.
|
2017-06-20 22:57:34 +00:00
|
|
|
Grace time.Duration
|
2017-06-27 00:55:54 +00:00
|
|
|
|
|
|
|
// Rand is the randomizer to use for underlying randomization. If not
|
|
|
|
// provided, one will be generated and seeded automatically. If provided, it
|
|
|
|
// is assumed to have already been seeded.
|
|
|
|
Rand *rand.Rand
|
2017-06-29 00:19:00 +00:00
|
|
|
|
|
|
|
// RenewBuffer is the size of the buffered channel where renew messages are
|
|
|
|
// dispatched.
|
|
|
|
RenewBuffer int
|
2017-12-18 15:09:59 +00:00
|
|
|
|
2017-12-18 15:11:24 +00:00
|
|
|
// The new TTL, in seconds, that should be set on the lease. The TTL set
|
|
|
|
// here may or may not be honored by the vault server, based on Vault
|
|
|
|
// configuration or any associated max TTL values.
|
2017-12-18 15:09:59 +00:00
|
|
|
Increment int
|
2017-06-20 22:57:34 +00:00
|
|
|
}
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2017-06-20 23:06:08 +00:00
|
|
|
// RenewOutput is the metadata returned to the client (if it's listening) to
|
|
|
|
// renew messages.
|
|
|
|
type RenewOutput struct {
|
|
|
|
// RenewedAt is the timestamp when the renewal took place (UTC).
|
|
|
|
RenewedAt time.Time
|
|
|
|
|
|
|
|
// Secret is the underlying renewal data. It's the same struct as all data
|
|
|
|
// that is returned from Vault, but since this is renewal data, it will not
|
|
|
|
// usually include the secret itself.
|
|
|
|
Secret *Secret
|
|
|
|
}
|
|
|
|
|
2017-06-20 04:34:11 +00:00
|
|
|
// NewRenewer creates a new renewer from the given input.
|
|
|
|
func (c *Client) NewRenewer(i *RenewerInput) (*Renewer, error) {
|
|
|
|
if i == nil {
|
|
|
|
return nil, ErrRenewerMissingInput
|
|
|
|
}
|
|
|
|
|
|
|
|
secret := i.Secret
|
|
|
|
if secret == nil {
|
|
|
|
return nil, ErrRenewerMissingSecret
|
|
|
|
}
|
|
|
|
|
2017-06-27 00:55:54 +00:00
|
|
|
random := i.Rand
|
|
|
|
if random == nil {
|
|
|
|
random = rand.New(rand.NewSource(int64(time.Now().Nanosecond())))
|
|
|
|
}
|
|
|
|
|
2017-06-29 00:19:00 +00:00
|
|
|
renewBuffer := i.RenewBuffer
|
|
|
|
if renewBuffer == 0 {
|
|
|
|
renewBuffer = DefaultRenewerRenewBuffer
|
|
|
|
}
|
|
|
|
|
2017-06-20 04:34:11 +00:00
|
|
|
return &Renewer{
|
2017-12-18 15:09:59 +00:00
|
|
|
client: c,
|
|
|
|
secret: secret,
|
|
|
|
increment: i.Increment,
|
|
|
|
random: random,
|
|
|
|
doneCh: make(chan error, 1),
|
|
|
|
renewCh: make(chan *RenewOutput, renewBuffer),
|
2017-06-20 04:34:11 +00:00
|
|
|
|
|
|
|
stopped: false,
|
2017-06-20 22:57:05 +00:00
|
|
|
stopCh: make(chan struct{}),
|
2017-06-20 04:34:11 +00:00
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// DoneCh returns the channel where the renewer will publish when renewal stops.
|
|
|
|
// If there is an error, this will be an error.
|
|
|
|
func (r *Renewer) DoneCh() <-chan error {
|
|
|
|
return r.doneCh
|
|
|
|
}
|
|
|
|
|
2017-06-20 23:06:08 +00:00
|
|
|
// RenewCh is a channel that receives a message when a successful renewal takes
|
|
|
|
// place and includes metadata about the renewal.
|
|
|
|
func (r *Renewer) RenewCh() <-chan *RenewOutput {
|
|
|
|
return r.renewCh
|
2017-06-20 04:34:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Stop stops the renewer.
|
|
|
|
func (r *Renewer) Stop() {
|
2017-06-29 00:13:24 +00:00
|
|
|
r.l.Lock()
|
2017-06-20 04:34:11 +00:00
|
|
|
if !r.stopped {
|
|
|
|
close(r.stopCh)
|
|
|
|
r.stopped = true
|
|
|
|
}
|
2017-06-29 00:13:24 +00:00
|
|
|
r.l.Unlock()
|
2017-06-20 04:34:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Renew starts a background process for renewing this secret. When the secret
|
2018-03-08 16:01:07 +00:00
|
|
|
// has auth data, this attempts to renew the auth (token). When the secret has
|
|
|
|
// a lease, this attempts to renew the lease.
|
2017-06-20 04:34:11 +00:00
|
|
|
func (r *Renewer) Renew() {
|
2017-06-29 00:16:28 +00:00
|
|
|
var result error
|
2017-06-20 04:34:11 +00:00
|
|
|
if r.secret.Auth != nil {
|
2017-06-29 00:16:28 +00:00
|
|
|
result = r.renewAuth()
|
2017-06-20 04:34:11 +00:00
|
|
|
} else {
|
2017-06-29 00:16:28 +00:00
|
|
|
result = r.renewLease()
|
|
|
|
}
|
|
|
|
|
2018-05-07 20:13:02 +00:00
|
|
|
r.doneCh <- result
|
2017-06-20 04:34:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// renewAuth is a helper for renewing authentication.
|
|
|
|
func (r *Renewer) renewAuth() error {
|
|
|
|
if !r.secret.Auth.Renewable || r.secret.Auth.ClientToken == "" {
|
|
|
|
return ErrRenewerNotRenewable
|
|
|
|
}
|
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
priorDuration := time.Duration(r.secret.Auth.LeaseDuration) * time.Second
|
|
|
|
r.calculateGrace(priorDuration)
|
|
|
|
|
2017-06-20 04:34:11 +00:00
|
|
|
client, token := r.client, r.secret.Auth.ClientToken
|
|
|
|
|
|
|
|
for {
|
|
|
|
// Check if we are stopped.
|
|
|
|
select {
|
|
|
|
case <-r.stopCh:
|
|
|
|
return nil
|
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
|
|
|
// Renew the auth.
|
2018-02-05 17:22:49 +00:00
|
|
|
renewal, err := client.Auth().Token().RenewTokenAsSelf(token, r.increment)
|
2017-06-20 04:34:11 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Push a message that a renewal took place.
|
|
|
|
select {
|
2017-06-20 23:06:08 +00:00
|
|
|
case r.renewCh <- &RenewOutput{time.Now().UTC(), renewal}:
|
2017-06-20 04:34:11 +00:00
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
|
|
|
// Somehow, sometimes, this happens.
|
|
|
|
if renewal == nil || renewal.Auth == nil {
|
|
|
|
return ErrRenewerNoSecretData
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do nothing if we are not renewable
|
|
|
|
if !renewal.Auth.Renewable {
|
|
|
|
return ErrRenewerNotRenewable
|
|
|
|
}
|
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
// Grab the lease duration
|
2017-06-20 22:55:50 +00:00
|
|
|
leaseDuration := time.Duration(renewal.Auth.LeaseDuration) * time.Second
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
// We keep evaluating a new grace period so long as the lease is
|
|
|
|
// extending. Once it stops extending, we've hit the max and need to
|
|
|
|
// rely on the grace duration.
|
|
|
|
if leaseDuration > priorDuration {
|
|
|
|
r.calculateGrace(leaseDuration)
|
|
|
|
}
|
|
|
|
priorDuration = leaseDuration
|
|
|
|
|
|
|
|
// The sleep duration is set to 2/3 of the current lease duration plus
|
|
|
|
// 1/3 of the current grace period, which adds jitter.
|
|
|
|
sleepDuration := time.Duration(float64(leaseDuration.Nanoseconds())*2/3 + float64(r.grace.Nanoseconds())/3)
|
|
|
|
|
|
|
|
// If we are within grace, return now; or, if the amount of time we
|
|
|
|
// would sleep would land us in the grace period. This helps with short
|
|
|
|
// tokens; for example, you don't want a current lease duration of 4
|
|
|
|
// seconds, a grace period of 3 seconds, and end up sleeping for more
|
|
|
|
// than three of those seconds and having a very small budget of time
|
|
|
|
// to renew.
|
|
|
|
if leaseDuration <= r.grace || leaseDuration-sleepDuration <= r.grace {
|
2017-06-20 04:34:11 +00:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
select {
|
|
|
|
case <-r.stopCh:
|
|
|
|
return nil
|
2017-06-26 21:22:18 +00:00
|
|
|
case <-time.After(sleepDuration):
|
2017-06-20 04:34:11 +00:00
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// renewLease is a helper for renewing a lease.
|
|
|
|
func (r *Renewer) renewLease() error {
|
|
|
|
if !r.secret.Renewable || r.secret.LeaseID == "" {
|
|
|
|
return ErrRenewerNotRenewable
|
|
|
|
}
|
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
priorDuration := time.Duration(r.secret.LeaseDuration) * time.Second
|
|
|
|
r.calculateGrace(priorDuration)
|
|
|
|
|
2017-06-20 04:34:11 +00:00
|
|
|
client, leaseID := r.client, r.secret.LeaseID
|
|
|
|
|
|
|
|
for {
|
|
|
|
// Check if we are stopped.
|
|
|
|
select {
|
|
|
|
case <-r.stopCh:
|
|
|
|
return nil
|
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
|
|
|
// Renew the lease.
|
2017-12-18 15:09:59 +00:00
|
|
|
renewal, err := client.Sys().Renew(leaseID, r.increment)
|
2017-06-20 04:34:11 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Push a message that a renewal took place.
|
|
|
|
select {
|
2017-06-20 23:06:08 +00:00
|
|
|
case r.renewCh <- &RenewOutput{time.Now().UTC(), renewal}:
|
2017-06-20 04:34:11 +00:00
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
|
|
|
// Somehow, sometimes, this happens.
|
|
|
|
if renewal == nil {
|
|
|
|
return ErrRenewerNoSecretData
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do nothing if we are not renewable
|
|
|
|
if !renewal.Renewable {
|
|
|
|
return ErrRenewerNotRenewable
|
|
|
|
}
|
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
// Grab the lease duration
|
2017-06-20 22:55:50 +00:00
|
|
|
leaseDuration := time.Duration(renewal.LeaseDuration) * time.Second
|
2017-06-20 04:34:11 +00:00
|
|
|
|
2018-03-19 19:48:24 +00:00
|
|
|
// We keep evaluating a new grace period so long as the lease is
|
|
|
|
// extending. Once it stops extending, we've hit the max and need to
|
|
|
|
// rely on the grace duration.
|
|
|
|
if leaseDuration > priorDuration {
|
|
|
|
r.calculateGrace(leaseDuration)
|
|
|
|
}
|
|
|
|
priorDuration = leaseDuration
|
|
|
|
|
|
|
|
// The sleep duration is set to 2/3 of the current lease duration plus
|
|
|
|
// 1/3 of the current grace period, which adds jitter.
|
|
|
|
sleepDuration := time.Duration(float64(leaseDuration.Nanoseconds())*2/3 + float64(r.grace.Nanoseconds())/3)
|
|
|
|
|
|
|
|
// If we are within grace, return now; or, if the amount of time we
|
|
|
|
// would sleep would land us in the grace period. This helps with short
|
|
|
|
// tokens; for example, you don't want a current lease duration of 4
|
|
|
|
// seconds, a grace period of 3 seconds, and end up sleeping for more
|
|
|
|
// than three of those seconds and having a very small budget of time
|
|
|
|
// to renew.
|
|
|
|
if leaseDuration <= r.grace || leaseDuration-sleepDuration <= r.grace {
|
2017-06-20 04:34:11 +00:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
select {
|
|
|
|
case <-r.stopCh:
|
|
|
|
return nil
|
2017-06-26 21:22:18 +00:00
|
|
|
case <-time.After(sleepDuration):
|
2017-06-20 04:34:11 +00:00
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-06-26 21:22:18 +00:00
|
|
|
|
|
|
|
// sleepDuration calculates the time to sleep given the base lease duration. The
|
|
|
|
// base is the resulting lease duration. It will be reduced to 1/3 and
|
|
|
|
// multiplied by a random float between 0.0 and 1.0. This extra randomness
|
|
|
|
// prevents multiple clients from all trying to renew simultaneously.
|
2017-06-27 00:55:54 +00:00
|
|
|
func (r *Renewer) sleepDuration(base time.Duration) time.Duration {
|
2017-06-26 21:22:18 +00:00
|
|
|
sleep := float64(base)
|
|
|
|
|
|
|
|
// Renew at 1/3 the remaining lease. This will give us an opportunity to retry
|
|
|
|
// at least one more time should the first renewal fail.
|
|
|
|
sleep = sleep / 3.0
|
|
|
|
|
|
|
|
// Use a randomness so many clients do not hit Vault simultaneously.
|
2017-07-11 23:05:04 +00:00
|
|
|
sleep = sleep * (r.random.Float64() + 1) / 2.0
|
2017-06-26 21:22:18 +00:00
|
|
|
|
2017-07-11 23:05:04 +00:00
|
|
|
return time.Duration(sleep)
|
2017-06-26 21:22:18 +00:00
|
|
|
}
|
2018-03-19 19:48:24 +00:00
|
|
|
|
|
|
|
// calculateGrace calculates the grace period based on a reasonable set of
|
|
|
|
// assumptions given the total lease time; it also adds some jitter to not have
|
|
|
|
// clients be in sync.
|
|
|
|
func (r *Renewer) calculateGrace(leaseDuration time.Duration) {
|
|
|
|
if leaseDuration == 0 {
|
|
|
|
r.grace = 0
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
leaseNanos := float64(leaseDuration.Nanoseconds())
|
|
|
|
jitterMax := 0.1 * leaseNanos
|
|
|
|
|
|
|
|
// For a given lease duration, we want to allow 80-90% of that to elapse,
|
|
|
|
// so the remaining amount is the grace period
|
|
|
|
r.grace = time.Duration(jitterMax) + time.Duration(uint64(r.random.Int63())%uint64(jitterMax))
|
|
|
|
}
|