
This moves the priority types from the algorithm package to priorities package. Idea is to move the type to the packages where it is implemented. This will ease the future refactor process.
64 lines
1.6 KiB
Go
64 lines
1.6 KiB
Go
/*
|
|
Copyright 2017 The Kubernetes Authors.
|
|
|
|
Licensed 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 priorities
|
|
|
|
import (
|
|
"k8s.io/api/core/v1"
|
|
schedulerapi "k8s.io/kubernetes/pkg/scheduler/api"
|
|
schedulernodeinfo "k8s.io/kubernetes/pkg/scheduler/nodeinfo"
|
|
)
|
|
|
|
// NormalizeReduce generates a PriorityReduceFunction that can normalize the result
|
|
// scores to [0, maxPriority]. If reverse is set to true, it reverses the scores by
|
|
// subtracting it from maxPriority.
|
|
func NormalizeReduce(maxPriority int, reverse bool) PriorityReduceFunction {
|
|
return func(
|
|
_ *v1.Pod,
|
|
_ interface{},
|
|
_ map[string]*schedulernodeinfo.NodeInfo,
|
|
result schedulerapi.HostPriorityList) error {
|
|
|
|
var maxCount int
|
|
for i := range result {
|
|
if result[i].Score > maxCount {
|
|
maxCount = result[i].Score
|
|
}
|
|
}
|
|
|
|
if maxCount == 0 {
|
|
if reverse {
|
|
for i := range result {
|
|
result[i].Score = maxPriority
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
for i := range result {
|
|
score := result[i].Score
|
|
|
|
score = maxPriority * score / maxCount
|
|
if reverse {
|
|
score = maxPriority - score
|
|
}
|
|
|
|
result[i].Score = score
|
|
}
|
|
return nil
|
|
}
|
|
}
|