mirror of
https://github.com/kubernetes-sigs/descheduler.git
synced 2026-01-28 06:29:29 +01:00
Merge pull request #874 from kubernetes-sigs/revert-869-existing-contraints-backport-1.23
Revert "Existing contraints fix backport 1.23"
This commit is contained in:
@@ -20,7 +20,6 @@ import (
|
|||||||
"context"
|
"context"
|
||||||
"fmt"
|
"fmt"
|
||||||
"math"
|
"math"
|
||||||
"reflect"
|
|
||||||
"sort"
|
"sort"
|
||||||
|
|
||||||
v1 "k8s.io/api/core/v1"
|
v1 "k8s.io/api/core/v1"
|
||||||
@@ -107,20 +106,14 @@ func RemovePodsViolatingTopologySpreadConstraint(
|
|||||||
}
|
}
|
||||||
|
|
||||||
// ...where there is a topology constraint
|
// ...where there is a topology constraint
|
||||||
namespaceTopologySpreadConstraints := []v1.TopologySpreadConstraint{}
|
namespaceTopologySpreadConstraints := make(map[v1.TopologySpreadConstraint]struct{})
|
||||||
for _, pod := range namespacePods.Items {
|
for _, pod := range namespacePods.Items {
|
||||||
for _, constraint := range pod.Spec.TopologySpreadConstraints {
|
for _, constraint := range pod.Spec.TopologySpreadConstraints {
|
||||||
// Ignore soft topology constraints if they are not included
|
// Ignore soft topology constraints if they are not included
|
||||||
if constraint.WhenUnsatisfiable == v1.ScheduleAnyway && (strategy.Params == nil || !strategy.Params.IncludeSoftConstraints) {
|
if constraint.WhenUnsatisfiable == v1.ScheduleAnyway && (strategy.Params == nil || !strategy.Params.IncludeSoftConstraints) {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
// Need to check v1.TopologySpreadConstraint deepEquality because
|
namespaceTopologySpreadConstraints[constraint] = struct{}{}
|
||||||
// v1.TopologySpreadConstraint has pointer fields
|
|
||||||
// and we don't need to go over duplicated constraints later on
|
|
||||||
if hasIdenticalConstraints(constraint, namespaceTopologySpreadConstraints) {
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
namespaceTopologySpreadConstraints = append(namespaceTopologySpreadConstraints, constraint)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if len(namespaceTopologySpreadConstraints) == 0 {
|
if len(namespaceTopologySpreadConstraints) == 0 {
|
||||||
@@ -128,7 +121,7 @@ func RemovePodsViolatingTopologySpreadConstraint(
|
|||||||
}
|
}
|
||||||
|
|
||||||
// 2. for each topologySpreadConstraint in that namespace
|
// 2. for each topologySpreadConstraint in that namespace
|
||||||
for _, constraint := range namespaceTopologySpreadConstraints {
|
for constraint := range namespaceTopologySpreadConstraints {
|
||||||
constraintTopologies := make(map[topologyPair][]*v1.Pod)
|
constraintTopologies := make(map[topologyPair][]*v1.Pod)
|
||||||
// pre-populate the topologyPair map with all the topologies available from the nodeMap
|
// pre-populate the topologyPair map with all the topologies available from the nodeMap
|
||||||
// (we can't just build it from existing pods' nodes because a topology may have 0 pods)
|
// (we can't just build it from existing pods' nodes because a topology may have 0 pods)
|
||||||
@@ -192,16 +185,6 @@ func RemovePodsViolatingTopologySpreadConstraint(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// hasIdenticalConstraints checks if we already had an identical TopologySpreadConstraint in namespaceTopologySpreadConstraints slice
|
|
||||||
func hasIdenticalConstraints(newConstraint v1.TopologySpreadConstraint, namespaceTopologySpreadConstraints []v1.TopologySpreadConstraint) bool {
|
|
||||||
for _, constraint := range namespaceTopologySpreadConstraints {
|
|
||||||
if reflect.DeepEqual(newConstraint, constraint) {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
// topologyIsBalanced checks if any domains in the topology differ by more than the MaxSkew
|
// topologyIsBalanced checks if any domains in the topology differ by more than the MaxSkew
|
||||||
// this is called before any sorting or other calculations and is used to skip topologies that don't need to be balanced
|
// this is called before any sorting or other calculations and is used to skip topologies that don't need to be balanced
|
||||||
func topologyIsBalanced(topology map[topologyPair][]*v1.Pod, constraint v1.TopologySpreadConstraint) bool {
|
func topologyIsBalanced(topology map[topologyPair][]*v1.Pod, constraint v1.TopologySpreadConstraint) bool {
|
||||||
|
|||||||
@@ -971,54 +971,3 @@ func getDefaultTopologyConstraints(maxSkew int32) []v1.TopologySpreadConstraint
|
|||||||
},
|
},
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestCheckIdenticalConstraints(t *testing.T) {
|
|
||||||
newConstraintSame := v1.TopologySpreadConstraint{
|
|
||||||
MaxSkew: 2,
|
|
||||||
TopologyKey: "zone",
|
|
||||||
WhenUnsatisfiable: v1.DoNotSchedule,
|
|
||||||
LabelSelector: &metav1.LabelSelector{MatchLabels: map[string]string{"foo": "bar"}},
|
|
||||||
}
|
|
||||||
newConstraintDifferent := v1.TopologySpreadConstraint{
|
|
||||||
MaxSkew: 3,
|
|
||||||
TopologyKey: "node",
|
|
||||||
WhenUnsatisfiable: v1.DoNotSchedule,
|
|
||||||
LabelSelector: &metav1.LabelSelector{MatchLabels: map[string]string{"foo": "bar"}},
|
|
||||||
}
|
|
||||||
namespaceTopologySpreadConstraint := []v1.TopologySpreadConstraint{}
|
|
||||||
namespaceTopologySpreadConstraint = []v1.TopologySpreadConstraint{
|
|
||||||
{
|
|
||||||
MaxSkew: 2,
|
|
||||||
TopologyKey: "zone",
|
|
||||||
WhenUnsatisfiable: v1.DoNotSchedule,
|
|
||||||
LabelSelector: &metav1.LabelSelector{MatchLabels: map[string]string{"foo": "bar"}},
|
|
||||||
},
|
|
||||||
}
|
|
||||||
testCases := []struct {
|
|
||||||
name string
|
|
||||||
namespaceTopologySpreadConstraints []v1.TopologySpreadConstraint
|
|
||||||
newConstraint v1.TopologySpreadConstraint
|
|
||||||
expectedResult bool
|
|
||||||
}{
|
|
||||||
{
|
|
||||||
name: "new constraint is identical",
|
|
||||||
namespaceTopologySpreadConstraints: namespaceTopologySpreadConstraint,
|
|
||||||
newConstraint: newConstraintSame,
|
|
||||||
expectedResult: true,
|
|
||||||
},
|
|
||||||
{
|
|
||||||
name: "new constraint is different",
|
|
||||||
namespaceTopologySpreadConstraints: namespaceTopologySpreadConstraint,
|
|
||||||
newConstraint: newConstraintDifferent,
|
|
||||||
expectedResult: false,
|
|
||||||
},
|
|
||||||
}
|
|
||||||
for _, tc := range testCases {
|
|
||||||
t.Run(tc.name, func(t *testing.T) {
|
|
||||||
isIdentical := hasIdenticalConstraints(tc.newConstraint, tc.namespaceTopologySpreadConstraints)
|
|
||||||
if isIdentical != tc.expectedResult {
|
|
||||||
t.Errorf("Test error for description: %s. Expected result %v, got %v", tc.name, tc.expectedResult, isIdentical)
|
|
||||||
}
|
|
||||||
})
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|||||||
Reference in New Issue
Block a user