RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00
Code Issues Projects Releases Wiki Activity

Fix bugs in iterator invalidation

Browse Source 
llvm-svn: 44174
This commit is contained in:
Daniel Berlin 2007-11-15 18:06:49 +00:00
parent 895e6284a9
commit 13a0e04717
1 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -614,8 +614,10 @@ public:
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end())
if (Iter1 == Elements.end()) {
CurrElementIter = Elements.begin();
return changed;
}
if (Iter1->index() > Iter2->index()) {
++Iter2;
@ -654,8 +656,10 @@ public:
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end())
if (Iter1 == Elements.end()) {
CurrElementIter = Elements.begin();
return changed;
}
if (Iter1->index() > Iter2->index()) {
++Iter2;
@ -689,6 +693,7 @@ public:
const SparseBitVector<ElementSize> &RHS2)
{
Elements.clear();
CurrElementIter = Elements.begin();
ElementListConstIter Iter1 = RHS1.Elements.begin();
ElementListConstIter Iter2 = RHS2.Elements.begin();
@ -732,7 +737,6 @@ public:
++Iter1;
}
CurrElementIter = Elements.begin();
return;
}