1*4ba319b5SDimitry Andric //===- FuzzerUtil.cpp - Misc utils ----------------------------------------===//
2*4ba319b5SDimitry Andric //
3*4ba319b5SDimitry Andric // The LLVM Compiler Infrastructure
4*4ba319b5SDimitry Andric //
5*4ba319b5SDimitry Andric // This file is distributed under the University of Illinois Open Source
6*4ba319b5SDimitry Andric // License. See LICENSE.TXT for details.
7*4ba319b5SDimitry Andric //
8*4ba319b5SDimitry Andric //===----------------------------------------------------------------------===//
9*4ba319b5SDimitry Andric // Misc utils.
10*4ba319b5SDimitry Andric //===----------------------------------------------------------------------===//
11*4ba319b5SDimitry Andric
12*4ba319b5SDimitry Andric #include "FuzzerUtil.h"
13*4ba319b5SDimitry Andric #include "FuzzerIO.h"
14*4ba319b5SDimitry Andric #include "FuzzerInternal.h"
15*4ba319b5SDimitry Andric #include <cassert>
16*4ba319b5SDimitry Andric #include <chrono>
17*4ba319b5SDimitry Andric #include <cstring>
18*4ba319b5SDimitry Andric #include <errno.h>
19*4ba319b5SDimitry Andric #include <mutex>
20*4ba319b5SDimitry Andric #include <signal.h>
21*4ba319b5SDimitry Andric #include <sstream>
22*4ba319b5SDimitry Andric #include <stdio.h>
23*4ba319b5SDimitry Andric #include <sys/types.h>
24*4ba319b5SDimitry Andric #include <thread>
25*4ba319b5SDimitry Andric
26*4ba319b5SDimitry Andric namespace fuzzer {
27*4ba319b5SDimitry Andric
PrintHexArray(const uint8_t * Data,size_t Size,const char * PrintAfter)28*4ba319b5SDimitry Andric void PrintHexArray(const uint8_t *Data, size_t Size,
29*4ba319b5SDimitry Andric const char *PrintAfter) {
30*4ba319b5SDimitry Andric for (size_t i = 0; i < Size; i++)
31*4ba319b5SDimitry Andric Printf("0x%x,", (unsigned)Data[i]);
32*4ba319b5SDimitry Andric Printf("%s", PrintAfter);
33*4ba319b5SDimitry Andric }
34*4ba319b5SDimitry Andric
Print(const Unit & v,const char * PrintAfter)35*4ba319b5SDimitry Andric void Print(const Unit &v, const char *PrintAfter) {
36*4ba319b5SDimitry Andric PrintHexArray(v.data(), v.size(), PrintAfter);
37*4ba319b5SDimitry Andric }
38*4ba319b5SDimitry Andric
PrintASCIIByte(uint8_t Byte)39*4ba319b5SDimitry Andric void PrintASCIIByte(uint8_t Byte) {
40*4ba319b5SDimitry Andric if (Byte == '\\')
41*4ba319b5SDimitry Andric Printf("\\\\");
42*4ba319b5SDimitry Andric else if (Byte == '"')
43*4ba319b5SDimitry Andric Printf("\\\"");
44*4ba319b5SDimitry Andric else if (Byte >= 32 && Byte < 127)
45*4ba319b5SDimitry Andric Printf("%c", Byte);
46*4ba319b5SDimitry Andric else
47*4ba319b5SDimitry Andric Printf("\\x%02x", Byte);
48*4ba319b5SDimitry Andric }
49*4ba319b5SDimitry Andric
PrintASCII(const uint8_t * Data,size_t Size,const char * PrintAfter)50*4ba319b5SDimitry Andric void PrintASCII(const uint8_t *Data, size_t Size, const char *PrintAfter) {
51*4ba319b5SDimitry Andric for (size_t i = 0; i < Size; i++)
52*4ba319b5SDimitry Andric PrintASCIIByte(Data[i]);
53*4ba319b5SDimitry Andric Printf("%s", PrintAfter);
54*4ba319b5SDimitry Andric }
55*4ba319b5SDimitry Andric
PrintASCII(const Unit & U,const char * PrintAfter)56*4ba319b5SDimitry Andric void PrintASCII(const Unit &U, const char *PrintAfter) {
57*4ba319b5SDimitry Andric PrintASCII(U.data(), U.size(), PrintAfter);
58*4ba319b5SDimitry Andric }
59*4ba319b5SDimitry Andric
ToASCII(uint8_t * Data,size_t Size)60*4ba319b5SDimitry Andric bool ToASCII(uint8_t *Data, size_t Size) {
61*4ba319b5SDimitry Andric bool Changed = false;
62*4ba319b5SDimitry Andric for (size_t i = 0; i < Size; i++) {
63*4ba319b5SDimitry Andric uint8_t &X = Data[i];
64*4ba319b5SDimitry Andric auto NewX = X;
65*4ba319b5SDimitry Andric NewX &= 127;
66*4ba319b5SDimitry Andric if (!isspace(NewX) && !isprint(NewX))
67*4ba319b5SDimitry Andric NewX = ' ';
68*4ba319b5SDimitry Andric Changed |= NewX != X;
69*4ba319b5SDimitry Andric X = NewX;
70*4ba319b5SDimitry Andric }
71*4ba319b5SDimitry Andric return Changed;
72*4ba319b5SDimitry Andric }
73*4ba319b5SDimitry Andric
IsASCII(const Unit & U)74*4ba319b5SDimitry Andric bool IsASCII(const Unit &U) { return IsASCII(U.data(), U.size()); }
75*4ba319b5SDimitry Andric
IsASCII(const uint8_t * Data,size_t Size)76*4ba319b5SDimitry Andric bool IsASCII(const uint8_t *Data, size_t Size) {
77*4ba319b5SDimitry Andric for (size_t i = 0; i < Size; i++)
78*4ba319b5SDimitry Andric if (!(isprint(Data[i]) || isspace(Data[i]))) return false;
79*4ba319b5SDimitry Andric return true;
80*4ba319b5SDimitry Andric }
81*4ba319b5SDimitry Andric
ParseOneDictionaryEntry(const std::string & Str,Unit * U)82*4ba319b5SDimitry Andric bool ParseOneDictionaryEntry(const std::string &Str, Unit *U) {
83*4ba319b5SDimitry Andric U->clear();
84*4ba319b5SDimitry Andric if (Str.empty()) return false;
85*4ba319b5SDimitry Andric size_t L = 0, R = Str.size() - 1; // We are parsing the range [L,R].
86*4ba319b5SDimitry Andric // Skip spaces from both sides.
87*4ba319b5SDimitry Andric while (L < R && isspace(Str[L])) L++;
88*4ba319b5SDimitry Andric while (R > L && isspace(Str[R])) R--;
89*4ba319b5SDimitry Andric if (R - L < 2) return false;
90*4ba319b5SDimitry Andric // Check the closing "
91*4ba319b5SDimitry Andric if (Str[R] != '"') return false;
92*4ba319b5SDimitry Andric R--;
93*4ba319b5SDimitry Andric // Find the opening "
94*4ba319b5SDimitry Andric while (L < R && Str[L] != '"') L++;
95*4ba319b5SDimitry Andric if (L >= R) return false;
96*4ba319b5SDimitry Andric assert(Str[L] == '\"');
97*4ba319b5SDimitry Andric L++;
98*4ba319b5SDimitry Andric assert(L <= R);
99*4ba319b5SDimitry Andric for (size_t Pos = L; Pos <= R; Pos++) {
100*4ba319b5SDimitry Andric uint8_t V = (uint8_t)Str[Pos];
101*4ba319b5SDimitry Andric if (!isprint(V) && !isspace(V)) return false;
102*4ba319b5SDimitry Andric if (V =='\\') {
103*4ba319b5SDimitry Andric // Handle '\\'
104*4ba319b5SDimitry Andric if (Pos + 1 <= R && (Str[Pos + 1] == '\\' || Str[Pos + 1] == '"')) {
105*4ba319b5SDimitry Andric U->push_back(Str[Pos + 1]);
106*4ba319b5SDimitry Andric Pos++;
107*4ba319b5SDimitry Andric continue;
108*4ba319b5SDimitry Andric }
109*4ba319b5SDimitry Andric // Handle '\xAB'
110*4ba319b5SDimitry Andric if (Pos + 3 <= R && Str[Pos + 1] == 'x'
111*4ba319b5SDimitry Andric && isxdigit(Str[Pos + 2]) && isxdigit(Str[Pos + 3])) {
112*4ba319b5SDimitry Andric char Hex[] = "0xAA";
113*4ba319b5SDimitry Andric Hex[2] = Str[Pos + 2];
114*4ba319b5SDimitry Andric Hex[3] = Str[Pos + 3];
115*4ba319b5SDimitry Andric U->push_back(strtol(Hex, nullptr, 16));
116*4ba319b5SDimitry Andric Pos += 3;
117*4ba319b5SDimitry Andric continue;
118*4ba319b5SDimitry Andric }
119*4ba319b5SDimitry Andric return false; // Invalid escape.
120*4ba319b5SDimitry Andric } else {
121*4ba319b5SDimitry Andric // Any other character.
122*4ba319b5SDimitry Andric U->push_back(V);
123*4ba319b5SDimitry Andric }
124*4ba319b5SDimitry Andric }
125*4ba319b5SDimitry Andric return true;
126*4ba319b5SDimitry Andric }
127*4ba319b5SDimitry Andric
ParseDictionaryFile(const std::string & Text,Vector<Unit> * Units)128*4ba319b5SDimitry Andric bool ParseDictionaryFile(const std::string &Text, Vector<Unit> *Units) {
129*4ba319b5SDimitry Andric if (Text.empty()) {
130*4ba319b5SDimitry Andric Printf("ParseDictionaryFile: file does not exist or is empty\n");
131*4ba319b5SDimitry Andric return false;
132*4ba319b5SDimitry Andric }
133*4ba319b5SDimitry Andric std::istringstream ISS(Text);
134*4ba319b5SDimitry Andric Units->clear();
135*4ba319b5SDimitry Andric Unit U;
136*4ba319b5SDimitry Andric int LineNo = 0;
137*4ba319b5SDimitry Andric std::string S;
138*4ba319b5SDimitry Andric while (std::getline(ISS, S, '\n')) {
139*4ba319b5SDimitry Andric LineNo++;
140*4ba319b5SDimitry Andric size_t Pos = 0;
141*4ba319b5SDimitry Andric while (Pos < S.size() && isspace(S[Pos])) Pos++; // Skip spaces.
142*4ba319b5SDimitry Andric if (Pos == S.size()) continue; // Empty line.
143*4ba319b5SDimitry Andric if (S[Pos] == '#') continue; // Comment line.
144*4ba319b5SDimitry Andric if (ParseOneDictionaryEntry(S, &U)) {
145*4ba319b5SDimitry Andric Units->push_back(U);
146*4ba319b5SDimitry Andric } else {
147*4ba319b5SDimitry Andric Printf("ParseDictionaryFile: error in line %d\n\t\t%s\n", LineNo,
148*4ba319b5SDimitry Andric S.c_str());
149*4ba319b5SDimitry Andric return false;
150*4ba319b5SDimitry Andric }
151*4ba319b5SDimitry Andric }
152*4ba319b5SDimitry Andric return true;
153*4ba319b5SDimitry Andric }
154*4ba319b5SDimitry Andric
Base64(const Unit & U)155*4ba319b5SDimitry Andric std::string Base64(const Unit &U) {
156*4ba319b5SDimitry Andric static const char Table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
157*4ba319b5SDimitry Andric "abcdefghijklmnopqrstuvwxyz"
158*4ba319b5SDimitry Andric "0123456789+/";
159*4ba319b5SDimitry Andric std::string Res;
160*4ba319b5SDimitry Andric size_t i;
161*4ba319b5SDimitry Andric for (i = 0; i + 2 < U.size(); i += 3) {
162*4ba319b5SDimitry Andric uint32_t x = (U[i] << 16) + (U[i + 1] << 8) + U[i + 2];
163*4ba319b5SDimitry Andric Res += Table[(x >> 18) & 63];
164*4ba319b5SDimitry Andric Res += Table[(x >> 12) & 63];
165*4ba319b5SDimitry Andric Res += Table[(x >> 6) & 63];
166*4ba319b5SDimitry Andric Res += Table[x & 63];
167*4ba319b5SDimitry Andric }
168*4ba319b5SDimitry Andric if (i + 1 == U.size()) {
169*4ba319b5SDimitry Andric uint32_t x = (U[i] << 16);
170*4ba319b5SDimitry Andric Res += Table[(x >> 18) & 63];
171*4ba319b5SDimitry Andric Res += Table[(x >> 12) & 63];
172*4ba319b5SDimitry Andric Res += "==";
173*4ba319b5SDimitry Andric } else if (i + 2 == U.size()) {
174*4ba319b5SDimitry Andric uint32_t x = (U[i] << 16) + (U[i + 1] << 8);
175*4ba319b5SDimitry Andric Res += Table[(x >> 18) & 63];
176*4ba319b5SDimitry Andric Res += Table[(x >> 12) & 63];
177*4ba319b5SDimitry Andric Res += Table[(x >> 6) & 63];
178*4ba319b5SDimitry Andric Res += "=";
179*4ba319b5SDimitry Andric }
180*4ba319b5SDimitry Andric return Res;
181*4ba319b5SDimitry Andric }
182*4ba319b5SDimitry Andric
183*4ba319b5SDimitry Andric static std::mutex SymbolizeMutex;
184*4ba319b5SDimitry Andric
DescribePC(const char * SymbolizedFMT,uintptr_t PC)185*4ba319b5SDimitry Andric std::string DescribePC(const char *SymbolizedFMT, uintptr_t PC) {
186*4ba319b5SDimitry Andric std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
187*4ba319b5SDimitry Andric if (!EF->__sanitizer_symbolize_pc || !l.owns_lock())
188*4ba319b5SDimitry Andric return "<can not symbolize>";
189*4ba319b5SDimitry Andric char PcDescr[1024] = {};
190*4ba319b5SDimitry Andric EF->__sanitizer_symbolize_pc(reinterpret_cast<void*>(PC),
191*4ba319b5SDimitry Andric SymbolizedFMT, PcDescr, sizeof(PcDescr));
192*4ba319b5SDimitry Andric PcDescr[sizeof(PcDescr) - 1] = 0; // Just in case.
193*4ba319b5SDimitry Andric return PcDescr;
194*4ba319b5SDimitry Andric }
195*4ba319b5SDimitry Andric
PrintPC(const char * SymbolizedFMT,const char * FallbackFMT,uintptr_t PC)196*4ba319b5SDimitry Andric void PrintPC(const char *SymbolizedFMT, const char *FallbackFMT, uintptr_t PC) {
197*4ba319b5SDimitry Andric if (EF->__sanitizer_symbolize_pc)
198*4ba319b5SDimitry Andric Printf("%s", DescribePC(SymbolizedFMT, PC).c_str());
199*4ba319b5SDimitry Andric else
200*4ba319b5SDimitry Andric Printf(FallbackFMT, PC);
201*4ba319b5SDimitry Andric }
202*4ba319b5SDimitry Andric
PrintStackTrace()203*4ba319b5SDimitry Andric void PrintStackTrace() {
204*4ba319b5SDimitry Andric std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
205*4ba319b5SDimitry Andric if (EF->__sanitizer_print_stack_trace && l.owns_lock())
206*4ba319b5SDimitry Andric EF->__sanitizer_print_stack_trace();
207*4ba319b5SDimitry Andric }
208*4ba319b5SDimitry Andric
PrintMemoryProfile()209*4ba319b5SDimitry Andric void PrintMemoryProfile() {
210*4ba319b5SDimitry Andric std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
211*4ba319b5SDimitry Andric if (EF->__sanitizer_print_memory_profile && l.owns_lock())
212*4ba319b5SDimitry Andric EF->__sanitizer_print_memory_profile(95, 8);
213*4ba319b5SDimitry Andric }
214*4ba319b5SDimitry Andric
NumberOfCpuCores()215*4ba319b5SDimitry Andric unsigned NumberOfCpuCores() {
216*4ba319b5SDimitry Andric unsigned N = std::thread::hardware_concurrency();
217*4ba319b5SDimitry Andric if (!N) {
218*4ba319b5SDimitry Andric Printf("WARNING: std::thread::hardware_concurrency not well defined for "
219*4ba319b5SDimitry Andric "your platform. Assuming CPU count of 1.\n");
220*4ba319b5SDimitry Andric N = 1;
221*4ba319b5SDimitry Andric }
222*4ba319b5SDimitry Andric return N;
223*4ba319b5SDimitry Andric }
224*4ba319b5SDimitry Andric
SimpleFastHash(const uint8_t * Data,size_t Size)225*4ba319b5SDimitry Andric size_t SimpleFastHash(const uint8_t *Data, size_t Size) {
226*4ba319b5SDimitry Andric size_t Res = 0;
227*4ba319b5SDimitry Andric for (size_t i = 0; i < Size; i++)
228*4ba319b5SDimitry Andric Res = Res * 11 + Data[i];
229*4ba319b5SDimitry Andric return Res;
230*4ba319b5SDimitry Andric }
231*4ba319b5SDimitry Andric
232*4ba319b5SDimitry Andric } // namespace fuzzer
233