forked from apache/cassandra-gocql-driver
-
Notifications
You must be signed in to change notification settings - Fork 0
/
policies_test.go
255 lines (215 loc) · 6.43 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
// 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 (
"fmt"
"testing"
"github.com/hailocab/go-hostpool"
)
// Tests of the round-robin host selection policy implementation
func TestRoundRobinHostPolicy(t *testing.T) {
policy := RoundRobinHostPolicy()
hosts := [...]*HostInfo{
{hostId: "0"},
{hostId: "1"},
}
for _, host := range hosts {
policy.AddHost(host)
}
// interleaved iteration should always increment the host
iterA := policy.Pick(nil)
if actual := iterA(); actual.Info() != hosts[0] {
t.Errorf("Expected hosts[0] but was hosts[%s]", actual.Info().HostID())
}
iterB := policy.Pick(nil)
if actual := iterB(); actual.Info() != hosts[1] {
t.Errorf("Expected hosts[1] but was hosts[%s]", actual.Info().HostID())
}
if actual := iterB(); actual.Info() != hosts[0] {
t.Errorf("Expected hosts[0] but was hosts[%s]", actual.Info().HostID())
}
if actual := iterA(); actual.Info() != hosts[1] {
t.Errorf("Expected hosts[1] but was hosts[%s]", actual.Info().HostID())
}
iterC := policy.Pick(nil)
if actual := iterC(); actual.Info() != hosts[0] {
t.Errorf("Expected hosts[0] but was hosts[%s]", actual.Info().HostID())
}
if actual := iterC(); actual.Info() != hosts[1] {
t.Errorf("Expected hosts[1] but was hosts[%s]", actual.Info().HostID())
}
}
// Tests of the token-aware host selection policy implementation with a
// round-robin host selection policy fallback.
func TestTokenAwareHostPolicy(t *testing.T) {
policy := TokenAwareHostPolicy(RoundRobinHostPolicy())
query := &Query{}
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{
{peer: "0", tokens: []string{"00"}},
{peer: "1", tokens: []string{"25"}},
{peer: "2", tokens: []string{"50"}},
{peer: "3", tokens: []string{"75"}},
}
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.Info().Peer() != "0" {
t.Errorf("Expected peer 0 but was %s", actual.Info().Peer())
}
query.RoutingKey([]byte("30"))
if actual := policy.Pick(query)(); actual.Info().Peer() != "1" {
t.Errorf("Expected peer 1 but was %s", actual.Info().Peer())
}
policy.SetPartitioner("OrderedPartitioner")
// now the token ring is configured
query.RoutingKey([]byte("20"))
iter = policy.Pick(query)
if actual := iter(); actual.Info().Peer() != "1" {
t.Errorf("Expected peer 1 but was %s", actual.Info().Peer())
}
// rest are round robin
if actual := iter(); actual.Info().Peer() != "2" {
t.Errorf("Expected peer 2 but was %s", actual.Info().Peer())
}
if actual := iter(); actual.Info().Peer() != "3" {
t.Errorf("Expected peer 3 but was %s", actual.Info().Peer())
}
if actual := iter(); actual.Info().Peer() != "0" {
t.Errorf("Expected peer 0 but was %s", actual.Info().Peer())
}
}
// Tests of the host pool host selection policy implementation
func TestHostPoolHostPolicy(t *testing.T) {
policy := HostPoolHostPolicy(hostpool.New(nil))
hosts := [...]*HostInfo{
{hostId: "0", peer: "0"},
{hostId: "1", peer: "1"},
}
for _, host := range hosts {
policy.AddHost(host)
}
// 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 TestRoundRobinNilHostInfo(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 TestTokenAwareNilHostInfo(t *testing.T) {
policy := TokenAwareHostPolicy(RoundRobinHostPolicy())
hosts := [...]*HostInfo{
{peer: "0", tokens: []string{"00"}},
{peer: "1", tokens: []string{"25"}},
{peer: "2", tokens: []string{"50"}},
{peer: "3", tokens: []string{"75"}},
}
for _, host := range hosts {
policy.AddHost(host)
}
policy.SetPartitioner("OrderedPartitioner")
query := &Query{}
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.Peer() != "1" {
t.Fatalf("expected peer 1 got %v", v.Peer())
}
// Empty the hosts to trigger the panic when using the fallback.
for _, host := range hosts {
policy.RemoveHost(host.Peer())
}
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 := [...]string{"peer1", "peer2", "peer3"}
for _, addr := range toAdd {
if !cow.add(&HostInfo{peer: 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[host.Peer()] = true
}
for _, addr := range toAdd {
if !set[addr] {
t.Errorf("addr was not in the host list: %q", addr)
}
}
}
func TestSimpleRetryPolicy(t *testing.T) {
q := &Query{}
rt := &SimpleRetryPolicy{NumRetries: 2}
if !rt.Attempt(q) {
t.Fatal("should allow retry after 0 attempts")
}
q.attempts = 5
if rt.Attempt(q) {
t.Fatal("should not allow retry after passing threshold")
}
}