Consolidate ShardRouting construction
Simplify and consolidate ShardRouting construction. Make sure that there is really only one place it gets created, when a shard is first created in unassigned state, and from there on, it is either copy constructed or built internally as a target for relocation. This change helps make sure within our codebase data carries over by the ShardRouting is not lost as the shard goes through transitions, and can help simplify the addition of more data on it (like uuid). For testing, a centralized TestShardRouting allows to create testable versions of ShardRouting, that are not needed to be as strict as the non test codebase. This can be cleanup more later on, but it is a good start. closes #12125
This commit is contained in:
parent
a6c0007325
commit
097b132238
|
@ -433,9 +433,9 @@ public class IndexRoutingTable extends AbstractDiffable<IndexRoutingTable> imple
|
||||||
for (int i = 0; i <= indexMetaData.numberOfReplicas(); i++) {
|
for (int i = 0; i <= indexMetaData.numberOfReplicas(); i++) {
|
||||||
if (asNew && ignoreShards.contains(shardId)) {
|
if (asNew && ignoreShards.contains(shardId)) {
|
||||||
// This shards wasn't completely snapshotted - restore it as new shard
|
// This shards wasn't completely snapshotted - restore it as new shard
|
||||||
indexShardRoutingBuilder.addShard(new ShardRouting(index, shardId, null, null, null, i == 0, ShardRoutingState.UNASSIGNED, 0, unassignedInfo));
|
indexShardRoutingBuilder.addShard(ShardRouting.newUnassigned(index, shardId, null, i == 0, unassignedInfo));
|
||||||
} else {
|
} else {
|
||||||
indexShardRoutingBuilder.addShard(new ShardRouting(index, shardId, null, null, i == 0 ? restoreSource : null, i == 0, ShardRoutingState.UNASSIGNED, 0, unassignedInfo));
|
indexShardRoutingBuilder.addShard(ShardRouting.newUnassigned(index, shardId, i == 0 ? restoreSource : null, i == 0, unassignedInfo));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
shards.put(shardId, indexShardRoutingBuilder.build());
|
shards.put(shardId, indexShardRoutingBuilder.build());
|
||||||
|
@ -453,7 +453,7 @@ public class IndexRoutingTable extends AbstractDiffable<IndexRoutingTable> imple
|
||||||
for (int shardId = 0; shardId < indexMetaData.numberOfShards(); shardId++) {
|
for (int shardId = 0; shardId < indexMetaData.numberOfShards(); shardId++) {
|
||||||
IndexShardRoutingTable.Builder indexShardRoutingBuilder = new IndexShardRoutingTable.Builder(new ShardId(indexMetaData.index(), shardId), asNew ? false : true);
|
IndexShardRoutingTable.Builder indexShardRoutingBuilder = new IndexShardRoutingTable.Builder(new ShardId(indexMetaData.index(), shardId), asNew ? false : true);
|
||||||
for (int i = 0; i <= indexMetaData.numberOfReplicas(); i++) {
|
for (int i = 0; i <= indexMetaData.numberOfReplicas(); i++) {
|
||||||
indexShardRoutingBuilder.addShard(new ShardRouting(index, shardId, null, null, null, i == 0, ShardRoutingState.UNASSIGNED, 0, unassignedInfo));
|
indexShardRoutingBuilder.addShard(ShardRouting.newUnassigned(index, shardId, null, i == 0, unassignedInfo));
|
||||||
}
|
}
|
||||||
shards.put(shardId, indexShardRoutingBuilder.build());
|
shards.put(shardId, indexShardRoutingBuilder.build());
|
||||||
}
|
}
|
||||||
|
@ -464,7 +464,7 @@ public class IndexRoutingTable extends AbstractDiffable<IndexRoutingTable> imple
|
||||||
for (IntCursor cursor : shards.keys()) {
|
for (IntCursor cursor : shards.keys()) {
|
||||||
int shardId = cursor.value;
|
int shardId = cursor.value;
|
||||||
// version 0, will get updated when reroute will happen
|
// version 0, will get updated when reroute will happen
|
||||||
ShardRouting shard = new ShardRouting(index, shardId, null, null, null, false, ShardRoutingState.UNASSIGNED, 0, new UnassignedInfo(UnassignedInfo.Reason.REPLICA_ADDED, null));
|
ShardRouting shard = ShardRouting.newUnassigned(index, shardId, null, false, new UnassignedInfo(UnassignedInfo.Reason.REPLICA_ADDED, null));
|
||||||
shards.put(shardId,
|
shards.put(shardId,
|
||||||
new IndexShardRoutingTable.Builder(shards.get(shard.id())).addShard(shard).build()
|
new IndexShardRoutingTable.Builder(shards.get(shard.id())).addShard(shard).build()
|
||||||
);
|
);
|
||||||
|
|
|
@ -89,7 +89,7 @@ public class IndexShardRoutingTable implements Iterable<ShardRouting> {
|
||||||
}
|
}
|
||||||
if (shard.relocating()) {
|
if (shard.relocating()) {
|
||||||
// create the target initializing shard routing on the node the shard is relocating to
|
// create the target initializing shard routing on the node the shard is relocating to
|
||||||
allInitializingShards.add(shard.targetRoutingIfRelocating());
|
allInitializingShards.add(shard.buildTargetRelocatingShard());
|
||||||
}
|
}
|
||||||
if (shard.assignedToNode()) {
|
if (shard.assignedToNode()) {
|
||||||
assignedShards.add(shard);
|
assignedShards.add(shard);
|
||||||
|
|
|
@ -109,8 +109,7 @@ public class RoutingNodes implements Iterable<RoutingNode> {
|
||||||
}
|
}
|
||||||
// add the counterpart shard with relocatingNodeId reflecting the source from which
|
// add the counterpart shard with relocatingNodeId reflecting the source from which
|
||||||
// it's relocating from.
|
// it's relocating from.
|
||||||
sr = new ShardRouting(shard.index(), shard.id(), shard.relocatingNodeId(),
|
sr = shard.buildTargetRelocatingShard();
|
||||||
shard.currentNodeId(), shard.restoreSource(), shard.primary(), ShardRoutingState.INITIALIZING, shard.version());
|
|
||||||
entries.add(sr);
|
entries.add(sr);
|
||||||
assignedShardsAdd(sr);
|
assignedShardsAdd(sr);
|
||||||
} else if (!shard.active()) { // shards that are initializing without being relocated
|
} else if (!shard.active()) { // shards that are initializing without being relocated
|
||||||
|
@ -399,11 +398,16 @@ public class RoutingNodes implements Iterable<RoutingNode> {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Relocate a shard to another node.
|
* Relocate a shard to another node, adding the target initializing
|
||||||
|
* shard as well as assigning it. And returning the target initializing
|
||||||
|
* shard.
|
||||||
*/
|
*/
|
||||||
public void relocate(ShardRouting shard, String nodeId) {
|
public ShardRouting relocate(ShardRouting shard, String nodeId) {
|
||||||
relocatingShards++;
|
relocatingShards++;
|
||||||
shard.relocate(nodeId);
|
shard.relocate(nodeId);
|
||||||
|
ShardRouting target = shard.buildTargetRelocatingShard();
|
||||||
|
assign(target, target.currentNodeId());
|
||||||
|
return target;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|
|
@ -32,6 +32,7 @@ import org.elasticsearch.indices.IndexMissingException;
|
||||||
|
|
||||||
import java.io.IOException;
|
import java.io.IOException;
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
|
import java.util.Collections;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
import java.util.Map;
|
import java.util.Map;
|
||||||
|
|
||||||
|
@ -179,10 +180,10 @@ public class RoutingTable implements Iterable<IndexRoutingTable>, Diffable<Routi
|
||||||
if (shardRouting.active()) {
|
if (shardRouting.active()) {
|
||||||
set.add(shardRouting.shardsIt());
|
set.add(shardRouting.shardsIt());
|
||||||
if (includeRelocationTargets && shardRouting.relocating()) {
|
if (includeRelocationTargets && shardRouting.relocating()) {
|
||||||
set.add(new PlainShardIterator(shardRouting.shardId(), ImmutableList.of(shardRouting.targetRoutingIfRelocating())));
|
set.add(new PlainShardIterator(shardRouting.shardId(), Collections.singletonList(shardRouting.buildTargetRelocatingShard())));
|
||||||
}
|
}
|
||||||
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
||||||
set.add(new PlainShardIterator(shardRouting.shardId(), ImmutableList.<ShardRouting>of()));
|
set.add(new PlainShardIterator(shardRouting.shardId(), Collections.<ShardRouting>emptyList()));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -215,10 +216,10 @@ public class RoutingTable implements Iterable<IndexRoutingTable>, Diffable<Routi
|
||||||
if (shardRouting.assignedToNode()) {
|
if (shardRouting.assignedToNode()) {
|
||||||
set.add(shardRouting.shardsIt());
|
set.add(shardRouting.shardsIt());
|
||||||
if (includeRelocationTargets && shardRouting.relocating()) {
|
if (includeRelocationTargets && shardRouting.relocating()) {
|
||||||
set.add(new PlainShardIterator(shardRouting.shardId(), ImmutableList.of(shardRouting.targetRoutingIfRelocating())));
|
set.add(new PlainShardIterator(shardRouting.shardId(), Collections.singletonList(shardRouting.buildTargetRelocatingShard())));
|
||||||
}
|
}
|
||||||
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
||||||
set.add(new PlainShardIterator(shardRouting.shardId(), ImmutableList.<ShardRouting>of()));
|
set.add(new PlainShardIterator(shardRouting.shardId(), Collections.<ShardRouting>emptyList()));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -249,7 +250,7 @@ public class RoutingTable implements Iterable<IndexRoutingTable>, Diffable<Routi
|
||||||
if (primary.active()) {
|
if (primary.active()) {
|
||||||
set.add(primary.shardsIt());
|
set.add(primary.shardsIt());
|
||||||
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
} else if (includeEmpty) { // we need this for counting properly, just make it an empty one
|
||||||
set.add(new PlainShardIterator(primary.shardId(), ImmutableList.<ShardRouting>of()));
|
set.add(new PlainShardIterator(primary.shardId(), Collections.<ShardRouting>emptyList()));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -19,7 +19,6 @@
|
||||||
|
|
||||||
package org.elasticsearch.cluster.routing;
|
package org.elasticsearch.cluster.routing;
|
||||||
|
|
||||||
import org.apache.lucene.util.SetOnce;
|
|
||||||
import org.elasticsearch.common.Nullable;
|
import org.elasticsearch.common.Nullable;
|
||||||
import org.elasticsearch.common.io.stream.StreamInput;
|
import org.elasticsearch.common.io.stream.StreamInput;
|
||||||
import org.elasticsearch.common.io.stream.StreamOutput;
|
import org.elasticsearch.common.io.stream.StreamOutput;
|
||||||
|
@ -29,7 +28,7 @@ import org.elasticsearch.common.xcontent.XContentBuilder;
|
||||||
import org.elasticsearch.index.shard.ShardId;
|
import org.elasticsearch.index.shard.ShardId;
|
||||||
|
|
||||||
import java.io.IOException;
|
import java.io.IOException;
|
||||||
import java.util.Arrays;
|
import java.util.Collections;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -38,32 +37,21 @@ import java.util.List;
|
||||||
*/
|
*/
|
||||||
public final class ShardRouting implements Streamable, ToXContent {
|
public final class ShardRouting implements Streamable, ToXContent {
|
||||||
|
|
||||||
protected String index;
|
private String index;
|
||||||
|
private int shardId;
|
||||||
protected int shardId;
|
private String currentNodeId;
|
||||||
|
private String relocatingNodeId;
|
||||||
protected String currentNodeId;
|
private boolean primary;
|
||||||
|
private ShardRoutingState state;
|
||||||
protected String relocatingNodeId;
|
private long version;
|
||||||
|
|
||||||
protected boolean primary;
|
|
||||||
|
|
||||||
protected ShardRoutingState state;
|
|
||||||
|
|
||||||
protected long version;
|
|
||||||
|
|
||||||
private transient ShardId shardIdentifier;
|
private transient ShardId shardIdentifier;
|
||||||
|
private RestoreSource restoreSource;
|
||||||
protected RestoreSource restoreSource;
|
private UnassignedInfo unassignedInfo;
|
||||||
|
|
||||||
protected UnassignedInfo unassignedInfo;
|
|
||||||
|
|
||||||
private final transient List<ShardRouting> asList;
|
private final transient List<ShardRouting> asList;
|
||||||
|
|
||||||
private boolean frozen = false;
|
private boolean frozen = false;
|
||||||
|
|
||||||
ShardRouting() {
|
private ShardRouting() {
|
||||||
this.asList = Arrays.asList(this);
|
this.asList = Collections.singletonList(this);
|
||||||
}
|
}
|
||||||
|
|
||||||
public ShardRouting(ShardRouting copy) {
|
public ShardRouting(ShardRouting copy) {
|
||||||
|
@ -71,37 +59,39 @@ public final class ShardRouting implements Streamable, ToXContent {
|
||||||
}
|
}
|
||||||
|
|
||||||
public ShardRouting(ShardRouting copy, long version) {
|
public ShardRouting(ShardRouting copy, long version) {
|
||||||
this(copy.index(), copy.id(), copy.currentNodeId(), copy.relocatingNodeId(), copy.restoreSource(), copy.primary(), copy.state(), version, copy.unassignedInfo());
|
this(copy.index(), copy.id(), copy.currentNodeId(), copy.relocatingNodeId(), copy.restoreSource(), copy.primary(), copy.state(), version, copy.unassignedInfo(), true);
|
||||||
}
|
}
|
||||||
|
|
||||||
public ShardRouting(String index, int shardId, String currentNodeId, boolean primary, ShardRoutingState state, long version) {
|
/**
|
||||||
this(index, shardId, currentNodeId, null, primary, state, version);
|
* A constructor to internally create shard routing instances, note, the internal flag should only be set to true
|
||||||
}
|
* by either this class or tests. Visible for testing.
|
||||||
|
*/
|
||||||
public ShardRouting(String index, int shardId, String currentNodeId,
|
ShardRouting(String index, int shardId, String currentNodeId,
|
||||||
String relocatingNodeId, boolean primary, ShardRoutingState state, long version) {
|
|
||||||
this(index, shardId, currentNodeId, relocatingNodeId, null, primary, state, version);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ShardRouting(String index, int shardId, String currentNodeId,
|
|
||||||
String relocatingNodeId, RestoreSource restoreSource, boolean primary, ShardRoutingState state, long version) {
|
|
||||||
this(index, shardId, currentNodeId, relocatingNodeId, restoreSource, primary, state, version, null);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ShardRouting(String index, int shardId, String currentNodeId,
|
|
||||||
String relocatingNodeId, RestoreSource restoreSource, boolean primary, ShardRoutingState state, long version,
|
String relocatingNodeId, RestoreSource restoreSource, boolean primary, ShardRoutingState state, long version,
|
||||||
UnassignedInfo unassignedInfo) {
|
UnassignedInfo unassignedInfo, boolean internal) {
|
||||||
this.index = index;
|
this.index = index;
|
||||||
this.shardId = shardId;
|
this.shardId = shardId;
|
||||||
this.currentNodeId = currentNodeId;
|
this.currentNodeId = currentNodeId;
|
||||||
this.relocatingNodeId = relocatingNodeId;
|
this.relocatingNodeId = relocatingNodeId;
|
||||||
this.primary = primary;
|
this.primary = primary;
|
||||||
this.state = state;
|
this.state = state;
|
||||||
this.asList = Arrays.asList(this);
|
this.asList = Collections.singletonList(this);
|
||||||
this.version = version;
|
this.version = version;
|
||||||
this.restoreSource = restoreSource;
|
this.restoreSource = restoreSource;
|
||||||
this.unassignedInfo = unassignedInfo;
|
this.unassignedInfo = unassignedInfo;
|
||||||
assert !(state == ShardRoutingState.UNASSIGNED && unassignedInfo == null) : "unassigned shard must be created with meta";
|
assert !(state == ShardRoutingState.UNASSIGNED && unassignedInfo == null) : "unassigned shard must be created with meta";
|
||||||
|
if (!internal) {
|
||||||
|
assert state == ShardRoutingState.UNASSIGNED;
|
||||||
|
assert currentNodeId == null;
|
||||||
|
assert relocatingNodeId == null;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Creates a new unassigned shard.
|
||||||
|
*/
|
||||||
|
public static ShardRouting newUnassigned(String index, int shardId, RestoreSource restoreSource, boolean primary, UnassignedInfo unassignedInfo) {
|
||||||
|
return new ShardRouting(index, shardId, null, null, restoreSource, primary, ShardRoutingState.UNASSIGNED, 0, unassignedInfo, true);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -205,15 +195,13 @@ public final class ShardRouting implements Streamable, ToXContent {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* If the shard is relocating, return a shard routing representing the target shard or null o.w.
|
* Creates a shard routing representing the target shard.
|
||||||
* The target shard routing will be the INITIALIZING state and have relocatingNodeId set to the
|
* The target shard routing will be the INITIALIZING state and have relocatingNodeId set to the
|
||||||
* source node.
|
* source node.
|
||||||
*/
|
*/
|
||||||
public ShardRouting targetRoutingIfRelocating() {
|
public ShardRouting buildTargetRelocatingShard() {
|
||||||
if (!relocating()) {
|
assert relocating();
|
||||||
return null;
|
return new ShardRouting(index, shardId, relocatingNodeId, currentNodeId, restoreSource, primary, ShardRoutingState.INITIALIZING, version, unassignedInfo, true);
|
||||||
}
|
|
||||||
return new ShardRouting(index, shardId, relocatingNodeId, currentNodeId, primary, ShardRoutingState.INITIALIZING, version);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|
|
@ -508,11 +508,8 @@ public class BalancedShardsAllocator extends AbstractComponent implements Shards
|
||||||
Decision decision = allocation.deciders().canAllocate(shard, target, allocation);
|
Decision decision = allocation.deciders().canAllocate(shard, target, allocation);
|
||||||
if (decision.type() == Type.YES) { // TODO maybe we can respect throttling here too?
|
if (decision.type() == Type.YES) { // TODO maybe we can respect throttling here too?
|
||||||
sourceNode.removeShard(shard);
|
sourceNode.removeShard(shard);
|
||||||
final ShardRouting initializingShard = new ShardRouting(shard.index(), shard.id(), currentNode.getNodeId(),
|
ShardRouting targetRelocatingShard = routingNodes.relocate(shard, target.nodeId());
|
||||||
shard.currentNodeId(), shard.restoreSource(), shard.primary(), INITIALIZING, shard.version() + 1);
|
currentNode.addShard(targetRelocatingShard, decision);
|
||||||
currentNode.addShard(initializingShard, decision);
|
|
||||||
routingNodes.assign(initializingShard, target.nodeId());
|
|
||||||
routingNodes.relocate(shard, target.nodeId()); // set the node to relocate after we added the initializing shard
|
|
||||||
if (logger.isTraceEnabled()) {
|
if (logger.isTraceEnabled()) {
|
||||||
logger.trace("Moved shard [{}] to node [{}]", shard, currentNode.getNodeId());
|
logger.trace("Moved shard [{}] to node [{}]", shard, currentNode.getNodeId());
|
||||||
}
|
}
|
||||||
|
@ -783,8 +780,6 @@ public class BalancedShardsAllocator extends AbstractComponent implements Shards
|
||||||
/* now allocate on the cluster - if we are started we need to relocate the shard */
|
/* now allocate on the cluster - if we are started we need to relocate the shard */
|
||||||
if (candidate.started()) {
|
if (candidate.started()) {
|
||||||
RoutingNode lowRoutingNode = routingNodes.node(minNode.getNodeId());
|
RoutingNode lowRoutingNode = routingNodes.node(minNode.getNodeId());
|
||||||
routingNodes.assign(new ShardRouting(candidate.index(), candidate.id(), lowRoutingNode.nodeId(), candidate
|
|
||||||
.currentNodeId(), candidate.restoreSource(), candidate.primary(), INITIALIZING, candidate.version() + 1), lowRoutingNode.nodeId());
|
|
||||||
routingNodes.relocate(candidate, lowRoutingNode.nodeId());
|
routingNodes.relocate(candidate, lowRoutingNode.nodeId());
|
||||||
|
|
||||||
} else {
|
} else {
|
||||||
|
|
|
@ -178,11 +178,6 @@ public class MoveAllocationCommand implements AllocationCommand {
|
||||||
if (decision.type() == Decision.Type.THROTTLE) {
|
if (decision.type() == Decision.Type.THROTTLE) {
|
||||||
// its being throttled, maybe have a flag to take it into account and fail? for now, just do it since the "user" wants it...
|
// its being throttled, maybe have a flag to take it into account and fail? for now, just do it since the "user" wants it...
|
||||||
}
|
}
|
||||||
|
|
||||||
allocation.routingNodes().assign(new ShardRouting(shardRouting.index(), shardRouting.id(),
|
|
||||||
toRoutingNode.nodeId(), shardRouting.currentNodeId(), shardRouting.restoreSource(),
|
|
||||||
shardRouting.primary(), ShardRoutingState.INITIALIZING, shardRouting.version() + 1), toRoutingNode.nodeId());
|
|
||||||
|
|
||||||
allocation.routingNodes().relocate(shardRouting, toRoutingNode.nodeId());
|
allocation.routingNodes().relocate(shardRouting, toRoutingNode.nodeId());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -193,7 +193,7 @@ public class ExceptionSerializationTests extends ElasticsearchTestCase {
|
||||||
}
|
}
|
||||||
|
|
||||||
public void testIllegalShardRoutingStateException() throws IOException {
|
public void testIllegalShardRoutingStateException() throws IOException {
|
||||||
ShardRouting routing = new ShardRouting("test", 0, "xyz", "def", false, ShardRoutingState.STARTED, 0);
|
ShardRouting routing = TestShardRouting.newShardRouting("test", 0, "xyz", "def", false, ShardRoutingState.STARTED, 0);
|
||||||
IllegalShardRoutingStateException serialize = serialize(new IllegalShardRoutingStateException(routing, "foo", new NullPointerException()));
|
IllegalShardRoutingStateException serialize = serialize(new IllegalShardRoutingStateException(routing, "foo", new NullPointerException()));
|
||||||
assertNotNull(serialize.shard());
|
assertNotNull(serialize.shard());
|
||||||
assertEquals(routing, serialize.shard());
|
assertEquals(routing, serialize.shard());
|
||||||
|
|
|
@ -225,7 +225,7 @@ public class ShardReplicationTests extends ElasticsearchTestCase {
|
||||||
} else {
|
} else {
|
||||||
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
||||||
}
|
}
|
||||||
indexShardRoutingBuilder.addShard(new ShardRouting(index, 0, primaryNode, relocatingNode, null, true, primaryState, 0, unassignedInfo));
|
indexShardRoutingBuilder.addShard(TestShardRouting.newShardRouting(index, 0, primaryNode, relocatingNode, null, true, primaryState, 0, unassignedInfo));
|
||||||
|
|
||||||
for (ShardRoutingState replicaState : replicaStates) {
|
for (ShardRoutingState replicaState : replicaStates) {
|
||||||
String replicaNode = null;
|
String replicaNode = null;
|
||||||
|
@ -241,7 +241,7 @@ public class ShardReplicationTests extends ElasticsearchTestCase {
|
||||||
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
||||||
}
|
}
|
||||||
indexShardRoutingBuilder.addShard(
|
indexShardRoutingBuilder.addShard(
|
||||||
new ShardRouting(index, shardId.id(), replicaNode, relocatingNode, null, false, replicaState, 0, unassignedInfo));
|
TestShardRouting.newShardRouting(index, shardId.id(), replicaNode, relocatingNode, null, false, replicaState, 0, unassignedInfo));
|
||||||
}
|
}
|
||||||
|
|
||||||
ClusterState.Builder state = ClusterState.builder(new ClusterName("test"));
|
ClusterState.Builder state = ClusterState.builder(new ClusterName("test"));
|
||||||
|
|
|
@ -122,11 +122,11 @@ public class ClusterHealthResponsesTests extends ElasticsearchTestCase {
|
||||||
|
|
||||||
switch (state) {
|
switch (state) {
|
||||||
case STARTED:
|
case STARTED:
|
||||||
return new ShardRouting(index, shardId, "node_" + Integer.toString(node_id++), null, null, primary, ShardRoutingState.STARTED, 1);
|
return TestShardRouting.newShardRouting(index, shardId, "node_" + Integer.toString(node_id++), null, null, primary, ShardRoutingState.STARTED, 1);
|
||||||
case INITIALIZING:
|
case INITIALIZING:
|
||||||
return new ShardRouting(index, shardId, "node_" + Integer.toString(node_id++), null, null, primary, ShardRoutingState.INITIALIZING, 1);
|
return TestShardRouting.newShardRouting(index, shardId, "node_" + Integer.toString(node_id++), null, null, primary, ShardRoutingState.INITIALIZING, 1);
|
||||||
case RELOCATING:
|
case RELOCATING:
|
||||||
return new ShardRouting(index, shardId, "node_" + Integer.toString(node_id++), "node_" + Integer.toString(node_id++), null, primary, ShardRoutingState.RELOCATING, 1);
|
return TestShardRouting.newShardRouting(index, shardId, "node_" + Integer.toString(node_id++), "node_" + Integer.toString(node_id++), null, primary, ShardRoutingState.RELOCATING, 1);
|
||||||
default:
|
default:
|
||||||
throw new ElasticsearchException("Unknown state: " + state.name());
|
throw new ElasticsearchException("Unknown state: " + state.name());
|
||||||
}
|
}
|
||||||
|
|
|
@ -222,7 +222,7 @@ public class ClusterStateDiffTests extends ElasticsearchIntegrationTest {
|
||||||
int replicaCount = randomIntBetween(1, 10);
|
int replicaCount = randomIntBetween(1, 10);
|
||||||
for (int j = 0; j < replicaCount; j++) {
|
for (int j = 0; j < replicaCount; j++) {
|
||||||
indexShard.addShard(
|
indexShard.addShard(
|
||||||
new ShardRouting(index, i, randomFrom(nodeIds), null, null, j == 0, ShardRoutingState.fromValue((byte) randomIntBetween(2, 4)), 1));
|
TestShardRouting.newShardRouting(index, i, randomFrom(nodeIds), null, null, j == 0, ShardRoutingState.fromValue((byte) randomIntBetween(2, 4)), 1));
|
||||||
}
|
}
|
||||||
builder.addIndexShard(indexShard.build());
|
builder.addIndexShard(indexShard.build());
|
||||||
}
|
}
|
||||||
|
|
|
@ -19,19 +19,12 @@
|
||||||
|
|
||||||
package org.elasticsearch.cluster.routing;
|
package org.elasticsearch.cluster.routing;
|
||||||
|
|
||||||
import com.google.common.collect.ImmutableMap;
|
|
||||||
import org.elasticsearch.Version;
|
import org.elasticsearch.Version;
|
||||||
import org.elasticsearch.cluster.ClusterState;
|
import org.elasticsearch.cluster.ClusterState;
|
||||||
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
||||||
import org.elasticsearch.cluster.metadata.MetaData;
|
import org.elasticsearch.cluster.metadata.MetaData;
|
||||||
import org.elasticsearch.cluster.node.DiscoveryNode;
|
|
||||||
import org.elasticsearch.cluster.node.DiscoveryNodes;
|
|
||||||
import org.elasticsearch.cluster.routing.allocation.AllocationService;
|
|
||||||
import org.elasticsearch.cluster.routing.allocation.decider.SameShardAllocationDecider;
|
|
||||||
import org.elasticsearch.common.io.stream.BytesStreamOutput;
|
import org.elasticsearch.common.io.stream.BytesStreamOutput;
|
||||||
import org.elasticsearch.common.io.stream.StreamInput;
|
import org.elasticsearch.common.io.stream.StreamInput;
|
||||||
import org.elasticsearch.common.transport.DummyTransportAddress;
|
|
||||||
import org.elasticsearch.test.ElasticsearchAllocationTestCase;
|
|
||||||
import org.elasticsearch.test.ElasticsearchTestCase;
|
import org.elasticsearch.test.ElasticsearchTestCase;
|
||||||
|
|
||||||
import java.io.IOException;
|
import java.io.IOException;
|
||||||
|
@ -39,11 +32,11 @@ import java.io.IOException;
|
||||||
public class ShardRoutingTests extends ElasticsearchTestCase {
|
public class ShardRoutingTests extends ElasticsearchTestCase {
|
||||||
|
|
||||||
public void testFrozenAfterRead() throws IOException {
|
public void testFrozenAfterRead() throws IOException {
|
||||||
ShardRouting routing = new ShardRouting("foo", 1, "node_1", null, null, false, ShardRoutingState.INITIALIZING, 1);
|
ShardRouting routing = TestShardRouting.newShardRouting("foo", 1, "node_1", null, null, false, ShardRoutingState.INITIALIZING, 1);
|
||||||
routing.moveToPrimary();
|
routing.moveToPrimary();
|
||||||
assertTrue(routing.primary);
|
assertTrue(routing.primary());
|
||||||
routing.moveFromPrimary();
|
routing.moveFromPrimary();
|
||||||
assertFalse(routing.primary);
|
assertFalse(routing.primary());
|
||||||
BytesStreamOutput out = new BytesStreamOutput();
|
BytesStreamOutput out = new BytesStreamOutput();
|
||||||
routing.writeTo(out);
|
routing.writeTo(out);
|
||||||
ShardRouting newRouting = ShardRouting.readShardRoutingEntry(StreamInput.wrap(out.bytes()));
|
ShardRouting newRouting = ShardRouting.readShardRoutingEntry(StreamInput.wrap(out.bytes()));
|
||||||
|
|
|
@ -0,0 +1,45 @@
|
||||||
|
/*
|
||||||
|
* Licensed to Elasticsearch under one or more contributor
|
||||||
|
* license agreements. See the NOTICE file distributed with
|
||||||
|
* this work for additional information regarding copyright
|
||||||
|
* ownership. Elasticsearch licenses this file to you 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 org.elasticsearch.cluster.routing;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* A helper that allows to create shard routing instances within tests, while not requiring to expose
|
||||||
|
* different simplified constructors on the ShardRouting itself.
|
||||||
|
*/
|
||||||
|
public class TestShardRouting {
|
||||||
|
|
||||||
|
public static ShardRouting newShardRouting(String index, int shardId, String currentNodeId, boolean primary, ShardRoutingState state, long version) {
|
||||||
|
return new ShardRouting(index, shardId, currentNodeId, null, null, primary, state, version, null, true);
|
||||||
|
}
|
||||||
|
|
||||||
|
public static ShardRouting newShardRouting(String index, int shardId, String currentNodeId, String relocatingNodeId, boolean primary, ShardRoutingState state, long version) {
|
||||||
|
return new ShardRouting(index, shardId, currentNodeId, relocatingNodeId, null, primary, state, version, null, true);
|
||||||
|
}
|
||||||
|
|
||||||
|
public static ShardRouting newShardRouting(String index, int shardId, String currentNodeId, String relocatingNodeId, RestoreSource restoreSource, boolean primary, ShardRoutingState state, long version) {
|
||||||
|
return new ShardRouting(index, shardId, currentNodeId, relocatingNodeId, restoreSource, primary, state, version, null, true);
|
||||||
|
}
|
||||||
|
|
||||||
|
public static ShardRouting newShardRouting(String index, int shardId, String currentNodeId,
|
||||||
|
String relocatingNodeId, RestoreSource restoreSource, boolean primary, ShardRoutingState state, long version,
|
||||||
|
UnassignedInfo unassignedInfo) {
|
||||||
|
return new ShardRouting(index, shardId, currentNodeId, relocatingNodeId, restoreSource, primary, state, version, unassignedInfo, true);
|
||||||
|
}
|
||||||
|
}
|
|
@ -186,7 +186,7 @@ public class UnassignedInfoTests extends ElasticsearchAllocationTestCase {
|
||||||
*/
|
*/
|
||||||
@Test
|
@Test
|
||||||
public void testStateTransitionMetaHandling() {
|
public void testStateTransitionMetaHandling() {
|
||||||
ShardRouting shard = new ShardRouting("test", 1, null, null, null, true, ShardRoutingState.UNASSIGNED, 1, new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null));
|
ShardRouting shard = TestShardRouting.newShardRouting("test", 1, null, null, null, true, ShardRoutingState.UNASSIGNED, 1, new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null));
|
||||||
ShardRouting mutable = new ShardRouting(shard);
|
ShardRouting mutable = new ShardRouting(shard);
|
||||||
assertThat(mutable.unassignedInfo(), notNullValue());
|
assertThat(mutable.unassignedInfo(), notNullValue());
|
||||||
mutable.assignToNode("test_node");
|
mutable.assignToNode("test_node");
|
||||||
|
|
|
@ -77,7 +77,7 @@ public abstract class CatAllocationTestBase extends ElasticsearchAllocationTestC
|
||||||
ShardRoutingState state = ShardRoutingState.valueOf(matcher.group(4));
|
ShardRoutingState state = ShardRoutingState.valueOf(matcher.group(4));
|
||||||
String ip = matcher.group(5);
|
String ip = matcher.group(5);
|
||||||
nodes.add(ip);
|
nodes.add(ip);
|
||||||
ShardRouting routing = new ShardRouting(index, shard, ip, null, null, primary, state, 1);
|
ShardRouting routing = TestShardRouting.newShardRouting(index, shard, ip, null, null, primary, state, 1);
|
||||||
idx.add(routing);
|
idx.add(routing);
|
||||||
logger.debug("Add routing {}", routing);
|
logger.debug("Add routing {}", routing);
|
||||||
} else {
|
} else {
|
||||||
|
|
|
@ -256,7 +256,7 @@ public class FailedShardsRoutingTests extends ElasticsearchAllocationTestCase {
|
||||||
|
|
||||||
logger.info("fail the first shard, will have no place to be rerouted to (single node), so stays unassigned");
|
logger.info("fail the first shard, will have no place to be rerouted to (single node), so stays unassigned");
|
||||||
prevRoutingTable = routingTable;
|
prevRoutingTable = routingTable;
|
||||||
routingTable = strategy.applyFailedShard(clusterState, new ShardRouting("test", 0, "node1", true, INITIALIZING, 0)).routingTable();
|
routingTable = strategy.applyFailedShard(clusterState, TestShardRouting.newShardRouting("test", 0, "node1", true, INITIALIZING, 0)).routingTable();
|
||||||
clusterState = ClusterState.builder(clusterState).routingTable(routingTable).build();
|
clusterState = ClusterState.builder(clusterState).routingTable(routingTable).build();
|
||||||
RoutingNodes routingNodes = clusterState.routingNodes();
|
RoutingNodes routingNodes = clusterState.routingNodes();
|
||||||
|
|
||||||
|
@ -272,7 +272,7 @@ public class FailedShardsRoutingTests extends ElasticsearchAllocationTestCase {
|
||||||
}
|
}
|
||||||
|
|
||||||
logger.info("fail the shard again, see that nothing happens");
|
logger.info("fail the shard again, see that nothing happens");
|
||||||
assertThat(strategy.applyFailedShard(clusterState, new ShardRouting("test", 0, "node1", true, INITIALIZING, 0)).changed(), equalTo(false));
|
assertThat(strategy.applyFailedShard(clusterState, TestShardRouting.newShardRouting("test", 0, "node1", true, INITIALIZING, 0)).changed(), equalTo(false));
|
||||||
}
|
}
|
||||||
|
|
||||||
@Test
|
@Test
|
||||||
|
@ -371,7 +371,7 @@ public class FailedShardsRoutingTests extends ElasticsearchAllocationTestCase {
|
||||||
|
|
||||||
logger.info("fail the first shard, will start INITIALIZING on the second node");
|
logger.info("fail the first shard, will start INITIALIZING on the second node");
|
||||||
prevRoutingTable = routingTable;
|
prevRoutingTable = routingTable;
|
||||||
routingTable = strategy.applyFailedShard(clusterState, new ShardRouting("test", 0, nodeHoldingPrimary, true, INITIALIZING, 0)).routingTable();
|
routingTable = strategy.applyFailedShard(clusterState, TestShardRouting.newShardRouting("test", 0, nodeHoldingPrimary, true, INITIALIZING, 0)).routingTable();
|
||||||
clusterState = ClusterState.builder(clusterState).routingTable(routingTable).build();
|
clusterState = ClusterState.builder(clusterState).routingTable(routingTable).build();
|
||||||
RoutingNodes routingNodes = clusterState.routingNodes();
|
RoutingNodes routingNodes = clusterState.routingNodes();
|
||||||
|
|
||||||
|
@ -387,7 +387,7 @@ public class FailedShardsRoutingTests extends ElasticsearchAllocationTestCase {
|
||||||
}
|
}
|
||||||
|
|
||||||
logger.info("fail the shard again, see that nothing happens");
|
logger.info("fail the shard again, see that nothing happens");
|
||||||
assertThat(strategy.applyFailedShard(clusterState, new ShardRouting("test", 0, nodeHoldingPrimary, true, INITIALIZING, 0)).changed(), equalTo(false));
|
assertThat(strategy.applyFailedShard(clusterState, TestShardRouting.newShardRouting("test", 0, nodeHoldingPrimary, true, INITIALIZING, 0)).changed(), equalTo(false));
|
||||||
}
|
}
|
||||||
|
|
||||||
@Test
|
@Test
|
||||||
|
|
|
@ -829,8 +829,8 @@ public class DiskThresholdDeciderTests extends ElasticsearchAllocationTestCase {
|
||||||
.build();
|
.build();
|
||||||
|
|
||||||
// Two shards consuming each 80% of disk space while 70% is allowed, so shard 0 isn't allowed here
|
// Two shards consuming each 80% of disk space while 70% is allowed, so shard 0 isn't allowed here
|
||||||
ShardRouting firstRouting = new ShardRouting("test", 0, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
ShardRouting firstRouting = TestShardRouting.newShardRouting("test", 0, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
||||||
ShardRouting secondRouting = new ShardRouting("test", 1, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
ShardRouting secondRouting = TestShardRouting.newShardRouting("test", 1, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
||||||
RoutingNode firstRoutingNode = new RoutingNode("node1", discoveryNode1, Arrays.asList(firstRouting, secondRouting));
|
RoutingNode firstRoutingNode = new RoutingNode("node1", discoveryNode1, Arrays.asList(firstRouting, secondRouting));
|
||||||
RoutingTable.Builder builder = RoutingTable.builder().add(
|
RoutingTable.Builder builder = RoutingTable.builder().add(
|
||||||
IndexRoutingTable.builder("test")
|
IndexRoutingTable.builder("test")
|
||||||
|
@ -849,8 +849,8 @@ public class DiskThresholdDeciderTests extends ElasticsearchAllocationTestCase {
|
||||||
assertThat(decision.type(), equalTo(Decision.Type.NO));
|
assertThat(decision.type(), equalTo(Decision.Type.NO));
|
||||||
|
|
||||||
// Two shards consuming each 80% of disk space while 70% is allowed, but one is relocating, so shard 0 can stay
|
// Two shards consuming each 80% of disk space while 70% is allowed, but one is relocating, so shard 0 can stay
|
||||||
firstRouting = new ShardRouting("test", 0, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
firstRouting = TestShardRouting.newShardRouting("test", 0, "node1", null, null, true, ShardRoutingState.STARTED, 1);
|
||||||
secondRouting = new ShardRouting("test", 1, "node1", "node2", null, true, ShardRoutingState.RELOCATING, 1);
|
secondRouting = TestShardRouting.newShardRouting("test", 1, "node1", "node2", null, true, ShardRoutingState.RELOCATING, 1);
|
||||||
firstRoutingNode = new RoutingNode("node1", discoveryNode1, Arrays.asList(firstRouting, secondRouting));
|
firstRoutingNode = new RoutingNode("node1", discoveryNode1, Arrays.asList(firstRouting, secondRouting));
|
||||||
builder = RoutingTable.builder().add(
|
builder = RoutingTable.builder().add(
|
||||||
IndexRoutingTable.builder("test")
|
IndexRoutingTable.builder("test")
|
||||||
|
|
|
@ -19,10 +19,7 @@
|
||||||
package org.elasticsearch.gateway;
|
package org.elasticsearch.gateway;
|
||||||
|
|
||||||
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
||||||
import org.elasticsearch.cluster.routing.RoutingNodes;
|
import org.elasticsearch.cluster.routing.*;
|
||||||
import org.elasticsearch.cluster.routing.ShardRouting;
|
|
||||||
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
|
||||||
import org.elasticsearch.cluster.routing.UnassignedInfo;
|
|
||||||
import org.elasticsearch.common.settings.Settings;
|
import org.elasticsearch.common.settings.Settings;
|
||||||
import org.elasticsearch.test.ElasticsearchTestCase;
|
import org.elasticsearch.test.ElasticsearchTestCase;
|
||||||
|
|
||||||
|
@ -49,7 +46,7 @@ public class PriorityComparatorTests extends ElasticsearchTestCase {
|
||||||
int numShards = randomIntBetween(10, 100);
|
int numShards = randomIntBetween(10, 100);
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
IndexMeta indexMeta = randomFrom(indices);
|
IndexMeta indexMeta = randomFrom(indices);
|
||||||
shards.add(new ShardRouting(indexMeta.name, randomIntBetween(1, 5), null, null, null,
|
shards.add(TestShardRouting.newShardRouting(indexMeta.name, randomIntBetween(1, 5), null, null, null,
|
||||||
randomBoolean(), ShardRoutingState.UNASSIGNED, randomIntBetween(0, 100), new UnassignedInfo(randomFrom(UnassignedInfo.Reason.values()), "foobar")));
|
randomBoolean(), ShardRoutingState.UNASSIGNED, randomIntBetween(0, 100), new UnassignedInfo(randomFrom(UnassignedInfo.Reason.values()), "foobar")));
|
||||||
}
|
}
|
||||||
shards.sort(new PriorityComparator() {
|
shards.sort(new PriorityComparator() {
|
||||||
|
|
|
@ -25,6 +25,7 @@ import org.elasticsearch.action.admin.indices.stats.IndexStats;
|
||||||
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
import org.elasticsearch.cluster.metadata.IndexMetaData;
|
||||||
import org.elasticsearch.cluster.routing.ShardRouting;
|
import org.elasticsearch.cluster.routing.ShardRouting;
|
||||||
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
||||||
|
import org.elasticsearch.cluster.routing.TestShardRouting;
|
||||||
import org.elasticsearch.common.bytes.BytesArray;
|
import org.elasticsearch.common.bytes.BytesArray;
|
||||||
import org.elasticsearch.common.logging.ESLogger;
|
import org.elasticsearch.common.logging.ESLogger;
|
||||||
import org.elasticsearch.common.settings.Settings;
|
import org.elasticsearch.common.settings.Settings;
|
||||||
|
@ -161,7 +162,7 @@ public class IndexShardTests extends ElasticsearchSingleNodeTest {
|
||||||
assertEquals(shardStateMetaData, new ShardStateMetaData(routing.version(), routing.primary(), shard.indexSettings.get(IndexMetaData.SETTING_UUID)));
|
assertEquals(shardStateMetaData, new ShardStateMetaData(routing.version(), routing.primary(), shard.indexSettings.get(IndexMetaData.SETTING_UUID)));
|
||||||
|
|
||||||
// test if we still write it even if the shard is not active
|
// test if we still write it even if the shard is not active
|
||||||
ShardRouting inactiveRouting = new ShardRouting(shard.shardRouting.index(), shard.shardRouting.shardId().id(), shard.shardRouting.currentNodeId(), null, null, true, ShardRoutingState.INITIALIZING, shard.shardRouting.version() + 1);
|
ShardRouting inactiveRouting = TestShardRouting.newShardRouting(shard.shardRouting.index(), shard.shardRouting.shardId().id(), shard.shardRouting.currentNodeId(), null, null, true, ShardRoutingState.INITIALIZING, shard.shardRouting.version() + 1);
|
||||||
shard.persistMetadata(inactiveRouting, shard.shardRouting);
|
shard.persistMetadata(inactiveRouting, shard.shardRouting);
|
||||||
shardStateMetaData = load(logger, env.availableShardPaths(shard.shardId));
|
shardStateMetaData = load(logger, env.availableShardPaths(shard.shardId));
|
||||||
assertEquals("inactive shard state shouldn't be persisted", shardStateMetaData, getShardStateMetadata(shard));
|
assertEquals("inactive shard state shouldn't be persisted", shardStateMetaData, getShardStateMetadata(shard));
|
||||||
|
@ -199,7 +200,7 @@ public class IndexShardTests extends ElasticsearchSingleNodeTest {
|
||||||
ShardStateMetaData shardStateMetaData = load(logger, env.availableShardPaths(shard.shardId));
|
ShardStateMetaData shardStateMetaData = load(logger, env.availableShardPaths(shard.shardId));
|
||||||
assertEquals(shardStateMetaData, getShardStateMetadata(shard));
|
assertEquals(shardStateMetaData, getShardStateMetadata(shard));
|
||||||
|
|
||||||
routing = new ShardRouting(shard.shardId.index().getName(), shard.shardId.id(), routing.currentNodeId(), null, null, routing.primary(), ShardRoutingState.INITIALIZING, shard.shardRouting.version() + 1);
|
routing = TestShardRouting.newShardRouting(shard.shardId.index().getName(), shard.shardId.id(), routing.currentNodeId(), null, null, routing.primary(), ShardRoutingState.INITIALIZING, shard.shardRouting.version() + 1);
|
||||||
shard.updateRoutingEntry(routing, true);
|
shard.updateRoutingEntry(routing, true);
|
||||||
shard.deleteShardState();
|
shard.deleteShardState();
|
||||||
|
|
||||||
|
|
|
@ -23,6 +23,7 @@ import com.carrotsearch.hppc.ObjectIntHashMap;
|
||||||
import com.carrotsearch.hppc.ObjectIntMap;
|
import com.carrotsearch.hppc.ObjectIntMap;
|
||||||
import org.elasticsearch.cluster.routing.ShardRouting;
|
import org.elasticsearch.cluster.routing.ShardRouting;
|
||||||
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
||||||
|
import org.elasticsearch.cluster.routing.TestShardRouting;
|
||||||
import org.elasticsearch.index.shard.ShardId;
|
import org.elasticsearch.index.shard.ShardId;
|
||||||
import org.elasticsearch.indices.flush.IndicesSyncedFlushResult.ShardCounts;
|
import org.elasticsearch.indices.flush.IndicesSyncedFlushResult.ShardCounts;
|
||||||
import org.elasticsearch.indices.flush.SyncedFlushService.SyncedFlushResponse;
|
import org.elasticsearch.indices.flush.SyncedFlushService.SyncedFlushResponse;
|
||||||
|
@ -106,7 +107,7 @@ public class SyncedFlushUnitTests extends ElasticsearchTestCase {
|
||||||
} else {
|
} else {
|
||||||
Map<ShardRouting, SyncedFlushResponse> shardResponses = new HashMap<>();
|
Map<ShardRouting, SyncedFlushResponse> shardResponses = new HashMap<>();
|
||||||
for (int copy = 0; copy < replicas + 1; copy++) {
|
for (int copy = 0; copy < replicas + 1; copy++) {
|
||||||
final ShardRouting shardRouting = new ShardRouting(index, shard, "node_" + shardId + "_" + copy, null,
|
final ShardRouting shardRouting = TestShardRouting.newShardRouting(index, shard, "node_" + shardId + "_" + copy, null,
|
||||||
copy == 0, ShardRoutingState.STARTED, 0);
|
copy == 0, ShardRoutingState.STARTED, 0);
|
||||||
if (randomInt(5) < 2) {
|
if (randomInt(5) < 2) {
|
||||||
// shard copy failure
|
// shard copy failure
|
||||||
|
|
|
@ -251,7 +251,7 @@ public class IndicesStoreIntegrationTests extends ElasticsearchIntegrationTest {
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
indexRoutingTableBuilder.addIndexShard(
|
indexRoutingTableBuilder.addIndexShard(
|
||||||
new IndexShardRoutingTable.Builder(new ShardId("test", i), false)
|
new IndexShardRoutingTable.Builder(new ShardId("test", i), false)
|
||||||
.addShard(new ShardRouting("test", i, node_1_id, true, ShardRoutingState.STARTED, shardVersions[shardIds[i]]))
|
.addShard(TestShardRouting.newShardRouting("test", i, node_1_id, true, ShardRoutingState.STARTED, shardVersions[shardIds[i]]))
|
||||||
.build()
|
.build()
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|
|
@ -26,10 +26,7 @@ import org.elasticsearch.cluster.metadata.IndexMetaData;
|
||||||
import org.elasticsearch.cluster.metadata.MetaData;
|
import org.elasticsearch.cluster.metadata.MetaData;
|
||||||
import org.elasticsearch.cluster.node.DiscoveryNode;
|
import org.elasticsearch.cluster.node.DiscoveryNode;
|
||||||
import org.elasticsearch.cluster.node.DiscoveryNodes;
|
import org.elasticsearch.cluster.node.DiscoveryNodes;
|
||||||
import org.elasticsearch.cluster.routing.ShardRouting;
|
import org.elasticsearch.cluster.routing.*;
|
||||||
import org.elasticsearch.cluster.routing.IndexShardRoutingTable;
|
|
||||||
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
|
||||||
import org.elasticsearch.cluster.routing.UnassignedInfo;
|
|
||||||
import org.elasticsearch.common.transport.LocalTransportAddress;
|
import org.elasticsearch.common.transport.LocalTransportAddress;
|
||||||
import org.elasticsearch.index.shard.ShardId;
|
import org.elasticsearch.index.shard.ShardId;
|
||||||
import org.elasticsearch.test.ElasticsearchTestCase;
|
import org.elasticsearch.test.ElasticsearchTestCase;
|
||||||
|
@ -100,7 +97,7 @@ public class IndicesStoreTests extends ElasticsearchTestCase {
|
||||||
if (state == ShardRoutingState.UNASSIGNED) {
|
if (state == ShardRoutingState.UNASSIGNED) {
|
||||||
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
unassignedInfo = new UnassignedInfo(UnassignedInfo.Reason.INDEX_CREATED, null);
|
||||||
}
|
}
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", null, null, j == 0, state, 0, unassignedInfo));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", null, null, j == 0, state, 0, unassignedInfo));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
assertFalse(indicesStore.shardCanBeDeleted(clusterState.build(), routingTable.build()));
|
assertFalse(indicesStore.shardCanBeDeleted(clusterState.build(), routingTable.build()));
|
||||||
|
@ -119,9 +116,9 @@ public class IndicesStoreTests extends ElasticsearchTestCase {
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
String nodeId = i == localShardId ? localNode.getId() : randomBoolean() ? "abc" : "xyz";
|
String nodeId = i == localShardId ? localNode.getId() : randomBoolean() ? "abc" : "xyz";
|
||||||
String relocationNodeId = randomBoolean() ? null : randomBoolean() ? localNode.getId() : "xyz";
|
String relocationNodeId = randomBoolean() ? null : randomBoolean() ? localNode.getId() : "xyz";
|
||||||
routingTable.addShard(new ShardRouting("test", i, nodeId, relocationNodeId, true, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, nodeId, relocationNodeId, true, ShardRoutingState.STARTED, 0));
|
||||||
for (int j = 0; j < numReplicas; j++) {
|
for (int j = 0; j < numReplicas; j++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, nodeId, relocationNodeId, false, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, nodeId, relocationNodeId, false, ShardRoutingState.STARTED, 0));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -140,9 +137,9 @@ public class IndicesStoreTests extends ElasticsearchTestCase {
|
||||||
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
String relocatingNodeId = randomBoolean() ? null : "def";
|
String relocatingNodeId = randomBoolean() ? null : "def";
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", relocatingNodeId, true, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", relocatingNodeId, true, ShardRoutingState.STARTED, 0));
|
||||||
for (int j = 0; j < numReplicas; j++) {
|
for (int j = 0; j < numReplicas; j++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", relocatingNodeId, false, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", relocatingNodeId, false, ShardRoutingState.STARTED, 0));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -162,9 +159,9 @@ public class IndicesStoreTests extends ElasticsearchTestCase {
|
||||||
clusterState.nodes(DiscoveryNodes.builder().localNodeId(localNode.id()).put(localNode).put(new DiscoveryNode("xyz", new LocalTransportAddress("xyz"), nodeVersion)));
|
clusterState.nodes(DiscoveryNodes.builder().localNodeId(localNode.id()).put(localNode).put(new DiscoveryNode("xyz", new LocalTransportAddress("xyz"), nodeVersion)));
|
||||||
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", null, true, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", null, true, ShardRoutingState.STARTED, 0));
|
||||||
for (int j = 0; j < numReplicas; j++) {
|
for (int j = 0; j < numReplicas; j++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", null, false, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", null, false, ShardRoutingState.STARTED, 0));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -188,9 +185,9 @@ public class IndicesStoreTests extends ElasticsearchTestCase {
|
||||||
));
|
));
|
||||||
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
IndexShardRoutingTable.Builder routingTable = new IndexShardRoutingTable.Builder(new ShardId("test", 1), false);
|
||||||
for (int i = 0; i < numShards; i++) {
|
for (int i = 0; i < numShards; i++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", "def", true, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", "def", true, ShardRoutingState.STARTED, 0));
|
||||||
for (int j = 0; j < numReplicas; j++) {
|
for (int j = 0; j < numReplicas; j++) {
|
||||||
routingTable.addShard(new ShardRouting("test", i, "xyz", "def", false, ShardRoutingState.STARTED, 0));
|
routingTable.addShard(TestShardRouting.newShardRouting("test", i, "xyz", "def", false, ShardRoutingState.STARTED, 0));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue