2014-04-12 05:18:18 +00:00
|
|
|
// Beego (http://beego.me/)
|
|
|
|
// @description beego is an open-source, high-performance web framework for the Go programming language.
|
|
|
|
// @link http://github.com/astaxie/beego for the canonical source repository
|
|
|
|
// @license http://github.com/astaxie/beego/blob/master/LICENSE
|
|
|
|
// @authors astaxie
|
|
|
|
|
2013-11-20 13:17:49 +00:00
|
|
|
package toolbox
|
2013-11-13 13:11:03 +00:00
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
2013-11-15 13:45:51 +00:00
|
|
|
"io"
|
2013-11-13 13:11:03 +00:00
|
|
|
"log"
|
|
|
|
"os"
|
|
|
|
"runtime"
|
|
|
|
"runtime/debug"
|
|
|
|
"runtime/pprof"
|
|
|
|
"strconv"
|
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
|
|
|
var startTime = time.Now()
|
|
|
|
var pid int
|
|
|
|
|
|
|
|
func init() {
|
|
|
|
pid = os.Getpid()
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// parse input command string
|
2013-11-15 13:45:51 +00:00
|
|
|
func ProcessInput(input string, w io.Writer) {
|
2013-11-13 13:11:03 +00:00
|
|
|
switch input {
|
|
|
|
case "lookup goroutine":
|
|
|
|
p := pprof.Lookup("goroutine")
|
2013-11-15 13:45:51 +00:00
|
|
|
p.WriteTo(w, 2)
|
2013-11-13 13:11:03 +00:00
|
|
|
case "lookup heap":
|
|
|
|
p := pprof.Lookup("heap")
|
2013-11-15 13:45:51 +00:00
|
|
|
p.WriteTo(w, 2)
|
2013-11-13 13:11:03 +00:00
|
|
|
case "lookup threadcreate":
|
|
|
|
p := pprof.Lookup("threadcreate")
|
2013-11-15 13:45:51 +00:00
|
|
|
p.WriteTo(w, 2)
|
2013-11-13 13:11:03 +00:00
|
|
|
case "lookup block":
|
|
|
|
p := pprof.Lookup("block")
|
2013-11-15 13:45:51 +00:00
|
|
|
p.WriteTo(w, 2)
|
2013-11-13 13:11:03 +00:00
|
|
|
case "start cpuprof":
|
|
|
|
StartCPUProfile()
|
|
|
|
case "stop cpuprof":
|
|
|
|
StopCPUProfile()
|
|
|
|
case "get memprof":
|
|
|
|
MemProf()
|
|
|
|
case "gc summary":
|
2013-11-15 13:45:51 +00:00
|
|
|
PrintGCSummary(w)
|
2013-11-13 13:11:03 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// record memory profile in pprof
|
2013-11-13 13:11:03 +00:00
|
|
|
func MemProf() {
|
|
|
|
if f, err := os.Create("mem-" + strconv.Itoa(pid) + ".memprof"); err != nil {
|
2014-04-11 08:08:43 +00:00
|
|
|
log.Fatal("record memory profile failed: ", err)
|
2013-11-13 13:11:03 +00:00
|
|
|
} else {
|
|
|
|
runtime.GC()
|
|
|
|
pprof.WriteHeapProfile(f)
|
|
|
|
f.Close()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// start cpu profile monitor
|
2013-11-13 13:11:03 +00:00
|
|
|
func StartCPUProfile() {
|
|
|
|
f, err := os.Create("cpu-" + strconv.Itoa(pid) + ".pprof")
|
|
|
|
if err != nil {
|
|
|
|
log.Fatal(err)
|
|
|
|
}
|
|
|
|
pprof.StartCPUProfile(f)
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// stop cpu profile monitor
|
2013-11-13 13:11:03 +00:00
|
|
|
func StopCPUProfile() {
|
|
|
|
pprof.StopCPUProfile()
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// print gc information to io.Writer
|
2013-11-15 13:45:51 +00:00
|
|
|
func PrintGCSummary(w io.Writer) {
|
2013-11-13 13:11:03 +00:00
|
|
|
memStats := &runtime.MemStats{}
|
|
|
|
runtime.ReadMemStats(memStats)
|
|
|
|
gcstats := &debug.GCStats{PauseQuantiles: make([]time.Duration, 100)}
|
|
|
|
debug.ReadGCStats(gcstats)
|
|
|
|
|
2013-11-15 13:45:51 +00:00
|
|
|
printGC(memStats, gcstats, w)
|
2013-11-13 13:11:03 +00:00
|
|
|
}
|
|
|
|
|
2013-11-15 13:45:51 +00:00
|
|
|
func printGC(memStats *runtime.MemStats, gcstats *debug.GCStats, w io.Writer) {
|
2013-11-13 13:11:03 +00:00
|
|
|
|
|
|
|
if gcstats.NumGC > 0 {
|
|
|
|
lastPause := gcstats.Pause[0]
|
|
|
|
elapsed := time.Now().Sub(startTime)
|
|
|
|
overhead := float64(gcstats.PauseTotal) / float64(elapsed) * 100
|
|
|
|
allocatedRate := float64(memStats.TotalAlloc) / elapsed.Seconds()
|
|
|
|
|
2013-11-15 13:45:51 +00:00
|
|
|
fmt.Fprintf(w, "NumGC:%d Pause:%s Pause(Avg):%s Overhead:%3.2f%% Alloc:%s Sys:%s Alloc(Rate):%s/s Histogram:%s %s %s \n",
|
2013-11-13 13:11:03 +00:00
|
|
|
gcstats.NumGC,
|
|
|
|
toS(lastPause),
|
|
|
|
toS(avg(gcstats.Pause)),
|
|
|
|
overhead,
|
|
|
|
toH(memStats.Alloc),
|
|
|
|
toH(memStats.Sys),
|
|
|
|
toH(uint64(allocatedRate)),
|
|
|
|
toS(gcstats.PauseQuantiles[94]),
|
|
|
|
toS(gcstats.PauseQuantiles[98]),
|
|
|
|
toS(gcstats.PauseQuantiles[99]))
|
|
|
|
} else {
|
|
|
|
// while GC has disabled
|
|
|
|
elapsed := time.Now().Sub(startTime)
|
|
|
|
allocatedRate := float64(memStats.TotalAlloc) / elapsed.Seconds()
|
|
|
|
|
2013-11-15 13:45:51 +00:00
|
|
|
fmt.Fprintf(w, "Alloc:%s Sys:%s Alloc(Rate):%s/s\n",
|
2013-11-13 13:11:03 +00:00
|
|
|
toH(memStats.Alloc),
|
|
|
|
toH(memStats.Sys),
|
|
|
|
toH(uint64(allocatedRate)))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func avg(items []time.Duration) time.Duration {
|
|
|
|
var sum time.Duration
|
|
|
|
for _, item := range items {
|
|
|
|
sum += item
|
|
|
|
}
|
|
|
|
return time.Duration(int64(sum) / int64(len(items)))
|
|
|
|
}
|
|
|
|
|
2014-01-29 11:12:00 +00:00
|
|
|
// format bytes number friendly
|
2013-11-13 13:11:03 +00:00
|
|
|
func toH(bytes uint64) string {
|
|
|
|
switch {
|
|
|
|
case bytes < 1024:
|
|
|
|
return fmt.Sprintf("%dB", bytes)
|
|
|
|
case bytes < 1024*1024:
|
|
|
|
return fmt.Sprintf("%.2fK", float64(bytes)/1024)
|
|
|
|
case bytes < 1024*1024*1024:
|
|
|
|
return fmt.Sprintf("%.2fM", float64(bytes)/1024/1024)
|
|
|
|
default:
|
|
|
|
return fmt.Sprintf("%.2fG", float64(bytes)/1024/1024/1024)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// short string format
|
|
|
|
func toS(d time.Duration) string {
|
|
|
|
|
|
|
|
u := uint64(d)
|
|
|
|
if u < uint64(time.Second) {
|
|
|
|
switch {
|
|
|
|
case u == 0:
|
|
|
|
return "0"
|
|
|
|
case u < uint64(time.Microsecond):
|
|
|
|
return fmt.Sprintf("%.2fns", float64(u))
|
|
|
|
case u < uint64(time.Millisecond):
|
|
|
|
return fmt.Sprintf("%.2fus", float64(u)/1000)
|
|
|
|
default:
|
|
|
|
return fmt.Sprintf("%.2fms", float64(u)/1000/1000)
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
switch {
|
|
|
|
case u < uint64(time.Minute):
|
|
|
|
return fmt.Sprintf("%.2fs", float64(u)/1000/1000/1000)
|
|
|
|
case u < uint64(time.Hour):
|
|
|
|
return fmt.Sprintf("%.2fm", float64(u)/1000/1000/1000/60)
|
|
|
|
default:
|
|
|
|
return fmt.Sprintf("%.2fh", float64(u)/1000/1000/1000/60/60)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|