mirror of
https://github.com/cozystack/cozystack.git
synced 2026-11-09 14:02:56 +09:00
The binder is the only writer of a claim's placement, so budget and capacity checks that admission already ran cannot be raced past by two replicas. Every event collapses into one pass over all GPU objects, which serializes the decisions without per-object locks, and claims are read past the cache so a unit booked in the last pass is never booked again from a stale view. A VM starts through its launcher pod, which the pod webhook holds at a scheduling gate. The pass creates the VMI's template claims, gathers the whole set onto one node that every class of the set tolerates and has room on, then pins the pod there and removes the gate in one update, since the API server lets a pod's node affinity change only while the pod is gated. A set that cannot be placed keeps its pod gated with a condition on its claims and a Warning event on the VMI, once per change of reason, so the VM waits for capacity instead of being refused into KubeVirt's backoff. The set goes only to a node the pod's own node selector and required affinity accept and, when the VMI has a volume bound to a node's PersistentVolume, that volume reaches. Gated pods go before moves and new orders. A pin cannot be undone, so a pinned pod its node refuses for lack of resources is deleted and the node is skipped for that set for ten minutes, or until its allocatable, taints or readiness change. The template claims of the set go with its failed VMI, so the controller also keeps the rejection in memory for the VM's next VMI. Only a VMI whose pod is already pinned is deleted to free a claim whose node cannot keep it; a VMI whose pod is gated has its set gathered instead. The full pass also moves held sets off nodes that cannot keep them, rebinds Lost sets before new orders, and binds new orders onto the fullest node with room. Finalizers and usage records run with the feature disabled too, so turning GPU off never hangs a namespace or class deletion. Each usage record is owned by its claim and sits under no WorkloadMonitor, so no tenant label can add or drop one, and garbage collection removes it with the claim. Without a monitor label the Workload controller would take such a record for an orphan, so it now leaves a record owned by a GPUClaim to that owner. The claims one VM names move, go Lost and are rebound as a set. Every pass restores that invariant before it places anything, gathering a set left partly Lost, by a write that failed half way or by a VMI that ended next to held members, onto one node or sending all of it to Lost, so each later step only ever changes whole sets. A Lost claim already counts against its tenant's budgets, so the pod of its still running VMI is not counted again under a raw GPU key; for node capacity it is, since the claim itself holds no units. A pod is a VMI's launcher only when the VMI lists it in status.activePods, because whoever creates a pod sets its owner reference. The KubeVirt watches start once KubeVirt serves its kinds, whose CRDs a fresh install adds after this controller starts. Assisted-by: LLM Signed-off-by: Aleksei Sviridkin <f@lex.la>
284 lines
9.7 KiB
Go
284 lines
9.7 KiB
Go
/*
|
|
Copyright 2026 The Cozystack 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 controller
|
|
|
|
import (
|
|
"strings"
|
|
"testing"
|
|
"time"
|
|
|
|
corev1 "k8s.io/api/core/v1"
|
|
|
|
gpuv1alpha1 "github.com/cozystack/cozystack/api/gpu/v1alpha1"
|
|
"github.com/cozystack/cozystack/internal/gpu/model"
|
|
)
|
|
|
|
func TestOrderBindsOnTheFullestNodeWithRoom(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 4}),
|
|
node("n2", map[string]int64{rnL40S: 4}),
|
|
claim("held", "l40s", 2, bound("n2")),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimBound, "n2")
|
|
if e.claim("order").Status.BoundAt == nil {
|
|
t.Fatal("boundAt not set")
|
|
}
|
|
}
|
|
|
|
func TestCapacityLeavesOutUnitsRawNamePodsHold(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 2}),
|
|
launcherPod("virt-launcher-raw", "raw-vm", "n1", map[string]int64{rnL40S: 2}),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
d := e.claim("order")
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimPending, "")
|
|
if c := waiting(d); c == nil || c.Reason != ReasonCapacity {
|
|
t.Fatalf("want a Capacity condition, got %+v", c)
|
|
}
|
|
}
|
|
|
|
func TestPodOfAnAttachedClaimIsNotCountedTwice(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 2}),
|
|
claim("running", "l40s", 1, bound("n1"), attached("vm1")),
|
|
vmiObj("vm1", "Running", "n1", ""),
|
|
launcherPod("virt-launcher-vm1", "vm1", "n1", map[string]int64{rnL40S: 1}),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
}
|
|
|
|
// A pod that names a VMI in its owner reference, but that the VMI does not
|
|
// list as active, is not that VMI's launcher: its GPUs count as raw-name
|
|
// usage, not as the units the VMI's claims hold.
|
|
func TestPodNamingAVMIItIsNotActiveInCountsAsRawUsage(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 2}),
|
|
claim("running", "l40s", 1, bound("n1"), attached("vm1")),
|
|
vmiObj("vm1", "Running", "n1", ""),
|
|
launcherPod("forged", "vm1", "n1", map[string]int64{rnL40S: 1}),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimPending, "")
|
|
}
|
|
|
|
func TestConcurrentOrdersForTheLastUnitBindOnlyOne(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 1}),
|
|
claim("first", "l40s", 1),
|
|
claim("second", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("first"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
expectPlacement(t, e.claim("second"), gpuv1alpha1.GPUClaimPending, "")
|
|
}
|
|
|
|
func TestOrderOverABudgetWaitsWithTheRefusal(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 4}),
|
|
tenant("acme", map[string]string{"gpu.cozystack.io/total": "1"}),
|
|
claim("held", "l40s", 1, bound("n1")),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
d := e.claim("order")
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimPending, "")
|
|
c := waiting(d)
|
|
if c == nil || c.Reason != string(model.ReasonBudget) || !strings.Contains(c.Message, "gpu.cozystack.io/total") {
|
|
t.Fatalf("want a Budget condition naming the key, got %+v", c)
|
|
}
|
|
}
|
|
|
|
func TestVGPUOrderNeedsTheEntitlement(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s-24c", rnL40S, vgpu),
|
|
node("n1", map[string]int64{rnL40S: 4}),
|
|
namespace(ns, false),
|
|
claim("order", "l40s-24c", 1),
|
|
)
|
|
e.pass()
|
|
if c := waiting(e.claim("order")); c == nil || c.Reason != string(model.ReasonNotEntitled) {
|
|
t.Fatalf("want NotEntitled, got %+v", c)
|
|
}
|
|
|
|
n := namespace(ns, true)
|
|
e.update(n)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
if c := waiting(e.claim("order")); c != nil {
|
|
t.Fatalf("condition kept after binding: %+v", c)
|
|
}
|
|
}
|
|
|
|
func TestOrderOfADeletedClassIsNeverBound(t *testing.T) {
|
|
c := class("l40s", rnL40S)
|
|
e := newEnv(t, c, node("n1", map[string]int64{rnL40S: 4}), claim("held", "l40s", 1, bound("n1")))
|
|
e.delete(c)
|
|
e.create(claim("order", "l40s", 1))
|
|
e.pass()
|
|
d := e.claim("order")
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimPending, "")
|
|
if w := waiting(d); w == nil || w.Reason != ReasonClassDeleted {
|
|
t.Fatalf("want ClassDeleted, got %+v", w)
|
|
}
|
|
}
|
|
|
|
func TestTaintedNodeGetsNoBindsAndLeavesFree(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("tainted", map[string]int64{rnL40S: 4}, tainted("dedicated", corev1.TaintEffectNoSchedule)),
|
|
node("n2", map[string]int64{rnL40S: 1}),
|
|
claim("order", "l40s", 2),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimPending, "")
|
|
if free := e.class("l40s").Status.Free; free == nil || *free != 1 {
|
|
t.Fatalf("free = %v, want 1: the tainted node's units do not count", free)
|
|
}
|
|
}
|
|
|
|
func TestFenceAgentsTaintIsNotACordon(t *testing.T) {
|
|
far := "remediation.medik8s.io/fence-agents-remediation"
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("fenced", map[string]int64{rnL40S: 4}, tainted(far, corev1.TaintEffectNoSchedule)),
|
|
node("n2", map[string]int64{rnL40S: 4}),
|
|
claim("held", "l40s", 1, bound("fenced")),
|
|
)
|
|
e.pass()
|
|
d := e.claim("held")
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimBound, "fenced")
|
|
if c := waiting(d); c != nil {
|
|
t.Fatalf("a taint must not trigger onCordon: %+v", c)
|
|
}
|
|
}
|
|
|
|
func TestLostSetsRebindBeforeNewOrdersWithoutBlockingSmallerOnes(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 2}),
|
|
claim("big", "l40s", 4, lost("dead")),
|
|
claim("a", "l40s", 1, lost("dead")),
|
|
claim("b", "l40s", 1, lost("dead")),
|
|
vmObj("vm-ab", "Always", "a", "b"),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("a"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
expectPlacement(t, e.claim("b"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
expectPlacement(t, e.claim("big"), gpuv1alpha1.GPUClaimLost, "dead")
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimPending, "")
|
|
}
|
|
|
|
func TestLostRebindSkipsBudgets(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 2}),
|
|
tenant("acme", map[string]string{"gpu.cozystack.io/total": "1"}),
|
|
claim("a", "l40s", 1, lost("dead")),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("a"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
}
|
|
|
|
func TestRawKeyOnAnAncestorCapsClaimsTogetherWithRawNameVMs(t *testing.T) {
|
|
child := "tenant-acme-dev"
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 4}),
|
|
tenant("acme", map[string]string{rnL40S: "2", "gpu.cozystack.io/l40s": "4"}),
|
|
launcherPod("virt-launcher-raw", "raw-vm", "n1", map[string]int64{rnL40S: 1}),
|
|
claim("first", "l40s", 1, inNamespace(child)),
|
|
claim("second", "l40s", 1, inNamespace(child)),
|
|
)
|
|
e.pass()
|
|
d := &gpuv1alpha1.GPUClaim{}
|
|
_ = e.c.Get(t.Context(), key(child, "first"), d)
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimBound, "n1")
|
|
_ = e.c.Get(t.Context(), key(child, "second"), d)
|
|
expectPlacement(t, d, gpuv1alpha1.GPUClaimPending, "")
|
|
}
|
|
|
|
// The second Pod entry buildSnapshot emits for a Lost claim's VMI carries
|
|
// an empty namespace so it counts for node capacity only; that relies on
|
|
// no tenant subtree containing the empty namespace.
|
|
func TestNoTenantSubtreeContainsTheEmptyNamespace(t *testing.T) {
|
|
for _, root := range []string{"tenant-root", "tenant-acme", "tenant-acme-dev", "default", ""} {
|
|
if model.InSubtree("", root) {
|
|
t.Fatalf("InSubtree(\"\", %q) is true: capacity-only pod usage would count against budgets", root)
|
|
}
|
|
}
|
|
}
|
|
|
|
// A Lost claim counts against budgets itself, so the pod of its still
|
|
// running VMI must not count again under a raw key. Node capacity still
|
|
// counts that pod: TestRequestPassCountsThePodOfALostClaimsRunningVMI.
|
|
func TestLostClaimsPodIsNotCountedTwiceAgainstARawKey(t *testing.T) {
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 1}, notReadySince(t0.Add(-time.Hour))),
|
|
node("n2", map[string]int64{rnL40S: 1}),
|
|
tenant("acme", map[string]string{rnL40S: "2", "gpu.cozystack.io/l40s": "4"}),
|
|
claim("b", "l40s", 1, lost("n1"), attached("vm1")),
|
|
vmiObj("vm1", "Running", "n1", ""),
|
|
launcherPod("virt-launcher-vm1", "vm1", "n1", map[string]int64{rnL40S: 1}),
|
|
claim("order", "l40s", 1),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("order"), gpuv1alpha1.GPUClaimBound, "n2")
|
|
}
|
|
|
|
// Values of one tenant that do not parse block the orders its budgets
|
|
// answer for, in its namespace and below it, and nobody else's.
|
|
func TestUnreadableBudgetsOfOneTenantBlockOnlyItsSubtree(t *testing.T) {
|
|
broken := tenant("bad", nil)
|
|
broken.Spec.Values.Raw = []byte(`{"resourceQuotas":{"gpu.cozystack.io/l40s":"many"}}`)
|
|
e := newEnv(t,
|
|
class("l40s", rnL40S),
|
|
node("n1", map[string]int64{rnL40S: 4}),
|
|
tenant("acme", map[string]string{"gpu.cozystack.io/l40s": "2"}),
|
|
broken,
|
|
claim("ok", "l40s", 1),
|
|
claim("own", "l40s", 1, inNamespace("tenant-bad")),
|
|
claim("child", "l40s", 1, inNamespace("tenant-bad-team")),
|
|
)
|
|
e.pass()
|
|
expectPlacement(t, e.claim("ok"), gpuv1alpha1.GPUClaimBound, "n1")
|
|
for _, d := range []struct{ ns, name string }{{"tenant-bad", "own"}, {"tenant-bad-team", "child"}} {
|
|
got := &gpuv1alpha1.GPUClaim{}
|
|
if err := e.c.Get(t.Context(), key(d.ns, d.name), got); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
c := waiting(got)
|
|
if got.Status.Phase != gpuv1alpha1.GPUClaimPending || c == nil || c.Reason != ReasonBudgetsRead || !strings.Contains(c.Message, "tenant-bad ") {
|
|
t.Fatalf("GPUClaim %s/%s: %s, condition %+v; want Pending, waiting on tenant-bad's budgets", d.ns, d.name, got.Status.Phase, c)
|
|
}
|
|
}
|
|
}
|