| /* |
| * 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 |
| * <p/> |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * <p/> |
| * 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.hadoop.hdds.scm.container.replication; |
| |
| import org.apache.hadoop.hdds.scm.container.ContainerInfo; |
| import org.apache.hadoop.ozone.protocol.commands.SCMCommand; |
| |
| import java.util.ArrayList; |
| import java.util.List; |
| |
| /** |
| * Class used to represent the Health States of containers. |
| */ |
| public class ContainerHealthResult { |
| |
| /** |
| * All possible container health states. |
| */ |
| public enum HealthState { |
| HEALTHY, |
| UNHEALTHY, |
| UNDER_REPLICATED, |
| OVER_REPLICATED |
| } |
| |
| private final ContainerInfo containerInfo; |
| private final HealthState healthState; |
| private final List<SCMCommand> commands = new ArrayList<>(); |
| |
| public ContainerHealthResult(ContainerInfo containerInfo, |
| HealthState healthState) { |
| this.containerInfo = containerInfo; |
| this.healthState = healthState; |
| } |
| |
| public HealthState getHealthState() { |
| return healthState; |
| } |
| |
| public void addCommand(SCMCommand command) { |
| commands.add(command); |
| } |
| |
| public List<SCMCommand> getCommands() { |
| return commands; |
| } |
| |
| public ContainerInfo getContainerInfo() { |
| return containerInfo; |
| } |
| |
| /** |
| * Class for Healthy Container Check results. |
| */ |
| public static class HealthyResult extends ContainerHealthResult { |
| |
| public HealthyResult(ContainerInfo containerInfo) { |
| super(containerInfo, HealthState.HEALTHY); |
| } |
| } |
| |
| /** |
| * Class for Unhealthy container check results, where the container has some |
| * issue other than over or under replication. |
| */ |
| public static class UnHealthyResult extends ContainerHealthResult { |
| |
| UnHealthyResult(ContainerInfo containerInfo) { |
| super(containerInfo, HealthState.UNHEALTHY); |
| } |
| } |
| |
| /** |
| * Class for UnderReplicated Container Check Results. |
| */ |
| public static class UnderReplicatedHealthResult |
| extends ContainerHealthResult { |
| |
| // For under replicated containers, the best remaining redundancy we can |
| // have is 3 for EC-10-4, 2 for EC-6-3, 1 for EC-3-2 and 2 for Ratis. |
| // A container which is under-replicated due to decommission will have one |
| // more, ie 4, 3, 2, 3 respectively. Ideally we want to sort decommission |
| // only under-replication after all other under-replicated containers. |
| // It may also make sense to allow under-replicated containers a chance to |
| // retry once before processing the decommission only under replication. |
| // Therefore we should adjust the weighted remaining redundancy of |
| // decommission only under-replicated containers to a floor of 5 so they |
| // sort after an under-replicated container with 3 remaining replicas ( |
| // EC-10-4) and plus one retry. |
| private static final int DECOMMISSION_REDUNDANCY = 5; |
| |
| private final int remainingRedundancy; |
| private final boolean dueToDecommission; |
| private final boolean sufficientlyReplicatedAfterPending; |
| private final boolean unrecoverable; |
| private int requeueCount = 0; |
| |
| public UnderReplicatedHealthResult(ContainerInfo containerInfo, |
| int remainingRedundancy, boolean dueToDecommission, |
| boolean replicatedOkWithPending, boolean unrecoverable) { |
| super(containerInfo, HealthState.UNDER_REPLICATED); |
| this.remainingRedundancy = remainingRedundancy; |
| this.dueToDecommission = dueToDecommission; |
| this.sufficientlyReplicatedAfterPending = replicatedOkWithPending; |
| this.unrecoverable = unrecoverable; |
| } |
| |
| /** |
| * How many more replicas can be lost before the container is |
| * unreadable. For containers which are under-replicated due to decommission |
| * or maintenance only, the remaining redundancy will include those |
| * decommissioning or maintenance replicas, as they are technically still |
| * available until the datanode processes are stopped. |
| * @return Count of remaining redundant replicas. |
| */ |
| public int getRemainingRedundancy() { |
| return remainingRedundancy; |
| } |
| |
| /** |
| * The weightedRedundancy, is the remaining redundancy + the requeue count. |
| * When this value is used for ordering in a priority queue it ensures the |
| * priority is reduced each time it is requeued, to prevent it from blocking |
| * other containers from being processed. |
| * Additionally, so that decommission and maintenance replicas are not |
| * ordered ahead of under-replicated replicas, a redundancy of |
| * DECOMMISSION_REDUNDANCY is used for the decommission redundancy rather |
| * than its real redundancy. |
| * @return The weightedRedundancy of this result. |
| */ |
| public int getWeightedRedundancy() { |
| int result = requeueCount; |
| if (dueToDecommission) { |
| result += DECOMMISSION_REDUNDANCY; |
| } else { |
| result += remainingRedundancy; |
| } |
| return result; |
| } |
| |
| /** |
| * If there is an attempt to process this under-replicated result, and it |
| * fails and has to be requeued, this method should be called to increment |
| * the requeue count to ensure the result is not placed back at the head |
| * of the queue. |
| */ |
| public void incrementRequeueCount() { |
| ++requeueCount; |
| } |
| |
| public int getRequeueCount() { |
| return requeueCount; |
| } |
| |
| /** |
| * Indicates whether the under-replication is caused only by replicas |
| * being decommissioned or entering maintenance. Ie, there are not replicas |
| * unavailable. |
| * @return True is the under-replication is caused by decommission. |
| */ |
| public boolean underReplicatedDueToDecommission() { |
| return dueToDecommission; |
| } |
| |
| /** |
| * Considering the pending replicas, which have been scheduled for copy or |
| * reconstruction, will the container still be under-replicated when they |
| * complete. |
| * @return True if the under-replication is corrected by the pending |
| * replicas. False otherwise. |
| */ |
| public boolean isSufficientlyReplicatedAfterPending() { |
| return sufficientlyReplicatedAfterPending; |
| } |
| |
| /** |
| * Indicates whether a container has enough replicas to be read. For Ratis |
| * at least one replia must be available. For EC, at least dataNum replicas |
| * are needed. |
| * @return True if the container has insufficient replicas available to be |
| * read, false otherwise |
| */ |
| public boolean isUnrecoverable() { |
| return unrecoverable; |
| } |
| } |
| |
| /** |
| * Class for Over Replicated Container Health Results. |
| */ |
| public static class OverReplicatedHealthResult extends ContainerHealthResult { |
| |
| private final int excessRedundancy; |
| private final boolean sufficientlyReplicatedAfterPending; |
| |
| |
| public OverReplicatedHealthResult(ContainerInfo containerInfo, |
| int excessRedundancy, boolean replicatedOkWithPending) { |
| super(containerInfo, HealthState.OVER_REPLICATED); |
| this.excessRedundancy = excessRedundancy; |
| this.sufficientlyReplicatedAfterPending = replicatedOkWithPending; |
| } |
| |
| /** |
| * How many extra replicas are present for this container and need to be |
| * removed. For EC, this number indicates how many indexes have more than |
| * one copy. Eg index 1 could have 3 copies. Index 2 could have 2 copies. |
| * The rest have 1 copy. The value returned here will be 2, indicating 2 |
| * indexes have excess redundancy, even though we have to remove 3 replicas. |
| * For Ratis containers, the number return is simply the current replica |
| * count minus the expected replica count. |
| * @return The number of excess replicas. |
| */ |
| public int getExcessRedundancy() { |
| return excessRedundancy; |
| } |
| |
| /** |
| * Considering the pending replicas, which have been scheduled for delete, |
| * will the container still be over-replicated when they complete. |
| * @return True if the over-replication is corrected by the pending |
| * deletes. False otherwise. |
| */ |
| public boolean isSufficientlyReplicatedAfterPending() { |
| return sufficientlyReplicatedAfterPending; |
| } |
| } |
| } |