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
|
//go:build darwin || aix || dragonfly || freebsd || (js && wasm) || linux || netbsd || openbsd || solaris
package fastwalk
import (
"math/rand"
"runtime"
"sync"
"testing"
"time"
)
type devIno struct {
Dev, Ino uint64
}
func generateDevIno(rr *rand.Rand, ndev, size int) []devIno {
devs := make([]uint64, ndev)
for i := range devs {
devs[i] = rr.Uint64()
}
pairs := make([]devIno, size)
seen := make(map[devIno]struct{}, len(pairs))
for i := range pairs {
for {
di := devIno{
Dev: devs[rr.Intn(len(devs))],
Ino: rr.Uint64(),
}
if _, ok := seen[di]; !ok {
pairs[i] = di
seen[di] = struct{}{}
break
}
}
}
rr.Shuffle(len(pairs), func(i, j int) {
pairs[i], pairs[j] = pairs[j], pairs[i]
})
return pairs
}
func TestEntryFilter_Unix(t *testing.T) {
rr := rand.New(rand.NewSource(1))
pairs := generateDevIno(rr, 2, 100)
x := NewEntryFilter()
for _, p := range pairs {
if x.seen(p.Dev, p.Ino) {
t.Errorf("duplicate: Dev: %d Ino: %d", p.Dev, p.Ino)
}
}
for _, p := range pairs {
if !x.seen(p.Dev, p.Ino) {
t.Errorf("wat: Dev: %d Ino: %d", p.Dev, p.Ino)
}
}
}
func TestEntryFilter_Unix_Parallel(t *testing.T) {
if testing.Short() {
t.Skip("Short test")
}
wg := new(sync.WaitGroup)
ready := new(sync.WaitGroup)
start := make(chan struct{})
x := NewEntryFilter()
numWorkers := runtime.NumCPU() * 2
if numWorkers < 2 {
numWorkers = 2
}
if numWorkers > 8 {
numWorkers = 8
}
rr := rand.New(rand.NewSource(time.Now().UnixNano()))
pairs := generateDevIno(rr, 2, numWorkers*8192)
for i := 0; i < numWorkers; i++ {
wg.Add(1)
ready.Add(1)
go func(i int, pairs []devIno) {
defer wg.Done()
ready.Done()
<-start
for _, p := range pairs {
if x.seen(p.Dev, p.Ino) {
t.Errorf("%d: unseen dev/ino: Dev: %d Ino: %d", i, p.Dev, p.Ino)
return
}
}
for _, p := range pairs {
if !x.seen(p.Dev, p.Ino) {
t.Errorf("%d: missed seen dev/ino: Dev: %d Ino: %d", i, p.Dev, p.Ino)
return
}
}
}(i, pairs[i*numWorkers:(i+1)*numWorkers])
}
ready.Wait()
close(start)
wg.Wait()
}
func BenchmarkEntryFilter_Unix(b *testing.B) {
if testing.Short() {
b.Skip("Skipping: short test")
}
rr := rand.New(rand.NewSource(1))
pairs := generateDevIno(rr, 2, 8192)
x := NewEntryFilter()
for _, p := range pairs {
x.seen(p.Dev, p.Ino)
}
if len(pairs) != 8192 {
panic("nope!")
}
b.ResetTimer()
b.Run("Sequential", func(b *testing.B) {
for i := 0; i < b.N; i++ {
p := pairs[i%8192]
x.seen(p.Dev, p.Ino)
}
})
b.Run("Parallel", func(b *testing.B) {
b.RunParallel(func(pb *testing.PB) {
for i := 0; pb.Next(); i++ {
p := pairs[i%8192]
x.seen(p.Dev, p.Ino)
}
})
})
}
|
