blob: 6523fa06005c48ace8f865a857b10f383c607cf5 [file] [log] [blame]
Kostya Serebryany6f5a8042016-09-21 01:50:50 +00001//===- FuzzerTracePC.h - Internal header for the Fuzzer ---------*- C++ -* ===//
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// fuzzer::TracePC
10//===----------------------------------------------------------------------===//
11
12#ifndef LLVM_FUZZER_TRACE_PC
13#define LLVM_FUZZER_TRACE_PC
14
15#include "FuzzerDefs.h"
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +000016#include "FuzzerDictionary.h"
Kostya Serebryany86586182016-09-21 21:17:23 +000017#include "FuzzerValueBitMap.h"
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +000018
Marcos Pividori178fe582016-12-13 17:46:11 +000019#include <set>
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000020
21namespace fuzzer {
22
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +000023// TableOfRecentCompares (TORC) remembers the most recently performed
24// comparisons of type T.
25// We record the arguments of CMP instructions in this table unconditionally
26// because it seems cheaper this way than to compute some expensive
27// conditions inside __sanitizer_cov_trace_cmp*.
28// After the unit has been executed we may decide to use the contents of
29// this table to populate a Dictionary.
30template<class T, size_t kSizeT>
31struct TableOfRecentCompares {
32 static const size_t kSize = kSizeT;
Kostya Serebryany3364f902016-10-25 02:04:43 +000033 struct Pair {
34 T A, B;
35 };
Kostya Serebryany7f058972017-01-27 00:09:59 +000036 ATTRIBUTE_NO_SANITIZE_ALL
Kostya Serebryanyaf2dfce2017-03-31 02:21:28 +000037 void Insert(size_t Idx, const T &Arg1, const T &Arg2) {
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +000038 Idx = Idx % kSize;
Kostya Serebryany3364f902016-10-25 02:04:43 +000039 Table[Idx].A = Arg1;
40 Table[Idx].B = Arg2;
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +000041 }
Kostya Serebryany3364f902016-10-25 02:04:43 +000042
43 Pair Get(size_t I) { return Table[I % kSize]; }
44
45 Pair Table[kSize];
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +000046};
47
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000048class TracePC {
49 public:
Kostya Serebryany68382d02017-02-02 19:56:01 +000050 static const size_t kNumPCs = 1 << 21;
Kostya Serebryanyd7d1d512017-03-30 01:27:20 +000051 // How many bits of PC are used from __sanitizer_cov_trace_pc.
52 static const size_t kTracePcBits = 18;
Kostya Serebryany2c556132016-09-30 01:19:56 +000053
Kostya Serebryanya9b0dd02016-09-29 17:43:24 +000054 void HandleInit(uint32_t *start, uint32_t *stop);
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000055 void HandleCallerCallee(uintptr_t Caller, uintptr_t Callee);
Mike Aizatsky0e37f8e2017-01-17 23:11:32 +000056 template <class T> void HandleCmp(uintptr_t PC, T Arg1, T Arg2);
Kostya Serebryany275e2602016-10-25 23:52:25 +000057 size_t GetTotalPCCoverage();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000058 void SetUseCounters(bool UC) { UseCounters = UC; }
Kostya Serebryanyab73c692016-09-23 00:46:18 +000059 void SetUseValueProfile(bool VP) { UseValueProfile = VP; }
Kostya Serebryanya5b2e542016-10-26 00:20:51 +000060 void SetPrintNewPCs(bool P) { DoPrintNewPCs = P; }
Kostya Serebryanya617e162017-03-31 04:17:45 +000061 template <class Callback> void CollectFeatures(Callback CB) const;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000062
Kostya Serebryanyce1cab12016-09-23 02:18:59 +000063 void ResetMaps() {
Kostya Serebryany16a145f2016-09-23 01:58:51 +000064 ValueProfileMap.Reset();
Kostya Serebryany68382d02017-02-02 19:56:01 +000065 memset(Counters(), 0, GetNumPCs());
Kostya Serebryany6ca44f92017-03-23 22:43:12 +000066 ClearExtraCounters();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000067 }
68
Kostya Serebryany0800b812016-09-23 23:51:58 +000069 void UpdateFeatureSet(size_t CurrentElementIdx, size_t CurrentElementSize);
70 void PrintFeatureSet();
71
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000072 void PrintModuleInfo();
73
74 void PrintCoverage();
Mike Aizatsky9b415be2016-12-19 22:18:08 +000075 void DumpCoverage();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000076
Kostya Serebryany379359c2016-10-05 01:09:40 +000077 void AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +000078 size_t n, bool StopAtZero);
Kostya Serebryany379359c2016-10-05 01:09:40 +000079
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +000080 TableOfRecentCompares<uint32_t, 32> TORC4;
81 TableOfRecentCompares<uint64_t, 32> TORC8;
82 TableOfRecentCompares<Word, 32> TORCW;
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +000083
Kostya Serebryanya5b2e542016-10-26 00:20:51 +000084 void PrintNewPCs();
Kostya Serebryany11a22bc2016-12-30 01:13:07 +000085 void InitializePrintNewPCs();
Kostya Serebryanyd7d1d512017-03-30 01:27:20 +000086 size_t GetNumPCs() const {
87 return NumGuards == 0 ? (1 << kTracePcBits) : Min(kNumPCs, NumGuards + 1);
88 }
Kostya Serebryany06b87572016-10-26 00:42:52 +000089 uintptr_t GetPC(size_t Idx) {
90 assert(Idx < GetNumPCs());
Kostya Serebryany68382d02017-02-02 19:56:01 +000091 return PCs()[Idx];
Kostya Serebryany06b87572016-10-26 00:42:52 +000092 }
Kostya Serebryanya5b2e542016-10-26 00:20:51 +000093
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000094private:
95 bool UseCounters = false;
Kostya Serebryanyab73c692016-09-23 00:46:18 +000096 bool UseValueProfile = false;
Kostya Serebryanya5b2e542016-10-26 00:20:51 +000097 bool DoPrintNewPCs = false;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000098
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000099 struct Module {
Kostya Serebryanya9b0dd02016-09-29 17:43:24 +0000100 uint32_t *Start, *Stop;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000101 };
102
103 Module Modules[4096];
Kostya Serebryany23567912016-11-11 23:06:53 +0000104 size_t NumModules; // linker-initialized.
105 size_t NumGuards; // linker-initialized.
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000106
Kostya Serebryany68382d02017-02-02 19:56:01 +0000107 uint8_t *Counters() const;
108 uintptr_t *PCs() const;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000109
Kostya Serebryanya5b2e542016-10-26 00:20:51 +0000110 std::set<uintptr_t> *PrintedPCs;
111
Kostya Serebryanyab73c692016-09-23 00:46:18 +0000112 ValueBitMap ValueProfileMap;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000113};
114
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000115template <class Callback> // void Callback(size_t Idx, uint8_t Value);
116ATTRIBUTE_NO_SANITIZE_ALL
117void ForEachNonZeroByte(const uint8_t *Begin, const uint8_t *End,
118 size_t FirstFeature, Callback Handle8bitCounter) {
119 typedef uintptr_t LargeType;
120 const size_t Step = sizeof(LargeType) / sizeof(uint8_t);
121 assert(!(reinterpret_cast<uintptr_t>(Begin) % 64));
122 for (auto P = Begin; P < End; P += Step)
123 if (LargeType Bundle = *reinterpret_cast<const LargeType *>(P))
124 for (size_t I = 0; I < Step; I++, Bundle >>= 8)
125 if (uint8_t V = Bundle & 0xff)
126 Handle8bitCounter(FirstFeature + P - Begin + I, V);
127}
128
129template <class Callback> // bool Callback(size_t Feature)
130ATTRIBUTE_NO_SANITIZE_ALL
131__attribute__((noinline))
Kostya Serebryanya617e162017-03-31 04:17:45 +0000132void TracePC::CollectFeatures(Callback HandleFeature) const {
Kostya Serebryany68382d02017-02-02 19:56:01 +0000133 uint8_t *Counters = this->Counters();
Kostya Serebryany7856fb32017-01-26 01:34:58 +0000134 size_t N = GetNumPCs();
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000135 auto Handle8bitCounter = [&](size_t Idx, uint8_t Counter) {
136 assert(Counter);
137 unsigned Bit = 0;
138 /**/ if (Counter >= 128) Bit = 7;
139 else if (Counter >= 32) Bit = 6;
140 else if (Counter >= 16) Bit = 5;
141 else if (Counter >= 8) Bit = 4;
142 else if (Counter >= 4) Bit = 3;
143 else if (Counter >= 3) Bit = 2;
144 else if (Counter >= 2) Bit = 1;
Kostya Serebryanya617e162017-03-31 04:17:45 +0000145 HandleFeature(Idx * 8 + Bit);
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000146 };
147
148 ForEachNonZeroByte(Counters, Counters + N, 0, Handle8bitCounter);
149 ForEachNonZeroByte(ExtraCountersBegin(), ExtraCountersEnd(), N * 8,
150 Handle8bitCounter);
151
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000152 if (UseValueProfile)
153 ValueProfileMap.ForEach([&](size_t Idx) {
Kostya Serebryanya617e162017-03-31 04:17:45 +0000154 HandleFeature(N * 8 + Idx);
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000155 });
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000156}
157
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000158extern TracePC TPC;
159
160} // namespace fuzzer
161
162#endif // LLVM_FUZZER_TRACE_PC