-
Notifications
You must be signed in to change notification settings - Fork 182
/
execution_datamap.go
81 lines (68 loc) · 1.32 KB
/
execution_datamap.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
package state
import (
"container/list"
"sync"
)
type deltaMap struct {
mtx sync.Mutex
cacheMap map[int64]*list.Element
cacheList *list.List
mrh int64
}
func newDataMap() *deltaMap {
return &deltaMap{
cacheMap: make(map[int64]*list.Element),
cacheList: list.New(),
}
}
type payload struct {
h int64
di *DeltaInfo
}
func (m *deltaMap) insert(height int64, deltaInfo *DeltaInfo, mrh int64) {
if deltaInfo == nil {
return
}
m.mtx.Lock()
defer m.mtx.Unlock()
e := m.cacheList.PushBack(&payload{height, deltaInfo})
m.cacheMap[height] = e
m.mrh = mrh
}
func (m *deltaMap) fetch(height int64) (*DeltaInfo, int64) {
m.mtx.Lock()
defer m.mtx.Unlock()
popped := m.cacheMap[height]
delete(m.cacheMap, height)
if popped != nil {
m.cacheList.Remove(popped)
pl := popped.Value.(*payload)
return pl.di, m.mrh
}
return nil, m.mrh
}
// remove all elements no higher than target
func (m *deltaMap) remove(target int64) (int, int) {
m.mtx.Lock()
defer m.mtx.Unlock()
num := 0
for {
e := m.cacheList.Front()
if e == nil {
break
}
h := e.Value.(*payload).h
if h > target {
break
}
m.cacheList.Remove(e)
delete(m.cacheMap, h)
num++
}
return num, len(m.cacheMap)
}
func (m *deltaMap) info() (int, int) {
m.mtx.Lock()
defer m.mtx.Unlock()
return len(m.cacheMap), m.cacheList.Len()
}