1 //===- FuzzerUtil.cpp - Misc utils ----------------------------------------===//
3 // 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
7 //===----------------------------------------------------------------------===//
9 //===----------------------------------------------------------------------===//
11 #include "FuzzerUtil.h"
13 #include "FuzzerInternal.h"
22 #include <sys/types.h>
27 void PrintHexArray(const uint8_t *Data, size_t Size,
28 const char *PrintAfter) {
29 for (size_t i = 0; i < Size; i++)
30 Printf("0x%x,", (unsigned)Data[i]);
31 Printf("%s", PrintAfter);
34 void Print(const Unit &v, const char *PrintAfter) {
35 PrintHexArray(v.data(), v.size(), PrintAfter);
38 void PrintASCIIByte(uint8_t Byte) {
43 else if (Byte >= 32 && Byte < 127)
46 Printf("\\x%02x", Byte);
49 void PrintASCII(const uint8_t *Data, size_t Size, const char *PrintAfter) {
50 for (size_t i = 0; i < Size; i++)
51 PrintASCIIByte(Data[i]);
52 Printf("%s", PrintAfter);
55 void PrintASCII(const Unit &U, const char *PrintAfter) {
56 PrintASCII(U.data(), U.size(), PrintAfter);
59 bool ToASCII(uint8_t *Data, size_t Size) {
61 for (size_t i = 0; i < Size; i++) {
65 if (!isspace(NewX) && !isprint(NewX))
73 bool IsASCII(const Unit &U) { return IsASCII(U.data(), U.size()); }
75 bool IsASCII(const uint8_t *Data, size_t Size) {
76 for (size_t i = 0; i < Size; i++)
77 if (!(isprint(Data[i]) || isspace(Data[i]))) return false;
81 bool ParseOneDictionaryEntry(const std::string &Str, Unit *U) {
83 if (Str.empty()) return false;
84 size_t L = 0, R = Str.size() - 1; // We are parsing the range [L,R].
85 // Skip spaces from both sides.
86 while (L < R && isspace(Str[L])) L++;
87 while (R > L && isspace(Str[R])) R--;
88 if (R - L < 2) return false;
89 // Check the closing "
90 if (Str[R] != '"') return false;
93 while (L < R && Str[L] != '"') L++;
94 if (L >= R) return false;
95 assert(Str[L] == '\"');
98 for (size_t Pos = L; Pos <= R; Pos++) {
99 uint8_t V = (uint8_t)Str[Pos];
100 if (!isprint(V) && !isspace(V)) return false;
103 if (Pos + 1 <= R && (Str[Pos + 1] == '\\' || Str[Pos + 1] == '"')) {
104 U->push_back(Str[Pos + 1]);
109 if (Pos + 3 <= R && Str[Pos + 1] == 'x'
110 && isxdigit(Str[Pos + 2]) && isxdigit(Str[Pos + 3])) {
112 Hex[2] = Str[Pos + 2];
113 Hex[3] = Str[Pos + 3];
114 U->push_back(strtol(Hex, nullptr, 16));
118 return false; // Invalid escape.
120 // Any other character.
127 bool ParseDictionaryFile(const std::string &Text, Vector<Unit> *Units) {
129 Printf("ParseDictionaryFile: file does not exist or is empty\n");
132 std::istringstream ISS(Text);
137 while (std::getline(ISS, S, '\n')) {
140 while (Pos < S.size() && isspace(S[Pos])) Pos++; // Skip spaces.
141 if (Pos == S.size()) continue; // Empty line.
142 if (S[Pos] == '#') continue; // Comment line.
143 if (ParseOneDictionaryEntry(S, &U)) {
146 Printf("ParseDictionaryFile: error in line %d\n\t\t%s\n", LineNo,
154 std::string Base64(const Unit &U) {
155 static const char Table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
156 "abcdefghijklmnopqrstuvwxyz"
160 for (i = 0; i + 2 < U.size(); i += 3) {
161 uint32_t x = (U[i] << 16) + (U[i + 1] << 8) + U[i + 2];
162 Res += Table[(x >> 18) & 63];
163 Res += Table[(x >> 12) & 63];
164 Res += Table[(x >> 6) & 63];
165 Res += Table[x & 63];
167 if (i + 1 == U.size()) {
168 uint32_t x = (U[i] << 16);
169 Res += Table[(x >> 18) & 63];
170 Res += Table[(x >> 12) & 63];
172 } else if (i + 2 == U.size()) {
173 uint32_t x = (U[i] << 16) + (U[i + 1] << 8);
174 Res += Table[(x >> 18) & 63];
175 Res += Table[(x >> 12) & 63];
176 Res += Table[(x >> 6) & 63];
182 static std::mutex SymbolizeMutex;
184 std::string DescribePC(const char *SymbolizedFMT, uintptr_t PC) {
185 std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
186 if (!EF->__sanitizer_symbolize_pc || !l.owns_lock())
187 return "<can not symbolize>";
188 char PcDescr[1024] = {};
189 EF->__sanitizer_symbolize_pc(reinterpret_cast<void*>(PC),
190 SymbolizedFMT, PcDescr, sizeof(PcDescr));
191 PcDescr[sizeof(PcDescr) - 1] = 0; // Just in case.
195 void PrintPC(const char *SymbolizedFMT, const char *FallbackFMT, uintptr_t PC) {
196 if (EF->__sanitizer_symbolize_pc)
197 Printf("%s", DescribePC(SymbolizedFMT, PC).c_str());
199 Printf(FallbackFMT, PC);
202 void PrintStackTrace() {
203 std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
204 if (EF->__sanitizer_print_stack_trace && l.owns_lock())
205 EF->__sanitizer_print_stack_trace();
208 void PrintMemoryProfile() {
209 std::unique_lock<std::mutex> l(SymbolizeMutex, std::try_to_lock);
210 if (EF->__sanitizer_print_memory_profile && l.owns_lock())
211 EF->__sanitizer_print_memory_profile(95, 8);
214 unsigned NumberOfCpuCores() {
215 unsigned N = std::thread::hardware_concurrency();
217 Printf("WARNING: std::thread::hardware_concurrency not well defined for "
218 "your platform. Assuming CPU count of 1.\n");
224 size_t SimpleFastHash(const uint8_t *Data, size_t Size) {
226 for (size_t i = 0; i < Size; i++)
227 Res = Res * 11 + Data[i];
231 } // namespace fuzzer