-
Notifications
You must be signed in to change notification settings - Fork 714
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
10 changed files
with
190 additions
and
20 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,144 @@ | ||
| // Copyright 2018 PingCAP, Inc. | ||
| // | ||
| // 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, | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| package faketikv | ||
|
|
||
| import ( | ||
| "fmt" | ||
| "math" | ||
| ) | ||
|
|
||
| type taskStatistics struct { | ||
| addPeer map[uint64]int | ||
| removePeer map[uint64]int | ||
| addLearner map[uint64]int | ||
| promoteLeaner map[uint64]int | ||
| transferLeader map[uint64]map[uint64]int | ||
| mergeRegion int | ||
| } | ||
|
|
||
| func newTaskStatistics() *taskStatistics { | ||
| return &taskStatistics{ | ||
| addPeer: make(map[uint64]int), | ||
| removePeer: make(map[uint64]int), | ||
| addLearner: make(map[uint64]int), | ||
| promoteLeaner: make(map[uint64]int), | ||
| transferLeader: make(map[uint64]map[uint64]int), | ||
| } | ||
| } | ||
|
|
||
| func (t *taskStatistics) getStatistics() map[string]int { | ||
| stats := make(map[string]int) | ||
| addpeer := getSum(t.addPeer) | ||
| removePeer := getSum(t.removePeer) | ||
| addLearner := getSum(t.addLearner) | ||
| promoteLeaner := getSum(t.promoteLeaner) | ||
|
|
||
| var transferLeader int | ||
| for _, to := range t.transferLeader { | ||
| for _, v := range to { | ||
| transferLeader += v | ||
| } | ||
| } | ||
|
|
||
| stats["Add Peer (task)"] = addpeer | ||
| stats["Remove Peer (task)"] = removePeer | ||
| stats["Add Learner (task)"] = addLearner | ||
| stats["Promote Learner (task)"] = promoteLeaner | ||
| stats["Transfer Leader (task)"] = transferLeader | ||
| stats["Merge Region (task)"] = t.mergeRegion | ||
|
|
||
| return stats | ||
| } | ||
|
|
||
| type snapshotStatistics struct { | ||
| receive map[uint64]int | ||
| send map[uint64]int | ||
| } | ||
|
|
||
| func newSnapshotStatistics() *snapshotStatistics { | ||
| return &snapshotStatistics{ | ||
| receive: make(map[uint64]int), | ||
| send: make(map[uint64]int), | ||
| } | ||
| } | ||
|
|
||
| type schedulerStatistics struct { | ||
| taskStats *taskStatistics | ||
| snapshotStats *snapshotStatistics | ||
| } | ||
|
|
||
| func newSchedulerStatistics() *schedulerStatistics { | ||
| return &schedulerStatistics{ | ||
| taskStats: newTaskStatistics(), | ||
| snapshotStats: newSnapshotStatistics(), | ||
| } | ||
| } | ||
|
|
||
| func (s *snapshotStatistics) getStatistics() map[string]int { | ||
| maxSend := getMax(s.send) | ||
| maxReceive := getMax(s.receive) | ||
| minSend := getMin(s.send) | ||
| minReceive := getMin(s.receive) | ||
|
|
||
| stats := make(map[string]int) | ||
| stats["Send Maximum (snapshot)"] = maxSend | ||
| stats["Receive Maximum (snapshot)"] = maxReceive | ||
| if minSend != math.MaxInt32 { | ||
| stats["Send Minimum (snapshot)"] = minSend | ||
| } | ||
| if minReceive != math.MaxInt32 { | ||
| stats["Receive Minimum (snapshot)"] = minReceive | ||
| } | ||
|
|
||
| return stats | ||
| } | ||
|
|
||
| func (s *schedulerStatistics) Print() { | ||
| task := s.taskStats.getStatistics() | ||
| snap := s.snapshotStats.getStatistics() | ||
| for t, count := range task { | ||
| fmt.Println(t, count) | ||
| } | ||
| for s, count := range snap { | ||
| fmt.Println(s, count) | ||
| } | ||
| } | ||
|
|
||
| func getMax(m map[uint64]int) int { | ||
| var max int | ||
| for _, v := range m { | ||
| if v > max { | ||
| max = v | ||
| } | ||
| } | ||
| return max | ||
| } | ||
|
|
||
| func getMin(m map[uint64]int) int { | ||
| min := math.MaxInt32 | ||
| for _, v := range m { | ||
| if v < min { | ||
| min = v | ||
| } | ||
| } | ||
| return min | ||
| } | ||
|
|
||
| func getSum(m map[uint64]int) int { | ||
| var sum int | ||
| for _, v := range m { | ||
| sum += v | ||
| } | ||
| return sum | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters