1
0
mirror of https://github.com/golang/go synced 2024-11-17 10:54:50 -07:00

runtime: add countAlloc benchmark

This change adds a small microbenchmark for (*mspan).countAlloc, which
we're about to replace. Admittedly this isn't a critical piece of code,
but the benchmark was useful in understanding the performance change.

Change-Id: Iea93c00f571ee95534a42f2ef2ab026b382242b3
Reviewed-on: https://go-review.googlesource.com/c/go/+/224438
Run-TryBot: Michael Knyszek <mknyszek@google.com>
Reviewed-by: Emmanuel Odeke <emm.odeke@gmail.com>
Reviewed-by: Austin Clements <austin@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
TryBot-Result: Gobot Gobot <gobot@golang.org>
This commit is contained in:
Michael Anthony Knyszek 2020-03-18 18:46:04 +00:00 committed by Michael Knyszek
parent 8c30971da6
commit 7af6a31b48
2 changed files with 27 additions and 0 deletions

View File

@ -975,3 +975,11 @@ func MapHashCheck(m interface{}, k interface{}) (uintptr, uintptr) {
y := typehash(kt, noescape(p), uintptr(mh.hash0))
return x, y
}
func MSpanCountAlloc(bits []byte) int {
s := mspan{
nelems: uintptr(len(bits) * 8),
gcmarkBits: (*gcBits)(unsafe.Pointer(&bits[0])),
}
return s.countAlloc()
}

View File

@ -6,6 +6,7 @@ package runtime_test
import (
"fmt"
"math/rand"
"os"
"reflect"
"runtime"
@ -751,6 +752,24 @@ func BenchmarkScanStackNoLocals(b *testing.B) {
close(teardown)
}
func BenchmarkMSpanCountAlloc(b *testing.B) {
// n is the number of bytes to benchmark against.
// n must always be a multiple of 8, since gcBits is
// always rounded up 8 bytes.
for _, n := range []int{8, 16, 32, 64, 128} {
b.Run(fmt.Sprintf("bits=%d", n*8), func(b *testing.B) {
// Initialize a new byte slice with pseduo-random data.
bits := make([]byte, n)
rand.Read(bits)
b.ResetTimer()
for i := 0; i < b.N; i++ {
runtime.MSpanCountAlloc(bits)
}
})
}
}
func countpwg(n *int, ready *sync.WaitGroup, teardown chan bool) {
if *n == 0 {
ready.Done()