Introduce an optimisation for special case lists with large numbers of literal entries.

[oota-llvm.git] / include / llvm / Transforms / Utils / SpecialCaseList.h

diff --git a/include/llvm/Transforms/Utils/SpecialCaseList.h b/include/llvm/Transforms/Utils/SpecialCaseList.h
index 9f74953c7f89b7b25dfa5d8b930f2d787dc52256..787ddb0c7c4b57a8a81149a6bb73ec9ac7473381 100644 (file)
--- a/include/llvm/Transforms/Utils/SpecialCaseList.h
+++ b/include/llvm/Transforms/Utils/SpecialCaseList.h
@@ -89,7 +89,8 @@ class SpecialCaseList {
   bool findCategory(const Module &M, StringRef &Category) const;
 
  private:
-  StringMap<StringMap<Regex*> > Entries;
+  struct Entry;
+  StringMap<StringMap<Entry> > Entries;
 
   void init(const MemoryBuffer *MB);
   bool findCategory(const StringRef Section, const StringRef Query,