mirror of https://github.com/k3s-io/k3s
142 lines
4.6 KiB
Go
142 lines
4.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 util
|
|
|
|
import (
|
|
"sort"
|
|
"time"
|
|
|
|
"k8s.io/api/core/v1"
|
|
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
|
|
"k8s.io/klog"
|
|
"k8s.io/kubernetes/pkg/apis/scheduling"
|
|
"k8s.io/kubernetes/pkg/scheduler/api"
|
|
)
|
|
|
|
// GetContainerPorts returns the used host ports of Pods: if 'port' was used, a 'port:true' pair
|
|
// will be in the result; but it does not resolve port conflict.
|
|
func GetContainerPorts(pods ...*v1.Pod) []*v1.ContainerPort {
|
|
var ports []*v1.ContainerPort
|
|
for _, pod := range pods {
|
|
for j := range pod.Spec.Containers {
|
|
container := &pod.Spec.Containers[j]
|
|
for k := range container.Ports {
|
|
ports = append(ports, &container.Ports[k])
|
|
}
|
|
}
|
|
}
|
|
return ports
|
|
}
|
|
|
|
// GetPodFullName returns a name that uniquely identifies a pod.
|
|
func GetPodFullName(pod *v1.Pod) string {
|
|
// Use underscore as the delimiter because it is not allowed in pod name
|
|
// (DNS subdomain format).
|
|
return pod.Name + "_" + pod.Namespace
|
|
}
|
|
|
|
// GetPodPriority returns priority of the given pod.
|
|
func GetPodPriority(pod *v1.Pod) int32 {
|
|
if pod.Spec.Priority != nil {
|
|
return *pod.Spec.Priority
|
|
}
|
|
// When priority of a running pod is nil, it means it was created at a time
|
|
// that there was no global default priority class and the priority class
|
|
// name of the pod was empty. So, we resolve to the static default priority.
|
|
return scheduling.DefaultPriorityWhenNoDefaultClassExists
|
|
}
|
|
|
|
// GetPodStartTime returns start time of the given pod.
|
|
func GetPodStartTime(pod *v1.Pod) *metav1.Time {
|
|
if pod.Status.StartTime != nil {
|
|
return pod.Status.StartTime
|
|
}
|
|
// Should not reach here as the start time of a running time should not be nil
|
|
// Return current timestamp as the default value.
|
|
// This will not affect the calculation of earliest timestamp of all the pods on one node,
|
|
// because current timestamp is always after the StartTime of any pod in good state.
|
|
klog.Errorf("pod.Status.StartTime is nil for pod %s. Should not reach here.", pod.Name)
|
|
return &metav1.Time{Time: time.Now()}
|
|
}
|
|
|
|
// GetEarliestPodStartTime returns the earliest start time of all pods that
|
|
// have the highest priority among all victims.
|
|
func GetEarliestPodStartTime(victims *api.Victims) *metav1.Time {
|
|
if len(victims.Pods) == 0 {
|
|
// should not reach here.
|
|
klog.Errorf("victims.Pods is empty. Should not reach here.")
|
|
return nil
|
|
}
|
|
|
|
earliestPodStartTime := GetPodStartTime(victims.Pods[0])
|
|
highestPriority := GetPodPriority(victims.Pods[0])
|
|
|
|
for _, pod := range victims.Pods {
|
|
if GetPodPriority(pod) == highestPriority {
|
|
if GetPodStartTime(pod).Before(earliestPodStartTime) {
|
|
earliestPodStartTime = GetPodStartTime(pod)
|
|
}
|
|
} else if GetPodPriority(pod) > highestPriority {
|
|
highestPriority = GetPodPriority(pod)
|
|
earliestPodStartTime = GetPodStartTime(pod)
|
|
}
|
|
}
|
|
|
|
return earliestPodStartTime
|
|
}
|
|
|
|
// SortableList is a list that implements sort.Interface.
|
|
type SortableList struct {
|
|
Items []interface{}
|
|
CompFunc LessFunc
|
|
}
|
|
|
|
// LessFunc is a function that receives two items and returns true if the first
|
|
// item should be placed before the second one when the list is sorted.
|
|
type LessFunc func(item1, item2 interface{}) bool
|
|
|
|
var _ = sort.Interface(&SortableList{})
|
|
|
|
func (l *SortableList) Len() int { return len(l.Items) }
|
|
|
|
func (l *SortableList) Less(i, j int) bool {
|
|
return l.CompFunc(l.Items[i], l.Items[j])
|
|
}
|
|
|
|
func (l *SortableList) Swap(i, j int) {
|
|
l.Items[i], l.Items[j] = l.Items[j], l.Items[i]
|
|
}
|
|
|
|
// Sort sorts the items in the list using the given CompFunc. Item1 is placed
|
|
// before Item2 when CompFunc(Item1, Item2) returns true.
|
|
func (l *SortableList) Sort() {
|
|
sort.Sort(l)
|
|
}
|
|
|
|
// MoreImportantPod return true when priority of the first pod is higher than
|
|
// the second one. If two pods' priorities are equal, compare their StartTime.
|
|
// It takes arguments of the type "interface{}" to be used with SortableList,
|
|
// but expects those arguments to be *v1.Pod.
|
|
func MoreImportantPod(pod1, pod2 interface{}) bool {
|
|
p1 := GetPodPriority(pod1.(*v1.Pod))
|
|
p2 := GetPodPriority(pod2.(*v1.Pod))
|
|
if p1 != p2 {
|
|
return p1 > p2
|
|
}
|
|
return GetPodStartTime(pod1.(*v1.Pod)).Before(GetPodStartTime(pod2.(*v1.Pod)))
|
|
}
|