blob: 44e0d32abee391b91255635a114ca2e382902e6f (
plain) (
blame)
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
|
package cache
import (
"gopkg.in/src-d/go-git.v4/plumbing"
)
const (
initialQueueSize = 20
MaxSize = 10 * MiByte
)
type ObjectFIFO struct {
objects map[plumbing.Hash]plumbing.EncodedObject
order *queue
maxSize FileSize
actualSize FileSize
}
// NewObjectFIFO returns an Object cache that keeps the newest objects that fit
// into the specific memory size
func NewObjectFIFO(size FileSize) *ObjectFIFO {
return &ObjectFIFO{
objects: make(map[plumbing.Hash]plumbing.EncodedObject),
order: newQueue(initialQueueSize),
maxSize: size,
}
}
// Put puts a new object to the cache. If the object size is greater than the
// cache size, the object is not added.
func (c *ObjectFIFO) Put(o plumbing.EncodedObject) {
objSize := FileSize(o.Size())
// if the size of the object is bigger or equal than the cache size,
// skip it
if objSize >= c.maxSize {
return
}
// if the object is into the cache, do not add it again
if _, ok := c.objects[o.Hash()]; ok {
return
}
// delete the oldest object if cache is full
if c.actualSize >= c.maxSize {
h := c.order.Pop()
o := c.objects[h]
if o != nil {
c.actualSize -= FileSize(o.Size())
delete(c.objects, h)
}
}
c.objects[o.Hash()] = o
c.order.Push(o.Hash())
c.actualSize += FileSize(o.Size())
}
// Get returns an object by his hash. If the object is not found in the cache, it
// returns nil
func (c *ObjectFIFO) Get(k plumbing.Hash) (plumbing.EncodedObject, bool) {
obj, ok := c.objects[k]
return obj, ok
}
// Clear the content of this object cache
func (c *ObjectFIFO) Clear() {
c.objects = make(map[plumbing.Hash]plumbing.EncodedObject)
c.order = newQueue(initialQueueSize)
c.actualSize = 0
}
|
