mirror of
https://github.com/ceph/ceph-csi.git
synced 2024-11-14 02:10:21 +00:00
292 lines
7.9 KiB
Go
292 lines
7.9 KiB
Go
/*
|
|
Copyright 2016 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 quota
|
|
|
|
import (
|
|
"strings"
|
|
|
|
"k8s.io/api/core/v1"
|
|
"k8s.io/apimachinery/pkg/api/resource"
|
|
"k8s.io/apimachinery/pkg/util/sets"
|
|
api "k8s.io/kubernetes/pkg/apis/core"
|
|
)
|
|
|
|
// Equals returns true if the two lists are equivalent
|
|
func Equals(a api.ResourceList, b api.ResourceList) bool {
|
|
for key, value1 := range a {
|
|
value2, found := b[key]
|
|
if !found {
|
|
return false
|
|
}
|
|
if value1.Cmp(value2) != 0 {
|
|
return false
|
|
}
|
|
}
|
|
for key, value1 := range b {
|
|
value2, found := a[key]
|
|
if !found {
|
|
return false
|
|
}
|
|
if value1.Cmp(value2) != 0 {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// V1Equals returns true if the two lists are equivalent
|
|
func V1Equals(a v1.ResourceList, b v1.ResourceList) bool {
|
|
for key, value1 := range a {
|
|
value2, found := b[key]
|
|
if !found {
|
|
return false
|
|
}
|
|
if value1.Cmp(value2) != 0 {
|
|
return false
|
|
}
|
|
}
|
|
for key, value1 := range b {
|
|
value2, found := a[key]
|
|
if !found {
|
|
return false
|
|
}
|
|
if value1.Cmp(value2) != 0 {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// LessThanOrEqual returns true if a < b for each key in b
|
|
// If false, it returns the keys in a that exceeded b
|
|
func LessThanOrEqual(a api.ResourceList, b api.ResourceList) (bool, []api.ResourceName) {
|
|
result := true
|
|
resourceNames := []api.ResourceName{}
|
|
for key, value := range b {
|
|
if other, found := a[key]; found {
|
|
if other.Cmp(value) > 0 {
|
|
result = false
|
|
resourceNames = append(resourceNames, key)
|
|
}
|
|
}
|
|
}
|
|
return result, resourceNames
|
|
}
|
|
|
|
// Max returns the result of Max(a, b) for each named resource
|
|
func Max(a api.ResourceList, b api.ResourceList) api.ResourceList {
|
|
result := api.ResourceList{}
|
|
for key, value := range a {
|
|
if other, found := b[key]; found {
|
|
if value.Cmp(other) <= 0 {
|
|
result[key] = *other.Copy()
|
|
continue
|
|
}
|
|
}
|
|
result[key] = *value.Copy()
|
|
}
|
|
for key, value := range b {
|
|
if _, found := result[key]; !found {
|
|
result[key] = *value.Copy()
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// Add returns the result of a + b for each named resource
|
|
func Add(a api.ResourceList, b api.ResourceList) api.ResourceList {
|
|
result := api.ResourceList{}
|
|
for key, value := range a {
|
|
quantity := *value.Copy()
|
|
if other, found := b[key]; found {
|
|
quantity.Add(other)
|
|
}
|
|
result[key] = quantity
|
|
}
|
|
for key, value := range b {
|
|
if _, found := result[key]; !found {
|
|
quantity := *value.Copy()
|
|
result[key] = quantity
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// SubtractWithNonNegativeResult - substracts and returns result of a - b but
|
|
// makes sure we don't return negative values to prevent negative resource usage.
|
|
func SubtractWithNonNegativeResult(a api.ResourceList, b api.ResourceList) api.ResourceList {
|
|
zero := resource.MustParse("0")
|
|
|
|
result := api.ResourceList{}
|
|
for key, value := range a {
|
|
quantity := *value.Copy()
|
|
if other, found := b[key]; found {
|
|
quantity.Sub(other)
|
|
}
|
|
if quantity.Cmp(zero) > 0 {
|
|
result[key] = quantity
|
|
} else {
|
|
result[key] = zero
|
|
}
|
|
}
|
|
|
|
for key := range b {
|
|
if _, found := result[key]; !found {
|
|
result[key] = zero
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// Subtract returns the result of a - b for each named resource
|
|
func Subtract(a api.ResourceList, b api.ResourceList) api.ResourceList {
|
|
result := api.ResourceList{}
|
|
for key, value := range a {
|
|
quantity := *value.Copy()
|
|
if other, found := b[key]; found {
|
|
quantity.Sub(other)
|
|
}
|
|
result[key] = quantity
|
|
}
|
|
for key, value := range b {
|
|
if _, found := result[key]; !found {
|
|
quantity := *value.Copy()
|
|
quantity.Neg()
|
|
result[key] = quantity
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// Mask returns a new resource list that only has the values with the specified names
|
|
func Mask(resources api.ResourceList, names []api.ResourceName) api.ResourceList {
|
|
nameSet := ToSet(names)
|
|
result := api.ResourceList{}
|
|
for key, value := range resources {
|
|
if nameSet.Has(string(key)) {
|
|
result[key] = *value.Copy()
|
|
}
|
|
}
|
|
return result
|
|
}
|
|
|
|
// ResourceNames returns a list of all resource names in the ResourceList
|
|
func ResourceNames(resources api.ResourceList) []api.ResourceName {
|
|
result := []api.ResourceName{}
|
|
for resourceName := range resources {
|
|
result = append(result, resourceName)
|
|
}
|
|
return result
|
|
}
|
|
|
|
// Contains returns true if the specified item is in the list of items
|
|
func Contains(items []api.ResourceName, item api.ResourceName) bool {
|
|
return ToSet(items).Has(string(item))
|
|
}
|
|
|
|
// ContainsPrefix returns true if the specified item has a prefix that contained in given prefix Set
|
|
func ContainsPrefix(prefixSet []string, item api.ResourceName) bool {
|
|
for _, prefix := range prefixSet {
|
|
if strings.HasPrefix(string(item), prefix) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// Intersection returns the intersection of both list of resources
|
|
func Intersection(a []api.ResourceName, b []api.ResourceName) []api.ResourceName {
|
|
setA := ToSet(a)
|
|
setB := ToSet(b)
|
|
setC := setA.Intersection(setB)
|
|
result := []api.ResourceName{}
|
|
for _, resourceName := range setC.List() {
|
|
result = append(result, api.ResourceName(resourceName))
|
|
}
|
|
return result
|
|
}
|
|
|
|
// IsZero returns true if each key maps to the quantity value 0
|
|
func IsZero(a api.ResourceList) bool {
|
|
zero := resource.MustParse("0")
|
|
for _, v := range a {
|
|
if v.Cmp(zero) != 0 {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// IsNegative returns the set of resource names that have a negative value.
|
|
func IsNegative(a api.ResourceList) []api.ResourceName {
|
|
results := []api.ResourceName{}
|
|
zero := resource.MustParse("0")
|
|
for k, v := range a {
|
|
if v.Cmp(zero) < 0 {
|
|
results = append(results, k)
|
|
}
|
|
}
|
|
return results
|
|
}
|
|
|
|
// ToSet takes a list of resource names and converts to a string set
|
|
func ToSet(resourceNames []api.ResourceName) sets.String {
|
|
result := sets.NewString()
|
|
for _, resourceName := range resourceNames {
|
|
result.Insert(string(resourceName))
|
|
}
|
|
return result
|
|
}
|
|
|
|
// CalculateUsage calculates and returns the requested ResourceList usage
|
|
func CalculateUsage(namespaceName string, scopes []api.ResourceQuotaScope, hardLimits api.ResourceList, registry Registry) (api.ResourceList, error) {
|
|
// find the intersection between the hard resources on the quota
|
|
// and the resources this controller can track to know what we can
|
|
// look to measure updated usage stats for
|
|
hardResources := ResourceNames(hardLimits)
|
|
potentialResources := []api.ResourceName{}
|
|
evaluators := registry.List()
|
|
for _, evaluator := range evaluators {
|
|
potentialResources = append(potentialResources, evaluator.MatchingResources(hardResources)...)
|
|
}
|
|
// NOTE: the intersection just removes duplicates since the evaluator match intersects wtih hard
|
|
matchedResources := Intersection(hardResources, potentialResources)
|
|
|
|
// sum the observed usage from each evaluator
|
|
newUsage := api.ResourceList{}
|
|
for _, evaluator := range evaluators {
|
|
// only trigger the evaluator if it matches a resource in the quota, otherwise, skip calculating anything
|
|
intersection := evaluator.MatchingResources(matchedResources)
|
|
if len(intersection) == 0 {
|
|
continue
|
|
}
|
|
|
|
usageStatsOptions := UsageStatsOptions{Namespace: namespaceName, Scopes: scopes, Resources: intersection}
|
|
stats, err := evaluator.UsageStats(usageStatsOptions)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
newUsage = Add(newUsage, stats.Used)
|
|
}
|
|
|
|
// mask the observed usage to only the set of resources tracked by this quota
|
|
// merge our observed usage with the quota usage status
|
|
// if the new usage is different than the last usage, we will need to do an update
|
|
newUsage = Mask(newUsage, matchedResources)
|
|
return newUsage, nil
|
|
}
|