blob: b36c4f54306cb6e92b07038370def0fa1d58e8d8 [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 Serebryanyf64b8482017-07-14 00:06:27 +000048template <size_t kSizeT>
49struct MemMemTable {
50 static const size_t kSize = kSizeT;
51 Word MemMemWords[kSize];
52 Word EmptyWord;
53
54 void Add(const uint8_t *Data, size_t Size) {
55 if (Size <= 2) return;
56 Size = std::min(Size, Word::GetMaxSize());
57 size_t Idx = SimpleFastHash(Data, Size) % kSize;
58 MemMemWords[Idx].Set(Data, Size);
59 }
60 const Word &Get(size_t Idx) {
61 for (size_t i = 0; i < kSize; i++) {
62 const Word &W = MemMemWords[(Idx + i) % kSize];
63 if (W.size()) return W;
64 }
65 EmptyWord.Set(nullptr, 0);
66 return EmptyWord;
67 }
68};
69
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000070class TracePC {
71 public:
Kostya Serebryany68382d02017-02-02 19:56:01 +000072 static const size_t kNumPCs = 1 << 21;
Kostya Serebryanyd7d1d512017-03-30 01:27:20 +000073 // How many bits of PC are used from __sanitizer_cov_trace_pc.
74 static const size_t kTracePcBits = 18;
Kostya Serebryany2c556132016-09-30 01:19:56 +000075
Kostya Serebryanyf2d4dcb2017-06-13 22:31:21 +000076 void HandleInit(uint32_t *Start, uint32_t *Stop);
77 void HandleInline8bitCountersInit(uint8_t *Start, uint8_t *Stop);
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000078 void HandleCallerCallee(uintptr_t Caller, uintptr_t Callee);
Mike Aizatsky0e37f8e2017-01-17 23:11:32 +000079 template <class T> void HandleCmp(uintptr_t PC, T Arg1, T Arg2);
Kostya Serebryany275e2602016-10-25 23:52:25 +000080 size_t GetTotalPCCoverage();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000081 void SetUseCounters(bool UC) { UseCounters = UC; }
Kostya Serebryanyab73c692016-09-23 00:46:18 +000082 void SetUseValueProfile(bool VP) { UseValueProfile = VP; }
Kostya Serebryanya5b2e542016-10-26 00:20:51 +000083 void SetPrintNewPCs(bool P) { DoPrintNewPCs = P; }
Kostya Serebryanya617e162017-03-31 04:17:45 +000084 template <class Callback> void CollectFeatures(Callback CB) const;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000085
Kostya Serebryanyce1cab12016-09-23 02:18:59 +000086 void ResetMaps() {
Kostya Serebryany16a145f2016-09-23 01:58:51 +000087 ValueProfileMap.Reset();
Kostya Serebryany68382d02017-02-02 19:56:01 +000088 memset(Counters(), 0, GetNumPCs());
Kostya Serebryany6ca44f92017-03-23 22:43:12 +000089 ClearExtraCounters();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000090 }
91
Kostya Serebryany0800b812016-09-23 23:51:58 +000092 void UpdateFeatureSet(size_t CurrentElementIdx, size_t CurrentElementSize);
93 void PrintFeatureSet();
94
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000095 void PrintModuleInfo();
96
97 void PrintCoverage();
Mike Aizatsky9b415be2016-12-19 22:18:08 +000098 void DumpCoverage();
Kostya Serebryany6f5a8042016-09-21 01:50:50 +000099
Kostya Serebryany379359c2016-10-05 01:09:40 +0000100 void AddValueForMemcmp(void *caller_pc, const void *s1, const void *s2,
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +0000101 size_t n, bool StopAtZero);
Kostya Serebryany379359c2016-10-05 01:09:40 +0000102
Kostya Serebryany1d8c2ce2017-01-17 23:09:05 +0000103 TableOfRecentCompares<uint32_t, 32> TORC4;
104 TableOfRecentCompares<uint64_t, 32> TORC8;
105 TableOfRecentCompares<Word, 32> TORCW;
Kostya Serebryanyf64b8482017-07-14 00:06:27 +0000106 MemMemTable<1024> MMT;
Kostya Serebryanya5f94fb2016-10-14 20:20:33 +0000107
Kostya Serebryanya5b2e542016-10-26 00:20:51 +0000108 void PrintNewPCs();
Kostya Serebryany11a22bc2016-12-30 01:13:07 +0000109 void InitializePrintNewPCs();
Kostya Serebryanyd7d1d512017-03-30 01:27:20 +0000110 size_t GetNumPCs() const {
111 return NumGuards == 0 ? (1 << kTracePcBits) : Min(kNumPCs, NumGuards + 1);
112 }
Kostya Serebryany06b87572016-10-26 00:42:52 +0000113 uintptr_t GetPC(size_t Idx) {
114 assert(Idx < GetNumPCs());
Kostya Serebryany68382d02017-02-02 19:56:01 +0000115 return PCs()[Idx];
Kostya Serebryany06b87572016-10-26 00:42:52 +0000116 }
Kostya Serebryanya5b2e542016-10-26 00:20:51 +0000117
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000118private:
119 bool UseCounters = false;
Kostya Serebryanyab73c692016-09-23 00:46:18 +0000120 bool UseValueProfile = false;
Kostya Serebryanya5b2e542016-10-26 00:20:51 +0000121 bool DoPrintNewPCs = false;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000122
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000123 struct Module {
Kostya Serebryanya9b0dd02016-09-29 17:43:24 +0000124 uint32_t *Start, *Stop;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000125 };
126
127 Module Modules[4096];
Kostya Serebryany23567912016-11-11 23:06:53 +0000128 size_t NumModules; // linker-initialized.
129 size_t NumGuards; // linker-initialized.
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000130
Kostya Serebryanyf2d4dcb2017-06-13 22:31:21 +0000131 struct { uint8_t *Start, *Stop; } ModuleCounters[4096];
132 size_t NumModulesWithInline8bitCounters; // linker-initialized.
133 size_t NumInline8bitCounters;
134
Kostya Serebryany68382d02017-02-02 19:56:01 +0000135 uint8_t *Counters() const;
136 uintptr_t *PCs() const;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000137
Kostya Serebryanya5b2e542016-10-26 00:20:51 +0000138 std::set<uintptr_t> *PrintedPCs;
139
Kostya Serebryanyab73c692016-09-23 00:46:18 +0000140 ValueBitMap ValueProfileMap;
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000141};
142
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000143template <class Callback> // void Callback(size_t Idx, uint8_t Value);
144ATTRIBUTE_NO_SANITIZE_ALL
145void ForEachNonZeroByte(const uint8_t *Begin, const uint8_t *End,
146 size_t FirstFeature, Callback Handle8bitCounter) {
147 typedef uintptr_t LargeType;
148 const size_t Step = sizeof(LargeType) / sizeof(uint8_t);
Kostya Serebryanyf2d4dcb2017-06-13 22:31:21 +0000149 const size_t StepMask = Step - 1;
150 auto P = Begin;
151 // Iterate by 1 byte until either the alignment boundary or the end.
152 for (; reinterpret_cast<uintptr_t>(P) & StepMask && P < End; P++)
153 if (uint8_t V = *P)
154 Handle8bitCounter(FirstFeature + P - Begin, V);
155
156 // Iterate by Step bytes at a time.
157 for (; P < End; P += Step)
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000158 if (LargeType Bundle = *reinterpret_cast<const LargeType *>(P))
159 for (size_t I = 0; I < Step; I++, Bundle >>= 8)
160 if (uint8_t V = Bundle & 0xff)
161 Handle8bitCounter(FirstFeature + P - Begin + I, V);
Kostya Serebryanyf2d4dcb2017-06-13 22:31:21 +0000162
163 // Iterate by 1 byte until the end.
164 for (; P < End; P++)
165 if (uint8_t V = *P)
166 Handle8bitCounter(FirstFeature + P - Begin, V);
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000167}
168
169template <class Callback> // bool Callback(size_t Feature)
170ATTRIBUTE_NO_SANITIZE_ALL
171__attribute__((noinline))
Kostya Serebryanya617e162017-03-31 04:17:45 +0000172void TracePC::CollectFeatures(Callback HandleFeature) const {
Kostya Serebryany68382d02017-02-02 19:56:01 +0000173 uint8_t *Counters = this->Counters();
Kostya Serebryany7856fb32017-01-26 01:34:58 +0000174 size_t N = GetNumPCs();
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000175 auto Handle8bitCounter = [&](size_t Idx, uint8_t Counter) {
176 assert(Counter);
177 unsigned Bit = 0;
178 /**/ if (Counter >= 128) Bit = 7;
179 else if (Counter >= 32) Bit = 6;
180 else if (Counter >= 16) Bit = 5;
181 else if (Counter >= 8) Bit = 4;
182 else if (Counter >= 4) Bit = 3;
183 else if (Counter >= 3) Bit = 2;
184 else if (Counter >= 2) Bit = 1;
Kostya Serebryanya617e162017-03-31 04:17:45 +0000185 HandleFeature(Idx * 8 + Bit);
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000186 };
187
Kostya Serebryanyf2d4dcb2017-06-13 22:31:21 +0000188 size_t FirstFeature = 0;
189 ForEachNonZeroByte(Counters, Counters + N, FirstFeature, Handle8bitCounter);
190 FirstFeature += N * 8;
191 for (size_t i = 0; i < NumModulesWithInline8bitCounters; i++) {
192 ForEachNonZeroByte(ModuleCounters[i].Start, ModuleCounters[i].Stop,
193 FirstFeature, Handle8bitCounter);
194 FirstFeature += 8 * (ModuleCounters[i].Stop - ModuleCounters[i].Start);
195 }
196
197 ForEachNonZeroByte(ExtraCountersBegin(), ExtraCountersEnd(), FirstFeature,
Kostya Serebryany6ca44f92017-03-23 22:43:12 +0000198 Handle8bitCounter);
199
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000200 if (UseValueProfile)
201 ValueProfileMap.ForEach([&](size_t Idx) {
Kostya Serebryanya617e162017-03-31 04:17:45 +0000202 HandleFeature(N * 8 + Idx);
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000203 });
Kostya Serebryanyfe1094b2016-12-05 23:35:22 +0000204}
205
Kostya Serebryany6f5a8042016-09-21 01:50:50 +0000206extern TracePC TPC;
207
208} // namespace fuzzer
209
210#endif // LLVM_FUZZER_TRACE_PC