blob: 0385b36bece9f1037658ddb56574036735b7a28b [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
dor1sd7197f42018-07-18 17:03:27 +000060template<class CallBack>
61void TracePC::IterateInline8bitCounters(CallBack CB) const {
dor1sbb933292018-07-16 16:01:31 +000062 if (NumInline8bitCounters && NumInline8bitCounters == NumPCsInPCTables) {
dor1sd7197f42018-07-18 17:03:27 +000063 size_t CounterIdx = 0;
dor1sbb933292018-07-16 16:01:31 +000064 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
65 uint8_t *Beg = ModuleCounters[i].Start;
66 size_t Size = ModuleCounters[i].Stop - Beg;
67 assert(Size == (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
dor1sd7197f42018-07-18 17:03:27 +000068 for (size_t j = 0; j < Size; j++, CounterIdx++)
69 CB(i, j, CounterIdx);
dor1sbb933292018-07-16 16:01:31 +000070 }
71 }
72}
73
dor1sd7197f42018-07-18 17:03:27 +000074// Initializes unstable counters by copying Inline8bitCounters to unstable
75// counters.
76void TracePC::InitializeUnstableCounters() {
77 IterateInline8bitCounters([&](int i, int j, int UnstableIdx) {
78 if (UnstableCounters[UnstableIdx] != kUnstableCounter)
79 UnstableCounters[UnstableIdx] = ModuleCounters[i].Start[j];
80 });
81}
82
dor1sbb933292018-07-16 16:01:31 +000083// Compares the current counters with counters from previous runs
84// and records differences as unstable edges.
85void TracePC::UpdateUnstableCounters() {
dor1sd7197f42018-07-18 17:03:27 +000086 IterateInline8bitCounters([&](int i, int j, int UnstableIdx) {
87 if (ModuleCounters[i].Start[j] != UnstableCounters[UnstableIdx])
88 UnstableCounters[UnstableIdx] = kUnstableCounter;
89 });
dor1sbb933292018-07-16 16:01:31 +000090}
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) {
dor1sd7197f42018-07-18 17:03:27 +0000194 IterateInline8bitCounters([&](int i, int j, int CounterIdx) {
195 if (ModuleCounters[i].Start[j])
196 Observe(ModulePCTable[i].Start[j]);
197 });
george.karpenkov29efa6d2017-08-21 23:25:50 +0000198 } else if (NumGuards == NumPCsInPCTables) {
199 size_t GuardIdx = 1;
200 for (size_t i = 0; i < NumModules; i++) {
201 uint32_t *Beg = Modules[i].Start;
202 size_t Size = Modules[i].Stop - Beg;
203 assert(Size ==
204 (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
205 for (size_t j = 0; j < Size; j++, GuardIdx++)
206 if (Counters()[GuardIdx])
kcc00da6482017-08-25 20:09:25 +0000207 Observe(ModulePCTable[i].Start[j]);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000208 }
209 }
210 }
kccec9da662017-08-28 22:52:22 +0000211
212 for (size_t i = 0, N = Min(CoveredFuncs.size(), NumPrintNewFuncs); i < N; i++) {
kcc873dc112018-06-07 21:15:24 +0000213 Printf("\tNEW_FUNC[%zd/%zd]: ", i + 1, CoveredFuncs.size());
kcc09b3e5f2018-07-06 19:47:00 +0000214 PrintPC("%p %F %L", "%p", CoveredFuncs[i] + 1);
215 Printf("\n");
kccec9da662017-08-28 22:52:22 +0000216 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000217}
218
219inline ALWAYS_INLINE uintptr_t GetPreviousInstructionPc(uintptr_t PC) {
220 // TODO: this implementation is x86 only.
221 // see sanitizer_common GetPreviousInstructionPc for full implementation.
222 return PC - 1;
223}
224
225inline ALWAYS_INLINE uintptr_t GetNextInstructionPc(uintptr_t PC) {
226 // TODO: this implementation is x86 only.
227 // see sanitizer_common GetPreviousInstructionPc for full implementation.
228 return PC + 1;
229}
230
231static std::string GetModuleName(uintptr_t PC) {
232 char ModulePathRaw[4096] = ""; // What's PATH_MAX in portable C++?
233 void *OffsetRaw = nullptr;
234 if (!EF->__sanitizer_get_module_and_offset_for_pc(
235 reinterpret_cast<void *>(PC), ModulePathRaw,
236 sizeof(ModulePathRaw), &OffsetRaw))
237 return "";
238 return ModulePathRaw;
239}
240
kcc85cad3d2018-05-11 01:17:52 +0000241template<class CallBack>
242void TracePC::IterateCoveredFunctions(CallBack CB) {
243 for (size_t i = 0; i < NumPCTables; i++) {
244 auto &M = ModulePCTable[i];
245 assert(M.Start < M.Stop);
246 auto ModuleName = GetModuleName(M.Start->PC);
247 for (auto NextFE = M.Start; NextFE < M.Stop; ) {
248 auto FE = NextFE;
249 assert((FE->PCFlags & 1) && "Not a function entry point");
250 do {
251 NextFE++;
252 } while (NextFE < M.Stop && !(NextFE->PCFlags & 1));
253 if (ObservedFuncs.count(FE->PC))
254 CB(FE, NextFE);
255 }
256 }
257}
258
kcc3acbe072018-05-16 23:26:37 +0000259void TracePC::SetFocusFunction(const std::string &FuncName) {
260 // This function should be called once.
261 assert(FocusFunction.first > NumModulesWithInline8bitCounters);
262 if (FuncName.empty())
263 return;
264 for (size_t M = 0; M < NumModulesWithInline8bitCounters; M++) {
265 auto &PCTE = ModulePCTable[M];
266 size_t N = PCTE.Stop - PCTE.Start;
267 for (size_t I = 0; I < N; I++) {
268 if (!(PCTE.Start[I].PCFlags & 1)) continue; // not a function entry.
269 auto Name = DescribePC("%F", GetNextInstructionPc(PCTE.Start[I].PC));
270 if (Name[0] == 'i' && Name[1] == 'n' && Name[2] == ' ')
271 Name = Name.substr(3, std::string::npos);
272 if (FuncName != Name) continue;
273 Printf("INFO: Focus function is set to '%s'\n", Name.c_str());
274 FocusFunction = {M, I};
275 return;
276 }
277 }
278}
279
280bool TracePC::ObservedFocusFunction() {
281 size_t I = FocusFunction.first;
282 size_t J = FocusFunction.second;
283 if (I >= NumModulesWithInline8bitCounters)
284 return false;
285 auto &MC = ModuleCounters[I];
286 size_t Size = MC.Stop - MC.Start;
287 if (J >= Size)
288 return false;
289 return MC.Start[J] != 0;
290}
291
george.karpenkov29efa6d2017-08-21 23:25:50 +0000292void TracePC::PrintCoverage() {
293 if (!EF->__sanitizer_symbolize_pc ||
294 !EF->__sanitizer_get_module_and_offset_for_pc) {
295 Printf("INFO: __sanitizer_symbolize_pc or "
296 "__sanitizer_get_module_and_offset_for_pc is not available,"
297 " not printing coverage\n");
298 return;
299 }
300 Printf("COVERAGE:\n");
kcc85cad3d2018-05-11 01:17:52 +0000301 auto CoveredFunctionCallback = [&](const PCTableEntry *First, const PCTableEntry *Last) {
302 assert(First < Last);
303 auto VisualizePC = GetNextInstructionPc(First->PC);
304 std::string FileStr = DescribePC("%s", VisualizePC);
305 if (!IsInterestingCoverageFile(FileStr)) return;
306 std::string FunctionStr = DescribePC("%F", VisualizePC);
307 std::string LineStr = DescribePC("%l", VisualizePC);
308 size_t Line = std::stoul(LineStr);
morehousef64b9402018-06-25 15:59:24 +0000309 Vector<uintptr_t> UncoveredPCs;
kcc85cad3d2018-05-11 01:17:52 +0000310 for (auto TE = First; TE < Last; TE++)
311 if (!ObservedPCs.count(TE->PC))
312 UncoveredPCs.push_back(TE->PC);
313 Printf("COVERED_FUNC: ");
314 UncoveredPCs.empty()
315 ? Printf("all")
316 : Printf("%zd/%zd", (Last - First) - UncoveredPCs.size(), Last - First);
317 Printf(" PCs covered %s %s:%zd\n", FunctionStr.c_str(), FileStr.c_str(),
318 Line);
319 for (auto PC: UncoveredPCs) {
320 Printf(" UNCOVERED_PC: %s\n",
321 DescribePC("%s:%l", GetNextInstructionPc(PC)).c_str());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000322 }
323 };
324
kcc85cad3d2018-05-11 01:17:52 +0000325 IterateCoveredFunctions(CoveredFunctionCallback);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000326}
327
kcca7dd2a92018-05-21 19:47:00 +0000328void TracePC::DumpCoverage() {
329 if (EF->__sanitizer_dump_coverage) {
330 Vector<uintptr_t> PCsCopy(GetNumPCs());
331 for (size_t i = 0; i < GetNumPCs(); i++)
332 PCsCopy[i] = PCs()[i] ? GetPreviousInstructionPc(PCs()[i]) : 0;
333 EF->__sanitizer_dump_coverage(PCsCopy.data(), PCsCopy.size());
334 }
335}
336
dor1sbb933292018-07-16 16:01:31 +0000337void TracePC::PrintUnstableStats() {
338 size_t count = 0;
339 for (size_t i = 0; i < NumInline8bitCounters; i++)
340 if (UnstableCounters[i] == kUnstableCounter)
341 count++;
342 Printf("stat::stability_rate: %.2f\n",
343 100 - static_cast<float>(count * 100) / NumInline8bitCounters);
344}
345
george.karpenkov29efa6d2017-08-21 23:25:50 +0000346// Value profile.
347// We keep track of various values that affect control flow.
348// These values are inserted into a bit-set-based hash map.
349// Every new bit in the map is treated as a new coverage.
350//
351// For memcmp/strcmp/etc the interesting value is the length of the common
352// prefix of the parameters.
353// For cmp instructions the interesting value is a XOR of the parameters.
354// The interesting value is mixed up with the PC and is then added to the map.
355
356ATTRIBUTE_NO_SANITIZE_ALL
357void TracePC::AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
358 size_t n, bool StopAtZero) {
359 if (!n) return;
360 size_t Len = std::min(n, Word::GetMaxSize());
361 const uint8_t *A1 = reinterpret_cast<const uint8_t *>(s1);
362 const uint8_t *A2 = reinterpret_cast<const uint8_t *>(s2);
363 uint8_t B1[Word::kMaxSize];
364 uint8_t B2[Word::kMaxSize];
365 // Copy the data into locals in this non-msan-instrumented function
366 // to avoid msan complaining further.
367 size_t Hash = 0; // Compute some simple hash of both strings.
368 for (size_t i = 0; i < Len; i++) {
369 B1[i] = A1[i];
370 B2[i] = A2[i];
371 size_t T = B1[i];
372 Hash ^= (T << 8) | B2[i];
373 }
374 size_t I = 0;
375 for (; I < Len; I++)
376 if (B1[I] != B2[I] || (StopAtZero && B1[I] == 0))
377 break;
378 size_t PC = reinterpret_cast<size_t>(caller_pc);
379 size_t Idx = (PC & 4095) | (I << 12);
380 ValueProfileMap.AddValue(Idx);
381 TORCW.Insert(Idx ^ Hash, Word(B1, Len), Word(B2, Len));
382}
383
384template <class T>
385ATTRIBUTE_TARGET_POPCNT ALWAYS_INLINE
386ATTRIBUTE_NO_SANITIZE_ALL
387void TracePC::HandleCmp(uintptr_t PC, T Arg1, T Arg2) {
388 uint64_t ArgXor = Arg1 ^ Arg2;
389 uint64_t ArgDistance = __builtin_popcountll(ArgXor) + 1; // [1,65]
390 uintptr_t Idx = ((PC & 4095) + 1) * ArgDistance;
391 if (sizeof(T) == 4)
dor1se6729cb2018-07-16 15:15:34 +0000392 TORC4.Insert(ArgXor, Arg1, Arg2);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000393 else if (sizeof(T) == 8)
dor1se6729cb2018-07-16 15:15:34 +0000394 TORC8.Insert(ArgXor, Arg1, Arg2);
kcc3850d062018-07-03 22:33:09 +0000395 // TODO: remove these flags and instead use all metrics at once.
396 if (UseValueProfileMask & 1)
397 ValueProfileMap.AddValue(Idx);
398 if (UseValueProfileMask & 2)
399 ValueProfileMap.AddValue(
400 PC * 64 + (Arg1 == Arg2 ? 0 : __builtin_clzll(Arg1 - Arg2) + 1));
401 if (UseValueProfileMask & 4) // alternative way to use the hamming distance
402 ValueProfileMap.AddValue(PC * 64 + ArgDistance);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000403}
404
405static size_t InternalStrnlen(const char *S, size_t MaxLen) {
406 size_t Len = 0;
407 for (; Len < MaxLen && S[Len]; Len++) {}
408 return Len;
409}
410
411// Finds min of (strlen(S1), strlen(S2)).
412// Needed bacause one of these strings may actually be non-zero terminated.
413static size_t InternalStrnlen2(const char *S1, const char *S2) {
414 size_t Len = 0;
415 for (; S1[Len] && S2[Len]; Len++) {}
416 return Len;
417}
418
419void TracePC::ClearInlineCounters() {
420 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
421 uint8_t *Beg = ModuleCounters[i].Start;
422 size_t Size = ModuleCounters[i].Stop - Beg;
423 memset(Beg, 0, Size);
424 }
425}
426
kcc0f3c0312017-08-22 01:50:00 +0000427ATTRIBUTE_NO_SANITIZE_ALL
kcc1c0379f2017-08-22 01:28:32 +0000428void TracePC::RecordInitialStack() {
kcc0f3c0312017-08-22 01:50:00 +0000429 int stack;
430 __sancov_lowest_stack = InitialStack = reinterpret_cast<uintptr_t>(&stack);
kcc1c0379f2017-08-22 01:28:32 +0000431}
432
433uintptr_t TracePC::GetMaxStackOffset() const {
434 return InitialStack - __sancov_lowest_stack; // Stack grows down
435}
436
george.karpenkov29efa6d2017-08-21 23:25:50 +0000437} // namespace fuzzer
438
439extern "C" {
440ATTRIBUTE_INTERFACE
441ATTRIBUTE_NO_SANITIZE_ALL
442void __sanitizer_cov_trace_pc_guard(uint32_t *Guard) {
443 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
444 uint32_t Idx = *Guard;
445 __sancov_trace_pc_pcs[Idx] = PC;
446 __sancov_trace_pc_guard_8bit_counters[Idx]++;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000447}
448
449// Best-effort support for -fsanitize-coverage=trace-pc, which is available
450// in both Clang and GCC.
451ATTRIBUTE_INTERFACE
452ATTRIBUTE_NO_SANITIZE_ALL
453void __sanitizer_cov_trace_pc() {
454 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
455 uintptr_t Idx = PC & (((uintptr_t)1 << fuzzer::TracePC::kTracePcBits) - 1);
456 __sancov_trace_pc_pcs[Idx] = PC;
457 __sancov_trace_pc_guard_8bit_counters[Idx]++;
458}
459
460ATTRIBUTE_INTERFACE
461void __sanitizer_cov_trace_pc_guard_init(uint32_t *Start, uint32_t *Stop) {
462 fuzzer::TPC.HandleInit(Start, Stop);
463}
464
465ATTRIBUTE_INTERFACE
466void __sanitizer_cov_8bit_counters_init(uint8_t *Start, uint8_t *Stop) {
467 fuzzer::TPC.HandleInline8bitCountersInit(Start, Stop);
468}
469
470ATTRIBUTE_INTERFACE
kcc98957a12017-08-25 19:29:47 +0000471void __sanitizer_cov_pcs_init(const uintptr_t *pcs_beg,
472 const uintptr_t *pcs_end) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000473 fuzzer::TPC.HandlePCsInit(pcs_beg, pcs_end);
474}
475
476ATTRIBUTE_INTERFACE
477ATTRIBUTE_NO_SANITIZE_ALL
478void __sanitizer_cov_trace_pc_indir(uintptr_t Callee) {
479 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
480 fuzzer::TPC.HandleCallerCallee(PC, Callee);
481}
482
483ATTRIBUTE_INTERFACE
484ATTRIBUTE_NO_SANITIZE_ALL
485ATTRIBUTE_TARGET_POPCNT
486void __sanitizer_cov_trace_cmp8(uint64_t Arg1, uint64_t Arg2) {
487 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
488 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
489}
490
491ATTRIBUTE_INTERFACE
492ATTRIBUTE_NO_SANITIZE_ALL
493ATTRIBUTE_TARGET_POPCNT
494// Now the __sanitizer_cov_trace_const_cmp[1248] callbacks just mimic
495// the behaviour of __sanitizer_cov_trace_cmp[1248] ones. This, however,
496// should be changed later to make full use of instrumentation.
497void __sanitizer_cov_trace_const_cmp8(uint64_t Arg1, uint64_t Arg2) {
498 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
499 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
500}
501
502ATTRIBUTE_INTERFACE
503ATTRIBUTE_NO_SANITIZE_ALL
504ATTRIBUTE_TARGET_POPCNT
505void __sanitizer_cov_trace_cmp4(uint32_t Arg1, uint32_t Arg2) {
506 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
507 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
508}
509
510ATTRIBUTE_INTERFACE
511ATTRIBUTE_NO_SANITIZE_ALL
512ATTRIBUTE_TARGET_POPCNT
513void __sanitizer_cov_trace_const_cmp4(uint32_t Arg1, uint32_t Arg2) {
514 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
515 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
516}
517
518ATTRIBUTE_INTERFACE
519ATTRIBUTE_NO_SANITIZE_ALL
520ATTRIBUTE_TARGET_POPCNT
521void __sanitizer_cov_trace_cmp2(uint16_t Arg1, uint16_t Arg2) {
522 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
523 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
524}
525
526ATTRIBUTE_INTERFACE
527ATTRIBUTE_NO_SANITIZE_ALL
528ATTRIBUTE_TARGET_POPCNT
529void __sanitizer_cov_trace_const_cmp2(uint16_t Arg1, uint16_t Arg2) {
530 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
531 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
532}
533
534ATTRIBUTE_INTERFACE
535ATTRIBUTE_NO_SANITIZE_ALL
536ATTRIBUTE_TARGET_POPCNT
537void __sanitizer_cov_trace_cmp1(uint8_t Arg1, uint8_t Arg2) {
538 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
539 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
540}
541
542ATTRIBUTE_INTERFACE
543ATTRIBUTE_NO_SANITIZE_ALL
544ATTRIBUTE_TARGET_POPCNT
545void __sanitizer_cov_trace_const_cmp1(uint8_t Arg1, uint8_t Arg2) {
546 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
547 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
548}
549
550ATTRIBUTE_INTERFACE
551ATTRIBUTE_NO_SANITIZE_ALL
552ATTRIBUTE_TARGET_POPCNT
553void __sanitizer_cov_trace_switch(uint64_t Val, uint64_t *Cases) {
554 uint64_t N = Cases[0];
555 uint64_t ValSizeInBits = Cases[1];
556 uint64_t *Vals = Cases + 2;
557 // Skip the most common and the most boring case.
558 if (Vals[N - 1] < 256 && Val < 256)
559 return;
560 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
561 size_t i;
562 uint64_t Token = 0;
563 for (i = 0; i < N; i++) {
564 Token = Val ^ Vals[i];
565 if (Val < Vals[i])
566 break;
567 }
568
569 if (ValSizeInBits == 16)
570 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint16_t>(Token), (uint16_t)(0));
571 else if (ValSizeInBits == 32)
572 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint32_t>(Token), (uint32_t)(0));
573 else
574 fuzzer::TPC.HandleCmp(PC + i, Token, (uint64_t)(0));
575}
576
577ATTRIBUTE_INTERFACE
578ATTRIBUTE_NO_SANITIZE_ALL
579ATTRIBUTE_TARGET_POPCNT
580void __sanitizer_cov_trace_div4(uint32_t Val) {
581 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
582 fuzzer::TPC.HandleCmp(PC, Val, (uint32_t)0);
583}
584
585ATTRIBUTE_INTERFACE
586ATTRIBUTE_NO_SANITIZE_ALL
587ATTRIBUTE_TARGET_POPCNT
588void __sanitizer_cov_trace_div8(uint64_t Val) {
589 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
590 fuzzer::TPC.HandleCmp(PC, Val, (uint64_t)0);
591}
592
593ATTRIBUTE_INTERFACE
594ATTRIBUTE_NO_SANITIZE_ALL
595ATTRIBUTE_TARGET_POPCNT
596void __sanitizer_cov_trace_gep(uintptr_t Idx) {
597 uintptr_t PC = reinterpret_cast<uintptr_t>(__builtin_return_address(0));
598 fuzzer::TPC.HandleCmp(PC, Idx, (uintptr_t)0);
599}
600
601ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
602void __sanitizer_weak_hook_memcmp(void *caller_pc, const void *s1,
603 const void *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000604 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000605 if (result == 0) return; // No reason to mutate.
606 if (n <= 1) return; // Not interesting.
607 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/false);
608}
609
610ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
611void __sanitizer_weak_hook_strncmp(void *caller_pc, const char *s1,
612 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000613 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000614 if (result == 0) return; // No reason to mutate.
615 size_t Len1 = fuzzer::InternalStrnlen(s1, n);
616 size_t Len2 = fuzzer::InternalStrnlen(s2, n);
617 n = std::min(n, Len1);
618 n = std::min(n, Len2);
619 if (n <= 1) return; // Not interesting.
620 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/true);
621}
622
623ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
624void __sanitizer_weak_hook_strcmp(void *caller_pc, const char *s1,
dor1se6729cb2018-07-16 15:15:34 +0000625 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000626 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000627 if (result == 0) return; // No reason to mutate.
628 size_t N = fuzzer::InternalStrnlen2(s1, s2);
629 if (N <= 1) return; // Not interesting.
630 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, N, /*StopAtZero*/true);
631}
632
633ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
634void __sanitizer_weak_hook_strncasecmp(void *called_pc, const char *s1,
635 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000636 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000637 return __sanitizer_weak_hook_strncmp(called_pc, s1, s2, n, result);
638}
639
640ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
641void __sanitizer_weak_hook_strcasecmp(void *called_pc, const char *s1,
642 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000643 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000644 return __sanitizer_weak_hook_strcmp(called_pc, s1, s2, result);
645}
646
647ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
648void __sanitizer_weak_hook_strstr(void *called_pc, const char *s1,
649 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000650 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000651 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
652}
653
654ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
655void __sanitizer_weak_hook_strcasestr(void *called_pc, const char *s1,
656 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000657 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000658 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
659}
660
661ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
662void __sanitizer_weak_hook_memmem(void *called_pc, const void *s1, size_t len1,
663 const void *s2, size_t len2, void *result) {
morehousec6ee8752018-07-17 16:12:00 +0000664 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000665 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), len2);
666}
667} // extern "C"