RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-04 06:12:18 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[ADT] Add SparseBitVector::find_last().

Browse Source 
Differential Revision: https://reviews.llvm.org/D28817

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@292288 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Zachary Turner 2017-01-17 23:09:21 +00:00
parent db5325aae3
commit 974466a9b8
2 changed files with 58 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
include/llvm/ADT/SparseBitVector.h
View File

@ -132,6 +132,17 @@ public:
llvm_unreachable("Illegal empty element"); llvm_unreachable("Illegal empty element");
} }
/// find_last - Returns the index of the last set bit.
int find_last() const {
for (unsigned I = 0; I < BITWORDS_PER_ELEMENT; ++I) {
unsigned Idx = BITWORDS_PER_ELEMENT - I - 1;
if (Bits[Idx] != 0)
return Idx * BITWORD_SIZE + BITWORD_SIZE -
countLeadingZeros(Bits[Idx]) - 1;
}
llvm_unreachable("Illegal empty element");
}
/// find_next - Returns the index of the next set bit starting from the /// find_next - Returns the index of the next set bit starting from the
/// "Curr" bit. Returns -1 if the next set bit is not found. /// "Curr" bit. Returns -1 if the next set bit is not found.
int find_next(unsigned Curr) const { int find_next(unsigned Curr) const {
@ -768,6 +779,14 @@ public:
return (First.index() * ElementSize) + First.find_first(); return (First.index() * ElementSize) + First.find_first();
} }
// Return the last set bit in the bitmap. Return -1 if no bits are set.
int find_last() const {
if (Elements.empty())
return -1;
const SparseBitVectorElement<ElementSize> &Last = *(Elements.rbegin());
return (Last.index() * ElementSize) + Last.find_last();
}
// Return true if the SparseBitVector is empty // Return true if the SparseBitVector is empty
bool empty() const { bool empty() const {
return Elements.empty(); return Elements.empty();

39
unittests/ADT/SparseBitVectorTest.cpp
View File

@ -127,4 +127,43 @@ TEST(SparseBitVectorTest, SelfAssignment) {
EXPECT_TRUE(Vec.empty()); EXPECT_TRUE(Vec.empty());
} }
TEST(SparseBitVectorTest, Find) {
SparseBitVector<> Vec;
Vec.set(1);
EXPECT_EQ(1, Vec.find_first());
EXPECT_EQ(1, Vec.find_last());
Vec.set(2);
EXPECT_EQ(1, Vec.find_first());
EXPECT_EQ(2, Vec.find_last());
Vec.set(0);
Vec.set(3);
EXPECT_EQ(0, Vec.find_first());
EXPECT_EQ(3, Vec.find_last());
Vec.reset(1);
Vec.reset(0);
Vec.reset(3);
EXPECT_EQ(2, Vec.find_first());
EXPECT_EQ(2, Vec.find_last());
// Set some large bits to ensure we are pulling bits from more than just a
// single bitword.
Vec.set(500);
Vec.set(2000);
Vec.set(3000);
Vec.set(4000);
Vec.reset(2);
EXPECT_EQ(500, Vec.find_first());
EXPECT_EQ(4000, Vec.find_last());
Vec.reset(500);
Vec.reset(3000);
Vec.reset(4000);
EXPECT_EQ(2000, Vec.find_first());
EXPECT_EQ(2000, Vec.find_last());
Vec.clear();
}
} }