forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-08-19 10:22:23 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

use rwlock

Browse source
This commit is contained in:
maskpp 2024-06-29 21:32:06 +08:00
parent 7cfff30ba3
commit 5fc20d4e63
2 changed files with 14 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
common/lru/blob_lru.go
View file

@ -36,7 +36,7 @@ type SizeConstrainedCache[K comparable, V blobType] struct {
size uint64 size uint64
maxSize uint64 maxSize uint64
lru BasicLRU[K, V] lru BasicLRU[K, V]
lock sync.Mutex lock sync.RWMutex
} }
// NewSizeConstrainedCache creates a new size-constrained LRU cache. // NewSizeConstrainedCache creates a new size-constrained LRU cache.
@ -77,8 +77,8 @@ func (c *SizeConstrainedCache[K, V]) Add(key K, value V) (evicted bool) {
// Get looks up a key's value from the cache. // Get looks up a key's value from the cache.
func (c *SizeConstrainedCache[K, V]) Get(key K) (V, bool) { func (c *SizeConstrainedCache[K, V]) Get(key K) (V, bool) {
c.lock.Lock() c.lock.RLock()
defer c.lock.Unlock() defer c.lock.RUnlock()
return c.lru.Get(key) return c.lru.Get(key)
} }

22
common/lru/lru.go
View file

@ -22,7 +22,7 @@ import "sync"
// This type is safe for concurrent use. // This type is safe for concurrent use.
type Cache[K comparable, V any] struct { type Cache[K comparable, V any] struct {
cache BasicLRU[K, V] cache BasicLRU[K, V]
mu sync.Mutex mu sync.RWMutex
} }
// NewCache creates an LRU cache. // NewCache creates an LRU cache.
@ -40,32 +40,32 @@ func (c *Cache[K, V]) Add(key K, value V) (evicted bool) {
// Contains reports whether the given key exists in the cache. // Contains reports whether the given key exists in the cache.
func (c *Cache[K, V]) Contains(key K) bool { func (c *Cache[K, V]) Contains(key K) bool {
c.mu.Lock() c.mu.RLock()
defer c.mu.Unlock() defer c.mu.RUnlock()
return c.cache.Contains(key) return c.cache.Contains(key)
} }
// Get retrieves a value from the cache. This marks the key as recently used. // Get retrieves a value from the cache. This marks the key as recently used.
func (c *Cache[K, V]) Get(key K) (value V, ok bool) { func (c *Cache[K, V]) Get(key K) (value V, ok bool) {
c.mu.Lock() c.mu.RLock()
defer c.mu.Unlock() defer c.mu.RUnlock()
return c.cache.Get(key) return c.cache.Get(key)
} }
// Len returns the current number of items in the cache. // Len returns the current number of items in the cache.
func (c *Cache[K, V]) Len() int { func (c *Cache[K, V]) Len() int {
c.mu.Lock() c.mu.RLock()
defer c.mu.Unlock() defer c.mu.RUnlock()
return c.cache.Len() return c.cache.Len()
} }
// Peek retrieves a value from the cache, but does not mark the key as recently used. // Peek retrieves a value from the cache, but does not mark the key as recently used.
func (c *Cache[K, V]) Peek(key K) (value V, ok bool) { func (c *Cache[K, V]) Peek(key K) (value V, ok bool) {
c.mu.Lock() c.mu.RLock()
defer c.mu.Unlock() defer c.mu.RUnlock()
return c.cache.Peek(key) return c.cache.Peek(key)
} }
@ -88,8 +88,8 @@ func (c *Cache[K, V]) Remove(key K) bool {
// Keys returns all keys of items currently in the LRU. // Keys returns all keys of items currently in the LRU.
func (c *Cache[K, V]) Keys() []K { func (c *Cache[K, V]) Keys() []K {
c.mu.Lock() c.mu.RLock()
defer c.mu.Unlock() defer c.mu.RUnlock()
return c.cache.Keys() return c.cache.Keys()
} }