-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[clusteragent/autoscaling] Impose 100 DatadogPodAutoscaler limit in c…
…luster agent (#28684)
- Loading branch information
Showing
6 changed files
with
636 additions
and
28 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,168 @@ | ||
| // Unless explicitly stated otherwise all files in this repository are licensed | ||
| // under the Apache License Version 2.0. | ||
| // This product includes software developed at Datadog (https://www.datadoghq.com/). | ||
| // Copyright 2024-present Datadog, Inc. | ||
|
|
||
| //go:build kubeapiserver | ||
|
|
||
| package autoscaling | ||
|
|
||
| import ( | ||
| "container/heap" | ||
| "sync" | ||
| "time" | ||
|
|
||
| "github.com/DataDog/datadog-agent/pkg/clusteragent/autoscaling/workload/model" | ||
| ) | ||
|
|
||
| type store = Store[model.PodAutoscalerInternal] | ||
|
|
||
| // TimestampKey is a struct that holds a timestamp and key for a `DatadogPodAutoscaler` object | ||
| type TimestampKey struct { | ||
| Timestamp time.Time | ||
| Key string | ||
| } | ||
|
|
||
| // MaxTimestampKeyHeap is a heap that sorts TimestampKey objects by timestamp in descending order | ||
| type MaxTimestampKeyHeap []TimestampKey | ||
|
|
||
| // Len returns the length of the heap | ||
| func (h MaxTimestampKeyHeap) Len() int { return len(h) } | ||
|
|
||
| // Less returns true if the timestamp at index i is after the timestamp at index j | ||
| func (h MaxTimestampKeyHeap) Less(i, j int) bool { | ||
| return LessThan(h[i], h[j]) | ||
| } | ||
|
|
||
| // LessThan returns true if the timestamp of k1 is after the timestamp of k2 | ||
| func LessThan(k1, k2 TimestampKey) bool { | ||
| return k1.Timestamp.After(k2.Timestamp) || (k1.Timestamp.Equal(k2.Timestamp) && k1.Key < k2.Key) | ||
| } | ||
|
|
||
| // Swap swaps the elements at indices i and j | ||
| func (h MaxTimestampKeyHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] } | ||
|
|
||
| // Push adds an element to the heap while preserving max heap ordering | ||
| func (h *MaxTimestampKeyHeap) Push(x interface{}) { | ||
| *h = append(*h, x.(TimestampKey)) | ||
| } | ||
|
|
||
| // Pop removes the top element from the heap while preserving max heap ordering | ||
| func (h *MaxTimestampKeyHeap) Pop() any { | ||
| old := *h | ||
| n := len(old) | ||
| x := old[n-1] | ||
| *h = old[0 : n-1] | ||
| return x | ||
| } | ||
|
|
||
| // Peek returns the top element of the heap without removing it | ||
| func (h *MaxTimestampKeyHeap) Peek() TimestampKey { | ||
| return (*h)[0] | ||
| } | ||
|
|
||
| // NewMaxHeap returns a new MaxTimestampKeyHeap | ||
| func NewMaxHeap() *MaxTimestampKeyHeap { | ||
| h := &MaxTimestampKeyHeap{} | ||
| heap.Init(h) | ||
| return h | ||
| } | ||
|
|
||
| // FindIdx returns the index of the given key in the heap and a boolean indicating if the key was found | ||
| func (h *MaxTimestampKeyHeap) FindIdx(key string) (int, bool) { | ||
| for idx, k := range *h { | ||
| if k.Key == key { | ||
| return idx, true | ||
| } | ||
| } | ||
| return 0, false | ||
| } | ||
|
|
||
| // HashHeap is a struct that holds a MaxHeap and a set of keys that exist in the heap | ||
| type HashHeap struct { | ||
| MaxHeap MaxTimestampKeyHeap | ||
| Keys map[string]bool | ||
| maxSize int | ||
| mu sync.RWMutex | ||
| store *store | ||
| } | ||
|
|
||
| // NewHashHeap returns a new MaxHeap with the given max size | ||
| func NewHashHeap(maxSize int, store *store) *HashHeap { | ||
| return &HashHeap{ | ||
| MaxHeap: *NewMaxHeap(), | ||
| Keys: make(map[string]bool), | ||
| maxSize: maxSize, | ||
| mu: sync.RWMutex{}, | ||
| store: store, | ||
| } | ||
| } | ||
|
|
||
| // InsertIntoHeap returns true if the key already exists in the max heap or was inserted correctly | ||
| // Used as an ObserverFunc; accept sender as parameter to match ObserverFunc signature | ||
| func (h *HashHeap) InsertIntoHeap(key, _sender string) { | ||
| // Already in heap, do not try to insert | ||
| if h.Exists(key) { | ||
| return | ||
| } | ||
|
|
||
| // Get object from store | ||
| podAutoscalerInternal, podAutoscalerInternalFound := h.store.Get(key) | ||
| if !podAutoscalerInternalFound { | ||
| return | ||
| } | ||
|
|
||
| if podAutoscalerInternal.CreationTimestamp().IsZero() { | ||
| return | ||
| } | ||
|
|
||
| newTimestampKey := TimestampKey{ | ||
| Timestamp: podAutoscalerInternal.CreationTimestamp(), | ||
| Key: key, | ||
| } | ||
|
|
||
| h.mu.Lock() | ||
| defer h.mu.Unlock() | ||
|
|
||
| if h.MaxHeap.Len() >= h.maxSize { | ||
| top := h.MaxHeap.Peek() | ||
| // If the new key is newer than or equal to the top key, do not insert | ||
| if LessThan(newTimestampKey, top) { | ||
| return | ||
| } | ||
| delete(h.Keys, top.Key) | ||
| heap.Pop(&h.MaxHeap) | ||
| } | ||
|
|
||
| heap.Push(&h.MaxHeap, newTimestampKey) | ||
| h.Keys[key] = true | ||
| } | ||
|
|
||
| // DeleteFromHeap removes the given key from the max heap | ||
| // Used as an ObserverFunc; accept sender as parameter to match ObserverFunc signature | ||
| func (h *HashHeap) DeleteFromHeap(key, _sender string) { | ||
| // Key did not exist in heap, return early | ||
| if !h.Exists(key) { | ||
| return | ||
| } | ||
| h.mu.RLock() | ||
| idx, found := h.MaxHeap.FindIdx(key) | ||
| h.mu.RUnlock() | ||
|
|
||
| if !found { | ||
| return | ||
| } | ||
|
|
||
| h.mu.Lock() | ||
| defer h.mu.Unlock() | ||
| heap.Remove(&h.MaxHeap, idx) | ||
| delete(h.Keys, key) | ||
| } | ||
|
|
||
| // Exists returns true if the given key exists in the heap | ||
| func (h *HashHeap) Exists(key string) bool { | ||
| h.mu.RLock() | ||
| defer h.mu.RUnlock() | ||
| _, ok := h.Keys[key] | ||
| return ok | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.