-
Notifications
You must be signed in to change notification settings - Fork 270
/
azure_retry.go
233 lines (204 loc) · 6.91 KB
/
azure_retry.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
/*
Copyright 2020 The Kubernetes Authors.
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
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 retry
import (
"html"
"math/rand"
"net/http"
"strings"
"time"
"github.com/Azure/go-autorest/autorest"
"github.com/Azure/go-autorest/autorest/mocks"
"k8s.io/klog/v2"
)
// Ensure package autorest/mocks is imported and vendored.
var _ autorest.Sender = mocks.NewSender()
// Backoff holds parameters applied to a Backoff function.
type Backoff struct {
// The initial duration.
Duration time.Duration
// Duration is multiplied by factor each iteration, if factor is not zero
// and the limits imposed by Steps and Cap have not been reached.
// Should not be negative.
// The jitter does not contribute to the updates to the duration parameter.
Factor float64
// The sleep at each iteration is the duration plus an additional
// amount chosen uniformly at random from the interval between
// zero and `jitter*duration`.
Jitter float64
// The remaining number of iterations in which the duration
// parameter may change (but progress can be stopped earlier by
// hitting the cap). If not positive, the duration is not
// changed. Used for exponential backoff in combination with
// Factor and Cap.
Steps int
// A limit on revised values of the duration parameter. If a
// multiplication by the factor parameter would make the duration
// exceed the cap then the duration is set to the cap and the
// steps parameter is set to zero.
Cap time.Duration
// The errors indicate that the request shouldn't do more retrying.
NonRetriableErrors []string
// The RetriableHTTPStatusCodes indicates that the HTTPStatusCode should do more retrying.
RetriableHTTPStatusCodes []int
}
// NewBackoff creates a new Backoff.
func NewBackoff(duration time.Duration, factor float64, jitter float64, steps int, cap time.Duration) *Backoff {
return &Backoff{
Duration: duration,
Factor: factor,
Jitter: jitter,
Steps: steps,
Cap: cap,
}
}
// WithNonRetriableErrors returns a new *Backoff with NonRetriableErrors assigned.
func (b *Backoff) WithNonRetriableErrors(errs []string) *Backoff {
newBackoff := *b
newBackoff.NonRetriableErrors = errs
return &newBackoff
}
// WithRetriableHTTPStatusCodes returns a new *Backoff with RetriableHTTPStatusCode assigned.
func (b *Backoff) WithRetriableHTTPStatusCodes(httpStatusCodes []int) *Backoff {
newBackoff := *b
newBackoff.RetriableHTTPStatusCodes = httpStatusCodes
return &newBackoff
}
// isNonRetriableError returns true if the Error is one of NonRetriableErrors.
func (b *Backoff) isNonRetriableError(rerr *Error) bool {
if rerr == nil {
return false
}
for _, err := range b.NonRetriableErrors {
if strings.Contains(rerr.RawError.Error(), err) {
return true
}
}
return false
}
// Step (1) returns an amount of time to sleep determined by the
// original Duration and Jitter and (2) mutates the provided Backoff
// to update its Steps and Duration.
func (b *Backoff) Step() time.Duration {
if b.Steps < 1 {
if b.Jitter > 0 {
return jitter(b.Duration, b.Jitter)
}
return b.Duration
}
b.Steps--
duration := b.Duration
// calculate the next step
if b.Factor != 0 {
b.Duration = time.Duration(float64(b.Duration) * b.Factor)
if b.Cap > 0 && b.Duration > b.Cap {
b.Duration = b.Cap
b.Steps = 0
}
}
if b.Jitter > 0 {
duration = jitter(duration, b.Jitter)
}
return duration
}
// Jitter returns a time.Duration between duration and duration + maxFactor *
// duration.
//
// This allows clients to avoid converging on periodic behavior. If maxFactor
// is 0.0, a suggested default value will be chosen.
func jitter(duration time.Duration, maxFactor float64) time.Duration {
if maxFactor <= 0.0 {
maxFactor = 1.0
}
wait := duration + time.Duration(rand.Float64()*maxFactor*float64(duration)) // #nosec G404
return wait
}
// DoExponentialBackoffRetry represents an autorest.SendDecorator with backoff retry.
func DoExponentialBackoffRetry(backoff *Backoff) autorest.SendDecorator {
return func(s autorest.Sender) autorest.Sender {
return autorest.SenderFunc(func(r *http.Request) (*http.Response, error) {
return doBackoffRetry(s, r, *backoff)
})
}
}
// doBackoffRetry does the backoff retries for the request.
// backoff is a retry policy here we implicitly copy the backoff policy when args is passed to function.
func doBackoffRetry(s autorest.Sender, r *http.Request, backoff Backoff) (resp *http.Response, err error) {
rr := autorest.NewRetriableRequest(r)
// Increment to add the first call (attempts denotes number of retries)
for backoff.Steps > 0 {
err = rr.Prepare()
if err != nil {
return
}
resp, err = s.Do(rr.Request())
rerr := GetError(resp, err)
// Abort retries in the following scenarios:
// 1) request succeed
// 2) request has been throttled
// 3) request is not retriable or contains non-retriable errors
// 4) request has completed all the retry steps
if rerr == nil {
return resp, nil
}
if rerr.IsThrottled() {
return resp, rerr.RawError
}
if !rerr.Retriable {
if IsInHTTPStatusCodeSet(rerr, backoff.RetriableHTTPStatusCodes) || isInErrorsSet(rerr, backoff.NonRetriableErrors) {
rerr.Retriable = true
} else {
return resp, rerr.RawError
}
}
if backoff.Steps == 1 {
return resp, rerr.RawError
}
if !delayForBackOff(&backoff, r.Context().Done()) {
if r.Context().Err() != nil {
return resp, r.Context().Err()
}
return resp, rerr.RawError
}
drainErr := autorest.DrainResponseBody(resp)
if drainErr != nil {
klog.V(3).ErrorS(drainErr, "Failed to drain response body")
}
klog.V(3).Infof("Backoff retrying %s %q with error %v", r.Method, html.EscapeString(r.URL.String()), err)
}
return resp, err
}
// delayForBackOff invokes time.After for the supplied backoff duration.
// The delay may be canceled by closing the passed channel. If terminated early, returns false.
func delayForBackOff(backoff *Backoff, cancel <-chan struct{}) bool {
d := backoff.Step()
select {
case <-time.After(d):
return true
case <-cancel:
return false
}
}
// DoFilterOutNonRetriableError decorator works with autorest.DoRetryForAttempts
func DoFilterOutNonRetriableError(shouldRetry func(rerr *Error) bool) autorest.SendDecorator {
return func(s autorest.Sender) autorest.Sender {
return autorest.SenderFunc(func(r *http.Request) (*http.Response, error) {
resp, err := s.Do(r)
rerr := GetError(resp, err)
if rerr != nil && shouldRetry != nil && shouldRetry(rerr) {
return resp, rerr.RawError
}
return resp, nil
})
}
}