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
|
// 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 (
"fmt"
"math"
"net"
"time"
"github.com/dexon-foundation/dexon-consensus-core/common"
"github.com/dexon-foundation/dexon-consensus-core/core/crypto"
"github.com/dexon-foundation/dexon-consensus-core/core/crypto/ecdsa"
"github.com/dexon-foundation/dexon-consensus-core/core/types"
)
func stableRandomHash(block *types.Block) (common.Hash, error) {
if (block.Hash != common.Hash{}) {
return block.Hash, nil
}
return common.NewRandomHash(), nil
}
// GenerateRandomNodeIDs generates randomly a slices of types.NodeID.
func GenerateRandomNodeIDs(nodeCount int) (nIDs types.NodeIDs) {
nIDs = types.NodeIDs{}
for i := 0; i < nodeCount; i++ {
nIDs = append(nIDs, types.NodeID{Hash: common.NewRandomHash()})
}
return
}
// GenerateRandomPrivateKeys generate a set of private keys.
func GenerateRandomPrivateKeys(nodeCount int) (prvKeys []crypto.PrivateKey) {
for i := 0; i < nodeCount; i++ {
prvKey, err := ecdsa.NewPrivateKey()
if err != nil {
panic(err)
}
prvKeys = append(prvKeys, prvKey)
}
return
}
// CalcLatencyStatistics calculates average and deviation from a slice
// of latencies.
func CalcLatencyStatistics(latencies []time.Duration) (avg, dev time.Duration) {
var (
sum float64
sumOfSquareDiff float64
)
// Calculate average.
for _, v := range latencies {
sum += float64(v)
}
avgAsFloat := sum / float64(len(latencies))
avg = time.Duration(avgAsFloat)
// Calculate deviation
for _, v := range latencies {
diff := math.Abs(float64(v) - avgAsFloat)
sumOfSquareDiff += diff * diff
}
dev = time.Duration(math.Sqrt(sumOfSquareDiff / float64(len(latencies)-1)))
return
}
// FindMyIP returns local IP address.
func FindMyIP() (ip string, err error) {
addrs, err := net.InterfaceAddrs()
if err != nil {
return
}
for _, a := range addrs {
ipnet, ok := a.(*net.IPNet)
if !ok {
continue
}
if ipnet.IP.IsLoopback() {
continue
}
if ipnet.IP.To4() != nil {
ip = ipnet.IP.String()
return
}
}
err = fmt.Errorf("unable to find IP")
return
}
|
