/
query_stat_manager.go
89 lines (75 loc) · 2 KB
/
query_stat_manager.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
// Copyright 2022 Liuxiangchao iwind.liu@gmail.com. All rights reserved.
package dbs
import (
"fmt"
teaconst "github.com/TeaOSLab/EdgeNode/internal/const"
"github.com/TeaOSLab/EdgeNode/internal/events"
"github.com/TeaOSLab/EdgeNode/internal/goman"
"github.com/iwind/TeaGo/logs"
"sort"
"strings"
"sync"
"time"
)
func init() {
if !teaconst.IsMain {
return
}
var ticker = time.NewTicker(5 * time.Second)
events.On(events.EventLoaded, func() {
if teaconst.EnableDBStat {
goman.New(func() {
for range ticker.C {
var stats = []string{}
for _, stat := range SharedQueryStatManager.TopN(10) {
var avg = stat.CostTotal / float64(stat.Calls)
var query = stat.Query
if len(query) > 128 {
query = query[:128]
}
stats = append(stats, fmt.Sprintf("%.2fms/%.2fms/%.2fms - %d - %s", stat.CostMin*1000, stat.CostMax*1000, avg*1000, stat.Calls, query))
}
logs.Println("\n========== DB STATS ==========\n" + strings.Join(stats, "\n") + "\n=============================")
}
})
}
})
}
var SharedQueryStatManager = NewQueryStatManager()
type QueryStatManager struct {
statsMap map[string]*QueryStat // query => *QueryStat
locker sync.Mutex
}
func NewQueryStatManager() *QueryStatManager {
return &QueryStatManager{
statsMap: map[string]*QueryStat{},
}
}
func (this *QueryStatManager) AddQuery(query string) *QueryLabel {
return NewQueryLabel(this, query)
}
func (this *QueryStatManager) AddCost(query string, cost float64) {
this.locker.Lock()
defer this.locker.Unlock()
stat, ok := this.statsMap[query]
if !ok {
stat = NewQueryStat(query)
this.statsMap[query] = stat
}
stat.AddCost(cost)
}
func (this *QueryStatManager) TopN(n int) []*QueryStat {
this.locker.Lock()
defer this.locker.Unlock()
var stats = []*QueryStat{}
for _, stat := range this.statsMap {
stats = append(stats, stat)
}
sort.Slice(stats, func(i, j int) bool {
return stats[i].CostMax > stats[j].CostMax
})
if len(stats) > n {
return stats[:n]
}
return stats
}