maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

make my atrocious linear search at least search in the order that is 

more likely to hit.

llvm-svn: 63714
This commit is contained in:
Chris Lattner 2009-02-04 02:29:52 +00:00
parent 7941b81498
commit 8411e168f8
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
clang/lib/Basic/SourceManager.cpp
View File

@ -160,14 +160,13 @@ const LineEntry *LineTableInfo::FindNearestLineEntry(unsigned FID,
const std::vector<LineEntry> &Entries = LineEntries[FID];
assert(!Entries.empty() && "No #line entries for this FID after all!");
if (Entries[0].FileOffset > Offset) return 0;
// FIXME: Dumb linear search.
// Find the maximal element that is still before Offset.
for (unsigned i = 1, e = Entries.size(); i != e; ++i)
if (Entries[i].FileOffset > Offset) return &Entries[i-1];
// Otherwise, all entries are before Offset.
return &Entries.back();
for (std::vector<LineEntry>::const_reverse_iterator I = Entries.rbegin(),
E = Entries.rend(); I != E; ++I)
if (I->FileOffset <= Offset) return &*I;
return 0;
}