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
|
// Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.documentapi.messagebus.protocol.test.storagepolicy;
import com.yahoo.collections.Pair;
import com.yahoo.documentapi.messagebus.protocol.WrongDistributionReply;
import com.yahoo.messagebus.Reply;
import com.yahoo.messagebus.routing.RoutingNode;
import java.util.Arrays;
public class BasicTests extends StoragePolicyTestEnvironment {
/** Test that we can send a message through the policy. */
public void testNormalUsage() {
setClusterNodes(new int[]{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
// First we want a wrong distribution reply, so make sure we don't try correct node on random
policyFactory.avoidPickingAtRandom(bucketOneNodePreference[0]);
RoutingNode target = select();
replyWrongDistribution(target, "foo", 5, "version:1 bits:16 distributor:10 storage:10");
// Then send to correct node and verify that
sendToCorrectNode("foo", bucketOneNodePreference[0]);
}
/** Test that we can identify newest cluster state and hang on to correct one. */
public void testRepliesWrongOrderDuringStateChange() throws Exception{
{
setClusterNodes(new int[]{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
RoutingNode target1 = select();
RoutingNode target2 = select();
replyWrongDistribution(target2, "foo", 0, "version:2 bits:16 distributor:10");
replyWrongDistribution(target1, "foo", 5, "version:1 bits:16 distributor:10 ." + bucketOneNodePreference[0] + ".s:d");
sendToCorrectNode("foo", bucketOneNodePreference[0]);
}
tearDown();
setUp();
{
setClusterNodes(new int[]{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
RoutingNode target1 = select();
RoutingNode target2 = select();
replyWrongDistribution(target2, "foo", 0, "version:1 bits:16 distributor:10");
replyWrongDistribution(target1, "foo", 5, "version:2 bits:16 distributor:10 ." + bucketOneNodePreference[0] + ".s:d");
sendToCorrectNode("foo", bucketOneNodePreference[1]);
}
}
/**
* To be independent of changes in distribution algorithm, we programmatically calculate preferred order of
* bucket 1, which we will be using in the tests. To avoid doing this ahead of every test, we still hardcode the
* values, though only one place, and have this test to verify they are correct, and make it easy to update the values.
*/
public void testVerifyBucketOneNodePreferenceInTenNodeDefaultCluster() {
int result[] = new int[10];
setClusterNodes(new int[]{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
String clusterState = " bits:16 storage:10 distributor:10";
for (int i=0; i<10; ++i) {
// Update cached cluster state, to reflect which node we want to find
RoutingNode target = select();
target.handleReply(new WrongDistributionReply("version:" + (i + 1) + clusterState));
Reply reply = frame.getReceptor().getReply(60);
assertNotNull(reply);
assertFalse(reply.hasErrors());
// Find correct target
target = select();
Pair<String, Integer> address = getAddress(target);
result[i] = address.getSecond();
removeNode(address.getSecond());
clusterState += " ." + result[i] + ".s:d";
}
assertEquals(Arrays.toString(bucketOneNodePreference), Arrays.toString(result));
}
}
|
