make the datastructure used in BytecodeWriter::outputValueSymbolTable

*slightly* less abusive of memory.  This speeds up the bcwriter from
1.83s to 1.32s (39% faster) on 447.dealII.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34140 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Bytecode/Writer/Writer.cpp b/lib/Bytecode/Writer/Writer.cpp
index 1c420443a6bbfec4a7134314841a85230e5f6ead..bdd3ca4430026af6ecd0e4885fdee751c7adf5fa 100644 (file)
--- a/lib/Bytecode/Writer/Writer.cpp
+++ b/lib/Bytecode/Writer/Writer.cpp
@@ -1086,14 +1086,14 @@ void BytecodeWriter::outputValueSymbolTable(const ValueSymbolTable &VST) {
                             true/*ElideIfEmpty*/);
 
   // Organize the symbol table by type
-  typedef std::pair<std::string, const Value*> PlaneMapEntry;
+  typedef std::pair<const std::string*, const Value*> PlaneMapEntry;
   typedef std::vector<PlaneMapEntry> PlaneMapVector;
   typedef std::map<const Type*, PlaneMapVector > PlaneMap;
   PlaneMap Planes;
   for (ValueSymbolTable::const_iterator SI = VST.begin(), SE = VST.end();
        SI != SE; ++SI) 
-    Planes[SI->second->getType()].push_back(
-        std::make_pair(SI->first,SI->second));
+    Planes[SI->second->getType()]
+      .push_back(std::make_pair(&SI->first, SI->second));
 
   for (PlaneMap::const_iterator PI = Planes.begin(), PE = Planes.end();
        PI != PE; ++PI) {
@@ -1112,7 +1112,7 @@ void BytecodeWriter::outputValueSymbolTable(const ValueSymbolTable &VST) {
     for (; I != End; ++I) {
       // Symtab entry: [def slot #][name]
       output_vbr(Table.getSlot(I->second));
-      output(I->first);
+      output(*I->first);
     }
   }
 }