forked from apache/cassandra-gocql-driver
-
Notifications
You must be signed in to change notification settings - Fork 0
/
policies_test.go
825 lines (717 loc) · 29.1 KB
/
policies_test.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
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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
// Copyright (c) 2015 The gocql Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package gocql
import (
"errors"
"fmt"
"net"
"sort"
"strings"
"testing"
"time"
"github.com/hailocab/go-hostpool"
)
// Tests of the round-robin host selection policy implementation
func TestRoundRobbin(t *testing.T) {
policy := RoundRobinHostPolicy()
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.IPv4(0, 0, 0, 1)},
{hostId: "1", connectAddress: net.IPv4(0, 0, 0, 2)},
}
for _, host := range hosts {
policy.AddHost(host)
}
got := make(map[string]bool)
it := policy.Pick(nil)
for h := it(); h != nil; h = it() {
id := h.Info().hostId
if got[id] {
t.Fatalf("got duplicate host: %v", id)
}
got[id] = true
}
if len(got) != len(hosts) {
t.Fatalf("expected %d hosts got %d", len(hosts), len(got))
}
}
// Tests of the token-aware host selection policy implementation with a
// round-robin host selection policy fallback.
func TestHostPolicy_TokenAware_SimpleStrategy(t *testing.T) {
const keyspace = "myKeyspace"
policy := TokenAwareHostPolicy(RoundRobinHostPolicy())
policyInternal := policy.(*tokenAwareHostPolicy)
policyInternal.getKeyspaceName = func() string { return keyspace }
policyInternal.getKeyspaceMetadata = func(ks string) (*KeyspaceMetadata, error) {
return nil, errors.New("not initalized")
}
query := &Query{routingInfo: &queryRoutingInfo{}}
query.getKeyspace = func() string { return keyspace }
iter := policy.Pick(nil)
if iter == nil {
t.Fatal("host iterator was nil")
}
actual := iter()
if actual != nil {
t.Fatalf("expected nil from iterator, but was %v", actual)
}
// set the hosts
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.IPv4(10, 0, 0, 1), tokens: []string{"00"}},
{hostId: "1", connectAddress: net.IPv4(10, 0, 0, 2), tokens: []string{"25"}},
{hostId: "2", connectAddress: net.IPv4(10, 0, 0, 3), tokens: []string{"50"}},
{hostId: "3", connectAddress: net.IPv4(10, 0, 0, 4), tokens: []string{"75"}},
}
for _, host := range &hosts {
policy.AddHost(host)
}
policy.SetPartitioner("OrderedPartitioner")
policyInternal.getKeyspaceMetadata = func(keyspaceName string) (*KeyspaceMetadata, error) {
if keyspaceName != keyspace {
return nil, fmt.Errorf("unknown keyspace: %s", keyspaceName)
}
return &KeyspaceMetadata{
Name: keyspace,
StrategyClass: "SimpleStrategy",
StrategyOptions: map[string]interface{}{
"class": "SimpleStrategy",
"replication_factor": 2,
},
}, nil
}
policy.KeyspaceChanged(KeyspaceUpdateEvent{Keyspace: keyspace})
// The SimpleStrategy above should generate the following replicas.
// It's handy to have as reference here.
assertDeepEqual(t, "replicas", map[string]tokenRingReplicas{
"myKeyspace": {
{orderedToken("00"), []*HostInfo{hosts[0], hosts[1]}},
{orderedToken("25"), []*HostInfo{hosts[1], hosts[2]}},
{orderedToken("50"), []*HostInfo{hosts[2], hosts[3]}},
{orderedToken("75"), []*HostInfo{hosts[3], hosts[0]}},
},
}, policyInternal.getMetadataReadOnly().replicas)
// now the token ring is configured
query.RoutingKey([]byte("20"))
iter = policy.Pick(query)
// first token-aware hosts
expectHosts(t, "hosts[0]", iter, "1")
expectHosts(t, "hosts[1]", iter, "2")
// then rest of the hosts
expectHosts(t, "rest", iter, "0", "3")
expectNoMoreHosts(t, iter)
}
// Tests of the host pool host selection policy implementation
func TestHostPolicy_HostPool(t *testing.T) {
policy := HostPoolHostPolicy(hostpool.New(nil))
hosts := []*HostInfo{
{hostId: "0", connectAddress: net.IPv4(10, 0, 0, 0)},
{hostId: "1", connectAddress: net.IPv4(10, 0, 0, 1)},
}
// Using set host to control the ordering of the hosts as calling "AddHost" iterates the map
// which will result in an unpredictable ordering
policy.(*hostPoolHostPolicy).SetHosts(hosts)
// the first host selected is actually at [1], but this is ok for RR
// interleaved iteration should always increment the host
iter := policy.Pick(nil)
actualA := iter()
if actualA.Info().HostID() != "0" {
t.Errorf("Expected hosts[0] but was hosts[%s]", actualA.Info().HostID())
}
actualA.Mark(nil)
actualB := iter()
if actualB.Info().HostID() != "1" {
t.Errorf("Expected hosts[1] but was hosts[%s]", actualB.Info().HostID())
}
actualB.Mark(fmt.Errorf("error"))
actualC := iter()
if actualC.Info().HostID() != "0" {
t.Errorf("Expected hosts[0] but was hosts[%s]", actualC.Info().HostID())
}
actualC.Mark(nil)
actualD := iter()
if actualD.Info().HostID() != "0" {
t.Errorf("Expected hosts[0] but was hosts[%s]", actualD.Info().HostID())
}
actualD.Mark(nil)
}
func TestHostPolicy_RoundRobin_NilHostInfo(t *testing.T) {
policy := RoundRobinHostPolicy()
host := &HostInfo{hostId: "host-1"}
policy.AddHost(host)
iter := policy.Pick(nil)
next := iter()
if next == nil {
t.Fatal("got nil host")
} else if v := next.Info(); v == nil {
t.Fatal("got nil HostInfo")
} else if v.HostID() != host.HostID() {
t.Fatalf("expected host %v got %v", host, v)
}
next = iter()
if next != nil {
t.Errorf("expected to get nil host got %+v", next)
if next.Info() == nil {
t.Fatalf("HostInfo is nil")
}
}
}
func TestHostPolicy_TokenAware_NilHostInfo(t *testing.T) {
policy := TokenAwareHostPolicy(RoundRobinHostPolicy())
policyInternal := policy.(*tokenAwareHostPolicy)
policyInternal.getKeyspaceName = func() string { return "myKeyspace" }
policyInternal.getKeyspaceMetadata = func(ks string) (*KeyspaceMetadata, error) {
return nil, errors.New("not initialized")
}
hosts := [...]*HostInfo{
{connectAddress: net.IPv4(10, 0, 0, 0), tokens: []string{"00"}},
{connectAddress: net.IPv4(10, 0, 0, 1), tokens: []string{"25"}},
{connectAddress: net.IPv4(10, 0, 0, 2), tokens: []string{"50"}},
{connectAddress: net.IPv4(10, 0, 0, 3), tokens: []string{"75"}},
}
for _, host := range hosts {
policy.AddHost(host)
}
policy.SetPartitioner("OrderedPartitioner")
query := &Query{routingInfo: &queryRoutingInfo{}}
query.getKeyspace = func() string { return "myKeyspace" }
query.RoutingKey([]byte("20"))
iter := policy.Pick(query)
next := iter()
if next == nil {
t.Fatal("got nil host")
} else if v := next.Info(); v == nil {
t.Fatal("got nil HostInfo")
} else if !v.ConnectAddress().Equal(hosts[1].ConnectAddress()) {
t.Fatalf("expected peer 1 got %v", v.ConnectAddress())
}
// Empty the hosts to trigger the panic when using the fallback.
for _, host := range hosts {
policy.RemoveHost(host)
}
next = iter()
if next != nil {
t.Errorf("expected to get nil host got %+v", next)
if next.Info() == nil {
t.Fatalf("HostInfo is nil")
}
}
}
func TestCOWList_Add(t *testing.T) {
var cow cowHostList
toAdd := [...]net.IP{net.IPv4(10, 0, 0, 1), net.IPv4(10, 0, 0, 2), net.IPv4(10, 0, 0, 3)}
for _, addr := range toAdd {
if !cow.add(&HostInfo{connectAddress: addr}) {
t.Fatal("did not add peer which was not in the set")
}
}
hosts := cow.get()
if len(hosts) != len(toAdd) {
t.Fatalf("expected to have %d hosts got %d", len(toAdd), len(hosts))
}
set := make(map[string]bool)
for _, host := range hosts {
set[string(host.ConnectAddress())] = true
}
for _, addr := range toAdd {
if !set[string(addr)] {
t.Errorf("addr was not in the host list: %q", addr)
}
}
}
// TestSimpleRetryPolicy makes sure that we only allow 1 + numRetries attempts
func TestSimpleRetryPolicy(t *testing.T) {
q := &Query{routingInfo: &queryRoutingInfo{}}
// this should allow a total of 3 tries.
rt := &SimpleRetryPolicy{NumRetries: 2}
cases := []struct {
attempts int
allow bool
}{
{0, true},
{1, true},
{2, true},
{3, false},
{4, false},
{5, false},
}
for _, c := range cases {
q.metrics = preFilledQueryMetrics(map[string]*hostMetrics{"127.0.0.1": {Attempts: c.attempts}})
if c.allow && !rt.Attempt(q) {
t.Fatalf("should allow retry after %d attempts", c.attempts)
}
if !c.allow && rt.Attempt(q) {
t.Fatalf("should not allow retry after %d attempts", c.attempts)
}
}
}
func TestExponentialBackoffPolicy(t *testing.T) {
// test with defaults
sut := &ExponentialBackoffRetryPolicy{NumRetries: 2}
cases := []struct {
attempts int
delay time.Duration
}{
{1, 100 * time.Millisecond},
{2, (2) * 100 * time.Millisecond},
{3, (2 * 2) * 100 * time.Millisecond},
{4, (2 * 2 * 2) * 100 * time.Millisecond},
}
for _, c := range cases {
// test 100 times for each case
for i := 0; i < 100; i++ {
d := sut.napTime(c.attempts)
if d < c.delay-(100*time.Millisecond)/2 {
t.Fatalf("Delay %d less than jitter min of %d", d, c.delay-100*time.Millisecond/2)
}
if d > c.delay+(100*time.Millisecond)/2 {
t.Fatalf("Delay %d greater than jitter max of %d", d, c.delay+100*time.Millisecond/2)
}
}
}
}
func TestDowngradingConsistencyRetryPolicy(t *testing.T) {
q := &Query{cons: LocalQuorum, routingInfo: &queryRoutingInfo{}}
rewt0 := &RequestErrWriteTimeout{
Received: 0,
WriteType: "SIMPLE",
}
rewt1 := &RequestErrWriteTimeout{
Received: 1,
WriteType: "BATCH",
}
rewt2 := &RequestErrWriteTimeout{
WriteType: "UNLOGGED_BATCH",
}
rert := &RequestErrReadTimeout{}
reu0 := &RequestErrUnavailable{
Alive: 0,
}
reu1 := &RequestErrUnavailable{
Alive: 1,
}
// this should allow a total of 3 tries.
consistencyLevels := []Consistency{Three, Two, One}
rt := &DowngradingConsistencyRetryPolicy{ConsistencyLevelsToTry: consistencyLevels}
cases := []struct {
attempts int
allow bool
err error
retryType RetryType
}{
{0, true, rewt0, Rethrow},
{3, true, rewt1, Ignore},
{1, true, rewt2, Retry},
{2, true, rert, Retry},
{4, false, reu0, Rethrow},
{16, false, reu1, Retry},
}
for _, c := range cases {
q.metrics = preFilledQueryMetrics(map[string]*hostMetrics{"127.0.0.1": {Attempts: c.attempts}})
if c.retryType != rt.GetRetryType(c.err) {
t.Fatalf("retry type should be %v", c.retryType)
}
if c.allow && !rt.Attempt(q) {
t.Fatalf("should allow retry after %d attempts", c.attempts)
}
if !c.allow && rt.Attempt(q) {
t.Fatalf("should not allow retry after %d attempts", c.attempts)
}
}
}
// expectHosts makes sure that the next len(hostIDs) returned from iter is a permutation of hostIDs.
func expectHosts(t *testing.T, msg string, iter NextHost, hostIDs ...string) {
t.Helper()
expectedHostIDs := make(map[string]struct{}, len(hostIDs))
for i := range hostIDs {
expectedHostIDs[hostIDs[i]] = struct{}{}
}
expectedStr := func() string {
keys := make([]string, 0, len(expectedHostIDs))
for k := range expectedHostIDs {
keys = append(keys, k)
}
sort.Strings(keys)
return strings.Join(keys, ", ")
}
for len(expectedHostIDs) > 0 {
host := iter()
if host == nil || host.Info() == nil {
t.Fatalf("%s: expected hostID one of {%s}, but got nil", msg, expectedStr())
}
hostID := host.Info().HostID()
if _, ok := expectedHostIDs[hostID]; !ok {
t.Fatalf("%s: expected host ID one of {%s}, but got %s", msg, expectedStr(), hostID)
}
delete(expectedHostIDs, hostID)
}
}
func expectNoMoreHosts(t *testing.T, iter NextHost) {
t.Helper()
host := iter()
if host == nil {
// success
return
}
info := host.Info()
if info == nil {
t.Fatalf("expected no more hosts, but got host with nil Info()")
return
}
t.Fatalf("expected no more hosts, but got %s", info.HostID())
}
func TestHostPolicy_DCAwareRR(t *testing.T) {
p := DCAwareRoundRobinPolicy("local")
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.ParseIP("10.0.0.1"), dataCenter: "local"},
{hostId: "1", connectAddress: net.ParseIP("10.0.0.2"), dataCenter: "local"},
{hostId: "2", connectAddress: net.ParseIP("10.0.0.3"), dataCenter: "remote"},
{hostId: "3", connectAddress: net.ParseIP("10.0.0.4"), dataCenter: "remote"},
}
for _, host := range hosts {
p.AddHost(host)
}
got := make(map[string]bool, len(hosts))
var dcs []string
it := p.Pick(nil)
for h := it(); h != nil; h = it() {
id := h.Info().hostId
dc := h.Info().dataCenter
if got[id] {
t.Fatalf("got duplicate host %s", id)
}
got[id] = true
dcs = append(dcs, dc)
}
if len(got) != len(hosts) {
t.Fatalf("expected %d hosts got %d", len(hosts), len(got))
}
var remote bool
for _, dc := range dcs {
if dc == "local" {
if remote {
t.Fatalf("got local dc after remote: %v", dcs)
}
} else {
remote = true
}
}
}
// Tests of the token-aware host selection policy implementation with a
// DC aware round-robin host selection policy fallback
// with {"class": "NetworkTopologyStrategy", "a": 1, "b": 1, "c": 1} replication.
func TestHostPolicy_TokenAware(t *testing.T) {
const keyspace = "myKeyspace"
policy := TokenAwareHostPolicy(DCAwareRoundRobinPolicy("local"))
policyInternal := policy.(*tokenAwareHostPolicy)
policyInternal.getKeyspaceName = func() string { return keyspace }
policyInternal.getKeyspaceMetadata = func(ks string) (*KeyspaceMetadata, error) {
return nil, errors.New("not initialized")
}
query := &Query{routingInfo: &queryRoutingInfo{}}
query.getKeyspace = func() string { return keyspace }
iter := policy.Pick(nil)
if iter == nil {
t.Fatal("host iterator was nil")
}
actual := iter()
if actual != nil {
t.Fatalf("expected nil from iterator, but was %v", actual)
}
// set the hosts
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.IPv4(10, 0, 0, 1), tokens: []string{"05"}, dataCenter: "remote1"},
{hostId: "1", connectAddress: net.IPv4(10, 0, 0, 2), tokens: []string{"10"}, dataCenter: "local"},
{hostId: "2", connectAddress: net.IPv4(10, 0, 0, 3), tokens: []string{"15"}, dataCenter: "remote2"},
{hostId: "3", connectAddress: net.IPv4(10, 0, 0, 4), tokens: []string{"20"}, dataCenter: "remote1"},
{hostId: "4", connectAddress: net.IPv4(10, 0, 0, 5), tokens: []string{"25"}, dataCenter: "local"},
{hostId: "5", connectAddress: net.IPv4(10, 0, 0, 6), tokens: []string{"30"}, dataCenter: "remote2"},
{hostId: "6", connectAddress: net.IPv4(10, 0, 0, 7), tokens: []string{"35"}, dataCenter: "remote1"},
{hostId: "7", connectAddress: net.IPv4(10, 0, 0, 8), tokens: []string{"40"}, dataCenter: "local"},
{hostId: "8", connectAddress: net.IPv4(10, 0, 0, 9), tokens: []string{"45"}, dataCenter: "remote2"},
{hostId: "9", connectAddress: net.IPv4(10, 0, 0, 10), tokens: []string{"50"}, dataCenter: "remote1"},
{hostId: "10", connectAddress: net.IPv4(10, 0, 0, 11), tokens: []string{"55"}, dataCenter: "local"},
{hostId: "11", connectAddress: net.IPv4(10, 0, 0, 12), tokens: []string{"60"}, dataCenter: "remote2"},
}
for _, host := range hosts {
policy.AddHost(host)
}
// the token ring is not setup without the partitioner, but the fallback
// should work
if actual := policy.Pick(nil)(); actual == nil {
t.Fatal("expected to get host from fallback got nil")
}
query.RoutingKey([]byte("30"))
if actual := policy.Pick(query)(); actual == nil {
t.Fatal("expected to get host from fallback got nil")
}
policy.SetPartitioner("OrderedPartitioner")
policyInternal.getKeyspaceMetadata = func(keyspaceName string) (*KeyspaceMetadata, error) {
if keyspaceName != keyspace {
return nil, fmt.Errorf("unknown keyspace: %s", keyspaceName)
}
return &KeyspaceMetadata{
Name: keyspace,
StrategyClass: "NetworkTopologyStrategy",
StrategyOptions: map[string]interface{}{
"class": "NetworkTopologyStrategy",
"local": 1,
"remote1": 1,
"remote2": 1,
},
}, nil
}
policy.KeyspaceChanged(KeyspaceUpdateEvent{Keyspace: "myKeyspace"})
// The NetworkTopologyStrategy above should generate the following replicas.
// It's handy to have as reference here.
assertDeepEqual(t, "replicas", map[string]tokenRingReplicas{
"myKeyspace": {
{orderedToken("05"), []*HostInfo{hosts[0], hosts[1], hosts[2]}},
{orderedToken("10"), []*HostInfo{hosts[1], hosts[2], hosts[3]}},
{orderedToken("15"), []*HostInfo{hosts[2], hosts[3], hosts[4]}},
{orderedToken("20"), []*HostInfo{hosts[3], hosts[4], hosts[5]}},
{orderedToken("25"), []*HostInfo{hosts[4], hosts[5], hosts[6]}},
{orderedToken("30"), []*HostInfo{hosts[5], hosts[6], hosts[7]}},
{orderedToken("35"), []*HostInfo{hosts[6], hosts[7], hosts[8]}},
{orderedToken("40"), []*HostInfo{hosts[7], hosts[8], hosts[9]}},
{orderedToken("45"), []*HostInfo{hosts[8], hosts[9], hosts[10]}},
{orderedToken("50"), []*HostInfo{hosts[9], hosts[10], hosts[11]}},
{orderedToken("55"), []*HostInfo{hosts[10], hosts[11], hosts[0]}},
{orderedToken("60"), []*HostInfo{hosts[11], hosts[0], hosts[1]}},
},
}, policyInternal.getMetadataReadOnly().replicas)
// now the token ring is configured
query.RoutingKey([]byte("23"))
iter = policy.Pick(query)
// first should be host with matching token from the local DC
expectHosts(t, "matching token from local DC", iter, "4")
// next are in non-deterministic order
expectHosts(t, "rest", iter, "0", "1", "2", "3", "5", "6", "7", "8", "9", "10", "11")
expectNoMoreHosts(t, iter)
}
// Tests of the token-aware host selection policy implementation with a
// DC aware round-robin host selection policy fallback
// with {"class": "NetworkTopologyStrategy", "a": 2, "b": 2, "c": 2} replication.
func TestHostPolicy_TokenAware_NetworkStrategy(t *testing.T) {
const keyspace = "myKeyspace"
policy := TokenAwareHostPolicy(DCAwareRoundRobinPolicy("local"), NonLocalReplicasFallback())
policyInternal := policy.(*tokenAwareHostPolicy)
policyInternal.getKeyspaceName = func() string { return keyspace }
policyInternal.getKeyspaceMetadata = func(ks string) (*KeyspaceMetadata, error) {
return nil, errors.New("not initialized")
}
query := &Query{routingInfo: &queryRoutingInfo{}}
query.getKeyspace = func() string { return keyspace }
iter := policy.Pick(nil)
if iter == nil {
t.Fatal("host iterator was nil")
}
actual := iter()
if actual != nil {
t.Fatalf("expected nil from iterator, but was %v", actual)
}
// set the hosts
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.IPv4(10, 0, 0, 1), tokens: []string{"05"}, dataCenter: "remote1"},
{hostId: "1", connectAddress: net.IPv4(10, 0, 0, 2), tokens: []string{"10"}, dataCenter: "local"},
{hostId: "2", connectAddress: net.IPv4(10, 0, 0, 3), tokens: []string{"15"}, dataCenter: "remote2"},
{hostId: "3", connectAddress: net.IPv4(10, 0, 0, 4), tokens: []string{"20"}, dataCenter: "remote1"}, // 1
{hostId: "4", connectAddress: net.IPv4(10, 0, 0, 5), tokens: []string{"25"}, dataCenter: "local"}, // 2
{hostId: "5", connectAddress: net.IPv4(10, 0, 0, 6), tokens: []string{"30"}, dataCenter: "remote2"}, // 3
{hostId: "6", connectAddress: net.IPv4(10, 0, 0, 7), tokens: []string{"35"}, dataCenter: "remote1"}, // 4
{hostId: "7", connectAddress: net.IPv4(10, 0, 0, 8), tokens: []string{"40"}, dataCenter: "local"}, // 5
{hostId: "8", connectAddress: net.IPv4(10, 0, 0, 9), tokens: []string{"45"}, dataCenter: "remote2"}, // 6
{hostId: "9", connectAddress: net.IPv4(10, 0, 0, 10), tokens: []string{"50"}, dataCenter: "remote1"},
{hostId: "10", connectAddress: net.IPv4(10, 0, 0, 11), tokens: []string{"55"}, dataCenter: "local"},
{hostId: "11", connectAddress: net.IPv4(10, 0, 0, 12), tokens: []string{"60"}, dataCenter: "remote2"},
}
for _, host := range hosts {
policy.AddHost(host)
}
policy.SetPartitioner("OrderedPartitioner")
policyInternal.getKeyspaceMetadata = func(keyspaceName string) (*KeyspaceMetadata, error) {
if keyspaceName != keyspace {
return nil, fmt.Errorf("unknown keyspace: %s", keyspaceName)
}
return &KeyspaceMetadata{
Name: keyspace,
StrategyClass: "NetworkTopologyStrategy",
StrategyOptions: map[string]interface{}{
"class": "NetworkTopologyStrategy",
"local": 2,
"remote1": 2,
"remote2": 2,
},
}, nil
}
policy.KeyspaceChanged(KeyspaceUpdateEvent{Keyspace: keyspace})
// The NetworkTopologyStrategy above should generate the following replicas.
// It's handy to have as reference here.
assertDeepEqual(t, "replicas", map[string]tokenRingReplicas{
keyspace: {
{orderedToken("05"), []*HostInfo{hosts[0], hosts[1], hosts[2], hosts[3], hosts[4], hosts[5]}},
{orderedToken("10"), []*HostInfo{hosts[1], hosts[2], hosts[3], hosts[4], hosts[5], hosts[6]}},
{orderedToken("15"), []*HostInfo{hosts[2], hosts[3], hosts[4], hosts[5], hosts[6], hosts[7]}},
{orderedToken("20"), []*HostInfo{hosts[3], hosts[4], hosts[5], hosts[6], hosts[7], hosts[8]}},
{orderedToken("25"), []*HostInfo{hosts[4], hosts[5], hosts[6], hosts[7], hosts[8], hosts[9]}},
{orderedToken("30"), []*HostInfo{hosts[5], hosts[6], hosts[7], hosts[8], hosts[9], hosts[10]}},
{orderedToken("35"), []*HostInfo{hosts[6], hosts[7], hosts[8], hosts[9], hosts[10], hosts[11]}},
{orderedToken("40"), []*HostInfo{hosts[7], hosts[8], hosts[9], hosts[10], hosts[11], hosts[0]}},
{orderedToken("45"), []*HostInfo{hosts[8], hosts[9], hosts[10], hosts[11], hosts[0], hosts[1]}},
{orderedToken("50"), []*HostInfo{hosts[9], hosts[10], hosts[11], hosts[0], hosts[1], hosts[2]}},
{orderedToken("55"), []*HostInfo{hosts[10], hosts[11], hosts[0], hosts[1], hosts[2], hosts[3]}},
{orderedToken("60"), []*HostInfo{hosts[11], hosts[0], hosts[1], hosts[2], hosts[3], hosts[4]}},
},
}, policyInternal.getMetadataReadOnly().replicas)
// now the token ring is configured
query.RoutingKey([]byte("18"))
iter = policy.Pick(query)
// first should be hosts with matching token from the local DC
expectHosts(t, "matching token from local DC", iter, "4", "7")
// rest should be hosts with matching token from remote DCs
expectHosts(t, "matching token from remote DCs", iter, "3", "5", "6", "8")
// followed by other hosts
expectHosts(t, "rest", iter, "0", "1", "2", "9", "10", "11")
expectNoMoreHosts(t, iter)
}
func TestHostPolicy_RackAwareRR(t *testing.T) {
p := RackAwareRoundRobinPolicy("local", "b")
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.ParseIP("10.0.0.1"), dataCenter: "local", rack: "a"},
{hostId: "1", connectAddress: net.ParseIP("10.0.0.2"), dataCenter: "local", rack: "a"},
{hostId: "2", connectAddress: net.ParseIP("10.0.0.3"), dataCenter: "local", rack: "b"},
{hostId: "3", connectAddress: net.ParseIP("10.0.0.4"), dataCenter: "local", rack: "b"},
{hostId: "4", connectAddress: net.ParseIP("10.0.0.5"), dataCenter: "remote", rack: "a"},
{hostId: "5", connectAddress: net.ParseIP("10.0.0.6"), dataCenter: "remote", rack: "a"},
{hostId: "6", connectAddress: net.ParseIP("10.0.0.7"), dataCenter: "remote", rack: "b"},
{hostId: "7", connectAddress: net.ParseIP("10.0.0.8"), dataCenter: "remote", rack: "b"},
}
for _, host := range hosts {
p.AddHost(host)
}
it := p.Pick(nil)
// Must start with rack-local hosts
expectHosts(t, "rack-local hosts", it, "3", "2")
// Then dc-local hosts
expectHosts(t, "dc-local hosts", it, "0", "1")
// Then the remote hosts
expectHosts(t, "remote hosts", it, "4", "5", "6", "7")
expectNoMoreHosts(t, it)
}
// Tests of the token-aware host selection policy implementation with a
// DC & Rack aware round-robin host selection policy fallback
func TestHostPolicy_TokenAware_RackAware(t *testing.T) {
const keyspace = "myKeyspace"
policy := TokenAwareHostPolicy(RackAwareRoundRobinPolicy("local", "b"))
policyWithFallback := TokenAwareHostPolicy(RackAwareRoundRobinPolicy("local", "b"), NonLocalReplicasFallback())
policyInternal := policy.(*tokenAwareHostPolicy)
policyInternal.getKeyspaceName = func() string { return keyspace }
policyInternal.getKeyspaceMetadata = func(ks string) (*KeyspaceMetadata, error) {
return nil, errors.New("not initialized")
}
policyWithFallbackInternal := policyWithFallback.(*tokenAwareHostPolicy)
policyWithFallbackInternal.getKeyspaceName = policyInternal.getKeyspaceName
policyWithFallbackInternal.getKeyspaceMetadata = policyInternal.getKeyspaceMetadata
query := &Query{routingInfo: &queryRoutingInfo{}}
query.getKeyspace = func() string { return keyspace }
iter := policy.Pick(nil)
if iter == nil {
t.Fatal("host iterator was nil")
}
actual := iter()
if actual != nil {
t.Fatalf("expected nil from iterator, but was %v", actual)
}
// set the hosts
hosts := [...]*HostInfo{
{hostId: "0", connectAddress: net.IPv4(10, 0, 0, 1), tokens: []string{"05"}, dataCenter: "remote", rack: "a"},
{hostId: "1", connectAddress: net.IPv4(10, 0, 0, 2), tokens: []string{"10"}, dataCenter: "remote", rack: "b"},
{hostId: "2", connectAddress: net.IPv4(10, 0, 0, 3), tokens: []string{"15"}, dataCenter: "local", rack: "a"},
{hostId: "3", connectAddress: net.IPv4(10, 0, 0, 4), tokens: []string{"20"}, dataCenter: "local", rack: "b"},
{hostId: "4", connectAddress: net.IPv4(10, 0, 0, 5), tokens: []string{"25"}, dataCenter: "remote", rack: "a"},
{hostId: "5", connectAddress: net.IPv4(10, 0, 0, 6), tokens: []string{"30"}, dataCenter: "remote", rack: "b"},
{hostId: "6", connectAddress: net.IPv4(10, 0, 0, 7), tokens: []string{"35"}, dataCenter: "local", rack: "a"},
{hostId: "7", connectAddress: net.IPv4(10, 0, 0, 8), tokens: []string{"40"}, dataCenter: "local", rack: "b"},
{hostId: "8", connectAddress: net.IPv4(10, 0, 0, 9), tokens: []string{"45"}, dataCenter: "remote", rack: "a"},
{hostId: "9", connectAddress: net.IPv4(10, 0, 0, 10), tokens: []string{"50"}, dataCenter: "remote", rack: "b"},
{hostId: "10", connectAddress: net.IPv4(10, 0, 0, 11), tokens: []string{"55"}, dataCenter: "local", rack: "a"},
{hostId: "11", connectAddress: net.IPv4(10, 0, 0, 12), tokens: []string{"60"}, dataCenter: "local", rack: "b"},
}
for _, host := range hosts {
policy.AddHost(host)
policyWithFallback.AddHost(host)
}
// the token ring is not setup without the partitioner, but the fallback
// should work
if actual := policy.Pick(nil)(); actual == nil {
t.Fatal("expected to get host from fallback got nil")
}
query.RoutingKey([]byte("30"))
if actual := policy.Pick(query)(); actual == nil {
t.Fatal("expected to get host from fallback got nil")
}
policy.SetPartitioner("OrderedPartitioner")
policyWithFallback.SetPartitioner("OrderedPartitioner")
policyInternal.getKeyspaceMetadata = func(keyspaceName string) (*KeyspaceMetadata, error) {
if keyspaceName != keyspace {
return nil, fmt.Errorf("unknown keyspace: %s", keyspaceName)
}
return &KeyspaceMetadata{
Name: keyspace,
StrategyClass: "NetworkTopologyStrategy",
StrategyOptions: map[string]interface{}{
"class": "NetworkTopologyStrategy",
"local": 2,
"remote": 2,
},
}, nil
}
policyWithFallbackInternal.getKeyspaceMetadata = policyInternal.getKeyspaceMetadata
policy.KeyspaceChanged(KeyspaceUpdateEvent{Keyspace: "myKeyspace"})
policyWithFallback.KeyspaceChanged(KeyspaceUpdateEvent{Keyspace: "myKeyspace"})
// The NetworkTopologyStrategy above should generate the following replicas.
// It's handy to have as reference here.
assertDeepEqual(t, "replicas", map[string]tokenRingReplicas{
"myKeyspace": {
{orderedToken("05"), []*HostInfo{hosts[0], hosts[1], hosts[2], hosts[3]}},
{orderedToken("10"), []*HostInfo{hosts[1], hosts[2], hosts[3], hosts[4]}},
{orderedToken("15"), []*HostInfo{hosts[2], hosts[3], hosts[4], hosts[5]}},
{orderedToken("20"), []*HostInfo{hosts[3], hosts[4], hosts[5], hosts[6]}},
{orderedToken("25"), []*HostInfo{hosts[4], hosts[5], hosts[6], hosts[7]}},
{orderedToken("30"), []*HostInfo{hosts[5], hosts[6], hosts[7], hosts[8]}},
{orderedToken("35"), []*HostInfo{hosts[6], hosts[7], hosts[8], hosts[9]}},
{orderedToken("40"), []*HostInfo{hosts[7], hosts[8], hosts[9], hosts[10]}},
{orderedToken("45"), []*HostInfo{hosts[8], hosts[9], hosts[10], hosts[11]}},
{orderedToken("50"), []*HostInfo{hosts[9], hosts[10], hosts[11], hosts[0]}},
{orderedToken("55"), []*HostInfo{hosts[10], hosts[11], hosts[0], hosts[1]}},
{orderedToken("60"), []*HostInfo{hosts[11], hosts[0], hosts[1], hosts[2]}},
},
}, policyInternal.getMetadataReadOnly().replicas)
query.RoutingKey([]byte("23"))
// now the token ring is configured
// Test the policy with fallback
iter = policyWithFallback.Pick(query)
// first should be host with matching token from the local DC & rack
expectHosts(t, "matching token from local DC and local rack", iter, "7")
// next should be host with matching token from local DC and other rack
expectHosts(t, "matching token from local DC and non-local rack", iter, "6")
// next should be hosts with matching token from other DC, in any order
expectHosts(t, "matching token from non-local DC", iter, "4", "5")
// then the local DC & rack that didn't match the token
expectHosts(t, "non-matching token from local DC and local rack", iter, "3", "11")
// then the local DC & other rack that didn't match the token
expectHosts(t, "non-matching token from local DC and non-local rack", iter, "2", "10")
// finally, the other DC that didn't match the token
expectHosts(t, "non-matching token from non-local DC", iter, "0", "1", "8", "9")
expectNoMoreHosts(t, iter)
// Test the policy without fallback
iter = policy.Pick(query)
// first should be host with matching token from the local DC & Rack
expectHosts(t, "matching token from local DC and local rack", iter, "7")
// next should be the other two hosts from local DC & rack
expectHosts(t, "non-matching token local DC and local rack", iter, "3", "11")
// then the three hosts from the local DC but other rack
expectHosts(t, "local DC, non-local rack", iter, "2", "6", "10")
// then the 6 hosts from the other DC
expectHosts(t, "non-local DC", iter, "0", "1", "4", "5", "8", "9")
expectNoMoreHosts(t, iter)
}