forked from google/syzkaller
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreport.go
223 lines (209 loc) · 5.09 KB
/
report.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
// Copyright 2018 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 cover
import (
"fmt"
"sort"
"github.com/google/syzkaller/pkg/cover/backend"
"github.com/google/syzkaller/pkg/host"
"github.com/google/syzkaller/pkg/mgrconfig"
"github.com/google/syzkaller/sys/targets"
)
type ReportGenerator struct {
target *targets.Target
srcDir string
buildDir string
subsystem []mgrconfig.Subsystem
*backend.Impl
}
type Prog struct {
Data string
PCs []uint64
}
var RestorePC = backend.RestorePC
func MakeReportGenerator(target *targets.Target, vm, objDir, srcDir, buildDir string, subsystem []mgrconfig.Subsystem,
moduleObj []string, modules []host.KernelModule) (*ReportGenerator, error) {
impl, err := backend.Make(target, vm, objDir, srcDir, buildDir, moduleObj, modules)
if err != nil {
return nil, err
}
subsystem = append(subsystem, mgrconfig.Subsystem{
Name: "all",
Paths: []string{""},
})
rg := &ReportGenerator{
target: target,
srcDir: srcDir,
buildDir: buildDir,
subsystem: subsystem,
Impl: impl,
}
return rg, nil
}
type file struct {
module string
filename string
lines map[int]line
functions []*function
covered []backend.Range
uncovered []backend.Range
totalPCs int
coveredPCs int
}
type function struct {
name string
pcs int
covered int
}
type line struct {
progCount map[int]bool // program indices that cover this line
progIndex int // example program index that covers this line
}
func (rg *ReportGenerator) prepareFileMap(progs []Prog) (map[string]*file, error) {
if err := rg.lazySymbolize(progs); err != nil {
return nil, err
}
files := make(map[string]*file)
for _, unit := range rg.Units {
files[unit.Name] = &file{
module: unit.Module.Name,
filename: unit.Path,
lines: make(map[int]line),
totalPCs: len(unit.PCs),
}
}
progPCs := make(map[uint64]map[int]bool)
for i, prog := range progs {
for _, pc := range prog.PCs {
if progPCs[pc] == nil {
progPCs[pc] = make(map[int]bool)
}
progPCs[pc][i] = true
}
}
matchedPC := false
for _, frame := range rg.Frames {
f := getFile(files, frame.Name, frame.Path, frame.Module.Name)
ln := f.lines[frame.StartLine]
coveredBy := progPCs[frame.PC]
if len(coveredBy) == 0 {
f.uncovered = append(f.uncovered, frame.Range)
continue
}
// Covered frame.
f.covered = append(f.covered, frame.Range)
matchedPC = true
if ln.progCount == nil {
ln.progCount = make(map[int]bool)
ln.progIndex = -1
}
for progIndex := range coveredBy {
ln.progCount[progIndex] = true
if ln.progIndex == -1 || len(progs[progIndex].Data) < len(progs[ln.progIndex].Data) {
ln.progIndex = progIndex
}
}
f.lines[frame.StartLine] = ln
}
if !matchedPC {
return nil, fmt.Errorf("coverage doesn't match any coverage callbacks")
}
for _, unit := range rg.Units {
f := files[unit.Name]
for _, pc := range unit.PCs {
if progPCs[pc] != nil {
f.coveredPCs++
}
}
}
for _, s := range rg.Symbols {
fun := &function{
name: s.Name,
pcs: len(s.PCs),
}
for _, pc := range s.PCs {
if progPCs[pc] != nil {
fun.covered++
}
}
f := files[s.Unit.Name]
f.functions = append(f.functions, fun)
}
for _, f := range files {
sort.Slice(f.functions, func(i, j int) bool {
return f.functions[i].name < f.functions[j].name
})
}
return files, nil
}
func (rg *ReportGenerator) lazySymbolize(progs []Prog) error {
if len(rg.Symbols) == 0 {
return nil
}
symbolize := make(map[*backend.Symbol]bool)
uniquePCs := make(map[uint64]bool)
pcs := make(map[*backend.Module][]uint64)
for _, prog := range progs {
for _, pc := range prog.PCs {
if uniquePCs[pc] {
continue
}
uniquePCs[pc] = true
sym := rg.findSymbol(pc)
if sym == nil || (sym.Symbolized || symbolize[sym]) {
continue
}
symbolize[sym] = true
pcs[sym.Module] = append(pcs[sym.Module], sym.PCs...)
}
}
if len(uniquePCs) == 0 {
return fmt.Errorf("no coverage collected so far")
}
frames, err := rg.Symbolize(pcs)
if err != nil {
return err
}
rg.Frames = append(rg.Frames, frames...)
uniqueFrames := make(map[uint64]bool)
var finalFrames []backend.Frame
for _, frame := range rg.Frames {
if !uniqueFrames[frame.PC] {
uniqueFrames[frame.PC] = true
finalFrames = append(finalFrames, frame)
}
}
rg.Frames = finalFrames
for sym := range symbolize {
sym.Symbolized = true
}
return nil
}
func getFile(files map[string]*file, name, path, module string) *file {
f := files[name]
if f == nil {
f = &file{
module: module,
filename: path,
lines: make(map[int]line),
// Special mark for header files, if a file does not have coverage at all it is not shown.
totalPCs: 1,
coveredPCs: 1,
}
files[name] = f
}
return f
}
func (rg *ReportGenerator) findSymbol(pc uint64) *backend.Symbol {
idx := sort.Search(len(rg.Symbols), func(i int) bool {
return pc < rg.Symbols[i].End
})
if idx == len(rg.Symbols) {
return nil
}
s := rg.Symbols[idx]
if pc < s.Start || pc > s.End {
return nil
}
return s
}