}
}
-func ExampleB_Loop() {
- simpleFunc := func(i int) int {
- return i + 1
- }
- n := 0
- testing.Benchmark(func(b *testing.B) {
- // Unlike "for i := range b.N {...}" style loops, this
- // setup logic will only be executed once, so simpleFunc
- // will always get argument 1.
- n++
- // It behaves just like "for i := range N {...}", except with keeping
- // function call parameters and results alive.
- for b.Loop() {
- // This function call, if was in a normal loop, will be optimized away
- // completely, first by inlining, then by dead code elimination.
- // In a b.Loop loop, the compiler ensures that this function is not optimized away.
- simpleFunc(n)
- }
- // This clean-up will only be executed once, so after the benchmark, the user
- // will see n == 2.
- n++
- // Use b.ReportMetric as usual just like what a user may do after
- // b.N loop.
- })
- // We can expect n == 2 here.
-
- // The return value of the above Benchmark could be used just like
- // a b.N loop benchmark as well.
-}
-
func ExampleB_RunParallel() {
// Parallel benchmark for text/template.Template.Execute on a single object.
testing.Benchmark(func(b *testing.B) {
--- /dev/null
+// Copyright 2024 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.
+
+package testing_test
+
+import (
+ "math/rand/v2"
+ "testing"
+)
+
+// ExBenchmark shows how to use b.Loop in a benchmark.
+//
+// (If this were a real benchmark, not an example, this would be named
+// BenchmarkSomething.)
+func ExBenchmark(b *testing.B) {
+ // Generate a large random slice to use as an input.
+ // Since this is done before the first call to b.Loop(),
+ // it doesn't count toward the benchmark time.
+ input := make([]int, 128<<10)
+ for i := range input {
+ input[i] = rand.Int()
+ }
+
+ // Perform the benchmark.
+ for b.Loop() {
+ // Normally, the compiler would be allowed to optimize away the call
+ // to sum because it has no side effects and the result isn't used.
+ // However, inside a b.Loop loop, the compiler ensures function calls
+ // aren't optimized away.
+ sum(input)
+ }
+
+ // Outside the loop, the timer is stopped, so we could perform
+ // cleanup if necessary without affecting the result.
+}
+
+func sum(data []int) int {
+ total := 0
+ for _, value := range data {
+ total += value
+ }
+ return total
+}
+
+func ExampleB_Loop() {
+ testing.Benchmark(ExBenchmark)
+}