blob: 5ecc22d0de917d6cc6690a7eef982effd4073943 [file] [log] [blame]
george.karpenkov29efa6d2017-08-21 23:25:50 +00001//===- FuzzerTracePC.cpp - PC tracing--------------------------------------===//
2//
chandlerc40284492019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
george.karpenkov29efa6d2017-08-21 23:25:50 +00006//
7//===----------------------------------------------------------------------===//
8// Trace PCs.
9// This module implements __sanitizer_cov_trace_pc_guard[_init],
10// the callback required for -fsanitize-coverage=trace-pc-guard instrumentation.
11//
12//===----------------------------------------------------------------------===//
13
14#include "FuzzerTracePC.h"
metzman40132972019-01-09 21:46:09 +000015#include "FuzzerBuiltins.h"
16#include "FuzzerBuiltinsMsvc.h"
george.karpenkov29efa6d2017-08-21 23:25:50 +000017#include "FuzzerCorpus.h"
18#include "FuzzerDefs.h"
19#include "FuzzerDictionary.h"
20#include "FuzzerExtFunctions.h"
21#include "FuzzerIO.h"
22#include "FuzzerUtil.h"
23#include "FuzzerValueBitMap.h"
24#include <set>
25
26// The coverage counters and PCs.
27// These are declared as global variables named "__sancov_*" to simplify
28// experiments with inlined instrumentation.
29alignas(64) ATTRIBUTE_INTERFACE
30uint8_t __sancov_trace_pc_guard_8bit_counters[fuzzer::TracePC::kNumPCs];
31
32ATTRIBUTE_INTERFACE
33uintptr_t __sancov_trace_pc_pcs[fuzzer::TracePC::kNumPCs];
34
kcc1c0379f2017-08-22 01:28:32 +000035// Used by -fsanitize-coverage=stack-depth to track stack depth
morehouse68f46432018-08-30 15:54:44 +000036ATTRIBUTES_INTERFACE_TLS_INITIAL_EXEC 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
60
61void TracePC::HandleInline8bitCountersInit(uint8_t *Start, uint8_t *Stop) {
62 if (Start == Stop) return;
63 if (NumModulesWithInline8bitCounters &&
64 ModuleCounters[NumModulesWithInline8bitCounters-1].Start == Start) return;
65 assert(NumModulesWithInline8bitCounters <
66 sizeof(ModuleCounters) / sizeof(ModuleCounters[0]));
67 ModuleCounters[NumModulesWithInline8bitCounters++] = {Start, Stop};
68 NumInline8bitCounters += Stop - Start;
69}
70
kcc98957a12017-08-25 19:29:47 +000071void TracePC::HandlePCsInit(const uintptr_t *Start, const uintptr_t *Stop) {
72 const PCTableEntry *B = reinterpret_cast<const PCTableEntry *>(Start);
73 const PCTableEntry *E = reinterpret_cast<const PCTableEntry *>(Stop);
george.karpenkov29efa6d2017-08-21 23:25:50 +000074 if (NumPCTables && ModulePCTable[NumPCTables - 1].Start == B) return;
75 assert(NumPCTables < sizeof(ModulePCTable) / sizeof(ModulePCTable[0]));
76 ModulePCTable[NumPCTables++] = {B, E};
77 NumPCsInPCTables += E - B;
78}
79
80void TracePC::HandleInit(uint32_t *Start, uint32_t *Stop) {
81 if (Start == Stop || *Start) return;
82 assert(NumModules < sizeof(Modules) / sizeof(Modules[0]));
83 for (uint32_t *P = Start; P < Stop; P++) {
84 NumGuards++;
85 if (NumGuards == kNumPCs) {
86 RawPrint(
87 "WARNING: The binary has too many instrumented PCs.\n"
88 " You may want to reduce the size of the binary\n"
89 " for more efficient fuzzing and precise coverage data\n");
90 }
91 *P = NumGuards % kNumPCs;
92 }
93 Modules[NumModules].Start = Start;
94 Modules[NumModules].Stop = Stop;
95 NumModules++;
96}
97
98void TracePC::PrintModuleInfo() {
99 if (NumGuards) {
100 Printf("INFO: Loaded %zd modules (%zd guards): ", NumModules, NumGuards);
101 for (size_t i = 0; i < NumModules; i++)
102 Printf("%zd [%p, %p), ", Modules[i].Stop - Modules[i].Start,
103 Modules[i].Start, Modules[i].Stop);
104 Printf("\n");
105 }
106 if (NumModulesWithInline8bitCounters) {
107 Printf("INFO: Loaded %zd modules (%zd inline 8-bit counters): ",
108 NumModulesWithInline8bitCounters, NumInline8bitCounters);
109 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++)
110 Printf("%zd [%p, %p), ", ModuleCounters[i].Stop - ModuleCounters[i].Start,
111 ModuleCounters[i].Start, ModuleCounters[i].Stop);
112 Printf("\n");
113 }
114 if (NumPCTables) {
115 Printf("INFO: Loaded %zd PC tables (%zd PCs): ", NumPCTables,
116 NumPCsInPCTables);
117 for (size_t i = 0; i < NumPCTables; i++) {
118 Printf("%zd [%p,%p), ", ModulePCTable[i].Stop - ModulePCTable[i].Start,
119 ModulePCTable[i].Start, ModulePCTable[i].Stop);
120 }
121 Printf("\n");
122
123 if ((NumGuards && NumGuards != NumPCsInPCTables) ||
124 (NumInline8bitCounters && NumInline8bitCounters != NumPCsInPCTables)) {
kcce220ebb2017-10-14 00:07:11 +0000125 Printf("ERROR: The size of coverage PC tables does not match the\n"
126 "number of instrumented PCs. This might be a compiler bug,\n"
127 "please contact the libFuzzer developers.\n"
128 "Also check https://bugs.llvm.org/show_bug.cgi?id=34636\n"
129 "for possible workarounds (tl;dr: don't use the old GNU ld)\n");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000130 _Exit(1);
131 }
132 }
delcypherfcd19a82018-04-20 06:46:19 +0000133 if (size_t NumExtraCounters = ExtraCountersEnd() - ExtraCountersBegin())
134 Printf("INFO: %zd Extra Counters\n", NumExtraCounters);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000135}
136
137ATTRIBUTE_NO_SANITIZE_ALL
138void TracePC::HandleCallerCallee(uintptr_t Caller, uintptr_t Callee) {
139 const uintptr_t kBits = 12;
140 const uintptr_t kMask = (1 << kBits) - 1;
141 uintptr_t Idx = (Caller & kMask) | ((Callee & kMask) << kBits);
142 ValueProfileMap.AddValueModPrime(Idx);
143}
144
george.karpenkovdc8a8c72018-10-10 00:57:44 +0000145/// \return the address of the previous instruction.
146/// Note: the logic is copied from `sanitizer_common/sanitizer_stacktrace.h`
147inline ALWAYS_INLINE uintptr_t GetPreviousInstructionPc(uintptr_t PC) {
148#if defined(__arm__)
149 // T32 (Thumb) branch instructions might be 16 or 32 bit long,
150 // so we return (pc-2) in that case in order to be safe.
151 // For A32 mode we return (pc-4) because all instructions are 32 bit long.
152 return (PC - 3) & (~1);
153#elif defined(__powerpc__) || defined(__powerpc64__) || defined(__aarch64__)
154 // PCs are always 4 byte aligned.
155 return PC - 4;
156#elif defined(__sparc__) || defined(__mips__)
157 return PC - 8;
158#else
159 return PC - 1;
160#endif
161}
162
163/// \return the address of the next instruction.
164/// Note: the logic is copied from `sanitizer_common/sanitizer_stacktrace.cc`
165inline ALWAYS_INLINE uintptr_t GetNextInstructionPc(uintptr_t PC) {
166#if defined(__mips__)
167 return PC + 8;
168#elif defined(__powerpc__) || defined(__sparc__) || defined(__arm__) || \
169 defined(__aarch64__)
170 return PC + 4;
171#else
172 return PC + 1;
173#endif
174}
175
george.karpenkov29efa6d2017-08-21 23:25:50 +0000176void 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) {
george.karpenkovdc8a8c72018-10-10 00:57:44 +0000180 PrintPC("\tNEW_PC: %p %F %L", "\tNEW_PC: %p", GetNextInstructionPc(PC));
kcc09b3e5f2018-07-06 19:47:00 +0000181 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)
kccb3080d02018-07-19 22:00:48 +0000187 if (++ObservedFuncs[TE.PC] == 1 && NumPrintNewFuncs)
kccec9da662017-08-28 22:52:22 +0000188 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) {
metzmanb8a1ad52019-01-15 22:12:51 +0000194 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])
201 Observe(ModulePCTable[i].Start[j]);
202 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000203 } 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
kccb3080d02018-07-19 22:00:48 +0000217 for (size_t i = 0, N = Min(CoveredFuncs.size(), NumPrintNewFuncs); i < N;
218 i++) {
kcc873dc112018-06-07 21:15:24 +0000219 Printf("\tNEW_FUNC[%zd/%zd]: ", i + 1, CoveredFuncs.size());
george.karpenkovdc8a8c72018-10-10 00:57:44 +0000220 PrintPC("%p %F %L", "%p", GetNextInstructionPc(CoveredFuncs[i]));
kcc09b3e5f2018-07-06 19:47:00 +0000221 Printf("\n");
kccec9da662017-08-28 22:52:22 +0000222 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000223}
224
george.karpenkov29efa6d2017-08-21 23:25:50 +0000225
226static std::string GetModuleName(uintptr_t PC) {
227 char ModulePathRaw[4096] = ""; // What's PATH_MAX in portable C++?
228 void *OffsetRaw = nullptr;
229 if (!EF->__sanitizer_get_module_and_offset_for_pc(
230 reinterpret_cast<void *>(PC), ModulePathRaw,
231 sizeof(ModulePathRaw), &OffsetRaw))
232 return "";
233 return ModulePathRaw;
234}
235
kcc85cad3d2018-05-11 01:17:52 +0000236template<class CallBack>
237void TracePC::IterateCoveredFunctions(CallBack CB) {
238 for (size_t i = 0; i < NumPCTables; i++) {
239 auto &M = ModulePCTable[i];
240 assert(M.Start < M.Stop);
241 auto ModuleName = GetModuleName(M.Start->PC);
242 for (auto NextFE = M.Start; NextFE < M.Stop; ) {
243 auto FE = NextFE;
244 assert((FE->PCFlags & 1) && "Not a function entry point");
245 do {
246 NextFE++;
247 } while (NextFE < M.Stop && !(NextFE->PCFlags & 1));
248 if (ObservedFuncs.count(FE->PC))
kccb3080d02018-07-19 22:00:48 +0000249 CB(FE, NextFE, ObservedFuncs[FE->PC]);
kcc85cad3d2018-05-11 01:17:52 +0000250 }
251 }
252}
253
kcc3acbe072018-05-16 23:26:37 +0000254void TracePC::SetFocusFunction(const std::string &FuncName) {
255 // This function should be called once.
256 assert(FocusFunction.first > NumModulesWithInline8bitCounters);
257 if (FuncName.empty())
258 return;
259 for (size_t M = 0; M < NumModulesWithInline8bitCounters; M++) {
260 auto &PCTE = ModulePCTable[M];
261 size_t N = PCTE.Stop - PCTE.Start;
262 for (size_t I = 0; I < N; I++) {
263 if (!(PCTE.Start[I].PCFlags & 1)) continue; // not a function entry.
264 auto Name = DescribePC("%F", GetNextInstructionPc(PCTE.Start[I].PC));
265 if (Name[0] == 'i' && Name[1] == 'n' && Name[2] == ' ')
266 Name = Name.substr(3, std::string::npos);
267 if (FuncName != Name) continue;
268 Printf("INFO: Focus function is set to '%s'\n", Name.c_str());
269 FocusFunction = {M, I};
270 return;
271 }
272 }
273}
274
275bool TracePC::ObservedFocusFunction() {
276 size_t I = FocusFunction.first;
277 size_t J = FocusFunction.second;
278 if (I >= NumModulesWithInline8bitCounters)
279 return false;
280 auto &MC = ModuleCounters[I];
281 size_t Size = MC.Stop - MC.Start;
282 if (J >= Size)
283 return false;
284 return MC.Start[J] != 0;
285}
286
george.karpenkov29efa6d2017-08-21 23:25:50 +0000287void TracePC::PrintCoverage() {
288 if (!EF->__sanitizer_symbolize_pc ||
289 !EF->__sanitizer_get_module_and_offset_for_pc) {
290 Printf("INFO: __sanitizer_symbolize_pc or "
291 "__sanitizer_get_module_and_offset_for_pc is not available,"
292 " not printing coverage\n");
293 return;
294 }
295 Printf("COVERAGE:\n");
kccb3080d02018-07-19 22:00:48 +0000296 auto CoveredFunctionCallback = [&](const PCTableEntry *First,
297 const PCTableEntry *Last,
298 uintptr_t Counter) {
kcc85cad3d2018-05-11 01:17:52 +0000299 assert(First < Last);
300 auto VisualizePC = GetNextInstructionPc(First->PC);
301 std::string FileStr = DescribePC("%s", VisualizePC);
kccb3080d02018-07-19 22:00:48 +0000302 if (!IsInterestingCoverageFile(FileStr))
303 return;
kcc85cad3d2018-05-11 01:17:52 +0000304 std::string FunctionStr = DescribePC("%F", VisualizePC);
kccb3080d02018-07-19 22:00:48 +0000305 if (FunctionStr.find("in ") == 0)
306 FunctionStr = FunctionStr.substr(3);
kcc85cad3d2018-05-11 01:17:52 +0000307 std::string LineStr = DescribePC("%l", VisualizePC);
308 size_t Line = std::stoul(LineStr);
kccb3080d02018-07-19 22:00:48 +0000309 size_t NumEdges = Last - First;
morehousef64b9402018-06-25 15:59:24 +0000310 Vector<uintptr_t> UncoveredPCs;
kcc85cad3d2018-05-11 01:17:52 +0000311 for (auto TE = First; TE < Last; TE++)
312 if (!ObservedPCs.count(TE->PC))
313 UncoveredPCs.push_back(TE->PC);
kccb3080d02018-07-19 22:00:48 +0000314 Printf("COVERED_FUNC: hits: %zd", Counter);
315 Printf(" edges: %zd/%zd", NumEdges - UncoveredPCs.size(), NumEdges);
316 Printf(" %s %s:%zd\n", FunctionStr.c_str(), FileStr.c_str(), Line);
317 for (auto PC: UncoveredPCs)
kcc85cad3d2018-05-11 01:17:52 +0000318 Printf(" UNCOVERED_PC: %s\n",
319 DescribePC("%s:%l", GetNextInstructionPc(PC)).c_str());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000320 };
321
kcc85cad3d2018-05-11 01:17:52 +0000322 IterateCoveredFunctions(CoveredFunctionCallback);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000323}
324
kcca7dd2a92018-05-21 19:47:00 +0000325void TracePC::DumpCoverage() {
326 if (EF->__sanitizer_dump_coverage) {
327 Vector<uintptr_t> PCsCopy(GetNumPCs());
328 for (size_t i = 0; i < GetNumPCs(); i++)
329 PCsCopy[i] = PCs()[i] ? GetPreviousInstructionPc(PCs()[i]) : 0;
330 EF->__sanitizer_dump_coverage(PCsCopy.data(), PCsCopy.size());
331 }
332}
333
george.karpenkov29efa6d2017-08-21 23:25:50 +0000334// Value profile.
335// We keep track of various values that affect control flow.
336// These values are inserted into a bit-set-based hash map.
337// Every new bit in the map is treated as a new coverage.
338//
339// For memcmp/strcmp/etc the interesting value is the length of the common
340// prefix of the parameters.
341// For cmp instructions the interesting value is a XOR of the parameters.
342// The interesting value is mixed up with the PC and is then added to the map.
343
344ATTRIBUTE_NO_SANITIZE_ALL
345void TracePC::AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
346 size_t n, bool StopAtZero) {
347 if (!n) return;
348 size_t Len = std::min(n, Word::GetMaxSize());
349 const uint8_t *A1 = reinterpret_cast<const uint8_t *>(s1);
350 const uint8_t *A2 = reinterpret_cast<const uint8_t *>(s2);
351 uint8_t B1[Word::kMaxSize];
352 uint8_t B2[Word::kMaxSize];
353 // Copy the data into locals in this non-msan-instrumented function
354 // to avoid msan complaining further.
355 size_t Hash = 0; // Compute some simple hash of both strings.
356 for (size_t i = 0; i < Len; i++) {
357 B1[i] = A1[i];
358 B2[i] = A2[i];
359 size_t T = B1[i];
360 Hash ^= (T << 8) | B2[i];
361 }
362 size_t I = 0;
363 for (; I < Len; I++)
364 if (B1[I] != B2[I] || (StopAtZero && B1[I] == 0))
365 break;
366 size_t PC = reinterpret_cast<size_t>(caller_pc);
367 size_t Idx = (PC & 4095) | (I << 12);
368 ValueProfileMap.AddValue(Idx);
369 TORCW.Insert(Idx ^ Hash, Word(B1, Len), Word(B2, Len));
370}
371
372template <class T>
373ATTRIBUTE_TARGET_POPCNT ALWAYS_INLINE
374ATTRIBUTE_NO_SANITIZE_ALL
375void TracePC::HandleCmp(uintptr_t PC, T Arg1, T Arg2) {
376 uint64_t ArgXor = Arg1 ^ Arg2;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000377 if (sizeof(T) == 4)
dor1se6729cb2018-07-16 15:15:34 +0000378 TORC4.Insert(ArgXor, Arg1, Arg2);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000379 else if (sizeof(T) == 8)
dor1se6729cb2018-07-16 15:15:34 +0000380 TORC8.Insert(ArgXor, Arg1, Arg2);
metzman40132972019-01-09 21:46:09 +0000381 uint64_t HammingDistance = Popcountll(ArgXor); // [0,64]
382 uint64_t AbsoluteDistance = (Arg1 == Arg2 ? 0 : Clzll(Arg1 - Arg2) + 1);
kcc6d3b8e92018-08-02 00:24:49 +0000383 ValueProfileMap.AddValue(PC * 128 + HammingDistance);
384 ValueProfileMap.AddValue(PC * 128 + 64 + AbsoluteDistance);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000385}
386
387static size_t InternalStrnlen(const char *S, size_t MaxLen) {
388 size_t Len = 0;
389 for (; Len < MaxLen && S[Len]; Len++) {}
390 return Len;
391}
392
393// Finds min of (strlen(S1), strlen(S2)).
394// Needed bacause one of these strings may actually be non-zero terminated.
395static size_t InternalStrnlen2(const char *S1, const char *S2) {
396 size_t Len = 0;
397 for (; S1[Len] && S2[Len]; Len++) {}
398 return Len;
399}
400
401void TracePC::ClearInlineCounters() {
402 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
403 uint8_t *Beg = ModuleCounters[i].Start;
404 size_t Size = ModuleCounters[i].Stop - Beg;
405 memset(Beg, 0, Size);
406 }
407}
408
kcc0f3c0312017-08-22 01:50:00 +0000409ATTRIBUTE_NO_SANITIZE_ALL
kcc1c0379f2017-08-22 01:28:32 +0000410void TracePC::RecordInitialStack() {
kcc0f3c0312017-08-22 01:50:00 +0000411 int stack;
412 __sancov_lowest_stack = InitialStack = reinterpret_cast<uintptr_t>(&stack);
kcc1c0379f2017-08-22 01:28:32 +0000413}
414
415uintptr_t TracePC::GetMaxStackOffset() const {
416 return InitialStack - __sancov_lowest_stack; // Stack grows down
417}
418
george.karpenkov29efa6d2017-08-21 23:25:50 +0000419} // namespace fuzzer
420
421extern "C" {
422ATTRIBUTE_INTERFACE
423ATTRIBUTE_NO_SANITIZE_ALL
424void __sanitizer_cov_trace_pc_guard(uint32_t *Guard) {
metzman40132972019-01-09 21:46:09 +0000425 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000426 uint32_t Idx = *Guard;
427 __sancov_trace_pc_pcs[Idx] = PC;
428 __sancov_trace_pc_guard_8bit_counters[Idx]++;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000429}
430
431// Best-effort support for -fsanitize-coverage=trace-pc, which is available
432// in both Clang and GCC.
433ATTRIBUTE_INTERFACE
434ATTRIBUTE_NO_SANITIZE_ALL
435void __sanitizer_cov_trace_pc() {
metzman40132972019-01-09 21:46:09 +0000436 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000437 uintptr_t Idx = PC & (((uintptr_t)1 << fuzzer::TracePC::kTracePcBits) - 1);
438 __sancov_trace_pc_pcs[Idx] = PC;
439 __sancov_trace_pc_guard_8bit_counters[Idx]++;
440}
441
442ATTRIBUTE_INTERFACE
443void __sanitizer_cov_trace_pc_guard_init(uint32_t *Start, uint32_t *Stop) {
444 fuzzer::TPC.HandleInit(Start, Stop);
445}
446
447ATTRIBUTE_INTERFACE
448void __sanitizer_cov_8bit_counters_init(uint8_t *Start, uint8_t *Stop) {
449 fuzzer::TPC.HandleInline8bitCountersInit(Start, Stop);
450}
451
452ATTRIBUTE_INTERFACE
kcc98957a12017-08-25 19:29:47 +0000453void __sanitizer_cov_pcs_init(const uintptr_t *pcs_beg,
454 const uintptr_t *pcs_end) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000455 fuzzer::TPC.HandlePCsInit(pcs_beg, pcs_end);
456}
457
458ATTRIBUTE_INTERFACE
459ATTRIBUTE_NO_SANITIZE_ALL
460void __sanitizer_cov_trace_pc_indir(uintptr_t Callee) {
metzman40132972019-01-09 21:46:09 +0000461 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000462 fuzzer::TPC.HandleCallerCallee(PC, Callee);
463}
464
465ATTRIBUTE_INTERFACE
466ATTRIBUTE_NO_SANITIZE_ALL
467ATTRIBUTE_TARGET_POPCNT
468void __sanitizer_cov_trace_cmp8(uint64_t Arg1, uint64_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000469 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000470 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
471}
472
473ATTRIBUTE_INTERFACE
474ATTRIBUTE_NO_SANITIZE_ALL
475ATTRIBUTE_TARGET_POPCNT
476// Now the __sanitizer_cov_trace_const_cmp[1248] callbacks just mimic
477// the behaviour of __sanitizer_cov_trace_cmp[1248] ones. This, however,
478// should be changed later to make full use of instrumentation.
479void __sanitizer_cov_trace_const_cmp8(uint64_t Arg1, uint64_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000480 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000481 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
482}
483
484ATTRIBUTE_INTERFACE
485ATTRIBUTE_NO_SANITIZE_ALL
486ATTRIBUTE_TARGET_POPCNT
487void __sanitizer_cov_trace_cmp4(uint32_t Arg1, uint32_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000488 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000489 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
490}
491
492ATTRIBUTE_INTERFACE
493ATTRIBUTE_NO_SANITIZE_ALL
494ATTRIBUTE_TARGET_POPCNT
495void __sanitizer_cov_trace_const_cmp4(uint32_t Arg1, uint32_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000496 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000497 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
498}
499
500ATTRIBUTE_INTERFACE
501ATTRIBUTE_NO_SANITIZE_ALL
502ATTRIBUTE_TARGET_POPCNT
503void __sanitizer_cov_trace_cmp2(uint16_t Arg1, uint16_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000504 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000505 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
506}
507
508ATTRIBUTE_INTERFACE
509ATTRIBUTE_NO_SANITIZE_ALL
510ATTRIBUTE_TARGET_POPCNT
511void __sanitizer_cov_trace_const_cmp2(uint16_t Arg1, uint16_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000512 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000513 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
514}
515
516ATTRIBUTE_INTERFACE
517ATTRIBUTE_NO_SANITIZE_ALL
518ATTRIBUTE_TARGET_POPCNT
519void __sanitizer_cov_trace_cmp1(uint8_t Arg1, uint8_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000520 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000521 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
522}
523
524ATTRIBUTE_INTERFACE
525ATTRIBUTE_NO_SANITIZE_ALL
526ATTRIBUTE_TARGET_POPCNT
527void __sanitizer_cov_trace_const_cmp1(uint8_t Arg1, uint8_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000528 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000529 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
530}
531
532ATTRIBUTE_INTERFACE
533ATTRIBUTE_NO_SANITIZE_ALL
534ATTRIBUTE_TARGET_POPCNT
535void __sanitizer_cov_trace_switch(uint64_t Val, uint64_t *Cases) {
536 uint64_t N = Cases[0];
537 uint64_t ValSizeInBits = Cases[1];
538 uint64_t *Vals = Cases + 2;
539 // Skip the most common and the most boring case.
540 if (Vals[N - 1] < 256 && Val < 256)
541 return;
metzman40132972019-01-09 21:46:09 +0000542 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000543 size_t i;
544 uint64_t Token = 0;
545 for (i = 0; i < N; i++) {
546 Token = Val ^ Vals[i];
547 if (Val < Vals[i])
548 break;
549 }
550
551 if (ValSizeInBits == 16)
552 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint16_t>(Token), (uint16_t)(0));
553 else if (ValSizeInBits == 32)
554 fuzzer::TPC.HandleCmp(PC + i, static_cast<uint32_t>(Token), (uint32_t)(0));
555 else
556 fuzzer::TPC.HandleCmp(PC + i, Token, (uint64_t)(0));
557}
558
559ATTRIBUTE_INTERFACE
560ATTRIBUTE_NO_SANITIZE_ALL
561ATTRIBUTE_TARGET_POPCNT
562void __sanitizer_cov_trace_div4(uint32_t Val) {
metzman40132972019-01-09 21:46:09 +0000563 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000564 fuzzer::TPC.HandleCmp(PC, Val, (uint32_t)0);
565}
566
567ATTRIBUTE_INTERFACE
568ATTRIBUTE_NO_SANITIZE_ALL
569ATTRIBUTE_TARGET_POPCNT
570void __sanitizer_cov_trace_div8(uint64_t Val) {
metzman40132972019-01-09 21:46:09 +0000571 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000572 fuzzer::TPC.HandleCmp(PC, Val, (uint64_t)0);
573}
574
575ATTRIBUTE_INTERFACE
576ATTRIBUTE_NO_SANITIZE_ALL
577ATTRIBUTE_TARGET_POPCNT
578void __sanitizer_cov_trace_gep(uintptr_t Idx) {
metzman40132972019-01-09 21:46:09 +0000579 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000580 fuzzer::TPC.HandleCmp(PC, Idx, (uintptr_t)0);
581}
582
583ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
584void __sanitizer_weak_hook_memcmp(void *caller_pc, const void *s1,
585 const void *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000586 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000587 if (result == 0) return; // No reason to mutate.
588 if (n <= 1) return; // Not interesting.
589 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/false);
590}
591
592ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
593void __sanitizer_weak_hook_strncmp(void *caller_pc, const char *s1,
594 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000595 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000596 if (result == 0) return; // No reason to mutate.
597 size_t Len1 = fuzzer::InternalStrnlen(s1, n);
598 size_t Len2 = fuzzer::InternalStrnlen(s2, n);
599 n = std::min(n, Len1);
600 n = std::min(n, Len2);
601 if (n <= 1) return; // Not interesting.
602 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/true);
603}
604
605ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
606void __sanitizer_weak_hook_strcmp(void *caller_pc, const char *s1,
dor1se6729cb2018-07-16 15:15:34 +0000607 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000608 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000609 if (result == 0) return; // No reason to mutate.
610 size_t N = fuzzer::InternalStrnlen2(s1, s2);
611 if (N <= 1) return; // Not interesting.
612 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, N, /*StopAtZero*/true);
613}
614
615ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
616void __sanitizer_weak_hook_strncasecmp(void *called_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 return __sanitizer_weak_hook_strncmp(called_pc, s1, s2, n, result);
620}
621
622ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
623void __sanitizer_weak_hook_strcasecmp(void *called_pc, const char *s1,
624 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000625 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000626 return __sanitizer_weak_hook_strcmp(called_pc, s1, s2, result);
627}
628
629ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
630void __sanitizer_weak_hook_strstr(void *called_pc, const char *s1,
631 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000632 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000633 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
634}
635
636ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
637void __sanitizer_weak_hook_strcasestr(void *called_pc, const char *s1,
638 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000639 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000640 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
641}
642
643ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
644void __sanitizer_weak_hook_memmem(void *called_pc, const void *s1, size_t len1,
645 const void *s2, size_t len2, void *result) {
morehousec6ee8752018-07-17 16:12:00 +0000646 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000647 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), len2);
648}
649} // extern "C"