blob: 659c165b37f9dd55f9327b088d869fe5d344ac24 [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
kcc1c0379f2017-08-22 01:28:32 +000026// Used by -fsanitize-coverage=stack-depth to track stack depth
morehouse68f46432018-08-30 15:54:44 +000027ATTRIBUTES_INTERFACE_TLS_INITIAL_EXEC uintptr_t __sancov_lowest_stack;
kcc1c0379f2017-08-22 01:28:32 +000028
george.karpenkov29efa6d2017-08-21 23:25:50 +000029namespace fuzzer {
30
31TracePC TPC;
32
george.karpenkov29efa6d2017-08-21 23:25:50 +000033size_t TracePC::GetTotalPCCoverage() {
kcc569b3fa2019-01-29 23:53:28 +000034 return ObservedPCs.size();
george.karpenkov29efa6d2017-08-21 23:25:50 +000035}
36
37
38void TracePC::HandleInline8bitCountersInit(uint8_t *Start, uint8_t *Stop) {
39 if (Start == Stop) return;
40 if (NumModulesWithInline8bitCounters &&
41 ModuleCounters[NumModulesWithInline8bitCounters-1].Start == Start) return;
42 assert(NumModulesWithInline8bitCounters <
43 sizeof(ModuleCounters) / sizeof(ModuleCounters[0]));
44 ModuleCounters[NumModulesWithInline8bitCounters++] = {Start, Stop};
45 NumInline8bitCounters += Stop - Start;
46}
47
kcc98957a12017-08-25 19:29:47 +000048void TracePC::HandlePCsInit(const uintptr_t *Start, const uintptr_t *Stop) {
49 const PCTableEntry *B = reinterpret_cast<const PCTableEntry *>(Start);
50 const PCTableEntry *E = reinterpret_cast<const PCTableEntry *>(Stop);
george.karpenkov29efa6d2017-08-21 23:25:50 +000051 if (NumPCTables && ModulePCTable[NumPCTables - 1].Start == B) return;
52 assert(NumPCTables < sizeof(ModulePCTable) / sizeof(ModulePCTable[0]));
53 ModulePCTable[NumPCTables++] = {B, E};
54 NumPCsInPCTables += E - B;
55}
56
george.karpenkov29efa6d2017-08-21 23:25:50 +000057void TracePC::PrintModuleInfo() {
george.karpenkov29efa6d2017-08-21 23:25:50 +000058 if (NumModulesWithInline8bitCounters) {
59 Printf("INFO: Loaded %zd modules (%zd inline 8-bit counters): ",
60 NumModulesWithInline8bitCounters, NumInline8bitCounters);
61 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++)
62 Printf("%zd [%p, %p), ", ModuleCounters[i].Stop - ModuleCounters[i].Start,
63 ModuleCounters[i].Start, ModuleCounters[i].Stop);
64 Printf("\n");
65 }
66 if (NumPCTables) {
67 Printf("INFO: Loaded %zd PC tables (%zd PCs): ", NumPCTables,
68 NumPCsInPCTables);
69 for (size_t i = 0; i < NumPCTables; i++) {
70 Printf("%zd [%p,%p), ", ModulePCTable[i].Stop - ModulePCTable[i].Start,
71 ModulePCTable[i].Start, ModulePCTable[i].Stop);
72 }
73 Printf("\n");
74
kcc569b3fa2019-01-29 23:53:28 +000075 if (NumInline8bitCounters && NumInline8bitCounters != NumPCsInPCTables) {
kcce220ebb2017-10-14 00:07:11 +000076 Printf("ERROR: The size of coverage PC tables does not match the\n"
77 "number of instrumented PCs. This might be a compiler bug,\n"
78 "please contact the libFuzzer developers.\n"
79 "Also check https://bugs.llvm.org/show_bug.cgi?id=34636\n"
80 "for possible workarounds (tl;dr: don't use the old GNU ld)\n");
george.karpenkov29efa6d2017-08-21 23:25:50 +000081 _Exit(1);
82 }
83 }
delcypherfcd19a82018-04-20 06:46:19 +000084 if (size_t NumExtraCounters = ExtraCountersEnd() - ExtraCountersBegin())
85 Printf("INFO: %zd Extra Counters\n", NumExtraCounters);
george.karpenkov29efa6d2017-08-21 23:25:50 +000086}
87
88ATTRIBUTE_NO_SANITIZE_ALL
89void TracePC::HandleCallerCallee(uintptr_t Caller, uintptr_t Callee) {
90 const uintptr_t kBits = 12;
91 const uintptr_t kMask = (1 << kBits) - 1;
92 uintptr_t Idx = (Caller & kMask) | ((Callee & kMask) << kBits);
93 ValueProfileMap.AddValueModPrime(Idx);
94}
95
george.karpenkovdc8a8c72018-10-10 00:57:44 +000096/// \return the address of the previous instruction.
97/// Note: the logic is copied from `sanitizer_common/sanitizer_stacktrace.h`
98inline ALWAYS_INLINE uintptr_t GetPreviousInstructionPc(uintptr_t PC) {
99#if defined(__arm__)
100 // T32 (Thumb) branch instructions might be 16 or 32 bit long,
101 // so we return (pc-2) in that case in order to be safe.
102 // For A32 mode we return (pc-4) because all instructions are 32 bit long.
103 return (PC - 3) & (~1);
104#elif defined(__powerpc__) || defined(__powerpc64__) || defined(__aarch64__)
105 // PCs are always 4 byte aligned.
106 return PC - 4;
107#elif defined(__sparc__) || defined(__mips__)
108 return PC - 8;
109#else
110 return PC - 1;
111#endif
112}
113
114/// \return the address of the next instruction.
115/// Note: the logic is copied from `sanitizer_common/sanitizer_stacktrace.cc`
116inline ALWAYS_INLINE uintptr_t GetNextInstructionPc(uintptr_t PC) {
117#if defined(__mips__)
118 return PC + 8;
119#elif defined(__powerpc__) || defined(__sparc__) || defined(__arm__) || \
120 defined(__aarch64__)
121 return PC + 4;
122#else
123 return PC + 1;
124#endif
125}
126
george.karpenkov29efa6d2017-08-21 23:25:50 +0000127void TracePC::UpdateObservedPCs() {
kccec9da662017-08-28 22:52:22 +0000128 Vector<uintptr_t> CoveredFuncs;
kcc00da6482017-08-25 20:09:25 +0000129 auto ObservePC = [&](uintptr_t PC) {
kcc09b3e5f2018-07-06 19:47:00 +0000130 if (ObservedPCs.insert(PC).second && DoPrintNewPCs) {
george.karpenkovdc8a8c72018-10-10 00:57:44 +0000131 PrintPC("\tNEW_PC: %p %F %L", "\tNEW_PC: %p", GetNextInstructionPc(PC));
kcc09b3e5f2018-07-06 19:47:00 +0000132 Printf("\n");
133 }
kcc1c0379f2017-08-22 01:28:32 +0000134 };
kcc00da6482017-08-25 20:09:25 +0000135
136 auto Observe = [&](const PCTableEntry &TE) {
137 if (TE.PCFlags & 1)
kccb3080d02018-07-19 22:00:48 +0000138 if (++ObservedFuncs[TE.PC] == 1 && NumPrintNewFuncs)
kccec9da662017-08-28 22:52:22 +0000139 CoveredFuncs.push_back(TE.PC);
kcc00da6482017-08-25 20:09:25 +0000140 ObservePC(TE.PC);
141 };
142
george.karpenkov29efa6d2017-08-21 23:25:50 +0000143 if (NumPCsInPCTables) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000144 if (NumInline8bitCounters == NumPCsInPCTables) {
metzmanb8a1ad52019-01-15 22:12:51 +0000145 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
146 uint8_t *Beg = ModuleCounters[i].Start;
147 size_t Size = ModuleCounters[i].Stop - Beg;
148 assert(Size ==
149 (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
150 for (size_t j = 0; j < Size; j++)
151 if (Beg[j])
152 Observe(ModulePCTable[i].Start[j]);
153 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000154 }
155 }
kccec9da662017-08-28 22:52:22 +0000156
kccb3080d02018-07-19 22:00:48 +0000157 for (size_t i = 0, N = Min(CoveredFuncs.size(), NumPrintNewFuncs); i < N;
158 i++) {
kcc873dc112018-06-07 21:15:24 +0000159 Printf("\tNEW_FUNC[%zd/%zd]: ", i + 1, CoveredFuncs.size());
george.karpenkovdc8a8c72018-10-10 00:57:44 +0000160 PrintPC("%p %F %L", "%p", GetNextInstructionPc(CoveredFuncs[i]));
kcc09b3e5f2018-07-06 19:47:00 +0000161 Printf("\n");
kccec9da662017-08-28 22:52:22 +0000162 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000163}
164
george.karpenkov29efa6d2017-08-21 23:25:50 +0000165
166static std::string GetModuleName(uintptr_t PC) {
167 char ModulePathRaw[4096] = ""; // What's PATH_MAX in portable C++?
168 void *OffsetRaw = nullptr;
169 if (!EF->__sanitizer_get_module_and_offset_for_pc(
170 reinterpret_cast<void *>(PC), ModulePathRaw,
171 sizeof(ModulePathRaw), &OffsetRaw))
172 return "";
173 return ModulePathRaw;
174}
175
kcc85cad3d2018-05-11 01:17:52 +0000176template<class CallBack>
177void TracePC::IterateCoveredFunctions(CallBack CB) {
178 for (size_t i = 0; i < NumPCTables; i++) {
179 auto &M = ModulePCTable[i];
180 assert(M.Start < M.Stop);
181 auto ModuleName = GetModuleName(M.Start->PC);
182 for (auto NextFE = M.Start; NextFE < M.Stop; ) {
183 auto FE = NextFE;
184 assert((FE->PCFlags & 1) && "Not a function entry point");
185 do {
186 NextFE++;
187 } while (NextFE < M.Stop && !(NextFE->PCFlags & 1));
kccfb675a72019-01-26 01:33:09 +0000188 CB(FE, NextFE, ObservedFuncs[FE->PC]);
kcc85cad3d2018-05-11 01:17:52 +0000189 }
190 }
191}
192
kcc3acbe072018-05-16 23:26:37 +0000193void TracePC::SetFocusFunction(const std::string &FuncName) {
194 // This function should be called once.
195 assert(FocusFunction.first > NumModulesWithInline8bitCounters);
196 if (FuncName.empty())
197 return;
198 for (size_t M = 0; M < NumModulesWithInline8bitCounters; M++) {
199 auto &PCTE = ModulePCTable[M];
200 size_t N = PCTE.Stop - PCTE.Start;
201 for (size_t I = 0; I < N; I++) {
202 if (!(PCTE.Start[I].PCFlags & 1)) continue; // not a function entry.
203 auto Name = DescribePC("%F", GetNextInstructionPc(PCTE.Start[I].PC));
204 if (Name[0] == 'i' && Name[1] == 'n' && Name[2] == ' ')
205 Name = Name.substr(3, std::string::npos);
206 if (FuncName != Name) continue;
207 Printf("INFO: Focus function is set to '%s'\n", Name.c_str());
208 FocusFunction = {M, I};
209 return;
210 }
211 }
212}
213
214bool TracePC::ObservedFocusFunction() {
215 size_t I = FocusFunction.first;
216 size_t J = FocusFunction.second;
217 if (I >= NumModulesWithInline8bitCounters)
218 return false;
219 auto &MC = ModuleCounters[I];
220 size_t Size = MC.Stop - MC.Start;
221 if (J >= Size)
222 return false;
223 return MC.Start[J] != 0;
224}
225
george.karpenkov29efa6d2017-08-21 23:25:50 +0000226void TracePC::PrintCoverage() {
227 if (!EF->__sanitizer_symbolize_pc ||
228 !EF->__sanitizer_get_module_and_offset_for_pc) {
229 Printf("INFO: __sanitizer_symbolize_pc or "
230 "__sanitizer_get_module_and_offset_for_pc is not available,"
231 " not printing coverage\n");
232 return;
233 }
234 Printf("COVERAGE:\n");
kccb3080d02018-07-19 22:00:48 +0000235 auto CoveredFunctionCallback = [&](const PCTableEntry *First,
236 const PCTableEntry *Last,
237 uintptr_t Counter) {
kcc85cad3d2018-05-11 01:17:52 +0000238 assert(First < Last);
239 auto VisualizePC = GetNextInstructionPc(First->PC);
240 std::string FileStr = DescribePC("%s", VisualizePC);
kccb3080d02018-07-19 22:00:48 +0000241 if (!IsInterestingCoverageFile(FileStr))
242 return;
kcc85cad3d2018-05-11 01:17:52 +0000243 std::string FunctionStr = DescribePC("%F", VisualizePC);
kccb3080d02018-07-19 22:00:48 +0000244 if (FunctionStr.find("in ") == 0)
245 FunctionStr = FunctionStr.substr(3);
kcc85cad3d2018-05-11 01:17:52 +0000246 std::string LineStr = DescribePC("%l", VisualizePC);
247 size_t Line = std::stoul(LineStr);
kccb3080d02018-07-19 22:00:48 +0000248 size_t NumEdges = Last - First;
morehousef64b9402018-06-25 15:59:24 +0000249 Vector<uintptr_t> UncoveredPCs;
kcc85cad3d2018-05-11 01:17:52 +0000250 for (auto TE = First; TE < Last; TE++)
251 if (!ObservedPCs.count(TE->PC))
252 UncoveredPCs.push_back(TE->PC);
kccfb675a72019-01-26 01:33:09 +0000253 Printf("%sCOVERED_FUNC: hits: %zd", Counter ? "" : "UN", Counter);
kccb3080d02018-07-19 22:00:48 +0000254 Printf(" edges: %zd/%zd", NumEdges - UncoveredPCs.size(), NumEdges);
255 Printf(" %s %s:%zd\n", FunctionStr.c_str(), FileStr.c_str(), Line);
kccfb675a72019-01-26 01:33:09 +0000256 if (Counter)
257 for (auto PC : UncoveredPCs)
258 Printf(" UNCOVERED_PC: %s\n",
259 DescribePC("%s:%l", GetNextInstructionPc(PC)).c_str());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000260 };
261
kcc85cad3d2018-05-11 01:17:52 +0000262 IterateCoveredFunctions(CoveredFunctionCallback);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000263}
264
george.karpenkov29efa6d2017-08-21 23:25:50 +0000265// Value profile.
266// We keep track of various values that affect control flow.
267// These values are inserted into a bit-set-based hash map.
268// Every new bit in the map is treated as a new coverage.
269//
270// For memcmp/strcmp/etc the interesting value is the length of the common
271// prefix of the parameters.
272// For cmp instructions the interesting value is a XOR of the parameters.
273// The interesting value is mixed up with the PC and is then added to the map.
274
275ATTRIBUTE_NO_SANITIZE_ALL
276void TracePC::AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
277 size_t n, bool StopAtZero) {
278 if (!n) return;
279 size_t Len = std::min(n, Word::GetMaxSize());
280 const uint8_t *A1 = reinterpret_cast<const uint8_t *>(s1);
281 const uint8_t *A2 = reinterpret_cast<const uint8_t *>(s2);
282 uint8_t B1[Word::kMaxSize];
283 uint8_t B2[Word::kMaxSize];
284 // Copy the data into locals in this non-msan-instrumented function
285 // to avoid msan complaining further.
286 size_t Hash = 0; // Compute some simple hash of both strings.
287 for (size_t i = 0; i < Len; i++) {
288 B1[i] = A1[i];
289 B2[i] = A2[i];
290 size_t T = B1[i];
291 Hash ^= (T << 8) | B2[i];
292 }
293 size_t I = 0;
294 for (; I < Len; I++)
295 if (B1[I] != B2[I] || (StopAtZero && B1[I] == 0))
296 break;
297 size_t PC = reinterpret_cast<size_t>(caller_pc);
298 size_t Idx = (PC & 4095) | (I << 12);
299 ValueProfileMap.AddValue(Idx);
300 TORCW.Insert(Idx ^ Hash, Word(B1, Len), Word(B2, Len));
301}
302
303template <class T>
304ATTRIBUTE_TARGET_POPCNT ALWAYS_INLINE
305ATTRIBUTE_NO_SANITIZE_ALL
306void TracePC::HandleCmp(uintptr_t PC, T Arg1, T Arg2) {
307 uint64_t ArgXor = Arg1 ^ Arg2;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000308 if (sizeof(T) == 4)
dor1se6729cb2018-07-16 15:15:34 +0000309 TORC4.Insert(ArgXor, Arg1, Arg2);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000310 else if (sizeof(T) == 8)
dor1se6729cb2018-07-16 15:15:34 +0000311 TORC8.Insert(ArgXor, Arg1, Arg2);
metzman40132972019-01-09 21:46:09 +0000312 uint64_t HammingDistance = Popcountll(ArgXor); // [0,64]
313 uint64_t AbsoluteDistance = (Arg1 == Arg2 ? 0 : Clzll(Arg1 - Arg2) + 1);
kcc6d3b8e92018-08-02 00:24:49 +0000314 ValueProfileMap.AddValue(PC * 128 + HammingDistance);
315 ValueProfileMap.AddValue(PC * 128 + 64 + AbsoluteDistance);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000316}
317
318static size_t InternalStrnlen(const char *S, size_t MaxLen) {
319 size_t Len = 0;
320 for (; Len < MaxLen && S[Len]; Len++) {}
321 return Len;
322}
323
324// Finds min of (strlen(S1), strlen(S2)).
325// Needed bacause one of these strings may actually be non-zero terminated.
326static size_t InternalStrnlen2(const char *S1, const char *S2) {
327 size_t Len = 0;
328 for (; S1[Len] && S2[Len]; Len++) {}
329 return Len;
330}
331
332void TracePC::ClearInlineCounters() {
333 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
334 uint8_t *Beg = ModuleCounters[i].Start;
335 size_t Size = ModuleCounters[i].Stop - Beg;
336 memset(Beg, 0, Size);
337 }
338}
339
kcc0f3c0312017-08-22 01:50:00 +0000340ATTRIBUTE_NO_SANITIZE_ALL
kcc1c0379f2017-08-22 01:28:32 +0000341void TracePC::RecordInitialStack() {
kcc0f3c0312017-08-22 01:50:00 +0000342 int stack;
343 __sancov_lowest_stack = InitialStack = reinterpret_cast<uintptr_t>(&stack);
kcc1c0379f2017-08-22 01:28:32 +0000344}
345
346uintptr_t TracePC::GetMaxStackOffset() const {
347 return InitialStack - __sancov_lowest_stack; // Stack grows down
348}
349
kcc02db23c2019-01-29 23:37:20 +0000350void WarnAboutDeprecatedInstrumentation(const char *flag) {
351 Printf("libFuzzer does not support %s any more.\n"
352 "Please either migrate to a compiler that supports -fsanitize=fuzzer\n"
353 "or use an older version of libFuzzer\n", flag);
354 exit(1);
355}
356
george.karpenkov29efa6d2017-08-21 23:25:50 +0000357} // namespace fuzzer
358
359extern "C" {
360ATTRIBUTE_INTERFACE
361ATTRIBUTE_NO_SANITIZE_ALL
362void __sanitizer_cov_trace_pc_guard(uint32_t *Guard) {
kcc02db23c2019-01-29 23:37:20 +0000363 fuzzer::WarnAboutDeprecatedInstrumentation("-fsanitize-coverage=trace-pc");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000364}
365
366// Best-effort support for -fsanitize-coverage=trace-pc, which is available
367// in both Clang and GCC.
368ATTRIBUTE_INTERFACE
369ATTRIBUTE_NO_SANITIZE_ALL
370void __sanitizer_cov_trace_pc() {
kcc02db23c2019-01-29 23:37:20 +0000371 fuzzer::WarnAboutDeprecatedInstrumentation(
372 "-fsanitize-coverage=trace-pc-guard");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000373}
374
375ATTRIBUTE_INTERFACE
376void __sanitizer_cov_trace_pc_guard_init(uint32_t *Start, uint32_t *Stop) {
kcc02db23c2019-01-29 23:37:20 +0000377 fuzzer::WarnAboutDeprecatedInstrumentation(
378 "-fsanitize-coverage=trace-pc-guard");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000379}
380
381ATTRIBUTE_INTERFACE
382void __sanitizer_cov_8bit_counters_init(uint8_t *Start, uint8_t *Stop) {
383 fuzzer::TPC.HandleInline8bitCountersInit(Start, Stop);
384}
385
386ATTRIBUTE_INTERFACE
kcc98957a12017-08-25 19:29:47 +0000387void __sanitizer_cov_pcs_init(const uintptr_t *pcs_beg,
388 const uintptr_t *pcs_end) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000389 fuzzer::TPC.HandlePCsInit(pcs_beg, pcs_end);
390}
391
392ATTRIBUTE_INTERFACE
393ATTRIBUTE_NO_SANITIZE_ALL
394void __sanitizer_cov_trace_pc_indir(uintptr_t Callee) {
metzman40132972019-01-09 21:46:09 +0000395 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000396 fuzzer::TPC.HandleCallerCallee(PC, Callee);
397}
398
399ATTRIBUTE_INTERFACE
400ATTRIBUTE_NO_SANITIZE_ALL
401ATTRIBUTE_TARGET_POPCNT
402void __sanitizer_cov_trace_cmp8(uint64_t Arg1, uint64_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000403 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000404 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
405}
406
407ATTRIBUTE_INTERFACE
408ATTRIBUTE_NO_SANITIZE_ALL
409ATTRIBUTE_TARGET_POPCNT
410// Now the __sanitizer_cov_trace_const_cmp[1248] callbacks just mimic
411// the behaviour of __sanitizer_cov_trace_cmp[1248] ones. This, however,
412// should be changed later to make full use of instrumentation.
413void __sanitizer_cov_trace_const_cmp8(uint64_t Arg1, uint64_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000414 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000415 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
416}
417
418ATTRIBUTE_INTERFACE
419ATTRIBUTE_NO_SANITIZE_ALL
420ATTRIBUTE_TARGET_POPCNT
421void __sanitizer_cov_trace_cmp4(uint32_t Arg1, uint32_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000422 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000423 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
424}
425
426ATTRIBUTE_INTERFACE
427ATTRIBUTE_NO_SANITIZE_ALL
428ATTRIBUTE_TARGET_POPCNT
429void __sanitizer_cov_trace_const_cmp4(uint32_t Arg1, uint32_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000430 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000431 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
432}
433
434ATTRIBUTE_INTERFACE
435ATTRIBUTE_NO_SANITIZE_ALL
436ATTRIBUTE_TARGET_POPCNT
437void __sanitizer_cov_trace_cmp2(uint16_t Arg1, uint16_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000438 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000439 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
440}
441
442ATTRIBUTE_INTERFACE
443ATTRIBUTE_NO_SANITIZE_ALL
444ATTRIBUTE_TARGET_POPCNT
445void __sanitizer_cov_trace_const_cmp2(uint16_t Arg1, uint16_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000446 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000447 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
448}
449
450ATTRIBUTE_INTERFACE
451ATTRIBUTE_NO_SANITIZE_ALL
452ATTRIBUTE_TARGET_POPCNT
453void __sanitizer_cov_trace_cmp1(uint8_t Arg1, uint8_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000454 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000455 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
456}
457
458ATTRIBUTE_INTERFACE
459ATTRIBUTE_NO_SANITIZE_ALL
460ATTRIBUTE_TARGET_POPCNT
461void __sanitizer_cov_trace_const_cmp1(uint8_t Arg1, uint8_t Arg2) {
metzman40132972019-01-09 21:46:09 +0000462 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000463 fuzzer::TPC.HandleCmp(PC, Arg1, Arg2);
464}
465
466ATTRIBUTE_INTERFACE
467ATTRIBUTE_NO_SANITIZE_ALL
468ATTRIBUTE_TARGET_POPCNT
469void __sanitizer_cov_trace_switch(uint64_t Val, uint64_t *Cases) {
470 uint64_t N = Cases[0];
471 uint64_t ValSizeInBits = Cases[1];
472 uint64_t *Vals = Cases + 2;
kcc59c3be42019-01-24 21:08:54 +0000473 // Skip the most common and the most boring case: all switch values are small.
474 // We may want to skip this at compile-time, but it will make the
475 // instrumentation less general.
476 if (Vals[N - 1] < 256)
477 return;
478 // Also skip small inputs values, they won't give good signal.
479 if (Val < 256)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000480 return;
metzman40132972019-01-09 21:46:09 +0000481 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000482 size_t i;
kcc59c3be42019-01-24 21:08:54 +0000483 uint64_t Smaller = 0;
484 uint64_t Larger = ~(uint64_t)0;
485 // Find two switch values such that Smaller < Val < Larger.
486 // Use 0 and 0xfff..f as the defaults.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000487 for (i = 0; i < N; i++) {
kcc59c3be42019-01-24 21:08:54 +0000488 if (Val < Vals[i]) {
489 Larger = Vals[i];
george.karpenkov29efa6d2017-08-21 23:25:50 +0000490 break;
kcc59c3be42019-01-24 21:08:54 +0000491 }
492 if (Val > Vals[i]) Smaller = Vals[i];
george.karpenkov29efa6d2017-08-21 23:25:50 +0000493 }
494
kcc59c3be42019-01-24 21:08:54 +0000495 // Apply HandleCmp to {Val,Smaller} and {Val, Larger},
496 // use i as the PC modifier for HandleCmp.
497 if (ValSizeInBits == 16) {
498 fuzzer::TPC.HandleCmp(PC + 2 * i, static_cast<uint16_t>(Val),
499 (uint16_t)(Smaller));
500 fuzzer::TPC.HandleCmp(PC + 2 * i + 1, static_cast<uint16_t>(Val),
501 (uint16_t)(Larger));
502 } else if (ValSizeInBits == 32) {
503 fuzzer::TPC.HandleCmp(PC + 2 * i, static_cast<uint32_t>(Val),
504 (uint32_t)(Smaller));
505 fuzzer::TPC.HandleCmp(PC + 2 * i + 1, static_cast<uint32_t>(Val),
506 (uint32_t)(Larger));
507 } else {
508 fuzzer::TPC.HandleCmp(PC + 2*i, Val, Smaller);
509 fuzzer::TPC.HandleCmp(PC + 2*i + 1, Val, Larger);
510 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000511}
512
513ATTRIBUTE_INTERFACE
514ATTRIBUTE_NO_SANITIZE_ALL
515ATTRIBUTE_TARGET_POPCNT
516void __sanitizer_cov_trace_div4(uint32_t Val) {
metzman40132972019-01-09 21:46:09 +0000517 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000518 fuzzer::TPC.HandleCmp(PC, Val, (uint32_t)0);
519}
520
521ATTRIBUTE_INTERFACE
522ATTRIBUTE_NO_SANITIZE_ALL
523ATTRIBUTE_TARGET_POPCNT
524void __sanitizer_cov_trace_div8(uint64_t Val) {
metzman40132972019-01-09 21:46:09 +0000525 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000526 fuzzer::TPC.HandleCmp(PC, Val, (uint64_t)0);
527}
528
529ATTRIBUTE_INTERFACE
530ATTRIBUTE_NO_SANITIZE_ALL
531ATTRIBUTE_TARGET_POPCNT
532void __sanitizer_cov_trace_gep(uintptr_t Idx) {
metzman40132972019-01-09 21:46:09 +0000533 uintptr_t PC = reinterpret_cast<uintptr_t>(GET_CALLER_PC());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000534 fuzzer::TPC.HandleCmp(PC, Idx, (uintptr_t)0);
535}
536
537ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
538void __sanitizer_weak_hook_memcmp(void *caller_pc, const void *s1,
539 const void *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000540 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000541 if (result == 0) return; // No reason to mutate.
542 if (n <= 1) return; // Not interesting.
543 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/false);
544}
545
546ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
547void __sanitizer_weak_hook_strncmp(void *caller_pc, const char *s1,
548 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000549 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000550 if (result == 0) return; // No reason to mutate.
551 size_t Len1 = fuzzer::InternalStrnlen(s1, n);
552 size_t Len2 = fuzzer::InternalStrnlen(s2, n);
553 n = std::min(n, Len1);
554 n = std::min(n, Len2);
555 if (n <= 1) return; // Not interesting.
556 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, n, /*StopAtZero*/true);
557}
558
559ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
560void __sanitizer_weak_hook_strcmp(void *caller_pc, const char *s1,
dor1se6729cb2018-07-16 15:15:34 +0000561 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000562 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000563 if (result == 0) return; // No reason to mutate.
564 size_t N = fuzzer::InternalStrnlen2(s1, s2);
565 if (N <= 1) return; // Not interesting.
566 fuzzer::TPC.AddValueForMemcmp(caller_pc, s1, s2, N, /*StopAtZero*/true);
567}
568
569ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
570void __sanitizer_weak_hook_strncasecmp(void *called_pc, const char *s1,
571 const char *s2, size_t n, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000572 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000573 return __sanitizer_weak_hook_strncmp(called_pc, s1, s2, n, result);
574}
575
576ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
577void __sanitizer_weak_hook_strcasecmp(void *called_pc, const char *s1,
578 const char *s2, int result) {
morehousec6ee8752018-07-17 16:12:00 +0000579 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000580 return __sanitizer_weak_hook_strcmp(called_pc, s1, s2, result);
581}
582
583ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
584void __sanitizer_weak_hook_strstr(void *called_pc, const char *s1,
585 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000586 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000587 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
588}
589
590ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
591void __sanitizer_weak_hook_strcasestr(void *called_pc, const char *s1,
592 const char *s2, char *result) {
morehousec6ee8752018-07-17 16:12:00 +0000593 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000594 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), strlen(s2));
595}
596
597ATTRIBUTE_INTERFACE ATTRIBUTE_NO_SANITIZE_MEMORY
598void __sanitizer_weak_hook_memmem(void *called_pc, const void *s1, size_t len1,
599 const void *s2, size_t len2, void *result) {
morehousec6ee8752018-07-17 16:12:00 +0000600 if (!fuzzer::RunningUserCallback) return;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000601 fuzzer::TPC.MMT.Add(reinterpret_cast<const uint8_t *>(s2), len2);
602}
603} // extern "C"