/
util.go
112 lines (92 loc) · 2.76 KB
/
util.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
// Copyright 2019 The Kubeflow 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 ctrlcommon
import (
"github.com/chriskery/kubecluster/apis/kubecluster.org/v1alpha1"
log "github.com/sirupsen/logrus"
v1 "k8s.io/api/core/v1"
schedulingv1 "k8s.io/api/scheduling/v1"
"sort"
)
// ReplicasPriority is a slice of ReplicaPriority.
type ReplicasPriority []ReplicaPriority
type ReplicaPriority struct {
priority int32
v1alpha1.ReplicaSpec
}
func (p ReplicasPriority) Len() int {
return len(p)
}
func (p ReplicasPriority) Less(i, j int) bool {
return p[i].priority > p[j].priority
}
func (p ReplicasPriority) Swap(i, j int) {
p[i], p[j] = p[j], p[i]
}
func AddResourceList(list, req, limit v1.ResourceList) {
for name, quantity := range req {
if value, ok := list[name]; !ok {
list[name] = quantity.DeepCopy()
} else {
value.Add(quantity)
list[name] = value
}
}
if req != nil {
return
}
// If Requests is omitted for a container,
// it defaults to Limits if that is explicitly specified.
for name, quantity := range limit {
if value, ok := list[name]; !ok {
list[name] = quantity.DeepCopy()
} else {
value.Add(quantity)
list[name] = value
}
}
}
type PriorityClassGetFunc func(string) (*schedulingv1.PriorityClass, error)
func CalcPGMinResources(minMember int32, replicas map[v1alpha1.ReplicaType]*v1alpha1.ReplicaSpec, pcGetFunc PriorityClassGetFunc) *v1.ResourceList {
var replicasPriority ReplicasPriority
for t, replica := range replicas {
rp := ReplicaPriority{0, *replica}
pc := replica.Template.Spec.PriorityClassName
priorityClass, err := pcGetFunc(pc)
if err != nil || priorityClass == nil {
log.Warnf("Ignore task %s priority class %s: %v", t, pc, err)
} else {
rp.priority = priorityClass.Value
}
replicasPriority = append(replicasPriority, rp)
}
sort.Sort(replicasPriority)
minAvailableTasksRes := v1.ResourceList{}
podCnt := int32(0)
for _, task := range replicasPriority {
if task.Replicas == nil {
continue
}
for i := int32(0); i < *task.Replicas; i++ {
if podCnt >= minMember {
break
}
podCnt++
for _, c := range task.Template.Spec.Containers {
AddResourceList(minAvailableTasksRes, c.Resources.Requests, c.Resources.Limits)
}
}
}
return &minAvailableTasksRes
}