mirror of
https://github.com/gravitational/teleport.git
synced 2026-11-02 06:08:23 +08:00
Alexander Klizhentas
6b5935fb71
Buffer fan out used simple prefix match in a loop, what resulted in high CPU load on many connected watchers. This commit switches to RADIX trees for prefix matching what reduces CPU load substantially for 5K+ connected watchers.
78 lines
1.6 KiB
Go
78 lines
1.6 KiB
Go
/*
|
|
Copyright 2019 Gravitational, Inc.
|
|
|
|
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 memory
|
|
|
|
import (
|
|
"container/heap"
|
|
)
|
|
|
|
// minHeap implements heap.Interface and holds backend items
|
|
type minHeap []*btreeItem
|
|
|
|
// newMinHeap returns a new min heap
|
|
func newMinHeap() *minHeap {
|
|
mh := &minHeap{}
|
|
heap.Init(mh)
|
|
return mh
|
|
}
|
|
|
|
func (mh minHeap) Len() int { return len(mh) }
|
|
|
|
func (mh minHeap) Less(i, j int) bool {
|
|
return mh[i].Expires.Unix() < mh[j].Expires.Unix()
|
|
}
|
|
|
|
func (mh minHeap) Swap(i, j int) {
|
|
mh[i], mh[j] = mh[j], mh[i]
|
|
mh[i].index = i
|
|
mh[j].index = j
|
|
}
|
|
|
|
func (mh *minHeap) Push(x interface{}) {
|
|
n := len(*mh)
|
|
item := x.(*btreeItem)
|
|
item.index = n
|
|
*mh = append(*mh, item)
|
|
}
|
|
|
|
func (mh *minHeap) Pop() interface{} {
|
|
old := *mh
|
|
n := len(old)
|
|
item := old[n-1]
|
|
item.index = -1 // for safety
|
|
*mh = old[0 : n-1]
|
|
return item
|
|
}
|
|
|
|
func (mh *minHeap) PushEl(el *btreeItem) {
|
|
heap.Push(mh, el)
|
|
}
|
|
|
|
func (mh *minHeap) PopEl() *btreeItem {
|
|
el := heap.Pop(mh)
|
|
return el.(*btreeItem)
|
|
}
|
|
|
|
func (mh *minHeap) PeekEl() *btreeItem {
|
|
items := *mh
|
|
return items[0]
|
|
}
|
|
|
|
func (mh *minHeap) RemoveEl(el *btreeItem) {
|
|
heap.Remove(mh, el.index)
|
|
}
|