-
Notifications
You must be signed in to change notification settings - Fork 5.9k
/
sharded_lru.go
58 lines (48 loc) · 1.6 KB
/
sharded_lru.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
// Copyright 2017 PingCAP, 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,
// See the License for the specific language governing permissions and
// limitations under the License.
package kvcache
import (
"sync"
"github.com/spaolacci/murmur3"
)
// ShardedLRUCache is a sharded LRU Cache, thread safe.
type ShardedLRUCache struct {
shards []*SimpleLRUCache
locks []sync.RWMutex
}
// NewShardedLRUCache creates a ShardedLRUCache.
func NewShardedLRUCache(capacity, shardCount uint) *ShardedLRUCache {
shardedLRUCache := &ShardedLRUCache{
shards: make([]*SimpleLRUCache, 0, shardCount),
locks: make([]sync.RWMutex, shardCount),
}
for i := uint(0); i < shardCount; i++ {
shardedLRUCache.shards = append(shardedLRUCache.shards, NewSimpleLRUCache(capacity/shardCount))
}
return shardedLRUCache
}
// Get gets a value from a ShardedLRUCache.
func (s *ShardedLRUCache) Get(key Key) (Value, bool) {
id := int(murmur3.Sum32(key.Hash())) % len(s.shards)
s.locks[id].Lock()
value, ok := s.shards[id].Get(key)
s.locks[id].Unlock()
return value, ok
}
// Put puts a (key, value) pair to a ShardedLRUCache.
func (s *ShardedLRUCache) Put(key Key, value Value) {
id := int(murmur3.Sum32(key.Hash())) % len(s.shards)
s.locks[id].Lock()
s.shards[id].Put(key, value)
s.locks[id].Unlock()
}