forked from googleprojectzero/fuzzilli
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Minimizer.swift
118 lines (98 loc) · 5.09 KB
/
Minimizer.swift
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
// Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
import Foundation
/// Minimizes programs.
///
/// Executes various program reducers to shrink a program in size while retaining its special aspects. All of this
/// happens on a separate dispatch queue so the main queue stays responsive.
public class Minimizer: ComponentBase {
/// DispatchQueue on which program minimization happens.
private let minimizationQueue = DispatchQueue(label: "Minimizer")
public init() {
super.init(name: "Minimizer")
}
enum MinimizationMode {
// Normal minimization will honor the minimization limit, not perform
// some of the expensive and especially "destructive" reductions (e.g.
// of call arguments and literals) and not perform fixpoint minimization.
case normal
// Aggressive minimization will minimize the program as much as possible,
// ignoring the minimization limit.
case aggressive
}
/// Minimizes the given program while preserving its special aspects.
///
/// Minimization will not modify the given program. Instead, it produce a new Program instance.
/// Once minimization is finished, the passed block will be invoked on the fuzzer's queue with the minimized program.
func withMinimizedCopy(_ program: Program, withAspects aspects: ProgramAspects, usingMode mode: MinimizationMode, block: @escaping (Program) -> ()) {
minimizationQueue.async {
let minimizedCode = self.internalMinimize(program, withAspects: aspects, usingMode: mode, limit: self.fuzzer.config.minimizationLimit)
self.fuzzer.async {
let minimizedProgram: Program
if self.fuzzer.config.inspection.contains(.history) {
minimizedProgram = Program(code: minimizedCode, parent: program)
minimizedProgram.comments.add("Minimizing \(program.id)", at: .header)
} else {
minimizedProgram = Program(code: minimizedCode)
}
block(minimizedProgram)
}
}
}
private func internalMinimize(_ program: Program, withAspects aspects: ProgramAspects, usingMode mode: MinimizationMode, limit minimizationLimit: UInt) -> Code {
dispatchPrecondition(condition: .onQueue(minimizationQueue))
if mode == .normal && program.size <= fuzzer.config.minimizationLimit {
return program.code
}
// Implementation of minimization limits:
// Pick N (~= the minimum program size) instructions at random which will not be removed during minimization.
// This way, minimization will be sped up (because no executions are necessary for those instructions marked as keep-alive)
// while the instructions that are kept artificially are equally distributed throughout the program.
var keptInstructions = Set<Int>()
if mode == .normal && minimizationLimit > 0 {
let analyzer = VariableAnalyzer(for: program)
var indices = Array(0..<program.size).shuffled()
while keptInstructions.count < minimizationLimit {
func keep(_ instr: Instruction) {
guard !keptInstructions.contains(instr.index) else { return }
keptInstructions.insert(instr.index)
// Keep alive all inputs recursively.
for input in instr.inputs {
keep(analyzer.definition(of: input))
}
}
keep(program.code[indices.removeLast()])
}
}
let verifier = ReductionVerifier(for: aspects, of: self.fuzzer, keeping: keptInstructions)
var code = program.code
repeat {
verifier.didReduce = false
let reducers: [Reducer]
switch mode {
case .aggressive:
reducers = [CallArgumentReducer(), ReplaceReducer(), GenericInstructionReducer(), BlockReducer(), InliningReducer()]
case .normal:
reducers = [ReplaceReducer(), GenericInstructionReducer(), BlockReducer(), InliningReducer()]
}
for reducer in reducers {
reducer.reduce(&code, with: verifier)
}
} while verifier.didReduce && mode == .aggressive
assert(code.isStaticallyValid())
// Most reducers replace instructions with NOPs instead of deleting them. Remove those NOPs now, and renumber the variables.
code.normalize()
return code
}
}