Go to the documentation of this file.
9 #ifndef LLVM_MC_STRINGTABLEBUILDER_H
10 #define LLVM_MC_STRINGTABLEBUILDER_H
42 bool Finalized =
false;
44 void finalizeStringTable(
bool Optimize);
79 return StringIndexMap.
count(
S);
86 void write(uint8_t *Buf)
const;
93 #endif // LLVM_MC_STRINGTABLEBUILDER_H
This is an optimization pass for GlobalISel generic memory operations.
bool contains(StringRef S) const
Check if a string is contained in the string table.
void finalizeInOrder()
Finalize the string table without reording it.
size_type count(const_arg_type_t< KeyT > Val) const
Return 1 if the specified key is in the map, 0 otherwise.
void finalize()
Analyze the strings and build the final table.
size_t getOffset(CachedHashStringRef S) const
Get the offest of a string in the string table.
This class implements an extremely fast bulk output stream that can only output to a stream.
A container which contains a StringRef plus a precomputed hash.
bool contains(CachedHashStringRef S) const
void write(raw_ostream &OS) const
StringRef - Represent a constant reference to a string, i.e.
add sub stmia L5 ldr r0 bl L_printf $stub Instead of a and a wouldn t it be better to do three moves *Return an aggregate type is even return S
size_t getOffset(StringRef S) const
size_t add(CachedHashStringRef S)
Add a string to the builder.
Utility for building string tables with deduplicated suffixes.
StringTableBuilder(Kind K, unsigned Alignment=1)