-
Notifications
You must be signed in to change notification settings - Fork 42
/
generator.go
439 lines (422 loc) · 9.96 KB
/
generator.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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
package parser
import (
"github.com/yaklang/yaklang/common/utils"
"reflect"
"unsafe"
)
type GenerateConfig struct {
AssertError bool
}
type ExecNode interface {
Reset() // 重置生成器
Exec() (bool, error) // 优先读取缓存,读完缓存后调用子生成器
IsRep() bool
}
type MethodContext struct {
methodTable map[string]*TagMethod
labelTable map[string]map[*TagExecNode]struct{}
tagToLabelsMap map[*TagExecNode][]string
dynTag map[*TagExecNode]struct{}
}
// UpdateLabels 更新全局labelTable,先删除当前tag的所有label映射,再增加
func (m *MethodContext) UpdateLabels(tag *TagExecNode) {
for _, label := range m.tagToLabelsMap[tag] {
if set, ok := m.labelTable[label]; ok {
delete(set, tag)
}
}
m.tagToLabelsMap[tag] = tag.data.GetLabels()
for _, label := range tag.data.GetLabels() {
switch label {
case "rep":
tag.isRep = true
case "dyn":
tag.isDyn = true
m.dynTag[tag] = struct{}{}
default:
if _, ok := m.labelTable[label]; !ok {
m.labelTable[label] = map[*TagExecNode]struct{}{}
}
m.labelTable[label][tag] = struct{}{}
}
}
}
// String
type StringExecNode struct {
submitResult func(s *FuzzResult)
data string
index int
}
func (s *StringExecNode) FirstExec() error {
s.index = 1
s.submitResult(NewFuzzResultWithData(s.data))
return nil
}
func (s *StringExecNode) Exec() (bool, error) {
defer func() {
s.index++
}()
if s.index == 0 {
s.submitResult(NewFuzzResultWithData(s.data))
return false, nil
}
return false, nil
}
func (s *StringExecNode) Reset() {
s.index = 0
}
func (s *StringExecNode) IsRep() bool {
return true
}
type TagExecNode struct {
config *GenerateConfig
data TagNode
cache *[]*FuzzResult
isRep bool
isDyn bool
params []ExecNode
methodCtx *MethodContext
childGenerator *Generator //
index int
submitResult func(s *FuzzResult)
backpropagation func() error
ignoreError bool
parentNode ExecNode
}
func NewTagGenerator(tag TagNode, ctx *MethodContext) *TagExecNode {
return &TagExecNode{
data: tag,
methodCtx: ctx,
}
}
func (f *TagExecNode) FirstExecWithBackpropagation(bp, exec, all bool) error {
f.FirstExec(bp, exec, all)
return f.backpropagation()
}
// FirstExec 重置并执行
func (f *TagExecNode) FirstExec(bp, exec, all bool) error {
f.childGenerator.first = exec
_, err := f.childGenerator.generate()
if err != nil {
return err
}
if exec {
err = f.exec(f.childGenerator.Result())
if err != nil {
return err
}
}
f.index = 1
f.submitResult((*f.cache)[0])
if all {
for _, param := range f.params {
if v, ok := param.(*TagExecNode); ok {
v.FirstExec(bp, exec, all)
}
}
}
return err
}
func (f *TagExecNode) exec(s *FuzzResult) error {
res, err := f.data.Exec(s, f.methodCtx.methodTable)
if len(res) == 0 {
res = []*FuzzResult{NewFuzzResultWithData("")}
}
for _, r := range res {
r.Source = append(r.Source, s)
r.ByTag = true
r.Error = err
}
if !f.config.AssertError {
err = nil
}
if err != nil {
return err
}
f.methodCtx.UpdateLabels(f)
f.cache = &res
return nil
}
func (f *TagExecNode) Exec() (bool, error) {
if f.isDyn && f.index >= 1 {
return false, nil
}
defer func() {
f.index++
}()
if f.index >= len(*f.cache) {
if f.isRep { // 当生成失败且存在rep标签时,使用最后一个元素
f.submitResult((*f.cache)[len(*f.cache)-1])
return false, f.backpropagation()
}
ok, err := f.childGenerator.generate()
if err != nil {
return ok, err
}
if !ok {
f.submitResult(NewFuzzResultWithData(""))
return false, nil
} else {
return true, f.backpropagation()
}
}
f.submitResult((*f.cache)[f.index])
return true, f.backpropagation()
}
func (s *TagExecNode) Reset() {
s.index = 0
var bp func() error
for _, param := range s.params {
param.Reset()
v, ok := param.(*TagExecNode)
if ok {
v.submitResult((*v.cache)[v.index])
bp = v.backpropagation
}
}
if bp != nil {
bp()
}
}
func (s *TagExecNode) IsRep() bool {
return s.isRep
}
type Generator struct {
*GenerateConfig
container []*FuzzResult
//index int
data []ExecNode
first bool
methodCtx *MethodContext
backpropagation func() error
AssertError bool
Error error
allowedLabels bool
renderTagWithSyncIndex bool
}
func newBackpropagationGenerator(f func() error, nodes []ExecNode, cfg *GenerateConfig) *Generator {
g := &Generator{data: nodes, container: make([]*FuzzResult, len(nodes)), first: true, backpropagation: f, GenerateConfig: cfg}
for index, d := range g.data {
index := index
switch ret := d.(type) {
case *TagExecNode:
g.methodCtx = ret.methodCtx
ret.config = cfg
ret.submitResult = func(s *FuzzResult) {
g.container[index] = s
}
ret.backpropagation = f
var bp func() error
childGen := newBackpropagationGenerator(func() error {
return bp()
}, ret.params, cfg)
bp = func() error {
err := ret.exec(childGen.Result())
ret.index = 1
ret.submitResult((*ret.cache)[0])
return err
}
ret.childGenerator = childGen
case *StringExecNode:
ret.submitResult = func(s *FuzzResult) {
g.container[index] = s
}
}
}
return g
}
func NewGenerator(nodes []Node, table map[string]*TagMethod) *Generator {
cfg := &GenerateConfig{}
methodCtx := &MethodContext{
dynTag: map[*TagExecNode]struct{}{},
methodTable: table,
labelTable: map[string]map[*TagExecNode]struct{}{},
tagToLabelsMap: map[*TagExecNode][]string{},
}
var node2generator func(nodes []Node, parentNode ExecNode) []ExecNode
node2generator = func(nodes []Node, parentNode ExecNode) []ExecNode {
generatorNodes := []ExecNode{}
for _, node := range nodes {
switch ret := node.(type) {
case TagNode:
gener := NewTagGenerator(ret, methodCtx)
gener.params = node2generator(ret.GetData(), gener)
gener.parentNode = parentNode
methodCtx.tagToLabelsMap[gener] = ret.GetLabels()
generatorNodes = append(generatorNodes, gener)
for _, label := range ret.GetLabels() {
methodCtx.labelTable[label][gener] = struct{}{}
}
case StringNode:
generatorNodes = append(generatorNodes, &StringExecNode{data: string(ret)})
}
}
return generatorNodes
}
g := newBackpropagationGenerator(func() error {
return nil
}, node2generator(nodes, nil), cfg)
g.allowedLabels = true
return g
}
func (g *Generator) Result() *FuzzResult {
res := NewFuzzResult()
data := []byte{}
for _, result := range g.container {
data = append(data, result.GetData()...)
res.Source = append(res.Source, result)
}
res.Data = data
res.Contact = true
return res
}
func (g *Generator) Next() bool {
defer func() {
if e := recover(); e != nil {
if err, ok := e.(error); ok {
g.Error = err
} else {
g.Error = utils.Error(e)
}
}
}()
ok, err := g.generate()
g.Error = err
return ok
}
func (g *Generator) SetTagsSync(b bool) {
g.renderTagWithSyncIndex = b
}
func (g *Generator) generate() (bool, error) {
if g.first {
for _, d := range g.data {
switch ret := d.(type) {
case *TagExecNode:
err := ret.FirstExec(false, true, false)
if err != nil {
return true, err
}
case *StringExecNode:
ret.submitResult(NewFuzzResultWithData(ret.data))
}
}
g.first = false
return true, nil
}
isOk := false
i := 0
renderedNode := map[unsafe.Pointer]struct{}{}
successCallBacks := []func() error{}
failedTag := map[*TagExecNode]struct{}{}
for {
if len(g.data) == i {
break
}
uid := reflect.ValueOf(g.data[i]).UnsafePointer()
if _, ok := renderedNode[uid]; ok {
i++
continue
}
renderedNode[reflect.ValueOf(g.data[i]).UnsafePointer()] = struct{}{}
genOneOk, err := g.data[i].Exec()
if err != nil {
return genOneOk, err
}
if g.renderTagWithSyncIndex {
if _, ok := g.data[i].(*TagExecNode); ok {
for _, m := range g.data {
uid1 := reflect.ValueOf(m).UnsafePointer()
if uid1 == uid {
continue
}
renderedNode[uid1] = struct{}{}
ok1, err := m.Exec()
if err != nil {
return ok1, err
}
genOneOk = genOneOk || ok1
}
}
} else {
if v, ok := g.data[i].(*TagExecNode); ok {
for _, label := range v.data.GetLabels() {
if ms, ok := v.methodCtx.labelTable[label]; ok {
for m := range ms {
uid1 := reflect.ValueOf(m).UnsafePointer()
if uid1 == uid { // not allow sync self
continue
}
if !allowSyncTag(v, m) { // check if allow sync by defined rules
continue
}
renderedNode[uid1] = struct{}{}
ok1, err := m.Exec()
if err != nil {
return ok1, err
}
genOneOk = genOneOk || ok1
}
}
}
}
}
if !genOneOk {
if v, ok := g.data[i].(*TagExecNode); ok {
failedTag[v] = struct{}{}
}
} else {
for _, back := range successCallBacks {
if err := back(); err != nil {
return true, err
}
}
var execAllFirst func(t ExecNode)
execAllFirst = func(t ExecNode) {
if v1, ok := t.(*TagExecNode); ok && v1.index >= len(*v1.cache) {
for _, param := range v1.params {
execAllFirst(param)
}
v1.FirstExec(false, true, true) //在这个节点第一次执行时已经判断了err,这里不用判断了
}
}
for tag, _ := range failedTag {
if _, ok := g.methodCtx.dynTag[tag]; ok {
continue
} else {
tag.FirstExecWithBackpropagation(true, false, true)
}
}
for tag, _ := range g.methodCtx.dynTag {
execAllFirst(tag)
tag.backpropagation()
}
isOk = true
break
}
i++
}
return isOk, nil
}
func allowSyncTag(srcTag, syncTag *TagExecNode) bool {
tag1, tag2 := srcTag, syncTag
for {
if tag1.parentNode == nil {
break
}
tag1 = tag1.parentNode.(*TagExecNode)
if tag1 == tag2 {
return false
}
}
tag1, tag2 = srcTag, syncTag
for {
if tag2.parentNode == nil {
break
}
tag2 = tag2.parentNode.(*TagExecNode)
if tag1 == tag2 {
return false
}
}
return true
}