-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoncefunc_test.go
437 lines (402 loc) · 10.1 KB
/
oncefunc_test.go
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
// Copyright 2022 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 sync_test
import (
"bytes"
"math"
"runtime"
"runtime/debug"
"sync"
"sync/atomic"
"testing"
_ "unsafe"
)
// We assume that the Once.Do tests have already covered parallelism.
func TestOnceFunc(t *testing.T) {
calls := 0
of := func() { calls++ }
f := sync.OnceFunc(of)
allocs := testing.AllocsPerRun(10, f)
if calls != 1 {
t.Errorf("want calls==1, got %d", calls)
}
if allocs != 0 {
t.Errorf("want 0 allocations per call to f, got %v", allocs)
}
allocs = testing.AllocsPerRun(10, func() {
f = sync.OnceFunc(of)
})
if allocs > 2 {
t.Errorf("want at most 2 allocations per call to OnceFunc, got %v", allocs)
}
}
func TestOnceValue(t *testing.T) {
calls := 0
of := func() int {
calls++
return calls
}
f := sync.OnceValue(of)
allocs := testing.AllocsPerRun(10, func() { f() })
value := f()
if calls != 1 {
t.Errorf("want calls==1, got %d", calls)
}
if value != 1 {
t.Errorf("want value==1, got %d", value)
}
if allocs != 0 {
t.Errorf("want 0 allocations per call to f, got %v", allocs)
}
allocs = testing.AllocsPerRun(10, func() {
f = sync.OnceValue(of)
})
if allocs > 2 {
t.Errorf("want at most 2 allocations per call to OnceValue, got %v", allocs)
}
}
func TestOnceValues(t *testing.T) {
calls := 0
of := func() (int, int) {
calls++
return calls, calls + 1
}
f := sync.OnceValues(of)
allocs := testing.AllocsPerRun(10, func() { f() })
v1, v2 := f()
if calls != 1 {
t.Errorf("want calls==1, got %d", calls)
}
if v1 != 1 || v2 != 2 {
t.Errorf("want v1==1 and v2==2, got %d and %d", v1, v2)
}
if allocs != 0 {
t.Errorf("want 0 allocations per call to f, got %v", allocs)
}
allocs = testing.AllocsPerRun(10, func() {
f = sync.OnceValues(of)
})
if allocs > 2 {
t.Errorf("want at most 2 allocations per call to OnceValues, got %v", allocs)
}
}
func testOncePanicX(t *testing.T, calls *int, f func()) {
testOncePanicWith(t, calls, f, func(label string, p any) {
if p != "x" {
t.Fatalf("%s: want panic %v, got %v", label, "x", p)
}
})
}
func testOncePanicWith(t *testing.T, calls *int, f func(), check func(label string, p any)) {
// Check that the each call to f panics with the same value, but the
// underlying function is only called once.
for _, label := range []string{"first time", "second time"} {
var p any
panicked := true
func() {
defer func() {
p = recover()
}()
f()
panicked = false
}()
if !panicked {
t.Fatalf("%s: f did not panic", label)
}
check(label, p)
}
if *calls != 1 {
t.Errorf("want calls==1, got %d", *calls)
}
}
func TestOnceFuncPanic(t *testing.T) {
calls := 0
f := sync.OnceFunc(func() {
calls++
panic("x")
})
testOncePanicX(t, &calls, f)
}
func TestOnceValuePanic(t *testing.T) {
calls := 0
f := sync.OnceValue(func() int {
calls++
panic("x")
})
testOncePanicX(t, &calls, func() { f() })
}
func TestOnceValuesPanic(t *testing.T) {
calls := 0
f := sync.OnceValues(func() (int, int) {
calls++
panic("x")
})
testOncePanicX(t, &calls, func() { f() })
}
func TestOnceFuncPanicNil(t *testing.T) {
calls := 0
f := sync.OnceFunc(func() {
calls++
panic(nil)
})
testOncePanicWith(t, &calls, f, func(label string, p any) {
switch p.(type) {
case nil, *runtime.PanicNilError:
return
}
t.Fatalf("%s: want nil panic, got %v", label, p)
})
}
func TestOnceFuncGoexit(t *testing.T) {
// If f calls Goexit, the results are unspecified. But check that f doesn't
// get called twice.
calls := 0
f := sync.OnceFunc(func() {
calls++
runtime.Goexit()
})
var wg sync.WaitGroup
for i := 0; i < 2; i++ {
wg.Add(1)
go func() {
defer wg.Done()
defer func() { recover() }()
f()
}()
wg.Wait()
}
if calls != 1 {
t.Errorf("want calls==1, got %d", calls)
}
}
func TestOnceFuncPanicTraceback(t *testing.T) {
// Test that on the first invocation of a OnceFunc, the stack trace goes all
// the way to the origin of the panic.
f := sync.OnceFunc(onceFuncPanic)
defer func() {
if p := recover(); p != "x" {
t.Fatalf("want panic %v, got %v", "x", p)
}
stack := debug.Stack()
want := "sync_test.onceFuncPanic"
if !bytes.Contains(stack, []byte(want)) {
t.Fatalf("want stack containing %v, got:\n%s", want, string(stack))
}
}()
f()
}
func onceFuncPanic() {
panic("x")
}
func TestOnceXGC(t *testing.T) {
fns := map[string]func([]byte) func(){
"OnceFunc": func(buf []byte) func() {
return sync.OnceFunc(func() { buf[0] = 1 })
},
"OnceValue": func(buf []byte) func() {
f := sync.OnceValue(func() any { buf[0] = 1; return nil })
return func() { f() }
},
"OnceValues": func(buf []byte) func() {
f := sync.OnceValues(func() (any, any) { buf[0] = 1; return nil, nil })
return func() { f() }
},
"OnceFunc panic": func(buf []byte) func() {
return sync.OnceFunc(func() { buf[0] = 1; panic("test panic") })
},
"OnceValue panic": func(buf []byte) func() {
f := sync.OnceValue(func() any { buf[0] = 1; panic("test panic") })
return func() { f() }
},
"OnceValues panic": func(buf []byte) func() {
f := sync.OnceValues(func() (any, any) { buf[0] = 1; panic("test panic") })
return func() { f() }
},
}
for n, fn := range fns {
t.Run(n, func(t *testing.T) {
buf := make([]byte, 1024)
var gc atomic.Bool
runtime.AddCleanup(&buf[0], func(g *atomic.Bool) { g.Store(true) }, &gc)
f := fn(buf)
gcwaitfin()
if gc.Load() != false {
t.Fatal("wrapped function garbage collected too early")
}
func() {
defer func() { recover() }()
f()
}()
gcwaitfin()
if gc.Load() != true {
// Even if f is still alive, the function passed to Once(Func|Value|Values)
// is not kept alive after the first call to f.
t.Fatal("wrapped function should be garbage collected, but still live")
}
func() {
defer func() { recover() }()
f()
}()
})
}
}
// gcwaitfin performs garbage collection and waits for all finalizers to run.
func gcwaitfin() {
runtime.GC()
runtime_blockUntilEmptyFinalizerQueue(math.MaxInt64)
}
//go:linkname runtime_blockUntilEmptyFinalizerQueue runtime.blockUntilEmptyFinalizerQueue
func runtime_blockUntilEmptyFinalizerQueue(int64) bool
var (
onceFunc = sync.OnceFunc(func() {})
onceFuncOnce sync.Once
onceFuncFunc func()
)
func doOnceFunc() {
onceFuncOnce.Do(func() {})
}
func BenchmarkOnceFunc(b *testing.B) {
b.Run("v=Once", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
// The baseline is direct use of sync.Once.
doOnceFunc()
}
})
b.Run("v=Global", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
// As of 3/2023, the compiler doesn't recognize that onceFunc is
// never mutated and is a closure that could be inlined.
// Too bad, because this is how OnceFunc will usually be used.
onceFunc()
}
})
b.Run("v=Local", func(b *testing.B) {
b.ReportAllocs()
// As of 3/2023, the compiler *does* recognize this local binding as an
// inlinable closure. This is the best case for OnceFunc, but probably
// not typical usage.
f := sync.OnceFunc(func() {})
for i := 0; i < b.N; i++ {
f()
}
})
b.Run("v=Make", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
onceFuncFunc = sync.OnceFunc(func() {})
}
})
}
var (
onceValue = sync.OnceValue(func() int { return 42 })
onceValueOnce sync.Once
onceValueValue int
onceValueFunc func() int
)
func doOnceValue() int {
onceValueOnce.Do(func() {
onceValueValue = 42
})
return onceValueValue
}
func BenchmarkOnceValue(b *testing.B) {
// See BenchmarkOnceFunc
b.Run("v=Once", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if want, got := 42, doOnceValue(); want != got {
b.Fatalf("want %d, got %d", want, got)
}
}
})
b.Run("v=Global", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if want, got := 42, onceValue(); want != got {
b.Fatalf("want %d, got %d", want, got)
}
}
})
b.Run("v=Local", func(b *testing.B) {
b.ReportAllocs()
onceValue := sync.OnceValue(func() int { return 42 })
for i := 0; i < b.N; i++ {
if want, got := 42, onceValue(); want != got {
b.Fatalf("want %d, got %d", want, got)
}
}
})
b.Run("v=Make", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
onceValueFunc = sync.OnceValue(func() int { return 42 })
}
})
}
const (
onceValuesWant1 = 42
onceValuesWant2 = true
)
var (
onceValues = sync.OnceValues(func() (int, bool) {
return onceValuesWant1, onceValuesWant2
})
onceValuesOnce sync.Once
onceValuesValue1 int
onceValuesValue2 bool
onceValuesFunc func() (int, bool)
)
func doOnceValues() (int, bool) {
onceValuesOnce.Do(func() {
onceValuesValue1 = onceValuesWant1
onceValuesValue2 = onceValuesWant2
})
return onceValuesValue1, onceValuesValue2
}
func BenchmarkOnceValues(b *testing.B) {
// See BenchmarkOnceFunc
b.Run("v=Once", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if got1, got2 := doOnceValues(); got1 != onceValuesWant1 {
b.Fatalf("value 1: got %d, want %d", got1, onceValuesWant1)
} else if got2 != onceValuesWant2 {
b.Fatalf("value 2: got %v, want %v", got2, onceValuesWant2)
}
}
})
b.Run("v=Global", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if got1, got2 := onceValues(); got1 != onceValuesWant1 {
b.Fatalf("value 1: got %d, want %d", got1, onceValuesWant1)
} else if got2 != onceValuesWant2 {
b.Fatalf("value 2: got %v, want %v", got2, onceValuesWant2)
}
}
})
b.Run("v=Local", func(b *testing.B) {
b.ReportAllocs()
onceValues := sync.OnceValues(func() (int, bool) {
return onceValuesWant1, onceValuesWant2
})
for i := 0; i < b.N; i++ {
if got1, got2 := onceValues(); got1 != onceValuesWant1 {
b.Fatalf("value 1: got %d, want %d", got1, onceValuesWant1)
} else if got2 != onceValuesWant2 {
b.Fatalf("value 2: got %v, want %v", got2, onceValuesWant2)
}
}
})
b.Run("v=Make", func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
onceValuesFunc = sync.OnceValues(func() (int, bool) {
return onceValuesWant1, onceValuesWant2
})
}
})
}