RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-09 22:13:07 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove potentially N^2 algorithm from symbol table reader. No speedup

Browse Source 
in practice though


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8985 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-10-09 20:30:04 +00:00
parent 927b185c17
commit 9073613d0c
1 changed files with 13 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
lib/Bytecode/Reader/Reader.cpp
View File

@ -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.");