-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathmultidns_test.go
More file actions
343 lines (302 loc) · 8.17 KB
/
Copy pathmultidns_test.go
File metadata and controls
343 lines (302 loc) · 8.17 KB
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
package multidns
import (
"context"
"errors"
"fmt"
"sync"
"sync/atomic"
"testing"
"time"
"github.com/miekg/dns"
)
// mockUpstream is a programmable stand-in for a real resolver.
type mockUpstream struct {
mu sync.Mutex
respond func(ctx context.Context, q *dns.Msg) (*dns.Msg, error)
calls atomic.Int64
closeErr error
}
func (m *mockUpstream) Exchange(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
m.calls.Add(1)
m.mu.Lock()
fn := m.respond
m.mu.Unlock()
if fn == nil {
return okAnswer(q), nil
}
return fn(ctx, q)
}
func (m *mockUpstream) Close() error { return m.closeErr }
func (m *mockUpstream) setRespond(fn func(ctx context.Context, q *dns.Msg) (*dns.Msg, error)) {
m.mu.Lock()
m.respond = fn
m.mu.Unlock()
}
func okAnswer(q *dns.Msg) *dns.Msg {
r := new(dns.Msg)
r.SetReply(q)
r.Rcode = dns.RcodeSuccess
return r
}
func refusedAnswer(q *dns.Msg) *dns.Msg {
r := new(dns.Msg)
r.SetReply(q)
r.Rcode = dns.RcodeRefused
return r
}
// addMock attaches a mockUpstream to the manager bypassing newUpstream so tests
// don't open real sockets. Holds m.mu like the real AddResolver, so the same
// lifecycle invariants are upheld (probeWG.Add cannot race with Close).
func addMock(t *testing.T, m *Manager, name string, mu *mockUpstream) string {
t.Helper()
cfg := ResolverConfig{
Name: name,
Protocol: ProtoUDP,
Address: "mock",
Timeout: 500 * time.Millisecond,
}
m.mu.Lock()
defer m.mu.Unlock()
if m.closed {
// Lifecycle race tests deliberately add after Close; treat as a
// no-op rather than failing.
return ""
}
id := fmt.Sprintf("r-%d", m.idSeq.Add(1))
rs := newResolverState(id, cfg, mu, &m.opts)
m.pool.add(rs)
m.startProbe(rs)
return id
}
func newQuery(name string) *dns.Msg {
q := new(dns.Msg)
q.SetQuestion(dns.Fqdn(name), dns.TypeA)
return q
}
func TestResolveSingleResolver(t *testing.T) {
m := New(Options{DefaultDeadline: time.Second})
defer m.Close()
mu := &mockUpstream{}
addMock(t, m, "a", mu)
resp, err := m.Resolve(context.Background(), newQuery("example.com"))
if err != nil {
t.Fatalf("Resolve: %v", err)
}
if resp == nil || resp.Rcode != dns.RcodeSuccess {
t.Fatalf("expected success, got %#v", resp)
}
if got := mu.calls.Load(); got != 1 {
t.Fatalf("expected 1 call, got %d", got)
}
}
func TestResolveFailoverOnError(t *testing.T) {
m := New(Options{DefaultDeadline: time.Second})
defer m.Close()
bad := &mockUpstream{}
bad.setRespond(func(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
return nil, errors.New("dial failed")
})
good := &mockUpstream{}
addMock(t, m, "bad", bad)
addMock(t, m, "good", good)
// Run several queries; round-robin guarantees the bad upstream is
// selected at least once, exercising failover. Every query must succeed.
for i := 0; i < 6; i++ {
resp, err := m.Resolve(context.Background(), newQuery("example.com"))
if err != nil {
t.Fatalf("Resolve: %v", err)
}
if resp.Rcode != dns.RcodeSuccess {
t.Fatalf("expected success, got %d", resp.Rcode)
}
}
if bad.calls.Load() < 1 || good.calls.Load() < 1 {
t.Fatalf("expected both upstreams to be hit (bad=%d good=%d)", bad.calls.Load(), good.calls.Load())
}
}
func TestResolveDeadlineHonored(t *testing.T) {
m := New(Options{DefaultDeadline: 60 * time.Millisecond})
defer m.Close()
slow := &mockUpstream{}
slow.setRespond(func(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
select {
case <-ctx.Done():
return nil, ctx.Err()
case <-time.After(200 * time.Millisecond):
return okAnswer(q), nil
}
})
addMock(t, m, "slow", slow)
start := time.Now()
_, err := m.Resolve(context.Background(), newQuery("example.com"))
elapsed := time.Since(start)
if err == nil {
t.Fatalf("expected deadline error")
}
if elapsed > 300*time.Millisecond {
t.Fatalf("call took too long: %v", elapsed)
}
}
func TestRateLimitTriggersThrottle(t *testing.T) {
m := New(Options{
DefaultDeadline: time.Second,
RateLimitFloorRPM: 6,
})
defer m.Close()
limited := &mockUpstream{}
limited.setRespond(func(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
return refusedAnswer(q), nil
})
id := addMock(t, m, "limited", limited)
// Drive enough successful "requests" then a REFUSED to trigger AIMD.
for i := 0; i < 5; i++ {
_, _ = m.Resolve(context.Background(), newQuery("example.com"))
}
stats := m.Stats()
var seen *ResolverStat
for i := range stats {
if stats[i].ID == id {
seen = &stats[i]
}
}
if seen == nil {
t.Fatalf("resolver not found in stats")
}
if seen.State != "rate_limited" {
t.Fatalf("expected rate_limited, got %q", seen.State)
}
if seen.CurrentRPMCap == 0 {
t.Fatalf("expected RPM cap to be set")
}
}
func TestProberRecoversDownResolver(t *testing.T) {
m := New(Options{
DefaultDeadline: 200 * time.Millisecond,
ProbeInterval: 30 * time.Millisecond,
DownAfterFailures: 2,
})
defer m.Close()
var failing atomic.Bool
failing.Store(true)
flappy := &mockUpstream{}
flappy.setRespond(func(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
if failing.Load() {
return nil, errors.New("network unreachable")
}
return okAnswer(q), nil
})
id := addMock(t, m, "flappy", flappy)
// Push it past DownAfterFailures by issuing a few queries.
for i := 0; i < 4; i++ {
_, _ = m.Resolve(context.Background(), newQuery("example.com"))
}
if got := getStateByID(m, id); got != "down" {
t.Fatalf("expected down, got %q", got)
}
// Heal the upstream and let the prober pick it up.
failing.Store(false)
deadline := time.Now().Add(time.Second)
for time.Now().Before(deadline) {
if getStateByID(m, id) == "healthy" {
return
}
time.Sleep(20 * time.Millisecond)
}
t.Fatalf("prober did not transition to healthy in time, state=%q", getStateByID(m, id))
}
func TestAddRemoveResolver(t *testing.T) {
m := New(Options{DefaultDeadline: 200 * time.Millisecond})
defer m.Close()
mu := &mockUpstream{}
id := addMock(t, m, "x", mu)
if len(m.Resolvers()) != 1 {
t.Fatalf("expected 1 resolver")
}
if err := m.RemoveResolver(id); err != nil {
t.Fatalf("RemoveResolver: %v", err)
}
if len(m.Resolvers()) != 0 {
t.Fatalf("expected 0 resolvers after remove")
}
if _, err := m.Resolve(context.Background(), newQuery("example.com")); err == nil {
t.Fatalf("expected error from empty pool")
}
}
func TestNoResolversError(t *testing.T) {
m := New(Options{})
defer m.Close()
_, err := m.Resolve(context.Background(), newQuery("x.test"))
if !errors.Is(err, ErrNoResolvers) {
t.Fatalf("expected ErrNoResolvers, got %v", err)
}
}
func TestBadResponseDoesNotPenalise(t *testing.T) {
m := New(Options{DefaultDeadline: 200 * time.Millisecond})
defer m.Close()
mu := &mockUpstream{}
mu.setRespond(func(ctx context.Context, q *dns.Msg) (*dns.Msg, error) {
r := new(dns.Msg)
r.SetReply(q)
r.Rcode = dns.RcodeFormatError
return r, nil
})
id := addMock(t, m, "x", mu)
for i := 0; i < 5; i++ {
_, _ = m.Resolve(context.Background(), newQuery("x.test"))
}
if got := getStateByID(m, id); got != "healthy" {
t.Fatalf("expected healthy after FormErr, got %q", got)
}
}
func getStateByID(m *Manager, id string) string {
for _, s := range m.Stats() {
if s.ID == id {
return s.State
}
}
return ""
}
func TestSlidingCounter(t *testing.T) {
var c slidingCounter
now := time.Unix(1700000000, 0)
c.add(now, 3)
c.add(now.Add(2*time.Second), 5)
if got := c.sum(now.Add(2 * time.Second)); got != 8 {
t.Fatalf("sum: got %d want 8", got)
}
if got := c.sum(now.Add(70 * time.Second)); got != 0 {
t.Fatalf("expired sum: got %d want 0", got)
}
}
func TestTokenBucket(t *testing.T) {
tb := newTokenBucket(60) // 1 per second
now := time.Unix(1700000000, 0)
consumed := 0
for i := 0; i < 100; i++ {
if tb.tryAcquire(now) {
consumed++
}
}
if consumed == 0 || consumed > 30 {
t.Fatalf("expected modest burst, got %d", consumed)
}
// After 60s we should be able to drain another full bucket.
consumed2 := 0
for i := 0; i < 100; i++ {
if tb.tryAcquire(now.Add(60 * time.Second)) {
consumed2++
}
}
if consumed2 == 0 {
t.Fatalf("refill did not happen")
}
}
func TestUncappedBucket(t *testing.T) {
tb := newTokenBucket(0)
now := time.Now()
for i := 0; i < 1000; i++ {
if !tb.tryAcquire(now) {
t.Fatalf("uncapped bucket should always permit")
}
}
}