don't leave WaitForState goroutine running
Make sure that we can cancel the WaitForState refresh loop when reaching a timeout, otherwise it may run indefinitely. There's no need to try and store and read the Result concurrently, just pass the value over a channel.
This commit is contained in:
parent
4a782583b6
commit
af5e22cf94
|
@ -2,7 +2,6 @@ package resource
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"log"
|
"log"
|
||||||
"sync/atomic"
|
|
||||||
"time"
|
"time"
|
||||||
)
|
)
|
||||||
|
|
||||||
|
@ -62,33 +61,45 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
conf.ContinuousTargetOccurence = 1
|
conf.ContinuousTargetOccurence = 1
|
||||||
}
|
}
|
||||||
|
|
||||||
// We can't safely read the result values if we timeout, so store them in
|
|
||||||
// an atomic.Value
|
|
||||||
type Result struct {
|
type Result struct {
|
||||||
Result interface{}
|
Result interface{}
|
||||||
State string
|
State string
|
||||||
Error error
|
Error error
|
||||||
|
Done bool
|
||||||
}
|
}
|
||||||
var lastResult atomic.Value
|
|
||||||
lastResult.Store(Result{})
|
|
||||||
|
|
||||||
doneCh := make(chan struct{})
|
// read ever result from the refresh loop, waiting for a positive result.Done
|
||||||
|
resCh := make(chan Result, 1)
|
||||||
|
// cancellation channel for the refresh loop
|
||||||
|
cancelCh := make(chan struct{})
|
||||||
|
|
||||||
go func() {
|
go func() {
|
||||||
defer close(doneCh)
|
defer close(resCh)
|
||||||
|
|
||||||
// Wait for the delay
|
|
||||||
time.Sleep(conf.Delay)
|
time.Sleep(conf.Delay)
|
||||||
|
|
||||||
wait := 100 * time.Millisecond
|
// start with 0 delay for the first loop
|
||||||
|
var wait time.Duration
|
||||||
|
|
||||||
for {
|
for {
|
||||||
|
// wait and watch for cancellation
|
||||||
|
select {
|
||||||
|
case <-cancelCh:
|
||||||
|
return
|
||||||
|
case <-time.After(wait):
|
||||||
|
// first round had no wait
|
||||||
|
if wait == 0 {
|
||||||
|
wait = 100 * time.Millisecond
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
res, currentState, err := conf.Refresh()
|
res, currentState, err := conf.Refresh()
|
||||||
result := Result{
|
result := Result{
|
||||||
Result: res,
|
Result: res,
|
||||||
State: currentState,
|
State: currentState,
|
||||||
Error: err,
|
Error: err,
|
||||||
}
|
}
|
||||||
lastResult.Store(result)
|
resCh <- result
|
||||||
|
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return
|
return
|
||||||
|
@ -98,6 +109,8 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
if res == nil && len(conf.Target) == 0 {
|
if res == nil && len(conf.Target) == 0 {
|
||||||
targetOccurence += 1
|
targetOccurence += 1
|
||||||
if conf.ContinuousTargetOccurence == targetOccurence {
|
if conf.ContinuousTargetOccurence == targetOccurence {
|
||||||
|
result.Done = true
|
||||||
|
resCh <- result
|
||||||
return
|
return
|
||||||
} else {
|
} else {
|
||||||
continue
|
continue
|
||||||
|
@ -113,7 +126,7 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
LastError: err,
|
LastError: err,
|
||||||
Retries: notfoundTick,
|
Retries: notfoundTick,
|
||||||
}
|
}
|
||||||
lastResult.Store(result)
|
resCh <- result
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
|
@ -126,6 +139,8 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
found = true
|
found = true
|
||||||
targetOccurence += 1
|
targetOccurence += 1
|
||||||
if conf.ContinuousTargetOccurence == targetOccurence {
|
if conf.ContinuousTargetOccurence == targetOccurence {
|
||||||
|
result.Done = true
|
||||||
|
resCh <- result
|
||||||
return
|
return
|
||||||
} else {
|
} else {
|
||||||
continue
|
continue
|
||||||
|
@ -147,7 +162,7 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
State: result.State,
|
State: result.State,
|
||||||
ExpectedState: conf.Target,
|
ExpectedState: conf.Target,
|
||||||
}
|
}
|
||||||
lastResult.Store(result)
|
resCh <- result
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -162,10 +177,6 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
} else if wait > 10*time.Second {
|
} else if wait > 10*time.Second {
|
||||||
wait = 10 * time.Second
|
wait = 10 * time.Second
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
log.Printf("[TRACE] Waiting %s before next try", wait)
|
|
||||||
time.Sleep(wait)
|
|
||||||
|
|
||||||
// Wait between refreshes using exponential backoff, except when
|
// Wait between refreshes using exponential backoff, except when
|
||||||
// waiting for the target state to reoccur.
|
// waiting for the target state to reoccur.
|
||||||
|
@ -173,19 +184,39 @@ func (conf *StateChangeConf) WaitForState() (interface{}, error) {
|
||||||
wait *= 2
|
wait *= 2
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
log.Printf("[TRACE] Waiting %s before next try", wait)
|
||||||
|
}
|
||||||
}()
|
}()
|
||||||
|
|
||||||
|
// store the last value result from the refresh loop
|
||||||
|
lastResult := Result{}
|
||||||
|
|
||||||
|
timeout := time.After(conf.Timeout)
|
||||||
|
for {
|
||||||
select {
|
select {
|
||||||
case <-doneCh:
|
case r, ok := <-resCh:
|
||||||
r := lastResult.Load().(Result)
|
// channel closed, so return the last result
|
||||||
|
if !ok {
|
||||||
|
return lastResult.Result, lastResult.Error
|
||||||
|
}
|
||||||
|
|
||||||
|
// we reached the intended state
|
||||||
|
if r.Done {
|
||||||
return r.Result, r.Error
|
return r.Result, r.Error
|
||||||
case <-time.After(conf.Timeout):
|
}
|
||||||
r := lastResult.Load().(Result)
|
|
||||||
|
// still waiting, store the last result
|
||||||
|
lastResult = r
|
||||||
|
|
||||||
|
case <-timeout:
|
||||||
|
close(cancelCh)
|
||||||
return nil, &TimeoutError{
|
return nil, &TimeoutError{
|
||||||
LastError: r.Error,
|
LastError: lastResult.Error,
|
||||||
LastState: r.State,
|
LastState: lastResult.State,
|
||||||
Timeout: conf.Timeout,
|
Timeout: conf.Timeout,
|
||||||
ExpectedState: conf.Target,
|
ExpectedState: conf.Target,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
Loading…
Reference in New Issue