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
|
// Copyright 2018 The dexon-consensus-core Authors
// This file is part of the dexon-consensus-core library.
//
// The dexon-consensus-core library is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the License,
// or (at your option) any later version.
//
// The dexon-consensus-core library is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the dexon-consensus-core library. If not, see
// <http://www.gnu.org/licenses/>.
package test
import (
"sync"
"testing"
"time"
"github.com/dexon-foundation/dexon-consensus-core/common"
"github.com/dexon-foundation/dexon-consensus-core/core/types"
"github.com/stretchr/testify/suite"
)
type SchedulerTestSuite struct {
suite.Suite
}
type simpleStopper struct {
lock sync.Mutex
touched map[types.NodeID]int
touchedCount int
}
func newSimpleStopper(
nodes []types.NodeID, touchedCount int) *simpleStopper {
touched := make(map[types.NodeID]int)
for _, nID := range nodes {
touched[nID] = 0
}
return &simpleStopper{
touched: touched,
touchedCount: touchedCount,
}
}
func (stopper *simpleStopper) ShouldStop(nID types.NodeID) bool {
stopper.lock.Lock()
defer stopper.lock.Unlock()
stopper.touched[nID] = stopper.touched[nID] + 1
for _, count := range stopper.touched {
if count < stopper.touchedCount {
return false
}
}
return true
}
type simpleHandler struct {
count int
nID types.NodeID
}
func (handler *simpleHandler) Handle(e *Event) (events []*Event) {
if e.NodeID == handler.nID {
handler.count++
}
return
}
type fixedLatencyHandler struct {
nID types.NodeID
}
func (handler *fixedLatencyHandler) Handle(e *Event) (events []*Event) {
// Simulate execution time.
time.Sleep(500 * time.Millisecond)
return []*Event{&Event{
NodeID: handler.nID,
Time: e.Time.Add(800 * time.Millisecond),
}}
}
func (s *SchedulerTestSuite) TestEventSequence() {
// This test case makes sure the event sequence is correctly increment
// by their timestamps in 'Time' field.
var (
sch = NewScheduler(nil)
req = s.Require()
)
req.NotNil(sch)
now := time.Now()
req.Nil(sch.Seed(&Event{Time: now.Add(100 * time.Second), Payload: 1}))
req.Nil(sch.Seed(&Event{Time: now.Add(99 * time.Second), Payload: 2}))
req.Nil(sch.Seed(&Event{Time: now.Add(98 * time.Second), Payload: 3}))
req.Nil(sch.Seed(&Event{Time: now.Add(97 * time.Second), Payload: 4}))
req.Nil(sch.Seed(&Event{Time: now.Add(96 * time.Second), Payload: 5}))
req.Equal(sch.nextTick().Payload.(int), 5)
req.Equal(sch.nextTick().Payload.(int), 4)
req.Equal(sch.nextTick().Payload.(int), 3)
req.Equal(sch.nextTick().Payload.(int), 2)
req.Equal(sch.nextTick().Payload.(int), 1)
req.Nil(sch.nextTick())
}
func (s *SchedulerTestSuite) TestBasicRound() {
// This test case makes sure these facts:
// - event is dispatched by NodeID attached to each handler.
// - stopper can stop the execution when condition is met.
var (
req = s.Require()
nodes = GenerateRandomNodeIDs(3)
stopper = newSimpleStopper(nodes, 2)
sch = NewScheduler(stopper)
handlers = make(map[types.NodeID]*simpleHandler)
)
for _, nID := range nodes {
handler := &simpleHandler{nID: nID}
handlers[nID] = handler
sch.RegisterEventHandler(nID, handler)
req.Nil(sch.Seed(&Event{NodeID: nID}))
req.Nil(sch.Seed(&Event{NodeID: nID}))
}
sch.Run(10)
// Verify result.
for _, h := range handlers {
req.Equal(h.count, 2)
}
}
func (s *SchedulerTestSuite) TestChildEvent() {
// This test case makes sure these fields of child events are
// assigned correctly.
var (
req = s.Require()
nID = types.NodeID{Hash: common.NewRandomHash()}
stopper = newSimpleStopper(types.NodeIDs{nID}, 3)
handler = &fixedLatencyHandler{nID: nID}
sch = NewScheduler(stopper)
)
sch.RegisterEventHandler(nID, handler)
req.Nil(sch.Seed(&Event{
NodeID: nID,
Time: time.Now().UTC(),
}))
sch.Run(1)
// Verify result.
history := sch.CloneExecutionHistory()
req.Len(history, 3)
curEvent := history[0]
for _, e := range history[1:] {
// Make sure the time difference between events are more than
// 1.3 second.
req.True(e.Time.Sub(curEvent.Time) >= 1300*time.Millisecond)
// Make sure ParentTime field is set and is equal to parent event's
// time.
req.NotEqual(-1, e.ParentHistoryIndex)
req.Equal(e.ParentHistoryIndex, curEvent.HistoryIndex)
curEvent = e
}
}
func TestScheduler(t *testing.T) {
suite.Run(t, new(SchedulerTestSuite))
}
|
