forked from kaspanet/kaspad
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mergeset.go
128 lines (111 loc) · 3.89 KB
/
mergeset.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
package ghostdagmanager
import (
"sort"
"github.com/romxxxx/nexepad/domain/consensus/model"
"github.com/romxxxx/nexepad/domain/consensus/model/externalapi"
)
func (gm *ghostdagManager) mergeSetWithoutSelectedParent(stagingArea *model.StagingArea,
selectedParent *externalapi.DomainHash, blockParents []*externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
mergeSetMap := make(map[externalapi.DomainHash]struct{}, gm.k)
mergeSetSlice := make([]*externalapi.DomainHash, 0, gm.k)
selectedParentPast := make(map[externalapi.DomainHash]struct{})
queue := []*externalapi.DomainHash{}
// Queueing all parents (other than the selected parent itself) for processing.
for _, parent := range blockParents {
if parent.Equal(selectedParent) {
continue
}
mergeSetMap[*parent] = struct{}{}
mergeSetSlice = append(mergeSetSlice, parent)
queue = append(queue, parent)
}
for len(queue) > 0 {
var current *externalapi.DomainHash
current, queue = queue[0], queue[1:]
// For each parent of the current block we check whether it is in the past of the selected parent. If not,
// we add the it to the resulting anticone-set and queue it for further processing.
currentParents, err := gm.dagTopologyManager.Parents(stagingArea, current)
if err != nil {
return nil, err
}
for _, parent := range currentParents {
if _, ok := mergeSetMap[*parent]; ok {
continue
}
if _, ok := selectedParentPast[*parent]; ok {
continue
}
isAncestorOfSelectedParent, err := gm.dagTopologyManager.IsAncestorOf(stagingArea, parent, selectedParent)
if err != nil {
return nil, err
}
if isAncestorOfSelectedParent {
selectedParentPast[*parent] = struct{}{}
continue
}
mergeSetMap[*parent] = struct{}{}
mergeSetSlice = append(mergeSetSlice, parent)
queue = append(queue, parent)
}
}
err := gm.sortMergeSet(stagingArea, mergeSetSlice)
if err != nil {
return nil, err
}
return mergeSetSlice, nil
}
func (gm *ghostdagManager) sortMergeSet(stagingArea *model.StagingArea, mergeSetSlice []*externalapi.DomainHash) error {
var err error
sort.Slice(mergeSetSlice, func(i, j int) bool {
if err != nil {
return false
}
isLess, lessErr := gm.less(stagingArea, mergeSetSlice[i], mergeSetSlice[j])
if lessErr != nil {
err = lessErr
return false
}
return isLess
})
return err
}
// GetSortedMergeSet return the merge set sorted in a toplogical order.
func (gm *ghostdagManager) GetSortedMergeSet(stagingArea *model.StagingArea,
current *externalapi.DomainHash) ([]*externalapi.DomainHash, error) {
currentGhostdagData, err := gm.ghostdagDataStore.Get(gm.databaseContext, stagingArea, current, false)
if err != nil {
return nil, err
}
blueMergeSet := currentGhostdagData.MergeSetBlues()
redMergeSet := currentGhostdagData.MergeSetReds()
sortedMergeSet := make([]*externalapi.DomainHash, 0, len(blueMergeSet)+len(redMergeSet))
// If the current block is the genesis block:
if len(blueMergeSet) == 0 {
return sortedMergeSet, nil
}
selectedParent, blueMergeSet := blueMergeSet[0], blueMergeSet[1:]
sortedMergeSet = append(sortedMergeSet, selectedParent)
i, j := 0, 0
for i < len(blueMergeSet) && j < len(redMergeSet) {
currentBlue := blueMergeSet[i]
currentBlueGhostdagData, err := gm.ghostdagDataStore.Get(gm.databaseContext, stagingArea, currentBlue, false)
if err != nil {
return nil, err
}
currentRed := redMergeSet[j]
currentRedGhostdagData, err := gm.ghostdagDataStore.Get(gm.databaseContext, stagingArea, currentRed, false)
if err != nil {
return nil, err
}
if gm.Less(currentBlue, currentBlueGhostdagData, currentRed, currentRedGhostdagData) {
sortedMergeSet = append(sortedMergeSet, currentBlue)
i++
} else {
sortedMergeSet = append(sortedMergeSet, currentRed)
j++
}
}
sortedMergeSet = append(sortedMergeSet, blueMergeSet[i:]...)
sortedMergeSet = append(sortedMergeSet, redMergeSet[j:]...)
return sortedMergeSet, nil
}