/
state.go
140 lines (130 loc) · 2.51 KB
/
state.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
package blockmania
import (
"chainspace.io/chainspace-go/blockmania/messages"
"chainspace.io/chainspace-go/blockmania/states"
)
type nodeRound struct {
node uint64
round uint64
}
type state struct {
bitsets map[messages.PrePrepare]*bitset
data stateKV
delay map[uint64]uint64
final map[nodeRound]string
out []messages.Message
timeout uint64
timeouts map[uint64][]timeout
}
// clone the current state and return it
func (s *state) clone(minround uint64) *state {
if s == nil {
return &state{
timeouts: map[uint64][]timeout{},
}
}
n := &state{
timeout: s.timeout,
}
if s.bitsets != nil {
bitsets := map[messages.PrePrepare]*bitset{}
for k, v := range s.bitsets {
if k.Round < minround {
continue
}
bitsets[k] = v.clone()
}
n.bitsets = bitsets
}
if s.data != nil {
data := map[states.StateData]interface{}{}
for k, v := range s.data {
if k.GetRound() < minround {
continue
}
data[k] = v
}
n.data = data
}
if s.delay != nil {
delay := map[uint64]uint64{}
for k, v := range s.delay {
delay[k] = v
}
n.delay = delay
}
if s.final != nil {
final := map[nodeRound]string{}
for k, v := range s.final {
if k.round < minround {
continue
}
final[k] = v
}
n.final = final
}
var out []messages.Message
for _, msg := range s.out {
_, r := msg.NodeRound()
if r < minround {
continue
}
out = append(out, msg)
}
n.out = out
timeouts := map[uint64][]timeout{}
for k, v := range s.timeouts {
if k < minround {
continue
}
timeouts[k] = v
}
n.timeouts = timeouts
return n
}
func (s *state) getBitset(size int, pp messages.PrePrepare) *bitset {
if s.bitsets == nil {
b := newBitset(size)
s.bitsets = map[messages.PrePrepare]*bitset{
pp: b,
}
return b
}
if b, exists := s.bitsets[pp]; exists {
return b
}
b := newBitset(size)
s.bitsets[pp] = b
return b
}
func (s *state) getOutput() []messages.Message {
if s == nil {
return nil
}
return s.out
}
func (s *state) getView(node uint64, round uint64) uint32 {
if val, exists := s.data[states.View{Node: node, Round: round}]; exists {
return val.(uint32)
}
if s.data == nil {
s.data = map[states.StateData]interface{}{
states.View{Node: node, Round: round}: uint32(0),
}
} else {
s.data[states.View{Node: node, Round: round}] = uint32(0)
}
return 0
}
type stateKV map[states.StateData]interface{}
type timeout struct {
node uint64
round uint64
view uint32
}
func diff(a uint64, b uint64) uint64 {
if a >= b {
return a - b
}
return b - a
}