Files
wehub-resource-sync e0e362d700
SDK Tests / changes (push) Successful in 2m29s
Real E2E Tests / changes (push) Successful in 2m29s
Deploy Docs Pages / build (push) Has been cancelled
Deploy Docs Pages / deploy (push) Has been cancelled
Real E2E Tests / JavaScript E2E (docker bridge) (push) Has been cancelled
Real E2E Tests / Python E2E (docker bridge) (push) Has been cancelled
Real E2E Tests / Java E2E (docker bridge) (push) Has been cancelled
Real E2E Tests / C# E2E (docker bridge) (push) Has been cancelled
Real E2E Tests / Go E2E (docker bridge) (push) Has been cancelled
Real E2E Tests / Real E2E CI (push) Has been cancelled
SDK Tests / SDK CI (push) Has been cancelled
SDK Tests / CLI Tests (push) Has been cancelled
SDK Tests / Python SDK Quality (code-interpreter) (push) Has been cancelled
SDK Tests / Python SDK Quality (sandbox) (push) Has been cancelled
SDK Tests / Python SDK Tests (code-interpreter) (push) Has been cancelled
SDK Tests / JavaScript SDK Quality And Tests (code-interpreter) (push) Has been cancelled
SDK Tests / JavaScript SDK Quality And Tests (sandbox) (push) Has been cancelled
SDK Tests / Python SDK Tests (sandbox) (push) Has been cancelled
SDK Tests / CLI Quality (push) Has been cancelled
SDK Tests / Kotlin SDK Quality And Tests (sandbox) (push) Has been cancelled
SDK Tests / Kotlin SDK Quality And Tests (code-interpreter) (push) Has been cancelled
SDK Tests / C# SDK Quality And Tests (code-interpreter) (push) Has been cancelled
SDK Tests / C# SDK Quality And Tests (sandbox) (push) Has been cancelled
SDK Tests / Go SDK Quality And Tests (push) Has been cancelled
chore: import upstream snapshot with attribution
2026-07-13 13:39:33 +08:00

192 lines
4.7 KiB
Go

// Copyright 2025 Alibaba Group Holding Ltd.
//
// 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 assign
import (
"context"
"fmt"
"sort"
"strconv"
"strings"
corev1 "k8s.io/api/core/v1"
sandboxv1alpha1 "github.com/alibaba/OpenSandbox/sandbox-k8s/apis/sandbox/v1alpha1"
)
type nodeSelectorPredicate struct{}
func newNodeSelectorPredicate(_ map[string]interface{}) (Predicate, error) {
return &nodeSelectorPredicate{}, nil
}
func (p *nodeSelectorPredicate) Predicate(_ context.Context, sbx *sandboxv1alpha1.BatchSandbox, pool *sandboxv1alpha1.Pool) bool {
if sbx.Spec.Template == nil {
return true
}
poolLabels := mergePoolLabels(pool)
if !nodeSelectorMatch(sbx.Spec.Template.Spec.NodeSelector, poolLabels) {
return false
}
if !nodeAffinityMatch(sbx.Spec.Template.Spec.Affinity, poolLabels) {
return false
}
return true
}
func (p *nodeSelectorPredicate) Reason(_ context.Context, sbx *sandboxv1alpha1.BatchSandbox, pool *sandboxv1alpha1.Pool) string {
if sbx.Spec.Template == nil {
return ""
}
poolLabels := mergePoolLabels(pool)
var reasons []string
for k, v := range sbx.Spec.Template.Spec.NodeSelector {
poolV, ok := poolLabels[k]
if !ok {
reasons = append(reasons, fmt.Sprintf("nodeSelector key %q not found in pool", k))
} else if poolV != v {
reasons = append(reasons, fmt.Sprintf("nodeSelector %s=%s, pool has %s=%s", k, v, k, poolV))
}
}
if sbx.Spec.Template.Spec.Affinity != nil && sbx.Spec.Template.Spec.Affinity.NodeAffinity != nil {
req := sbx.Spec.Template.Spec.Affinity.NodeAffinity.RequiredDuringSchedulingIgnoredDuringExecution
if req != nil && len(req.NodeSelectorTerms) > 0 && !nodeAffinityMatch(sbx.Spec.Template.Spec.Affinity, poolLabels) {
reasons = append(reasons, "node affinity requirements not satisfied")
}
}
sort.Strings(reasons)
return strings.Join(reasons, "; ")
}
func mergePoolLabels(pool *sandboxv1alpha1.Pool) map[string]string {
result := make(map[string]string, len(pool.Labels))
for k, v := range pool.Labels {
result[k] = v
}
if pool.Spec.Template != nil {
for k, v := range pool.Spec.Template.Spec.NodeSelector {
result[k] = v
}
}
return result
}
func nodeSelectorMatch(sbxSelector, poolSelector map[string]string) bool {
for k, v := range sbxSelector {
if poolV, ok := poolSelector[k]; !ok || poolV != v {
return false
}
}
return true
}
func nodeAffinityMatch(affinity *corev1.Affinity, poolLabels map[string]string) bool {
if affinity == nil || affinity.NodeAffinity == nil {
return true
}
req := affinity.NodeAffinity.RequiredDuringSchedulingIgnoredDuringExecution
if req == nil || len(req.NodeSelectorTerms) == 0 {
return true
}
for _, term := range req.NodeSelectorTerms {
if termMatchExpressions(term.MatchExpressions, poolLabels) {
return true
}
}
return false
}
func termMatchExpressions(exprs []corev1.NodeSelectorRequirement, labels map[string]string) bool {
for _, expr := range exprs {
val, hasVal := labels[expr.Key]
switch expr.Operator {
case corev1.NodeSelectorOpIn:
if !hasVal || !valueInList(val, expr.Values) {
return false
}
case corev1.NodeSelectorOpNotIn:
if hasVal && valueInList(val, expr.Values) {
return false
}
case corev1.NodeSelectorOpExists:
if !hasVal {
return false
}
case corev1.NodeSelectorOpDoesNotExist:
if hasVal {
return false
}
case corev1.NodeSelectorOpGt:
if !hasVal || !cmpIntGt(val, expr.Values) {
return false
}
case corev1.NodeSelectorOpLt:
if !hasVal || !cmpIntLt(val, expr.Values) {
return false
}
default:
return false
}
}
return true
}
func cmpIntGt(labelVal string, values []string) bool {
if len(values) == 0 {
return false
}
lv, err := strconv.Atoi(labelVal)
if err != nil {
return false
}
rv, err := strconv.Atoi(values[0])
if err != nil {
return false
}
return lv > rv
}
func cmpIntLt(labelVal string, values []string) bool {
if len(values) == 0 {
return false
}
lv, err := strconv.Atoi(labelVal)
if err != nil {
return false
}
rv, err := strconv.Atoi(values[0])
if err != nil {
return false
}
return lv < rv
}
func valueInList(target string, list []string) bool {
for _, v := range list {
if v == target {
return true
}
}
return false
}