mirror of
https://github.com/golang/go
synced 2024-10-02 20:31:21 -06:00
27ee719fb3
The current heap sampling introduces some bias that interferes with unsampling, producing unexpected heap profiles. The solution is to use a Poisson process to generate the sampling points, using the formulas described at https://en.wikipedia.org/wiki/Poisson_process This fixes #12620 Change-Id: If2400809ed3c41de504dd6cff06be14e476ff96c Reviewed-on: https://go-review.googlesource.com/14590 Reviewed-by: Keith Randall <khr@golang.org> Reviewed-by: Minux Ma <minux@golang.org> Run-TryBot: Minux Ma <minux@golang.org> TryBot-Result: Gobot Gobot <gobot@golang.org>
53 lines
1.3 KiB
Go
53 lines
1.3 KiB
Go
// Copyright 2015 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// +build ignore
|
|
|
|
// fastlog2Table contains log2 approximations for 5 binary digits.
|
|
// This is used to implement fastlog2, which is used for heap sampling.
|
|
|
|
package main
|
|
|
|
import (
|
|
"bytes"
|
|
"fmt"
|
|
"io/ioutil"
|
|
"log"
|
|
"math"
|
|
)
|
|
|
|
func main() {
|
|
var buf bytes.Buffer
|
|
|
|
fmt.Fprintln(&buf, "// AUTO-GENERATED by mkfastlog2table.go")
|
|
fmt.Fprintln(&buf, "// Run go generate from src/runtime to update.")
|
|
fmt.Fprintln(&buf, "// See mkfastlog2table.go for comments.")
|
|
fmt.Fprintln(&buf)
|
|
fmt.Fprintln(&buf, "package runtime")
|
|
fmt.Fprintln(&buf)
|
|
fmt.Fprintln(&buf, "const fastlogNumBits =", fastlogNumBits)
|
|
fmt.Fprintln(&buf)
|
|
|
|
fmt.Fprintln(&buf, "var fastlog2Table = [1<<fastlogNumBits + 1]float64{")
|
|
table := computeTable()
|
|
for _, t := range table {
|
|
fmt.Fprintf(&buf, "\t%v,\n", t)
|
|
}
|
|
fmt.Fprintln(&buf, "}")
|
|
|
|
if err := ioutil.WriteFile("fastlog2table.go", buf.Bytes(), 0644); err != nil {
|
|
log.Fatalln(err)
|
|
}
|
|
}
|
|
|
|
const fastlogNumBits = 5
|
|
|
|
func computeTable() []float64 {
|
|
fastlog2Table := make([]float64, 1<<fastlogNumBits+1)
|
|
for i := 0; i <= (1 << fastlogNumBits); i++ {
|
|
fastlog2Table[i] = math.Log2(1.0 + float64(i)/(1<<fastlogNumBits))
|
|
}
|
|
return fastlog2Table
|
|
}
|