From 9073613d0ca9a90bf09fe4f507e12dc849a48358 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Thu, 9 Oct 2003 20:30:04 +0000 Subject: [PATCH] Remove potentially N^2 algorithm from symbol table reader. No speedup in practice though git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8985 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Bytecode/Reader/Reader.cpp | 18 +++++++++++++----- 1 file changed, 13 insertions(+), 5 deletions(-) diff --git a/lib/Bytecode/Reader/Reader.cpp b/lib/Bytecode/Reader/Reader.cpp index e649cdc08f1..c515c1575c5 100644 --- a/lib/Bytecode/Reader/Reader.cpp +++ b/lib/Bytecode/Reader/Reader.cpp @@ -219,6 +219,9 @@ void BytecodeParser::ParseSymbolTable(const unsigned char *&Buf, BCR_TRACE(3, "Plane Type: '" << *Ty << "' with " << NumEntries << " entries\n"); + Function::iterator BlockIterator; + unsigned CurBlockIteratorIdx = ~0; + for (unsigned i = 0; i < NumEntries; ++i) { // Symtab entry: [def slot #][name] unsigned slot; @@ -231,12 +234,17 @@ void BytecodeParser::ParseSymbolTable(const unsigned char *&Buf, if (Typ == Type::TypeTyID) V = (Value*)getType(slot); else if (Typ == Type::LabelTyID) { - if (CurrentFunction) { - // FIXME: THIS IS N^2!!! - Function::iterator BlockIterator = CurrentFunction->begin(); - std::advance(BlockIterator, slot); - V = BlockIterator; + if (!CurrentFunction) + throw std::string("Basic blocks don't exist at global scope!"); + + if (slot < CurBlockIteratorIdx) { + CurBlockIteratorIdx = 0; + BlockIterator = CurrentFunction->begin(); } + + std::advance(BlockIterator, slot-CurBlockIteratorIdx); + CurBlockIteratorIdx = slot; + V = BlockIterator; } else V = getValue(Typ, slot, false); // Find mapping... if (V == 0) throw std::string("Failed value look-up.");