/
trie_dag.go
295 lines (247 loc) · 6.01 KB
/
trie_dag.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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
package trie
import (
"runtime"
"sync"
"sync/atomic"
"github.com/AlayaNetwork/Alaya-Go/common/byteutil"
"github.com/cespare/xxhash"
"github.com/panjf2000/ants/v2"
"github.com/AlayaNetwork/Alaya-Go/common"
)
var fullNodeSuffix = []byte("fullnode")
// dagNode
type dagNode struct {
collapsed node
cached node
pid uint64
idx int
}
// trieDag
type trieDag struct {
nodes map[uint64]*dagNode
dag *dag
lock sync.Mutex
loged bool
}
func newTrieDag() *trieDag {
return &trieDag{
nodes: make(map[uint64]*dagNode),
dag: newDag(),
loged: false,
}
}
func (td *trieDag) addVertexAndEdge(pprefix, prefix []byte, n node) {
td.lock.Lock()
defer td.lock.Unlock()
td.internalAddVertexAndEdge(pprefix, prefix, n, true)
}
func (td *trieDag) internalAddVertexAndEdge(pprefix, prefix []byte, n node, recursive bool) {
var pid uint64
if len(pprefix) > 0 {
pid = xxhash.Sum64(pprefix)
}
cachedHash := func(n node) (node, bool) {
if hash, _ := n.cache(); len(hash) != 0 {
return hash, true
}
return n, false
}
switch nc := n.(type) {
case *shortNode:
collapsed, cached := nc.copy(), nc.copy()
collapsed.Key = hexToCompact(nc.Key)
cached.Key = common.CopyBytes(nc.Key)
hash, has := cachedHash(nc.Val)
if has {
hash, _ = hash.(hashNode)
collapsed.Val = hash
}
id := xxhash.Sum64(byteutil.Concat(prefix, nc.Key...))
td.nodes[id] = &dagNode{
collapsed: collapsed,
cached: cached,
pid: pid,
}
if len(prefix) > 0 {
td.nodes[id].idx = int(prefix[len(prefix)-1])
}
td.dag.addVertex(id)
if pid > 0 {
td.dag.addEdge(id, pid)
}
case *fullNode:
collapsed, cached := nc.copy(), nc.copy()
cached.Children[16] = nc.Children[16]
dagNode := &dagNode{
collapsed: collapsed,
cached: cached,
pid: pid,
}
if len(prefix) > 0 {
dagNode.idx = int(prefix[len(prefix)-1])
}
id := xxhash.Sum64(byteutil.Concat(prefix, fullNodeSuffix...))
td.nodes[id] = dagNode
td.dag.addVertex(id)
if pid > 0 {
td.dag.addEdge(id, pid)
}
if recursive {
for i := 0; i < 16; i++ {
if cached.Children[i] != nil {
cn := cached.Children[i]
td.internalAddVertexAndEdge(byteutil.Concat(prefix, fullNodeSuffix...), byteutil.Concat(prefix, byte(i)), cn, false)
}
}
}
}
}
func (td *trieDag) delVertexAndEdge(key []byte) {
id := xxhash.Sum64(key)
td.delVertexAndEdgeByID(id)
}
func (td *trieDag) delVertexAndEdgeByID(id uint64) {
td.lock.Lock()
defer td.lock.Unlock()
//td.dag.delEdge(id)
td.dag.delVertex(id)
delete(td.nodes, id)
//fmt.Printf("del: %d\n", id)
}
func (td *trieDag) delVertexAndEdgeByNode(prefix []byte, n node) {
var id uint64
switch nc := n.(type) {
case *shortNode:
id = xxhash.Sum64(byteutil.Concat(prefix, nc.Key...))
case *fullNode:
id = xxhash.Sum64(byteutil.Concat(prefix, fullNodeSuffix...))
}
td.delVertexAndEdgeByID(id)
}
func (td *trieDag) clear() {
td.lock.Lock()
defer td.lock.Unlock()
td.dag.clear()
td.nodes = make(map[uint64]*dagNode)
}
func (td *trieDag) hash(db *Database, force bool, onleaf LeafCallback) (node, node, error) {
td.lock.Lock()
defer td.lock.Unlock()
td.dag.generate()
//log.Trace("Prepare do hash", "me", fmt.Sprintf("%p", td), "routineID", goid.Get(), "dag", fmt.Sprintf("%p", td.dag), "nodes", len(td.nodes), "topLevel", td.dag.topLevel.Len(), "consumed", td.dag.totalConsumed, "vtxs", td.dag.totalVertexs, "cv", td.dag.cv)
var wg sync.WaitGroup
var errDone common.AtomicBool
var e atomic.Value // error
var resHash node = hashNode{}
var newRoot node
numCPU := runtime.NumCPU()
cachedHash := func(n, c node) (node, node, bool) {
if hash, dirty := c.cache(); len(hash) != 0 {
if db == nil {
return hash, c, true
}
if !dirty {
return hash, c, true
}
}
return n, c, false
}
process := func() {
//log.Trace("Do hash", "me", fmt.Sprintf("%p", td), "routineID", goid.Get(), "dag", fmt.Sprintf("%p", td.dag), "nodes", len(td.nodes), "topLevel", td.dag.topLevel.Len(), "consumed", td.dag.totalConsumed, "vtxs", td.dag.totalVertexs, "cv", td.dag.cv)
hasher := newHasher(onleaf)
id := td.dag.waitPop()
if id == invalidID {
returnHasherToPool(hasher)
wg.Done()
return
}
var hashed node
var cached node
var err error
var hasCache bool
for id != invalidID {
n := td.nodes[id]
tmpForce := false
if n.pid == 0 {
tmpForce = force
}
hashed, cached, hasCache = cachedHash(n.collapsed, n.cached)
if !hasCache {
switch ct := n.collapsed.(type) {
case *fullNode:
for i := 0; i < 16; i++ {
if ct.Children[i] != nil {
nc := ct.Children[i]
if _, isHash := nc.(hashNode); !isHash {
h, _, _ := cachedHash(nc, nc)
ct.Children[i] = h
}
}
}
}
hashed, err = hasher.store(n.collapsed, db, tmpForce)
if err != nil {
e.Store(err)
errDone.Set(true)
break
}
cached = n.cached
}
if n.pid > 0 {
p := td.nodes[n.pid]
switch ptype := p.collapsed.(type) {
case *shortNode:
ptype.Val = hashed
case *fullNode:
ptype.Children[n.idx] = hashed
}
if _, ok := cached.(hashNode); ok {
switch nc := p.cached.(type) {
case *shortNode:
nc.Val = cached
case *fullNode:
nc.Children[n.idx] = cached
}
}
}
cachedHash, _ := hashed.(hashNode)
switch cn := n.cached.(type) {
case *shortNode:
*cn.flags.hash = cachedHash
if db != nil {
*cn.flags.dirty = false
}
case *fullNode:
*cn.flags.hash = cachedHash
if db != nil {
*cn.flags.dirty = false
}
}
id = td.dag.consume(id)
if n.pid == 0 {
resHash = hashed
newRoot = n.cached
break
}
if errDone.IsSet() {
break
}
if id == invalidID && !td.dag.hasFinished() {
id = td.dag.waitPop()
}
}
returnHasherToPool(hasher)
wg.Done()
}
wg.Add(numCPU)
for i := 0; i < numCPU; i++ {
_ = ants.Submit(process)
}
wg.Wait()
td.dag.reset()
td.loged = true
if e.Load() != nil && e.Load().(error) != nil {
return hashNode{}, nil, e.Load().(error)
}
return resHash, newRoot, nil
}