-
Notifications
You must be signed in to change notification settings - Fork 660
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add a everlasting binomially increasing retry.
This fixes an issue in an application `mc` when during `mc mirror -w` it is expected that the underlying call for ListenBucketNotification should run continously. In case if server crashes, client should retry and wait for the server. Fixes minio/mc#1889
- Loading branch information
1 parent
675b291
commit c692048
Showing
2 changed files
with
63 additions
and
14 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,52 @@ | ||
package minio | ||
|
||
import "time" | ||
|
||
// newRetryTimerContinous creates a timer with exponentially increasing delays forever. | ||
func (c Client) newRetryTimerContinous(unit time.Duration, cap time.Duration, jitter float64, doneCh chan struct{}) <-chan int { | ||
attemptCh := make(chan int) | ||
|
||
// normalize jitter to the range [0, 1.0] | ||
if jitter < NoJitter { | ||
jitter = NoJitter | ||
} | ||
if jitter > MaxJitter { | ||
jitter = MaxJitter | ||
} | ||
|
||
// computes the exponential backoff duration according to | ||
// https://www.awsarchitectureblog.com/2015/03/backoff.html | ||
exponentialBackoffWait := func(attempt int) time.Duration { | ||
// 1<<uint(attempt) below could overflow, so limit the value of attempt | ||
maxAttempt := 30 | ||
if attempt > maxAttempt { | ||
attempt = maxAttempt | ||
} | ||
//sleep = random_between(0, min(cap, base * 2 ** attempt)) | ||
sleep := unit * time.Duration(1<<uint(attempt)) | ||
if sleep > cap { | ||
sleep = cap | ||
} | ||
if jitter != NoJitter { | ||
sleep -= time.Duration(c.random.Float64() * float64(sleep) * jitter) | ||
} | ||
return sleep | ||
} | ||
|
||
go func() { | ||
defer close(attemptCh) | ||
var nextBackoff int | ||
for { | ||
select { | ||
// Attempts starts. | ||
case attemptCh <- nextBackoff: | ||
nextBackoff++ | ||
case <-doneCh: | ||
// Stop the routine. | ||
return | ||
} | ||
time.Sleep(exponentialBackoffWait(nextBackoff)) | ||
} | ||
}() | ||
return attemptCh | ||
} |