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
|
// Copyright 2013 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 singleflight
import (
"errors"
"fmt"
"sync"
"sync/atomic"
"testing"
"time"
)
func TestDo(t *testing.T) {
var g Group
v, err, _ := g.Do("key", func() (any, error) {
return "bar", nil
})
if got, want := fmt.Sprintf("%v (%T)", v, v), "bar (string)"; got != want {
t.Errorf("Do = %v; want %v", got, want)
}
if err != nil {
t.Errorf("Do error = %v", err)
}
}
func TestDoErr(t *testing.T) {
var g Group
someErr := errors.New("some error")
v, err, _ := g.Do("key", func() (any, error) {
return nil, someErr
})
if err != someErr {
t.Errorf("Do error = %v; want someErr %v", err, someErr)
}
if v != nil {
t.Errorf("unexpected non-nil value %#v", v)
}
}
func TestDoDupSuppress(t *testing.T) {
var g Group
var wg1, wg2 sync.WaitGroup
c := make(chan string, 1)
var calls atomic.Int32
fn := func() (any, error) {
if calls.Add(1) == 1 {
// First invocation.
wg1.Done()
}
v := <-c
c <- v // pump; make available for any future calls
time.Sleep(10 * time.Millisecond) // let more goroutines enter Do
return v, nil
}
const n = 10
wg1.Add(1)
for i := 0; i < n; i++ {
wg1.Add(1)
wg2.Add(1)
go func() {
defer wg2.Done()
wg1.Done()
v, err, _ := g.Do("key", fn)
if err != nil {
t.Errorf("Do error: %v", err)
return
}
if s, _ := v.(string); s != "bar" {
t.Errorf("Do = %T %v; want %q", v, v, "bar")
}
}()
}
wg1.Wait()
// At least one goroutine is in fn now and all of them have at
// least reached the line before the Do.
c <- "bar"
wg2.Wait()
if got := calls.Load(); got <= 0 || got >= n {
t.Errorf("number of calls = %d; want over 0 and less than %d", got, n)
}
}
func TestForgetUnshared(t *testing.T) {
var g Group
var firstStarted, firstFinished sync.WaitGroup
firstStarted.Add(1)
firstFinished.Add(1)
key := "key"
firstCh := make(chan struct{})
go func() {
g.Do(key, func() (i interface{}, e error) {
firstStarted.Done()
<-firstCh
return
})
firstFinished.Done()
}()
firstStarted.Wait()
g.ForgetUnshared(key) // from this point no two function using same key should be executed concurrently
secondCh := make(chan struct{})
go func() {
g.Do(key, func() (i interface{}, e error) {
// Notify that we started
secondCh <- struct{}{}
<-secondCh
return 2, nil
})
}()
<-secondCh
resultCh := g.DoChan(key, func() (i interface{}, e error) {
panic("third must not be started")
})
if g.ForgetUnshared(key) {
t.Errorf("Before first goroutine finished, key %q is shared, should return false", key)
}
close(firstCh)
firstFinished.Wait()
if g.ForgetUnshared(key) {
t.Errorf("After first goroutine finished, key %q is still shared, should return false", key)
}
secondCh <- struct{}{}
if result := <-resultCh; result.Val != 2 {
t.Errorf("We should receive result produced by second call, expected: 2, got %d", result.Val)
}
}
func TestDoAndForgetUnsharedRace(t *testing.T) {
t.Parallel()
var g Group
key := "key"
d := time.Millisecond
for {
var calls, shared atomic.Int64
const n = 1000
var wg sync.WaitGroup
wg.Add(n)
for i := 0; i < n; i++ {
go func() {
g.Do(key, func() (interface{}, error) {
time.Sleep(d)
return calls.Add(1), nil
})
if !g.ForgetUnshared(key) {
shared.Add(1)
}
wg.Done()
}()
}
wg.Wait()
if calls.Load() != 1 {
// The goroutines didn't park in g.Do in time,
// so the key was re-added and may have been shared after the call.
// Try again with more time to park.
d *= 2
continue
}
// All of the Do calls ended up sharing the first
// invocation, so the key should have been unused
// (and therefore unshared) when they returned.
if shared.Load() > 0 {
t.Errorf("after a single shared Do, ForgetUnshared returned false %d times", shared.Load())
}
break
}
}
|
