SagerNet/sing
1
0
Fork 0
mirror of https://github.com/SagerNet/sing.git synced 2025-04-03 11:57:39 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

shared: Add SetHealthCheck to interface

Browse source
This commit is contained in:
世界 2024-11-09 11:38:32 +08:00
parent 11ffb962ae
commit 72ff654ee0
No known key found for this signature in database
GPG key ID: CD109927C34A63C4
2 changed files with 16 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

2
contrab/freelru/cache.go
View file

@ -24,6 +24,8 @@ type Cache[K comparable, V any] interface {
// Lifetime 0 means "forever". // Lifetime 0 means "forever".
SetLifetime(lifetime time.Duration) SetLifetime(lifetime time.Duration)
SetHealthCheck(healthCheck HealthCheckCallback[K, V])
// SetOnEvict sets the OnEvict callback function. // SetOnEvict sets the OnEvict callback function.
// The onEvict function is called for each evicted lru entry. // The onEvict function is called for each evicted lru entry.
SetOnEvict(onEvict OnEvictCallback[K, V]) SetOnEvict(onEvict OnEvictCallback[K, V])

17
contrab/freelru/sharedlru.go
View file

@ -42,6 +42,14 @@ func (lru *ShardedLRU[K, V]) SetOnEvict(onEvict OnEvictCallback[K, V]) {
} }
} }
func (lru *ShardedLRU[K, V]) SetHealthCheck(healthCheck HealthCheckCallback[K, V]) {
for shard := range lru.lrus {
lru.mus[shard].Lock()
lru.lrus[shard].SetHealthCheck(healthCheck)
lru.mus[shard].Unlock()
}
}
func nextPowerOfTwo(val uint32) uint32 { func nextPowerOfTwo(val uint32) uint32 {
if bits.OnesCount32(val) != 1 { if bits.OnesCount32(val) != 1 {
return 1 << bits.Len32(val) return 1 << bits.Len32(val)
@ -51,7 +59,8 @@ func nextPowerOfTwo(val uint32) uint32 {
// NewSharded creates a new thread-safe sharded LRU hashmap with the given capacity. // NewSharded creates a new thread-safe sharded LRU hashmap with the given capacity.
func NewSharded[K comparable, V any](capacity uint32, hash HashKeyCallback[K]) (*ShardedLRU[K, V], func NewSharded[K comparable, V any](capacity uint32, hash HashKeyCallback[K]) (*ShardedLRU[K, V],
error) { error,
) {
size := uint32(float64(capacity) * 1.25) // 25% extra space for fewer collisions size := uint32(float64(capacity) * 1.25) // 25% extra space for fewer collisions
return NewShardedWithSize[K, V](uint32(runtime.GOMAXPROCS(0)*16), capacity, size, hash) return NewShardedWithSize[K, V](uint32(runtime.GOMAXPROCS(0)*16), capacity, size, hash)
@ -59,7 +68,8 @@ func NewSharded[K comparable, V any](capacity uint32, hash HashKeyCallback[K]) (
func NewShardedWithSize[K comparable, V any](shards, capacity, size uint32, func NewShardedWithSize[K comparable, V any](shards, capacity, size uint32,
hash HashKeyCallback[K]) ( hash HashKeyCallback[K]) (
*ShardedLRU[K, V], error) { *ShardedLRU[K, V], error,
) {
if capacity == 0 { if capacity == 0 {
return nil, errors.New("capacity must be positive") return nil, errors.New("capacity must be positive")
} }
@ -126,7 +136,8 @@ func (lru *ShardedLRU[K, V]) Len() (length int) {
// AddWithLifetime adds a key:value to the cache with a lifetime. // AddWithLifetime adds a key:value to the cache with a lifetime.
// Returns true, true if key was updated and eviction occurred. // Returns true, true if key was updated and eviction occurred.
func (lru *ShardedLRU[K, V]) AddWithLifetime(key K, value V, func (lru *ShardedLRU[K, V]) AddWithLifetime(key K, value V,
lifetime time.Duration) (evicted bool) { lifetime time.Duration,
) (evicted bool) {
hash := lru.hash(key) hash := lru.hash(key)
shard := (hash >> 16) & lru.mask shard := (hash >> 16) & lru.mask