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
|
// Copyright 2024 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 corpus
import (
"context"
"sync"
"github.com/google/syzkaller/pkg/cover"
"github.com/google/syzkaller/pkg/hash"
"github.com/google/syzkaller/pkg/signal"
"github.com/google/syzkaller/pkg/stats"
"github.com/google/syzkaller/prog"
)
// Corpus object represents a set of syzkaller-found programs that
// cover the kernel up to the currently reached frontiers.
type Corpus struct {
ctx context.Context
mu sync.RWMutex
progs map[string]*Item
signal signal.Signal // total signal of all items
cover cover.Cover // total coverage of all items
updates chan<- NewItemEvent
*ProgramsList
StatProgs *stats.Val
StatSignal *stats.Val
StatCover *stats.Val
}
func NewCorpus(ctx context.Context) *Corpus {
return NewMonitoredCorpus(ctx, nil)
}
func NewMonitoredCorpus(ctx context.Context, updates chan<- NewItemEvent) *Corpus {
corpus := &Corpus{
ctx: ctx,
progs: make(map[string]*Item),
updates: updates,
ProgramsList: &ProgramsList{},
}
corpus.StatProgs = stats.Create("corpus", "Number of test programs in the corpus", stats.Console,
stats.Link("/corpus"), stats.Graph("corpus"), stats.LenOf(&corpus.progs, &corpus.mu))
corpus.StatSignal = stats.Create("signal", "Fuzzing signal in the corpus",
stats.LenOf(&corpus.signal, &corpus.mu))
corpus.StatCover = stats.Create("coverage", "Source coverage in the corpus", stats.Console,
stats.Link("/cover"), stats.Prometheus("syz_corpus_cover"), stats.LenOf(&corpus.cover, &corpus.mu))
return corpus
}
// It may happen that a single program is relevant because of several
// sysalls. In that case, there will be several ItemUpdate entities.
type ItemUpdate struct {
Call int
RawCover []uint64
}
// Item objects are to be treated as immutable, otherwise it's just
// too hard to synchonize accesses to them across the whole project.
// When Corpus updates one of its items, it saves a copy of it.
type Item struct {
Sig string
Call int
Prog *prog.Prog
ProgData []byte // to save some Serialize() calls
HasAny bool // whether the prog contains squashed arguments
Signal signal.Signal
Cover []uint64
Updates []ItemUpdate
}
func (item Item) StringCall() string {
return item.Prog.CallName(item.Call)
}
type NewInput struct {
Prog *prog.Prog
Call int
Signal signal.Signal
Cover []uint64
RawCover []uint64
}
type NewItemEvent struct {
Sig string
Exists bool
ProgData []byte
NewCover []uint64
}
func (corpus *Corpus) Save(inp NewInput) {
progData := inp.Prog.Serialize()
sig := hash.String(progData)
corpus.mu.Lock()
defer corpus.mu.Unlock()
update := ItemUpdate{
Call: inp.Call,
RawCover: inp.RawCover,
}
exists := false
if old, ok := corpus.progs[sig]; ok {
exists = true
newSignal := old.Signal.Copy()
newSignal.Merge(inp.Signal)
var newCover cover.Cover
newCover.Merge(old.Cover)
newCover.Merge(inp.Cover)
newItem := &Item{
Sig: sig,
Prog: old.Prog,
ProgData: progData,
Call: old.Call,
HasAny: old.HasAny,
Signal: newSignal,
Cover: newCover.Serialize(),
Updates: append([]ItemUpdate{}, old.Updates...),
}
const maxUpdates = 32
if len(newItem.Updates) < maxUpdates {
newItem.Updates = append(newItem.Updates, update)
}
corpus.progs[sig] = newItem
} else {
corpus.progs[sig] = &Item{
Sig: sig,
Call: inp.Call,
Prog: inp.Prog,
ProgData: progData,
HasAny: inp.Prog.ContainsAny(),
Signal: inp.Signal,
Cover: inp.Cover,
Updates: []ItemUpdate{update},
}
corpus.saveProgram(inp.Prog, inp.Signal)
}
corpus.signal.Merge(inp.Signal)
newCover := corpus.cover.MergeDiff(inp.Cover)
if corpus.updates != nil {
select {
case <-corpus.ctx.Done():
case corpus.updates <- NewItemEvent{
Sig: sig,
Exists: exists,
ProgData: progData,
NewCover: newCover,
}:
}
}
}
func (corpus *Corpus) Signal() signal.Signal {
corpus.mu.RLock()
defer corpus.mu.RUnlock()
return corpus.signal.Copy()
}
func (corpus *Corpus) Items() []*Item {
corpus.mu.RLock()
defer corpus.mu.RUnlock()
ret := make([]*Item, 0, len(corpus.progs))
for _, item := range corpus.progs {
ret = append(ret, item)
}
return ret
}
func (corpus *Corpus) Item(sig string) *Item {
corpus.mu.RLock()
defer corpus.mu.RUnlock()
return corpus.progs[sig]
}
type CallCov struct {
Count int
Cover cover.Cover
}
func (corpus *Corpus) CallCover() map[string]*CallCov {
corpus.mu.RLock()
defer corpus.mu.RUnlock()
calls := make(map[string]*CallCov)
for _, inp := range corpus.progs {
call := inp.StringCall()
if calls[call] == nil {
calls[call] = new(CallCov)
}
cc := calls[call]
cc.Count++
cc.Cover.Merge(inp.Cover)
}
return calls
}
|
