aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorDaniel Berlin <dberlin@dberlin.org>2007-10-04 21:27:17 +0000
committerDaniel Berlin <dberlin@dberlin.org>2007-10-04 21:27:17 +0000
commit3eae3a0be8e36dbff42ed261953ba3086964b8fb (patch)
tree3dd488d56b966ab4ce5276c1989e45f7952f6478
parentb61814e4c1ad0268aba51b6c395a8e94e8d76222 (diff)
downloadexternal_llvm-3eae3a0be8e36dbff42ed261953ba3086964b8fb.zip
external_llvm-3eae3a0be8e36dbff42ed261953ba3086964b8fb.tar.gz
external_llvm-3eae3a0be8e36dbff42ed261953ba3086964b8fb.tar.bz2
Fix the previous bug a slightly different way (by modifying how find_next works)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42613 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--include/llvm/ADT/SparseBitVector.h17
1 files changed, 8 insertions, 9 deletions
diff --git a/include/llvm/ADT/SparseBitVector.h b/include/llvm/ADT/SparseBitVector.h
index 56db805..1d96546 100644
--- a/include/llvm/ADT/SparseBitVector.h
+++ b/include/llvm/ADT/SparseBitVector.h
@@ -168,15 +168,14 @@ public:
assert(0 && "Illegal empty element");
}
- /// find_next - Returns the index of the next set bit following the
- /// "Prev" bit. Returns -1 if the next set bit is not found.
- int find_next(unsigned Prev) const {
- ++Prev;
- if (Prev >= BITS_PER_ELEMENT)
+ /// 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.
+ int find_next(unsigned Curr) const {
+ if (Curr >= BITS_PER_ELEMENT)
return -1;
- unsigned WordPos = Prev / BITWORD_SIZE;
- unsigned BitPos = Prev % BITWORD_SIZE;
+ unsigned WordPos = Curr / BITWORD_SIZE;
+ unsigned BitPos = Curr % BITWORD_SIZE;
BitWord Copy = Bits[WordPos];
assert (WordPos <= BITWORDS_PER_ELEMENT
&& "Word Position outside of element");
@@ -390,7 +389,7 @@ class SparseBitVector {
// See if we ran out of Bits in this word.
if (!Bits) {
- int NextSetBitNumber = Iter->find_next((BitNumber - 1) % ElementSize) ;
+ int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
// If we ran out of set bits in this element, move to next element.
if (NextSetBitNumber == -1 || (BitNumber % ElementSize == 0)) {
++Iter;
@@ -546,7 +545,7 @@ public:
}
}
CurrElementIter = ElementIter;
-
+
ElementIter->set(Idx % ElementSize);
}