18 size_t sizeA = a.
size();
19 size_t sizeB = b.
size();
21 for (
size_t i = 0; i < len; ++i) {
22 char ca = a[sizeA - i - 1];
23 char cb = b[sizeB - i - 1];
34 for (
auto i = StringIndexMap.
begin(), e = StringIndexMap.
end(); i != e; ++i)
43 StringTable +=
'\x00';
47 StringTable.
append(4,
'\x00');
54 assert(s.size() >
COFF::NameSize &&
"Short string in COFF string table!");
57 StringIndexMap[s] = StringTable.
size() - 1 - s.size();
61 StringIndexMap[s] = StringTable.
size();
63 StringTable +=
'\x00';
72 while (StringTable.
size() % 4)
73 StringTable +=
'\x00';
77 assert(StringTable.
size() <= std::numeric_limits<uint32_t>::max());
78 uint32_t
size =
static_cast<uint32_t
>(StringTable.
size());
79 support::endian::write<uint32_t, support::little, support::unaligned>(
87 StringIndexMap.
clear();
void push_back(const T &Elt)
size_t size() const
size - Get the string size.
bool endswith(StringRef Suffix) const
Check if this string ends with the given Suffix.
void reserve(size_type N)
void finalize(Kind kind)
Analyze the strings and build the final table.
Number of individual test Apply this number of consecutive mutations to each input exit after the first new interesting input is found the minimized corpus is saved into the first input directory Number of jobs to run If min(jobs, NumberOfCpuCores()/2)\" is used.") FUZZER_FLAG_INT(reload
void append(in_iter S, in_iter E)
Append from an iterator pair.
static bool compareBySuffix(StringRef a, StringRef b)
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small...
pointer data()
Return a pointer to the vector's buffer, even if empty().
StringRef - Represent a constant reference to a string, i.e.