1 // Copyright 2017 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
9 "internal/goexperiment"
19 // TestIntendedInlining tests that specific functions are inlined.
20 // This allows refactoring for code clarity and re-use without fear that
21 // changes to the compiler will cause silent performance regressions.
22 func TestIntendedInlining(t *testing.T) {
23 if testing.Short() && testenv.Builder() == "" {
24 t.Skip("skipping in short mode")
26 testenv.MustHaveGoRun(t)
29 // want is the list of function names (by package) that should
30 // be inlinable. If they have no callers in their packages, they
31 // might not actually be inlined anywhere.
32 want := map[string][]string{
74 "writeHeapBitsForAddr",
81 "(*gcWork).tryGetFast",
83 "(*markBits).advance",
84 "(*mspan).allocBitsForIndex",
86 "(*mspan).markBitsForBase",
87 "(*mspan).markBitsForIndex",
91 "runtime/internal/sys": {},
92 "runtime/internal/math": {
102 "(*Buffer).ReadByte",
105 "(*Buffer).UnreadByte",
106 "(*Buffer).tryGrowByReslice",
112 "(*dictDecoder).tryWriteCopy",
135 "Value.CanInterface",
148 "Value.OverflowComplex",
149 "Value.OverflowFloat",
151 "Value.OverflowUint",
160 "flag.mustBeAssignable",
161 "flag.mustBeExported",
170 // The following functions require the math_big_pure_go build tag.
175 "(*rngSource).Int63",
176 "(*rngSource).Uint64",
179 "(*UDPConn).ReadFromUDP",
182 // (*Bool).CompareAndSwap handled below.
187 "(*Int32).CompareAndSwap",
192 "(*Int64).CompareAndSwap",
197 "(*Uint32).CompareAndSwap",
202 "(*Uint64).CompareAndSwap",
207 "(*Uintptr).CompareAndSwap",
211 // (*Pointer[T])'s methods' handled below.
215 if runtime.GOARCH != "386" && runtime.GOARCH != "loong64" && runtime.GOARCH != "mips64" && runtime.GOARCH != "mips64le" && runtime.GOARCH != "riscv64" {
216 // nextFreeFast calls sys.TrailingZeros64, which on 386 is implemented in asm and is not inlinable.
217 // We currently don't have midstack inlining so nextFreeFast is also not inlinable on 386.
218 // On loong64, mips64x and riscv64, TrailingZeros64 is not intrinsified and causes nextFreeFast
219 // too expensive to inline (Issue 22239).
220 want["runtime"] = append(want["runtime"], "nextFreeFast")
221 // Same behavior for heapBits.nextFast.
222 want["runtime"] = append(want["runtime"], "heapBits.nextFast")
224 if runtime.GOARCH != "386" {
225 // As explained above, TrailingZeros64 and TrailingZeros32 are not Go code on 386.
226 // The same applies to Bswap32.
227 want["runtime/internal/sys"] = append(want["runtime/internal/sys"], "TrailingZeros64")
228 want["runtime/internal/sys"] = append(want["runtime/internal/sys"], "TrailingZeros32")
229 want["runtime/internal/sys"] = append(want["runtime/internal/sys"], "Bswap32")
231 if bits.UintSize == 64 {
232 // mix is only defined on 64-bit architectures
233 want["runtime"] = append(want["runtime"], "mix")
234 // (*Bool).CompareAndSwap is just over budget on 32-bit systems (386, arm).
235 want["sync/atomic"] = append(want["sync/atomic"], "(*Bool).CompareAndSwap")
237 if true /* was buildcfg.Experiment.Unified */ {
238 // Non-unified IR does not report "inlining call ..." for atomic.Pointer[T]'s methods.
239 // TODO(cuonglm): remove once non-unified IR frontend gone.
240 want["sync/atomic"] = append(want["sync/atomic"], "(*Pointer[go.shape.int]).CompareAndSwap")
241 want["sync/atomic"] = append(want["sync/atomic"], "(*Pointer[go.shape.int]).Load")
242 want["sync/atomic"] = append(want["sync/atomic"], "(*Pointer[go.shape.int]).Store")
243 want["sync/atomic"] = append(want["sync/atomic"], "(*Pointer[go.shape.int]).Swap")
246 switch runtime.GOARCH {
247 case "386", "wasm", "arm":
249 // TODO(mvdan): As explained in /test/inline_sync.go, some
250 // architectures don't have atomic intrinsics, so these go over
251 // the inlining budget. Move back to the main table once that
252 // problem is solved.
253 want["sync"] = []string{
257 "(*RWMutex).RUnlock",
262 // Functions that must actually be inlined; they must have actual callers.
263 must := map[string]bool{
264 "compress/flate.byLiteral.Len": true,
265 "compress/flate.byLiteral.Less": true,
266 "compress/flate.byLiteral.Swap": true,
269 notInlinedReason := make(map[string]string)
270 pkgs := make([]string, 0, len(want))
271 for pname, fnames := range want {
272 pkgs = append(pkgs, pname)
273 for _, fname := range fnames {
274 fullName := pname + "." + fname
275 if _, ok := notInlinedReason[fullName]; ok {
276 t.Errorf("duplicate func: %s", fullName)
278 notInlinedReason[fullName] = "unknown reason"
282 args := append([]string{"build", "-gcflags=-m -m", "-tags=math_big_pure_go"}, pkgs...)
283 cmd := testenv.CleanCmdEnv(testenv.Command(t, testenv.GoToolPath(t), args...))
287 cmdErr := make(chan error, 1)
292 scanner := bufio.NewScanner(pr)
294 canInline := regexp.MustCompile(`: can inline ([^ ]*)`)
295 haveInlined := regexp.MustCompile(`: inlining call to ([^ ]*)`)
296 cannotInline := regexp.MustCompile(`: cannot inline ([^ ]*): (.*)`)
298 line := scanner.Text()
299 if strings.HasPrefix(line, "# ") {
303 if m := haveInlined.FindStringSubmatch(line); m != nil {
305 delete(notInlinedReason, curPkg+"."+fname)
308 if m := canInline.FindStringSubmatch(line); m != nil {
310 fullname := curPkg + "." + fname
311 // If function must be inlined somewhere, being inlinable is not enough
312 if _, ok := must[fullname]; !ok {
313 delete(notInlinedReason, fullname)
317 if m := cannotInline.FindStringSubmatch(line); m != nil {
318 fname, reason := m[1], m[2]
319 fullName := curPkg + "." + fname
320 if _, ok := notInlinedReason[fullName]; ok {
321 // cmd/compile gave us a reason why
322 notInlinedReason[fullName] = reason
327 if err := <-cmdErr; err != nil {
330 if err := scanner.Err(); err != nil {
333 for fullName, reason := range notInlinedReason {
334 t.Errorf("%s was not inlined: %s", fullName, reason)
338 func collectInlCands(msgs string) map[string]struct{} {
339 rv := make(map[string]struct{})
340 lines := strings.Split(msgs, "\n")
341 re := regexp.MustCompile(`^\S+\s+can\s+inline\s+(\S+)`)
342 for _, line := range lines {
343 m := re.FindStringSubmatch(line)
345 rv[m[1]] = struct{}{}
351 func TestIssue56044(t *testing.T) {
353 t.Skipf("skipping test: too long for short mode")
355 if !goexperiment.CoverageRedesign {
356 t.Skipf("skipping new coverage tests (experiment not enabled)")
359 testenv.MustHaveGoBuild(t)
361 modes := []string{"-covermode=set", "-covermode=atomic"}
363 for _, mode := range modes {
364 // Build the Go runtime with "-m", capturing output.
365 args := []string{"build", "-gcflags=runtime=-m", "runtime"}
366 cmd := testenv.Command(t, testenv.GoToolPath(t), args...)
367 b, err := cmd.CombinedOutput()
369 t.Fatalf("build failed (%v): %s", err, b)
371 mbase := collectInlCands(string(b))
373 // Redo the build with -cover, also with "-m".
374 args = []string{"build", "-gcflags=runtime=-m", mode, "runtime"}
375 cmd = testenv.Command(t, testenv.GoToolPath(t), args...)
376 b, err = cmd.CombinedOutput()
378 t.Fatalf("build failed (%v): %s", err, b)
380 mcov := collectInlCands(string(b))
382 // Make sure that there aren't any functions that are marked
383 // as inline candidates at base but not with coverage.
384 for k := range mbase {
385 if _, ok := mcov[k]; !ok {
386 t.Errorf("error: did not find %s in coverage -m output", k)