From a55866f2ccf3fec442b08a59ad46c82b4a70cd9a Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Fri, 12 Jan 2007 23:23:08 +0000 Subject: [PATCH] Eliminate a log(n) lookup git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33155 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Bytecode/Writer/SlotCalculator.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/Bytecode/Writer/SlotCalculator.cpp b/lib/Bytecode/Writer/SlotCalculator.cpp index 2d4cd0c4cb4..65215fecb17 100644 --- a/lib/Bytecode/Writer/SlotCalculator.cpp +++ b/lib/Bytecode/Writer/SlotCalculator.cpp @@ -279,7 +279,7 @@ void SlotCalculator::processSymbolTableConstants(const SymbolTable *ST) { void SlotCalculator::incorporateFunction(const Function *F) { - assert((ModuleLevel.size() == 0 || + assert((ModuleLevel.empty() || ModuleTypeLevel == 0) && "Module already incorporated!"); SC_DEBUG("begin processFunction!\n"); @@ -442,7 +442,7 @@ unsigned SlotCalculator::getOrCreateCompactionTableSlot(const Type *T) { unsigned SlotNo = CompactionTypes.size(); SC_DEBUG("Inserting Compaction Type #" << SlotNo << ": " << *T << "\n"); CompactionTypes.push_back(T); - CompactionTypeMap[T] = SlotNo; + CompactionTypeMap.insert(I, std::make_pair(T, SlotNo)); return SlotNo; } @@ -639,7 +639,7 @@ void SlotCalculator::pruneCompactionTable() { /// to determine if its actually empty. bool SlotCalculator::CompactionTableIsEmpty() const { // Check a degenerate case, just in case. - if (CompactionTable.size() == 0) + if (CompactionTable.empty()) return true; // Check each plane