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
|
// Copyright 2023 syzkaller project authors. All rights reserved.
// Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
package linux
import (
"io/fs"
"regexp"
"runtime"
"sync"
"github.com/google/syzkaller/pkg/subsystem"
)
func BuildCoincidenceMatrix(root fs.FS, list []*subsystem.Subsystem,
excludeRe *regexp.Regexp) (*CoincidenceMatrix, error) {
// Create a matcher.
matcher := subsystem.MakePathMatcher(list)
chPaths, chResult := extractSubsystems(matcher)
// The final consumer goroutine.
cm := MakeCoincidenceMatrix()
ready := make(chan struct{})
go func() {
for items := range chResult {
cm.Record(items...)
}
ready <- struct{}{}
}()
// Source of data.
err := fs.WalkDir(root, ".", func(path string, info fs.DirEntry, err error) error {
if err != nil || info.IsDir() {
return err
}
if !includePathRe.MatchString(path) ||
(excludeRe != nil && excludeRe.MatchString(path)) {
return nil
}
chPaths <- path
return nil
})
close(chPaths)
<-ready
return cm, err
}
var (
includePathRe = regexp.MustCompile(`(?:/|\.(?:c|h|S))$`)
)
func extractSubsystems(matcher *subsystem.PathMatcher) (chan<- string, <-chan []*subsystem.Subsystem) {
procs := runtime.NumCPU()
paths, output := make(chan string, procs), make(chan []*subsystem.Subsystem, procs)
var wg sync.WaitGroup
for i := 0; i < procs; i++ {
wg.Add(1)
go func() {
defer wg.Done()
for path := range paths {
output <- matcher.Match(path)
}
}()
}
go func() {
wg.Wait()
close(output)
}()
return paths, output
}
|
