blob: d21f61fa32a52e429c263d6842a922ef0fb90be4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// run
// Copyright 2023 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 main
import (
"sync"
"time"
)
type B struct {
pid int
f func() (uint64, error)
wg sync.WaitGroup
v uint64
}
func newB(pid int) *B {
return &B{
pid: pid,
}
}
//go:noinline
func Sq(i int) uint64 {
S++
return uint64(i * i)
}
type RO func(*B)
var ROSL = []RO{
Bad(),
}
func Bad() RO {
return func(b *B) {
b.f = func() (uint64, error) {
return Sq(b.pid), nil
}
}
}
func (b *B) startit() chan<- struct{} {
stop := make(chan struct{})
b.wg.Add(1)
go func() {
defer b.wg.Done()
var v uint64
for {
select {
case <-stop:
b.v = v
return
case <-time.After(1 * time.Millisecond):
r, err := b.f()
if err != nil {
panic("bad")
}
v = r
}
}
}()
return stop
}
var S, G int
//go:noinline
func rec(x int) int {
if x == 0 {
return 9
}
return rec(x-1) + 1
}
//go:noinline
func recur(x int) {
for i := 0; i < x; i++ {
G = rec(i)
}
}
func main() {
b := newB(17)
for _, opt := range ROSL {
opt(b)
}
stop := b.startit()
// see if we can get some stack growth/moving
recur(10101)
if stop != nil {
stop <- struct{}{}
}
}
|
