/
conn.go
53 lines (45 loc) · 1.51 KB
/
conn.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
// Copyright 2018 TiKV Project Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package simulator
import (
"github.com/pingcap/kvproto/pkg/metapb"
"github.com/tikv/pd/tools/pd-simulator/simulator/cases"
)
// Connection records the information of connection among nodes.
type Connection struct {
pdAddr string
Nodes map[uint64]*Node
}
// NewConnection creates nodes according to the configuration and returns the connection among nodes.
func NewConnection(simCase *cases.Case, pdAddr string, storeConfig *SimConfig) (*Connection, error) {
conn := &Connection{
pdAddr: pdAddr,
Nodes: make(map[uint64]*Node),
}
for _, store := range simCase.Stores {
node, err := NewNode(store, pdAddr, storeConfig)
if err != nil {
return nil, err
}
conn.Nodes[store.ID] = node
}
return conn, nil
}
func (c *Connection) nodeHealth(storeID uint64) bool {
n, ok := c.Nodes[storeID]
if !ok {
return false
}
return n.GetNodeState() == metapb.NodeState_Preparing || n.GetNodeState() == metapb.NodeState_Serving
}