/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF 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.apache.cassandra.locator; import java.net.InetAddress; import java.util.ArrayList; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.HashMap; import org.apache.cassandra.dht.Token; /** * This Replication Strategy returns the nodes responsible for a given * key but respects rack awareness. It places one replica in a * different data center from the first (if there is any such data center), * the third replica in a different rack in the first datacenter, and * any remaining replicas on the first unused nodes on the ring. */ public class OldNetworkTopologyStrategy extends AbstractReplicationStrategy { public OldNetworkTopologyStrategy(String table, TokenMetadata tokenMetadata, IEndpointSnitch snitch, Map<String, String> configOptions) { super(table, tokenMetadata, snitch, configOptions); } public Map<InetAddress, Integer> calculateNaturalEndpoints(Token token, TokenMetadata metadata) { int replicas = getReplicationFactor(); Map<InetAddress, Integer> endpoints = new HashMap<InetAddress, Integer>(replicas); ArrayList<Token> tokens = metadata.sortedTokens(); if (tokens.isEmpty()) return endpoints; Iterator<Token> iter = TokenMetadata.ringIterator(tokens, token, false); Token primaryToken = iter.next(); InetAddress addr = metadata.getEndpoint(primaryToken); endpoints.put(addr, metadata.getStorageType(addr)); boolean bDataCenter = false; boolean bOtherRack = false; while (endpoints.size() < replicas && iter.hasNext()) { // First try to find one in a different data center Token t = iter.next(); if (!snitch.getDatacenter(metadata.getEndpoint(primaryToken)).equals(snitch.getDatacenter(metadata.getEndpoint(t)))) { // If we have already found something in a diff datacenter no need to find another if (!bDataCenter) { InetAddress endpoint = metadata.getEndpoint(t); endpoints.put(endpoint, metadata.getStorageType(endpoint)); bDataCenter = true; } continue; } // Now try to find one on a different rack if (!snitch.getRack(metadata.getEndpoint(primaryToken)).equals(snitch.getRack(metadata.getEndpoint(t))) && snitch.getDatacenter(metadata.getEndpoint(primaryToken)).equals(snitch.getDatacenter(metadata.getEndpoint(t)))) { // If we have already found something in a diff rack no need to find another if (!bOtherRack) { InetAddress endpoint = metadata.getEndpoint(t); endpoints.put(endpoint, metadata.getStorageType(endpoint)); bOtherRack = true; } } } // If we found N number of nodes we are good. This loop wil just exit. Otherwise just // loop through the list and add until we have N nodes. if (endpoints.size() < replicas) { iter = TokenMetadata.ringIterator(tokens, token, false); while (endpoints.size() < replicas && iter.hasNext()) { Token t = iter.next(); if (!endpoints.containsKey(metadata.getEndpoint(t))) { InetAddress endpoint = metadata.getEndpoint(t); endpoints.put(endpoint, metadata.getStorageType(endpoint)); } } if (endpoints.size() < replicas) throw new IllegalStateException(String.format("replication factor (%s) exceeds number of endpoints (%s)", replicas, endpoints.size())); } return endpoints; } }