This repository has been archived by the owner on Dec 1, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
gcstore.go
102 lines (83 loc) · 2.41 KB
/
gcstore.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
// Copyright 2015 Google Inc. All Rights Reserved.
//
// 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.
// Generic storage for garbage collected entries.
package gcstore
import (
"sync"
"time"
"github.com/GoogleCloudPlatform/kubernetes/pkg/util"
)
var _ GCStore = &gcStore{}
// Garbage collected key-value store. Items that are not accessed after a
// certain amount of time are garbage collected. Keys must be comparable.
//
// Implementation is thread-safe.
type GCStore interface {
// Put a key-value into the store. Keys must be comparable.
Put(key, value interface{})
// Gets the value of a specified key. If the key is not present,
// nil is returned.
Get(key interface{}) interface{}
}
func New(ttl time.Duration) GCStore {
store := &gcStore{
data: make(map[interface{}]*dataItem),
ttl: ttl,
}
go util.Forever(store.garbageCollect, ttl/2)
return store
}
type gcStore struct {
// Holds mapping of keys to values.
data map[interface{}]*dataItem
// TODO(vmarmol): Consider using other locking mechanism if
// there is too much contention.
// Synchronizes access to data.
lock sync.Mutex
// Time since last access for which to keep an item.
ttl time.Duration
}
type dataItem struct {
lastAccessed time.Time
value interface{}
}
func (self *gcStore) Put(key, value interface{}) {
self.lock.Lock()
defer self.lock.Unlock()
self.data[key] = &dataItem{
lastAccessed: time.Now(),
value: value,
}
}
func (self *gcStore) Get(key interface{}) interface{} {
self.lock.Lock()
defer self.lock.Unlock()
item, ok := self.data[key]
if !ok {
return nil
}
item.lastAccessed = time.Now()
return item.value
}
func (self *gcStore) garbageCollect() {
self.lock.Lock()
defer self.lock.Unlock()
// Remove all entried older than the allowed time.
oldest := time.Now().Add(-self.ttl)
for key := range self.data {
if self.data[key].lastAccessed.Before(oldest) {
delete(self.data, key)
}
}
}