1*9712c20fSFrederick Mayle // Copyright 2010 Google LLC
2*9712c20fSFrederick Mayle //
3*9712c20fSFrederick Mayle // Redistribution and use in source and binary forms, with or without
4*9712c20fSFrederick Mayle // modification, are permitted provided that the following conditions are
5*9712c20fSFrederick Mayle // met:
6*9712c20fSFrederick Mayle //
7*9712c20fSFrederick Mayle // * Redistributions of source code must retain the above copyright
8*9712c20fSFrederick Mayle // notice, this list of conditions and the following disclaimer.
9*9712c20fSFrederick Mayle // * Redistributions in binary form must reproduce the above
10*9712c20fSFrederick Mayle // copyright notice, this list of conditions and the following disclaimer
11*9712c20fSFrederick Mayle // in the documentation and/or other materials provided with the
12*9712c20fSFrederick Mayle // distribution.
13*9712c20fSFrederick Mayle // * Neither the name of Google LLC nor the names of its
14*9712c20fSFrederick Mayle // contributors may be used to endorse or promote products derived from
15*9712c20fSFrederick Mayle // this software without specific prior written permission.
16*9712c20fSFrederick Mayle //
17*9712c20fSFrederick Mayle // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*9712c20fSFrederick Mayle // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*9712c20fSFrederick Mayle // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*9712c20fSFrederick Mayle // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*9712c20fSFrederick Mayle // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*9712c20fSFrederick Mayle // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*9712c20fSFrederick Mayle // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*9712c20fSFrederick Mayle // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*9712c20fSFrederick Mayle // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*9712c20fSFrederick Mayle // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*9712c20fSFrederick Mayle // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*9712c20fSFrederick Mayle
29*9712c20fSFrederick Mayle // exploitability_win.cc: Windows specific exploitability engine.
30*9712c20fSFrederick Mayle //
31*9712c20fSFrederick Mayle // Provides a guess at the exploitability of the crash for the Windows
32*9712c20fSFrederick Mayle // platform given a minidump and process_state.
33*9712c20fSFrederick Mayle //
34*9712c20fSFrederick Mayle // Author: Cris Neckar
35*9712c20fSFrederick Mayle
36*9712c20fSFrederick Mayle #ifdef HAVE_CONFIG_H
37*9712c20fSFrederick Mayle #include <config.h> // Must come first
38*9712c20fSFrederick Mayle #endif
39*9712c20fSFrederick Mayle
40*9712c20fSFrederick Mayle #include <vector>
41*9712c20fSFrederick Mayle
42*9712c20fSFrederick Mayle #include "processor/exploitability_win.h"
43*9712c20fSFrederick Mayle
44*9712c20fSFrederick Mayle #include "common/scoped_ptr.h"
45*9712c20fSFrederick Mayle #include "google_breakpad/common/minidump_exception_win32.h"
46*9712c20fSFrederick Mayle #include "google_breakpad/processor/minidump.h"
47*9712c20fSFrederick Mayle #include "processor/disassembler_x86.h"
48*9712c20fSFrederick Mayle #include "processor/logging.h"
49*9712c20fSFrederick Mayle
50*9712c20fSFrederick Mayle #include "third_party/libdisasm/libdis.h"
51*9712c20fSFrederick Mayle
52*9712c20fSFrederick Mayle namespace google_breakpad {
53*9712c20fSFrederick Mayle
54*9712c20fSFrederick Mayle // The cutoff that we use to judge if and address is likely an offset
55*9712c20fSFrederick Mayle // from various interesting addresses.
56*9712c20fSFrederick Mayle static const uint64_t kProbableNullOffset = 4096;
57*9712c20fSFrederick Mayle static const uint64_t kProbableStackOffset = 8192;
58*9712c20fSFrederick Mayle
59*9712c20fSFrederick Mayle // The various cutoffs for the different ratings.
60*9712c20fSFrederick Mayle static const size_t kHighCutoff = 100;
61*9712c20fSFrederick Mayle static const size_t kMediumCutoff = 80;
62*9712c20fSFrederick Mayle static const size_t kLowCutoff = 50;
63*9712c20fSFrederick Mayle static const size_t kInterestingCutoff = 25;
64*9712c20fSFrederick Mayle
65*9712c20fSFrederick Mayle // Predefined incremental values for conditional weighting.
66*9712c20fSFrederick Mayle static const size_t kTinyBump = 5;
67*9712c20fSFrederick Mayle static const size_t kSmallBump = 20;
68*9712c20fSFrederick Mayle static const size_t kMediumBump = 50;
69*9712c20fSFrederick Mayle static const size_t kLargeBump = 70;
70*9712c20fSFrederick Mayle static const size_t kHugeBump = 90;
71*9712c20fSFrederick Mayle
72*9712c20fSFrederick Mayle // The maximum number of bytes to disassemble past the program counter.
73*9712c20fSFrederick Mayle static const size_t kDisassembleBytesBeyondPC = 2048;
74*9712c20fSFrederick Mayle
ExploitabilityWin(Minidump * dump,ProcessState * process_state)75*9712c20fSFrederick Mayle ExploitabilityWin::ExploitabilityWin(Minidump* dump,
76*9712c20fSFrederick Mayle ProcessState* process_state)
77*9712c20fSFrederick Mayle : Exploitability(dump, process_state) { }
78*9712c20fSFrederick Mayle
CheckPlatformExploitability()79*9712c20fSFrederick Mayle ExploitabilityRating ExploitabilityWin::CheckPlatformExploitability() {
80*9712c20fSFrederick Mayle MinidumpException* exception = dump_->GetException();
81*9712c20fSFrederick Mayle if (!exception) {
82*9712c20fSFrederick Mayle BPLOG(INFO) << "Minidump does not have exception record.";
83*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
84*9712c20fSFrederick Mayle }
85*9712c20fSFrederick Mayle
86*9712c20fSFrederick Mayle const MDRawExceptionStream* raw_exception = exception->exception();
87*9712c20fSFrederick Mayle if (!raw_exception) {
88*9712c20fSFrederick Mayle BPLOG(INFO) << "Could not obtain raw exception info.";
89*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
90*9712c20fSFrederick Mayle }
91*9712c20fSFrederick Mayle
92*9712c20fSFrederick Mayle const MinidumpContext* context = exception->GetContext();
93*9712c20fSFrederick Mayle if (!context) {
94*9712c20fSFrederick Mayle BPLOG(INFO) << "Could not obtain exception context.";
95*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
96*9712c20fSFrederick Mayle }
97*9712c20fSFrederick Mayle
98*9712c20fSFrederick Mayle MinidumpMemoryList* memory_list = dump_->GetMemoryList();
99*9712c20fSFrederick Mayle bool memory_available = true;
100*9712c20fSFrederick Mayle if (!memory_list) {
101*9712c20fSFrederick Mayle BPLOG(INFO) << "Minidump memory segments not available.";
102*9712c20fSFrederick Mayle memory_available = false;
103*9712c20fSFrederick Mayle }
104*9712c20fSFrederick Mayle uint64_t address = process_state_->crash_address();
105*9712c20fSFrederick Mayle uint32_t exception_code = raw_exception->exception_record.exception_code;
106*9712c20fSFrederick Mayle
107*9712c20fSFrederick Mayle uint32_t exploitability_weight = 0;
108*9712c20fSFrederick Mayle
109*9712c20fSFrederick Mayle uint64_t stack_ptr = 0;
110*9712c20fSFrederick Mayle uint64_t instruction_ptr = 0;
111*9712c20fSFrederick Mayle
112*9712c20fSFrederick Mayle // Getting the instruction pointer.
113*9712c20fSFrederick Mayle if (!context->GetInstructionPointer(&instruction_ptr)) {
114*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
115*9712c20fSFrederick Mayle }
116*9712c20fSFrederick Mayle
117*9712c20fSFrederick Mayle // Getting the stack pointer.
118*9712c20fSFrederick Mayle if (!context->GetStackPointer(&stack_ptr)) {
119*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
120*9712c20fSFrederick Mayle }
121*9712c20fSFrederick Mayle
122*9712c20fSFrederick Mayle // Check if we are executing on the stack.
123*9712c20fSFrederick Mayle if (instruction_ptr <= (stack_ptr + kProbableStackOffset) &&
124*9712c20fSFrederick Mayle instruction_ptr >= (stack_ptr - kProbableStackOffset))
125*9712c20fSFrederick Mayle exploitability_weight += kHugeBump;
126*9712c20fSFrederick Mayle
127*9712c20fSFrederick Mayle switch (exception_code) {
128*9712c20fSFrederick Mayle // This is almost certainly recursion.
129*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_STACK_OVERFLOW:
130*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
131*9712c20fSFrederick Mayle break;
132*9712c20fSFrederick Mayle
133*9712c20fSFrederick Mayle // These exceptions tend to be benign and we can generally ignore them.
134*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_INTEGER_DIVIDE_BY_ZERO:
135*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_INTEGER_OVERFLOW:
136*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_FLOAT_DIVIDE_BY_ZERO:
137*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_FLOAT_INEXACT_RESULT:
138*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_FLOAT_OVERFLOW:
139*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_FLOAT_UNDERFLOW:
140*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_IN_PAGE_ERROR:
141*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
142*9712c20fSFrederick Mayle break;
143*9712c20fSFrederick Mayle
144*9712c20fSFrederick Mayle // These exceptions will typically mean that we have jumped where we
145*9712c20fSFrederick Mayle // shouldn't.
146*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_ILLEGAL_INSTRUCTION:
147*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_FLOAT_INVALID_OPERATION:
148*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_PRIVILEGED_INSTRUCTION:
149*9712c20fSFrederick Mayle exploitability_weight += kLargeBump;
150*9712c20fSFrederick Mayle break;
151*9712c20fSFrederick Mayle
152*9712c20fSFrederick Mayle // These represent bugs in exception handlers.
153*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_INVALID_DISPOSITION:
154*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_NONCONTINUABLE_EXCEPTION:
155*9712c20fSFrederick Mayle exploitability_weight += kSmallBump;
156*9712c20fSFrederick Mayle break;
157*9712c20fSFrederick Mayle
158*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_HEAP_CORRUPTION:
159*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_STACK_BUFFER_OVERRUN:
160*9712c20fSFrederick Mayle exploitability_weight += kHugeBump;
161*9712c20fSFrederick Mayle break;
162*9712c20fSFrederick Mayle
163*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_GUARD_PAGE_VIOLATION:
164*9712c20fSFrederick Mayle exploitability_weight += kLargeBump;
165*9712c20fSFrederick Mayle break;
166*9712c20fSFrederick Mayle
167*9712c20fSFrederick Mayle case MD_EXCEPTION_CODE_WIN_ACCESS_VIOLATION:
168*9712c20fSFrederick Mayle bool near_null = (address <= kProbableNullOffset);
169*9712c20fSFrederick Mayle bool bad_read = false;
170*9712c20fSFrederick Mayle bool bad_write = false;
171*9712c20fSFrederick Mayle if (raw_exception->exception_record.number_parameters >= 1) {
172*9712c20fSFrederick Mayle MDAccessViolationTypeWin av_type =
173*9712c20fSFrederick Mayle static_cast<MDAccessViolationTypeWin>
174*9712c20fSFrederick Mayle (raw_exception->exception_record.exception_information[0]);
175*9712c20fSFrederick Mayle switch (av_type) {
176*9712c20fSFrederick Mayle case MD_ACCESS_VIOLATION_WIN_READ:
177*9712c20fSFrederick Mayle bad_read = true;
178*9712c20fSFrederick Mayle if (near_null)
179*9712c20fSFrederick Mayle exploitability_weight += kSmallBump;
180*9712c20fSFrederick Mayle else
181*9712c20fSFrederick Mayle exploitability_weight += kMediumBump;
182*9712c20fSFrederick Mayle break;
183*9712c20fSFrederick Mayle case MD_ACCESS_VIOLATION_WIN_WRITE:
184*9712c20fSFrederick Mayle bad_write = true;
185*9712c20fSFrederick Mayle if (near_null)
186*9712c20fSFrederick Mayle exploitability_weight += kSmallBump;
187*9712c20fSFrederick Mayle else
188*9712c20fSFrederick Mayle exploitability_weight += kHugeBump;
189*9712c20fSFrederick Mayle break;
190*9712c20fSFrederick Mayle case MD_ACCESS_VIOLATION_WIN_EXEC:
191*9712c20fSFrederick Mayle if (near_null)
192*9712c20fSFrederick Mayle exploitability_weight += kSmallBump;
193*9712c20fSFrederick Mayle else
194*9712c20fSFrederick Mayle exploitability_weight += kHugeBump;
195*9712c20fSFrederick Mayle break;
196*9712c20fSFrederick Mayle default:
197*9712c20fSFrederick Mayle BPLOG(INFO) << "Unrecognized access violation type.";
198*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
199*9712c20fSFrederick Mayle }
200*9712c20fSFrederick Mayle MinidumpMemoryRegion* instruction_region = 0;
201*9712c20fSFrederick Mayle if (memory_available) {
202*9712c20fSFrederick Mayle instruction_region =
203*9712c20fSFrederick Mayle memory_list->GetMemoryRegionForAddress(instruction_ptr);
204*9712c20fSFrederick Mayle }
205*9712c20fSFrederick Mayle if (!near_null && instruction_region &&
206*9712c20fSFrederick Mayle context->GetContextCPU() == MD_CONTEXT_X86 &&
207*9712c20fSFrederick Mayle (bad_read || bad_write)) {
208*9712c20fSFrederick Mayle // Perform checks related to memory around instruction pointer.
209*9712c20fSFrederick Mayle uint32_t memory_offset =
210*9712c20fSFrederick Mayle instruction_ptr - instruction_region->GetBase();
211*9712c20fSFrederick Mayle uint32_t available_memory =
212*9712c20fSFrederick Mayle instruction_region->GetSize() - memory_offset;
213*9712c20fSFrederick Mayle available_memory = available_memory > kDisassembleBytesBeyondPC ?
214*9712c20fSFrederick Mayle kDisassembleBytesBeyondPC : available_memory;
215*9712c20fSFrederick Mayle if (available_memory) {
216*9712c20fSFrederick Mayle const uint8_t* raw_memory =
217*9712c20fSFrederick Mayle instruction_region->GetMemory() + memory_offset;
218*9712c20fSFrederick Mayle DisassemblerX86 disassembler(raw_memory,
219*9712c20fSFrederick Mayle available_memory,
220*9712c20fSFrederick Mayle instruction_ptr);
221*9712c20fSFrederick Mayle disassembler.NextInstruction();
222*9712c20fSFrederick Mayle if (bad_read)
223*9712c20fSFrederick Mayle disassembler.setBadRead();
224*9712c20fSFrederick Mayle else
225*9712c20fSFrederick Mayle disassembler.setBadWrite();
226*9712c20fSFrederick Mayle if (disassembler.currentInstructionValid()) {
227*9712c20fSFrederick Mayle // Check if the faulting instruction falls into one of
228*9712c20fSFrederick Mayle // several interesting groups.
229*9712c20fSFrederick Mayle switch (disassembler.currentInstructionGroup()) {
230*9712c20fSFrederick Mayle case libdis::insn_controlflow:
231*9712c20fSFrederick Mayle exploitability_weight += kLargeBump;
232*9712c20fSFrederick Mayle break;
233*9712c20fSFrederick Mayle case libdis::insn_string:
234*9712c20fSFrederick Mayle exploitability_weight += kHugeBump;
235*9712c20fSFrederick Mayle break;
236*9712c20fSFrederick Mayle default:
237*9712c20fSFrederick Mayle break;
238*9712c20fSFrederick Mayle }
239*9712c20fSFrederick Mayle // Loop the disassembler through the code and check if it
240*9712c20fSFrederick Mayle // IDed any interesting conditions in the near future.
241*9712c20fSFrederick Mayle // Multiple flags may be set so treat each equally.
242*9712c20fSFrederick Mayle while (disassembler.NextInstruction() &&
243*9712c20fSFrederick Mayle disassembler.currentInstructionValid() &&
244*9712c20fSFrederick Mayle !disassembler.endOfBlock())
245*9712c20fSFrederick Mayle continue;
246*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_BRANCH_TARGET)
247*9712c20fSFrederick Mayle exploitability_weight += kLargeBump;
248*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_ARGUMENT_PASSED)
249*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
250*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_WRITE)
251*9712c20fSFrederick Mayle exploitability_weight += kMediumBump;
252*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_BLOCK_WRITE)
253*9712c20fSFrederick Mayle exploitability_weight += kMediumBump;
254*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_READ)
255*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
256*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_BLOCK_READ)
257*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
258*9712c20fSFrederick Mayle if (disassembler.flags() & DISX86_BAD_COMPARISON)
259*9712c20fSFrederick Mayle exploitability_weight += kTinyBump;
260*9712c20fSFrederick Mayle }
261*9712c20fSFrederick Mayle }
262*9712c20fSFrederick Mayle }
263*9712c20fSFrederick Mayle if (!near_null && AddressIsAscii(address))
264*9712c20fSFrederick Mayle exploitability_weight += kMediumBump;
265*9712c20fSFrederick Mayle } else {
266*9712c20fSFrederick Mayle BPLOG(INFO) << "Access violation type parameter missing.";
267*9712c20fSFrederick Mayle return EXPLOITABILITY_ERR_PROCESSING;
268*9712c20fSFrederick Mayle }
269*9712c20fSFrederick Mayle }
270*9712c20fSFrederick Mayle
271*9712c20fSFrederick Mayle // Based on the calculated weight we return a simplified classification.
272*9712c20fSFrederick Mayle BPLOG(INFO) << "Calculated exploitability weight: " << exploitability_weight;
273*9712c20fSFrederick Mayle if (exploitability_weight >= kHighCutoff)
274*9712c20fSFrederick Mayle return EXPLOITABILITY_HIGH;
275*9712c20fSFrederick Mayle if (exploitability_weight >= kMediumCutoff)
276*9712c20fSFrederick Mayle return EXPLOITABLITY_MEDIUM;
277*9712c20fSFrederick Mayle if (exploitability_weight >= kLowCutoff)
278*9712c20fSFrederick Mayle return EXPLOITABILITY_LOW;
279*9712c20fSFrederick Mayle if (exploitability_weight >= kInterestingCutoff)
280*9712c20fSFrederick Mayle return EXPLOITABILITY_INTERESTING;
281*9712c20fSFrederick Mayle
282*9712c20fSFrederick Mayle return EXPLOITABILITY_NONE;
283*9712c20fSFrederick Mayle }
284*9712c20fSFrederick Mayle
285*9712c20fSFrederick Mayle } // namespace google_breakpad
286