blob: e61e9116bbde3ead62974e9a6ea118dc62bd682c [file] [log] [blame]
george.karpenkov29efa6d2017-08-21 23:25:50 +00001//===- FuzzerTracePC.cpp - PC tracing--------------------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9// Trace PCs.
10// This module implements __sanitizer_cov_trace_pc_guard[_init],
11// the callback required for -fsanitize-coverage=trace-pc-guard instrumentation.
12//
13//===----------------------------------------------------------------------===//
14
15#include "FuzzerTracePC.h"
16#include "FuzzerCorpus.h"
17#include "FuzzerDefs.h"
18#include "FuzzerDictionary.h"
19#include "FuzzerExtFunctions.h"
20#include "FuzzerIO.h"
21#include "FuzzerUtil.h"
22#include "FuzzerValueBitMap.h"
23#include <set>
24
25// The coverage counters and PCs.
26// These are declared as global variables named "__sancov_*" to simplify
27// experiments with inlined instrumentation.
28alignas(64) ATTRIBUTE_INTERFACE
29uint8_t __sancov_trace_pc_guard_8bit_counters[fuzzer::TracePC::kNumPCs];
30
31ATTRIBUTE_INTERFACE
32uintptr_t __sancov_trace_pc_pcs[fuzzer::TracePC::kNumPCs];
33
kcc1c0379f2017-08-22 01:28:32 +000034// Used by -fsanitize-coverage=stack-depth to track stack depth
morehouse398297f2017-08-22 21:28:29 +000035ATTRIBUTE_INTERFACE __attribute__((tls_model("initial-exec")))
36thread_local uintptr_t __sancov_lowest_stack;
kcc1c0379f2017-08-22 01:28:32 +000037
george.karpenkov29efa6d2017-08-21 23:25:50 +000038namespace fuzzer {
39
40TracePC TPC;
41
george.karpenkov29efa6d2017-08-21 23:25:50 +000042uint8_t *TracePC::Counters() const {
43 return __sancov_trace_pc_guard_8bit_counters;
44}
45
46uintptr_t *TracePC::PCs() const {
47 return __sancov_trace_pc_pcs;
48}
49
50size_t TracePC::GetTotalPCCoverage() {
51 if (ObservedPCs.size())
52 return ObservedPCs.size();
53 size_t Res = 0;
54 for (size_t i = 1, N = GetNumPCs(); i < N; i++)
55 if (PCs()[i])
56 Res++;
57 return Res;
58}
59
dor1sbb933292018-07-16 16:01:31 +000060// Initializes unstable counters by copying Inline8bitCounters to unstable
61// counters.
62void TracePC::InitializeUnstableCounters() {
63 if (NumInline8bitCounters && NumInline8bitCounters == NumPCsInPCTables) {
64 size_t UnstableIdx = 0;
65 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
66 uint8_t *Beg = ModuleCounters[i].Start;
67 size_t Size = ModuleCounters[i].Stop - Beg;
68 assert(Size == (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
69 for (size_t j = 0; j < Size; j++, UnstableIdx++)
70 if (UnstableCounters[UnstableIdx] != kUnstableCounter)
71 UnstableCounters[UnstableIdx] = Beg[j];
72 }
73 }
74}
75
76// Compares the current counters with counters from previous runs
77// and records differences as unstable edges.
78void TracePC::UpdateUnstableCounters() {
79 if (NumInline8bitCounters && NumInline8bitCounters == NumPCsInPCTables) {
80 size_t UnstableIdx = 0;
81 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
82 uint8_t *Beg = ModuleCounters[i].Start;
83 size_t Size = ModuleCounters[i].Stop - Beg;
84 assert(Size == (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
85 for (size_t j = 0; j < Size; j++, UnstableIdx++)
86 if (Beg[j] != UnstableCounters[UnstableIdx])
87 UnstableCounters[UnstableIdx] = kUnstableCounter;
88 }
89 }
90}
george.karpenkov29efa6d2017-08-21 23:25:50 +000091
92void TracePC::HandleInline8bitCountersInit(uint8_t *Start, uint8_t *Stop) {
93 if (Start == Stop) return;
94 if (NumModulesWithInline8bitCounters &&
95 ModuleCounters[NumModulesWithInline8bitCounters-1].Start == Start) return;
96 assert(NumModulesWithInline8bitCounters <
97 sizeof(ModuleCounters) / sizeof(ModuleCounters[0]));
98 ModuleCounters[NumModulesWithInline8bitCounters++] = {Start, Stop};
99 NumInline8bitCounters += Stop - Start;
100}
101
kcc98957a12017-08-25 19:29:47 +0000102void TracePC::HandlePCsInit(const uintptr_t *Start, const uintptr_t *Stop) {
103 const PCTableEntry *B = reinterpret_cast<const PCTableEntry *>(Start);
104 const PCTableEntry *E = reinterpret_cast<const PCTableEntry *>(Stop);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000105 if (NumPCTables && ModulePCTable[NumPCTables - 1].Start == B) return;
106 assert(NumPCTables < sizeof(ModulePCTable) / sizeof(ModulePCTable[0]));
107 ModulePCTable[NumPCTables++] = {B, E};
108 NumPCsInPCTables += E - B;
109}
110
111void TracePC::HandleInit(uint32_t *Start, uint32_t *Stop) {
112 if (Start == Stop || *Start) return;
113 assert(NumModules < sizeof(Modules) / sizeof(Modules[0]));
114 for (uint32_t *P = Start; P < Stop; P++) {
115 NumGuards++;
116 if (NumGuards == kNumPCs) {
117 RawPrint(
118 "WARNING: The binary has too many instrumented PCs.\n"
119 " You may want to reduce the size of the binary\n"
120 " for more efficient fuzzing and precise coverage data\n");
121 }
122 *P = NumGuards % kNumPCs;
123 }
124 Modules[NumModules].Start = Start;
125 Modules[NumModules].Stop = Stop;
126 NumModules++;
127}
128
129void TracePC::PrintModuleInfo() {
130 if (NumGuards) {
131 Printf("INFO: Loaded %zd modules (%zd guards): ", NumModules, NumGuards);
132 for (size_t i = 0; i < NumModules; i++)
133 Printf("%zd [%p, %p), ", Modules[i].Stop - Modules[i].Start,
134 Modules[i].Start, Modules[i].Stop);
135 Printf("\n");
136 }
137 if (NumModulesWithInline8bitCounters) {
138 Printf("INFO: Loaded %zd modules (%zd inline 8-bit counters): ",
139 NumModulesWithInline8bitCounters, NumInline8bitCounters);
140 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++)
141 Printf("%zd [%p, %p), ", ModuleCounters[i].Stop - ModuleCounters[i].Start,
142 ModuleCounters[i].Start, ModuleCounters[i].Stop);
143 Printf("\n");
144 }
145 if (NumPCTables) {
146 Printf("INFO: Loaded %zd PC tables (%zd PCs): ", NumPCTables,
147 NumPCsInPCTables);
148 for (size_t i = 0; i < NumPCTables; i++) {
149 Printf("%zd [%p,%p), ", ModulePCTable[i].Stop - ModulePCTable[i].Start,
150 ModulePCTable[i].Start, ModulePCTable[i].Stop);
151 }
152 Printf("\n");
153
154 if ((NumGuards && NumGuards != NumPCsInPCTables) ||
155 (NumInline8bitCounters && NumInline8bitCounters != NumPCsInPCTables)) {
kcce220ebb2017-10-14 00:07:11 +0000156 Printf("ERROR: The size of coverage PC tables does not match the\n"
157 "number of instrumented PCs. This might be a compiler bug,\n"
158 "please contact the libFuzzer developers.\n"
159 "Also check https://bugs.llvm.org/show_bug.cgi?id=34636\n"
160 "for possible workarounds (tl;dr: don't use the old GNU ld)\n");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000161 _Exit(1);
162 }
163 }
delcypherfcd19a82018-04-20 06:46:19 +0000164 if (size_t NumExtraCounters = ExtraCountersEnd() - ExtraCountersBegin())
165 Printf("INFO: %zd Extra Counters\n", NumExtraCounters);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000166}
167
168ATTRIBUTE_NO_SANITIZE_ALL
169void TracePC::HandleCallerCallee(uintptr_t Caller, uintptr_t Callee) {
170 const uintptr_t kBits = 12;
171 const uintptr_t kMask = (1 << kBits) - 1;
172 uintptr_t Idx = (Caller & kMask) | ((Callee & kMask) << kBits);
173 ValueProfileMap.AddValueModPrime(Idx);
174}
175
176void TracePC::UpdateObservedPCs() {
kccec9da662017-08-28 22:52:22 +0000177 Vector<uintptr_t> CoveredFuncs;
kcc00da6482017-08-25 20:09:25 +0000178 auto ObservePC = [&](uintptr_t PC) {
kcc09b3e5f2018-07-06 19:47:00 +0000179 if (ObservedPCs.insert(PC).second && DoPrintNewPCs) {
180 PrintPC("\tNEW_PC: %p %F %L", "\tNEW_PC: %p", PC + 1);
181 Printf("\n");
182 }
kcc1c0379f2017-08-22 01:28:32 +0000183 };
kcc00da6482017-08-25 20:09:25 +0000184
185 auto Observe = [&](const PCTableEntry &TE) {
186 if (TE.PCFlags & 1)
kccec9da662017-08-28 22:52:22 +0000187 if (ObservedFuncs.insert(TE.PC).second && NumPrintNewFuncs)
188 CoveredFuncs.push_back(TE.PC);
kcc00da6482017-08-25 20:09:25 +0000189 ObservePC(TE.PC);
190 };
191
george.karpenkov29efa6d2017-08-21 23:25:50 +0000192 if (NumPCsInPCTables) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000193 if (NumInline8bitCounters == NumPCsInPCTables) {
194 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
195 uint8_t *Beg = ModuleCounters[i].Start;
196 size_t Size = ModuleCounters[i].Stop - Beg;
197 assert(Size ==
198 (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
199 for (size_t j = 0; j < Size; j++)
200 if (Beg[j])
kcc00da6482017-08-25 20:09:25 +0000201 Observe(ModulePCTable[i].Start[j]);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000202 }
203 } else if (NumGuards == NumPCsInPCTables) {
204 size_t GuardIdx = 1;
205 for (size_t i = 0; i < NumModules; i++) {
206 uint32_t *Beg = Modules[i].Start;
207 size_t Size = Modules[i].Stop - Beg;
208 assert(Size ==
209 (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
210 for (size_t j = 0; j < Size; j++, GuardIdx++)
211 if (Counters()[GuardIdx])
kcc00da6482017-08-25 20:09:25 +0000212 Observe(ModulePCTable[i].Start[j]);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000213 }
214 }
215 }
kccec9da662017-08-28 22:52:22 +0000216
217 for (size_t i = 0, N = Min(CoveredFuncs.size(), NumPrintNewFuncs); i < N; i++) {
kcc873dc112018-06-07 21:15:24 +0000218 Printf("\tNEW_FUNC[%zd/%zd]: ", i + 1, CoveredFuncs.size());
kcc09b3e5f2018-07-06 19:47:00 +0000219 PrintPC("%p %F %L", "%p", CoveredFuncs[i] + 1);
220 Printf("\n");
kccec9da662017-08-28 22:52:22 +0000221 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000222}
223
224inline ALWAYS_INLINE uintptr_t GetPreviousInstructionPc(uintptr_t PC) {
225 // TODO: this implementation is x86 only.
226 // see sanitizer_common GetPreviousInstructionPc for full implementation.
227 return PC - 1;
228}
229
230inline ALWAYS_INLINE uintptr_t GetNextInstructionPc(uintptr_t PC) {
231 // TODO: this implementation is x86 only.
232 // see sanitizer_common GetPreviousInstructionPc for full implementation.
233 return PC + 1;
234}
235
236static std::string GetModuleName(uintptr_t PC) {
237 char ModulePathRaw[4096] = ""; // What's PATH_MAX in portable C++?
238 void *OffsetRaw = nullptr;
239 if (!EF->__sanitizer_get_module_and_offset_for_pc(
240 reinterpret_cast<void *>(PC), ModulePathRaw,
241 sizeof(ModulePathRaw), &OffsetRaw))
242 return "";
243 return ModulePathRaw;
244}
245
kcc85cad3d2018-05-11 01:17:52 +0000246template<class CallBack>
247void TracePC::IterateCoveredFunctions(CallBack CB) {
248 for (size_t i = 0; i < NumPCTables; i++) {
249 auto &M = ModulePCTable[i];
250 assert(M.Start < M.Stop);
251 auto ModuleName = GetModuleName(M.Start->PC);
252 for (auto NextFE = M.Start; NextFE < M.Stop; ) {
253 auto FE = NextFE;
254 assert((FE->PCFlags & 1) && "Not a function entry point");
255 do {
256 NextFE++;
257 } while (NextFE < M.Stop && !(NextFE->PCFlags & 1));
258 if (ObservedFuncs.count(FE->PC))
259 CB(FE, NextFE);
260 }
261 }
262}
263
kcc3acbe072018-05-16 23:26:37 +0000264void TracePC::SetFocusFunction(const std::string &FuncName) {
265 // This function should be called once.
266 assert(FocusFunction.first > NumModulesWithInline8bitCounters);
267 if (FuncName.empty())
268 return;
269 for (size_t M = 0; M < NumModulesWithInline8bitCounters; M++) {
270 auto &PCTE = ModulePCTable[M];
271 size_t N = PCTE.Stop - PCTE.Start;
272 for (size_t I = 0; I < N; I++) {
273 if (!(PCTE.Start[I].PCFlags & 1)) continue; // not a function entry.
274 auto Name = DescribePC("%F", GetNextInstructionPc(PCTE.Start[I].PC));
275 if (Name[0] == 'i' && Name[1] == 'n' && Name[2] == ' ')
276 Name = Name.substr(3, std::string::npos);
277 if (FuncName != Name) continue;
278 Printf("INFO: Focus function is set to '%s'\n", Name.c_str());
279 FocusFunction = {M, I};
280 return;
281 }
282 }
283}
284
285bool TracePC::ObservedFocusFunction() {
286 size_t I = FocusFunction.first;
287 size_t J = FocusFunction.second;
288 if (I >= NumModulesWithInline8bitCounters)
289 return false;
290 auto &MC = ModuleCounters[I];
291 size_t Size = MC.Stop - MC.Start;
292 if (J >= Size)
293 return false;
294 return MC.Start[J] != 0;
295}
296
george.karpenkov29efa6d2017-08-21 23:25:50 +0000297void TracePC::PrintCoverage() {
298 if (!EF->__sanitizer_symbolize_pc ||
299 !EF->__sanitizer_get_module_and_offset_for_pc) {
300 Printf("INFO: __sanitizer_symbolize_pc or "
301 "__sanitizer_get_module_and_offset_for_pc is not available,"
302 " not printing coverage\n");
303 return;
304 }
305 Printf("COVERAGE:\n");
kcc85cad3d2018-05-11 01:17:52 +0000306 auto CoveredFunctionCallback = [&](const PCTableEntry *First, const PCTableEntry *Last) {
307 assert(First < Last);
308 auto VisualizePC = GetNextInstructionPc(First->PC);
309 std::string FileStr = DescribePC("%s", VisualizePC);
310 if (!IsInterestingCoverageFile(FileStr)) return;
311 std::string FunctionStr = DescribePC("%F", VisualizePC);
312 std::string LineStr = DescribePC("%l", VisualizePC);
313 size_t Line = std::stoul(LineStr);
morehousef64b9402018-06-25 15:59:24 +0000314 Vector<uintptr_t> UncoveredPCs;
kcc85cad3d2018-05-11 01:17:52 +0000315 for (auto TE = First; TE < Last; TE++)
316 if (!ObservedPCs.count(TE->PC))
317 UncoveredPCs.push_back(TE->PC);
318 Printf("COVERED_FUNC: ");
319 UncoveredPCs.empty()
320 ? Printf("all")
321 : Printf("%zd/%zd", (Last - First) - UncoveredPCs.size(), Last - First);
322 Printf(" PCs covered %s %s:%zd\n", FunctionStr.c_str(), FileStr.c_str(),
323 Line);
324 for (auto PC: UncoveredPCs) {
325 Printf(" UNCOVERED_PC: %s\n",
326 DescribePC("%s:%l", GetNextInstructionPc(PC)).c_str());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000327 }
328 };
329
kcc85cad3d2018-05-11 01:17:52 +0000330 IterateCoveredFunctions(CoveredFunctionCallback);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000331}
332
kcca7dd2a92018-05-21 19:47:00 +0000333void TracePC::DumpCoverage() {
334 if (EF->__sanitizer_dump_coverage) {
335 Vector<uintptr_t> PCsCopy(GetNumPCs());
336 for (size_t i = 0; i < GetNumPCs(); i++)
337 PCsCopy[i] = PCs()[i] ? GetPreviousInstructionPc(PCs()[i]) : 0;
338 EF->__sanitizer_dump_coverage(PCsCopy.data(), PCsCopy.size());
339 }
340}
341
dor1sbb933292018-07-16 16:01:31 +0000342void TracePC::PrintUnstableStats() {
343 size_t count = 0;
344 for (size_t i = 0; i < NumInline8bitCounters; i++)
345 if (UnstableCounters[i] == kUnstableCounter)
346 count++;
347 Printf("stat::stability_rate: %.2f\n",
348 100 - static_cast<float>(count * 100) / NumInline8bitCounters);
349}
350
george.karpenkov29efa6d2017-08-21 23:25:50 +0000351// Value profile.
352// We keep track of various values that affect control flow.
353// These values are inserted into a bit-set-based hash map.
354// Every new bit in the map is treated as a new coverage.
355//
356// For memcmp/strcmp/etc the interesting value is the length of the common
357// prefix of the parameters.
358// For cmp instructions the interesting value is a XOR of the parameters.
359// The interesting value is mixed up with the PC and is then added to the map.
360
361ATTRIBUTE_NO_SANITIZE_ALL
362void TracePC::AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
363 size_t n, bool StopAtZero) {
364 if (!n) return;
365 size_t Len = std::min(n, Word::GetMaxSize());
366 const uint8_t *A1 = reinterpret_cast<const uint8_t *>(s1);
367 const uint8_t *A2 = reinterpret_cast<const uint8_t *>(s2);
368 uint8_t B1[Word::kMaxSize];
369 uint8_t B2[Word::kMaxSize];
370 // Copy the data into locals in this non-msan-instrumented function
371 // to avoid msan complaining further.
372 size_t Hash = 0; // Compute some simple hash of both strings.
373 for (size_t i = 0; i < Len; i++) {
374 B1[i] = A1[i];
375 B2[i] = A2[i];
376 size_t T = B1[i];
377 Hash ^= (T << 8) | B2[i];
378 }
379 size_t I = 0;
380 for (; I < Len; I++)
381 if (B1[I] != B2[I] || (StopAtZero && B1[I] == 0))
382 break;
383 size_t PC = reinterpret_cast<size_t>(caller_pc);
384 size_t Idx = (PC & 4095) | (I << 12);
385 ValueProfileMap.AddValue(Idx);
386 TORCW.Insert(Idx ^ Hash, Word(B1, Len), Word(B2, Len));
387}
388
389template <class T>
390ATTRIBUTE_TARGET_POPCNT ALWAYS_INLINE
391ATTRIBUTE_NO_SANITIZE_ALL
392void TracePC::HandleCmp(uintptr_t PC, T Arg1, T Arg2) {
393 uint64_t ArgXor = Arg1 ^ Arg2;
394 uint64_t ArgDistance = __builtin_popcountll(ArgXor) + 1; // [1,65]
395 uintptr_t Idx = ((PC & 4095) + 1) * ArgDistance;
396 if (sizeof(T) == 4)
dor1se6729cb2018-07-16 15:15:34 +0000397 TORC4.Insert(ArgXor, Arg1, Arg2);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000398 else if (sizeof(T) == 8)
dor1se6729cb2018-07-16 15:15:34 +0000399 TORC8.Insert(ArgXor, Arg1, Arg2);
kcc3850d062018-07-03 22:33:09 +0000400 // TODO: remove these flags and instead use all metrics at once.
401 if (UseValueProfileMask & 1)
402 ValueProfileMap.AddValue(Idx);
403 if (UseValueProfileMask & 2)
404 ValueProfileMap.AddValue(
405 PC * 64 + (Arg1 == Arg2 ? 0 : __builtin_clzll(Arg1 - Arg2) + 1));
406 if (UseValueProfileMask & 4) // alternative way to use the hamming distance
407 ValueProfileMap.AddValue(PC * 64 + ArgDistance);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000408}
409
410static size_t InternalStrnlen(const char *S, size_t MaxLen) {
411 size_t Len = 0;
412 for (; Len < MaxLen && S[Len]; Len++) {}
413 return Len;
414}
415
416// Finds min of (strlen(S1), strlen(S2)).
417// Needed bacause one of these strings may actually be non-zero terminated.
418static size_t InternalStrnlen2(const char *S1, const char *S2) {
419 size_t Len = 0;
420 for (; S1[Len] && S2[Len]; Len++) {}
421 return Len;
422}
423
424void TracePC::ClearInlineCounters() {
425 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
426 uint8_t *Beg = ModuleCounters[i].Start;
427 size_t Size = ModuleCounters[i].Stop - Beg;
428 memset(Beg, 0, Size);
429 }
430}
431
kcc0f3c0312017-08-22 01:50:00 +0000432ATTRIBUTE_NO_SANITIZE_ALL
kcc1c0379f2017-08-22 01:28:32 +0000433void TracePC::RecordInitialStack() {
kcc0f3c0312017-08-22 01:50:00 +0000434 int stack;
435 __sancov_lowest_stack = InitialStack = reinterpret_cast<uintptr_t>(&stack);
kcc1c0379f2017-08-22 01:28:32 +0000436}
437
438uintptr_t TracePC::GetMaxStackOffset() const {
439 return InitialStack - __sancov_lowest_stack; // Stack grows down
440}
441
george.karpenkov29efa6d2017-08-21 23:25:50 +0000442} // namespace fuzzer
443
444extern "C" {
445ATTRIBUTE_INTERFACE
446ATTRIBUTE_NO_SANITIZE_ALL
447void __sanitizer_cov_trace_pc_guard(uint32_t *Guard) {
448 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
449 uint32_t Idx = *Guard;
450 __sancov_trace_pc_pcs[Idx] = PC;
451 __sancov_trace_pc_guard_8bit_counters[Idx]++;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000452}
453
454// Best-effort support for -fsanitize-coverage=trace-pc, which is available
455// in both Clang and GCC.
456ATTRIBUTE_INTERFACE
457ATTRIBUTE_NO_SANITIZE_ALL
458void __sanitizer_cov_trace_pc() {
459 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
460 uintptr_t Idx = PC & (((uintptr_t)1 << fuzzer::TracePC::kTracePcBits) - 1);
461 __sancov_trace_pc_pcs[Idx] = PC;
462 __sancov_trace_pc_guard_8bit_counters[Idx]++;
463}
464
465ATTRIBUTE_INTERFACE
466void __sanitizer_cov_trace_pc_guard_init(uint32_t *Start, uint32_t *Stop) {
467 fuzzer::TPC.HandleInit(Start, Stop);
468}
469
470ATTRIBUTE_INTERFACE
471void __sanitizer_cov_8bit_counters_init(uint8_t *Start, uint8_t *Stop) {
472 fuzzer::TPC.HandleInline8bitCountersInit(Start, Stop);
473}
474
475ATTRIBUTE_INTERFACE
kcc98957a12017-08-25 19:29:47 +0000476void __sanitizer_cov_pcs_init(const uintptr_t *pcs_beg,
477 const uintptr_t *pcs_end) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000478 fuzzer::TPC.HandlePCsInit(pcs_beg, pcs_end);
479}
480
481ATTRIBUTE_INTERFACE
482ATTRIBUTE_NO_SANITIZE_ALL
483void __sanitizer_cov_trace_pc_indir(uintptr_t Callee) {
484 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
485 fuzzer::TPC.HandleCallerCallee(PC, Callee);
486}
487
488ATTRIBUTE_INTERFACE
489ATTRIBUTE_NO_SANITIZE_ALL
490ATTRIBUTE_TARGET_POPCNT
491void __sanitizer_cov_trace_cmp8(uint64_t Arg1, uint64_t Arg2) {
492 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
493 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
494}
495
496ATTRIBUTE_INTERFACE
497ATTRIBUTE_NO_SANITIZE_ALL
498ATTRIBUTE_TARGET_POPCNT
499// Now the __sanitizer_cov_trace_const_cmp[1248] callbacks just mimic
500// the behaviour of __sanitizer_cov_trace_cmp[1248] ones. This, however,
501// should be changed later to make full use of instrumentation.
502void __sanitizer_cov_trace_const_cmp8(uint64_t Arg1, uint64_t Arg2) {
503 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
504 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
505}
506
507ATTRIBUTE_INTERFACE
508ATTRIBUTE_NO_SANITIZE_ALL
509ATTRIBUTE_TARGET_POPCNT
510void __sanitizer_cov_trace_cmp4(uint32_t Arg1, uint32_t Arg2) {
511 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
512 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
513}
514
515ATTRIBUTE_INTERFACE
516ATTRIBUTE_NO_SANITIZE_ALL
517ATTRIBUTE_TARGET_POPCNT
518void __sanitizer_cov_trace_const_cmp4(uint32_t Arg1, uint32_t Arg2) {
519 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
520 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
521}
522
523ATTRIBUTE_INTERFACE
524ATTRIBUTE_NO_SANITIZE_ALL
525ATTRIBUTE_TARGET_POPCNT
526void __sanitizer_cov_trace_cmp2(uint16_t Arg1, uint16_t Arg2) {
527 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
528 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
529}
530
531ATTRIBUTE_INTERFACE
532ATTRIBUTE_NO_SANITIZE_ALL
533ATTRIBUTE_TARGET_POPCNT
534void __sanitizer_cov_trace_const_cmp2(uint16_t Arg1, uint16_t Arg2) {
535 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
536 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
537}
538
539ATTRIBUTE_INTERFACE
540ATTRIBUTE_NO_SANITIZE_ALL
541ATTRIBUTE_TARGET_POPCNT
542void __sanitizer_cov_trace_cmp1(uint8_t Arg1, uint8_t Arg2) {
543 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
544 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
545}
546
547ATTRIBUTE_INTERFACE
548ATTRIBUTE_NO_SANITIZE_ALL
549ATTRIBUTE_TARGET_POPCNT
550void __sanitizer_cov_trace_const_cmp1(uint8_t Arg1, uint8_t Arg2) {
551 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
552 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
553}
554
555ATTRIBUTE_INTERFACE
556ATTRIBUTE_NO_SANITIZE_ALL
557ATTRIBUTE_TARGET_POPCNT
558void __sanitizer_cov_trace_switch(uint64_t Val, uint64_t *Cases) {
559 uint64_t N = Cases[0];
560 uint64_t ValSizeInBits = Cases[1];
561 uint64_t *Vals = Cases + 2;
562 // Skip the most common and the most boring case.
563 if (Vals[N - 1] < 256 && Val < 256)
564 return;
565 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
566 size_t i;
567 uint64_t Token = 0;
568 for (i = 0; i < N; i++) {
569 Token = Val ^ Vals[i];
570 if (Val < Vals[i])
571 break;
572 }
573
574 if (ValSizeInBits == 16)
575 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint16_t>(Token), (uint16_t)(0));
576 else if (ValSizeInBits == 32)
577 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint32_t>(Token), (uint32_t)(0));
578 else
579 fuzzer::TPC.HandleCmp(PC + i, Token, (uint64_t)(0));
580}
581
582ATTRIBUTE_INTERFACE
583ATTRIBUTE_NO_SANITIZE_ALL
584ATTRIBUTE_TARGET_POPCNT
585void __sanitizer_cov_trace_div4(uint32_t Val) {
586 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
587 fuzzer::TPC.HandleCmp(PC, Val, (uint32_t)0);
588}
589
590ATTRIBUTE_INTERFACE
591ATTRIBUTE_NO_SANITIZE_ALL
592ATTRIBUTE_TARGET_POPCNT
593void __sanitizer_cov_trace_div8(uint64_t Val) {
594 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
595 fuzzer::TPC.HandleCmp(PC, Val, (uint64_t)0);
596}
597
598ATTRIBUTE_INTERFACE
599ATTRIBUTE_NO_SANITIZE_ALL
600ATTRIBUTE_TARGET_POPCNT
601void __sanitizer_cov_trace_gep(uintptr_t Idx) {
602 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
603 fuzzer::TPC.HandleCmp(PC, Idx, (uintptr_t)0);
604}
605
606ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
607void __sanitizer_weak_hook_memcmp(void *caller_pc, const void *s1,
608 const void *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000609 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000610 if (result == 0) return; // No reason to mutate.
611 if (n <= 1) return; // Not interesting.
612 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/false);
613}
614
615ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
616void __sanitizer_weak_hook_strncmp(void *caller_pc, const char *s1,
617 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000618 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000619 if (result == 0) return; // No reason to mutate.
620 size_t Len1 = fuzzer::InternalStrnlen(s1, n);
621 size_t Len2 = fuzzer::InternalStrnlen(s2, n);
622 n = std::min(n, Len1);
623 n = std::min(n, Len2);
624 if (n <= 1) return; // Not interesting.
625 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/true);
626}
627
628ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
629void __sanitizer_weak_hook_strcmp(void *caller_pc, const char *s1,
dor1se6729cb2018-07-16 15:15:34 +0000630 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000631 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000632 if (result == 0) return; // No reason to mutate.
633 size_t N = fuzzer::InternalStrnlen2(s1, s2);
634 if (N <= 1) return; // Not interesting.
635 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, N, /*StopAtZero*/true);
636}
637
638ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
639void __sanitizer_weak_hook_strncasecmp(void *called_pc, const char *s1,
640 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000641 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000642 return __sanitizer_weak_hook_strncmp(called_pc, s1, s2, n, result);
643}
644
645ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
646void __sanitizer_weak_hook_strcasecmp(void *called_pc, const char *s1,
647 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000648 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000649 return __sanitizer_weak_hook_strcmp(called_pc, s1, s2, result);
650}
651
652ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
653void __sanitizer_weak_hook_strstr(void *called_pc, const char *s1,
654 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000655 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000656 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
657}
658
659ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
660void __sanitizer_weak_hook_strcasestr(void *called_pc, const char *s1,
661 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000662 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000663 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
664}
665
666ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
667void __sanitizer_weak_hook_memmem(void *called_pc, const void *s1, size_t len1,
668 const void *s2, size_t len2, void *result) {
morehousec6ee8752018-07-17 16:12:00 +0000669 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000670 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), len2);
671}
672} // extern "C"