-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
104 lines (83 loc) · 1.74 KB
/
main.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
package main
import (
"fmt"
//"io/ioutil"
"log"
"math/rand"
//"os"
"miniproj.akash.page/node"
"time"
)
func main() {
rand.Seed(time.Now().UnixNano())
log.SetFlags(log.Ldate | log.Lmicroseconds)
nodes, leader_node := startCluster(3)
for{
time.Sleep(250 * time.Millisecond)
if countLeaders(nodes) == 1 {
fmt.Println("leaders should still be one who is %v", leader_node.ID)
}
}
}
func gimmeNodes(num int) []*node.Node {
var nodes []*node.Node
for i := 0; i < num; i++ {
transport := &node.HTTPTransport{Address: "127.0.0.1:0"}
logger := &node.Log{}
applyer := &node.StateMachine{}
node := node.NewNode(fmt.Sprintf("%d", i), transport, logger, applyer)
nodes = append(nodes, node)
nodes[i].Serve()
}
// let them start serving
time.Sleep(100 * time.Millisecond)
for i := 0; i < len(nodes); i++ {
for j := 0; j < len(nodes); j++ {
if j != i {
nodes[i].AddToCluster(nodes[j].Transport.String())
}
}
}
for _, node := range nodes {
node.Start()
}
return nodes
}
func countLeaders(nodes []*node.Node) int {
leaders := 0
for i := 0; i < len(nodes); i++ {
nodes[i].RLock()
if nodes[i].State == node.Leader {
leaders++
}
nodes[i].RUnlock()
}
return leaders
}
func findLeader(nodes []*node.Node) *node.Node {
for i := 0; i < len(nodes); i++ {
nodes[i].RLock()
if nodes[i].State == node.Leader {
nodes[i].RUnlock()
return nodes[i]
}
nodes[i].RUnlock()
}
return nil
}
func startCluster(num int) ([]*node.Node, *node.Node) {
nodes := gimmeNodes(num)
for {
time.Sleep(50 * time.Millisecond)
if countLeaders(nodes) == 1 {
break
}
}
leader := findLeader(nodes)
return nodes, leader
}
func stopCluster(nodes []*node.Node) {
for _, node := range nodes {
node.Exit()
}
}