This repository was archived by the owner on Jan 28, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 109
/
Copy pathcache.go
131 lines (105 loc) · 2.62 KB
/
cache.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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
package sql
import (
"fmt"
"hash/crc64"
"runtime"
lru "github.com/hashicorp/golang-lru"
errors "gopkg.in/src-d/go-errors.v1"
)
var table = crc64.MakeTable(crc64.ISO)
// CacheKey returns a hash of the given value to be used as key in
// a cache.
func CacheKey(v interface{}) uint64 {
return crc64.Checksum([]byte(fmt.Sprintf("%#v", v)), table)
}
// ErrKeyNotFound is returned when the key could not be found in the cache.
var ErrKeyNotFound = errors.NewKind("memory: key %d not found in cache")
type lruCache struct {
memory Freeable
reporter Reporter
size int
cache *lru.Cache
}
func newLRUCache(memory Freeable, r Reporter, size uint) *lruCache {
lru, _ := lru.New(int(size))
return &lruCache{memory, r, int(size), lru}
}
func (l *lruCache) Put(k uint64, v interface{}) error {
if releaseMemoryIfNeeded(l.reporter, l.Free, l.memory.Free) {
l.cache.Add(k, v)
}
return nil
}
func (l *lruCache) Get(k uint64) (interface{}, error) {
v, ok := l.cache.Get(k)
if !ok {
return nil, ErrKeyNotFound.New(k)
}
return v, nil
}
func (l *lruCache) Free() {
l.cache, _ = lru.New(l.size)
}
func (l *lruCache) Dispose() {
l.memory = nil
l.cache = nil
}
type rowsCache struct {
memory Freeable
reporter Reporter
rows []Row
}
func newRowsCache(memory Freeable, r Reporter) *rowsCache {
return &rowsCache{memory, r, nil}
}
func (c *rowsCache) Add(row Row) error {
if !releaseMemoryIfNeeded(c.reporter, c.memory.Free) {
return ErrNoMemoryAvailable.New()
}
c.rows = append(c.rows, row)
return nil
}
func (c *rowsCache) Get() []Row { return c.rows }
func (c *rowsCache) Dispose() {
c.memory = nil
c.rows = nil
}
type historyCache struct {
memory Freeable
reporter Reporter
cache map[uint64]interface{}
}
func newHistoryCache(memory Freeable, r Reporter) *historyCache {
return &historyCache{memory, r, make(map[uint64]interface{})}
}
func (h *historyCache) Put(k uint64, v interface{}) error {
if !releaseMemoryIfNeeded(h.reporter, h.memory.Free) {
return ErrNoMemoryAvailable.New()
}
h.cache[k] = v
return nil
}
func (h *historyCache) Get(k uint64) (interface{}, error) {
v, ok := h.cache[k]
if !ok {
return nil, ErrKeyNotFound.New(k)
}
return v, nil
}
func (h *historyCache) Dispose() {
h.memory = nil
h.cache = nil
}
// releasesMemoryIfNeeded releases memory if needed using the following steps
// until there is available memory. It returns whether or not there was
// available memory after all the steps.
func releaseMemoryIfNeeded(r Reporter, steps ...func()) bool {
for _, s := range steps {
if HasAvailableMemory(r) {
return true
}
s()
runtime.GC()
}
return HasAvailableMemory(r)
}