mirror of
https://github.com/etcd-io/etcd.git
synced 2024-09-27 06:25:44 +00:00
161 lines
3.4 KiB
Go
161 lines
3.4 KiB
Go
// Copyright 2016 The etcd 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 report
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/csv"
|
|
"fmt"
|
|
"log"
|
|
"math"
|
|
"sort"
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
type DataPoint struct {
|
|
Timestamp int64
|
|
MinLatency time.Duration
|
|
AvgLatency time.Duration
|
|
MaxLatency time.Duration
|
|
ThroughPut int64
|
|
}
|
|
|
|
type TimeSeries []DataPoint
|
|
|
|
func (t TimeSeries) Swap(i, j int) { t[i], t[j] = t[j], t[i] }
|
|
func (t TimeSeries) Len() int { return len(t) }
|
|
func (t TimeSeries) Less(i, j int) bool { return t[i].Timestamp < t[j].Timestamp }
|
|
|
|
type secondPoint struct {
|
|
minLatency time.Duration
|
|
maxLatency time.Duration
|
|
totalLatency time.Duration
|
|
count int64
|
|
}
|
|
|
|
type secondPoints struct {
|
|
mu sync.Mutex
|
|
tm map[int64]secondPoint
|
|
}
|
|
|
|
func newSecondPoints() *secondPoints {
|
|
return &secondPoints{tm: make(map[int64]secondPoint)}
|
|
}
|
|
|
|
func (sp *secondPoints) Add(ts time.Time, lat time.Duration) {
|
|
sp.mu.Lock()
|
|
defer sp.mu.Unlock()
|
|
|
|
tk := ts.Unix()
|
|
if v, ok := sp.tm[tk]; !ok {
|
|
sp.tm[tk] = secondPoint{minLatency: lat, maxLatency: lat, totalLatency: lat, count: 1}
|
|
} else {
|
|
if lat != time.Duration(0) {
|
|
v.minLatency = minDuration(v.minLatency, lat)
|
|
}
|
|
v.maxLatency = maxDuration(v.maxLatency, lat)
|
|
v.totalLatency += lat
|
|
v.count++
|
|
sp.tm[tk] = v
|
|
}
|
|
}
|
|
|
|
func (sp *secondPoints) getTimeSeries() TimeSeries {
|
|
sp.mu.Lock()
|
|
defer sp.mu.Unlock()
|
|
|
|
var (
|
|
minTs int64 = math.MaxInt64
|
|
maxTs int64 = -1
|
|
)
|
|
for k := range sp.tm {
|
|
if minTs > k {
|
|
minTs = k
|
|
}
|
|
if maxTs < k {
|
|
maxTs = k
|
|
}
|
|
}
|
|
for ti := minTs; ti < maxTs; ti++ {
|
|
if _, ok := sp.tm[ti]; !ok { // fill-in empties
|
|
sp.tm[ti] = secondPoint{totalLatency: 0, count: 0}
|
|
}
|
|
}
|
|
|
|
var (
|
|
tslice = make(TimeSeries, len(sp.tm))
|
|
i int
|
|
)
|
|
for k, v := range sp.tm {
|
|
var lat time.Duration
|
|
if v.count > 0 {
|
|
lat = time.Duration(v.totalLatency) / time.Duration(v.count)
|
|
}
|
|
tslice[i] = DataPoint{
|
|
Timestamp: k,
|
|
MinLatency: v.minLatency,
|
|
AvgLatency: lat,
|
|
MaxLatency: v.maxLatency,
|
|
ThroughPut: v.count,
|
|
}
|
|
i++
|
|
}
|
|
|
|
sort.Sort(tslice)
|
|
return tslice
|
|
}
|
|
|
|
func (ts TimeSeries) String() string {
|
|
buf := new(bytes.Buffer)
|
|
wr := csv.NewWriter(buf)
|
|
if err := wr.Write([]string{"UNIX-SECOND", "MIN-LATENCY-MS", "AVG-LATENCY-MS", "MAX-LATENCY-MS", "AVG-THROUGHPUT"}); err != nil {
|
|
log.Fatal(err)
|
|
}
|
|
rows := [][]string{}
|
|
for i := range ts {
|
|
row := []string{
|
|
fmt.Sprintf("%d", ts[i].Timestamp),
|
|
ts[i].MinLatency.String(),
|
|
ts[i].AvgLatency.String(),
|
|
ts[i].MaxLatency.String(),
|
|
fmt.Sprintf("%d", ts[i].ThroughPut),
|
|
}
|
|
rows = append(rows, row)
|
|
}
|
|
if err := wr.WriteAll(rows); err != nil {
|
|
log.Fatal(err)
|
|
}
|
|
wr.Flush()
|
|
if err := wr.Error(); err != nil {
|
|
log.Fatal(err)
|
|
}
|
|
return fmt.Sprintf("\nSample in one second (unix latency throughput):\n%s", buf.String())
|
|
}
|
|
|
|
func minDuration(a, b time.Duration) time.Duration {
|
|
if a < b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
func maxDuration(a, b time.Duration) time.Duration {
|
|
if a > b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|