RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity

Make it 64-bit safe.

Browse Source 
llvm-svn: 34829
This commit is contained in:
Evan Cheng 2007-03-02 02:31:37 +00:00
parent 39b817765b
commit 44257955c8
1 changed files with 25 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
include/llvm/ADT/BitVector.h
View File

@ -120,8 +120,14 @@ public:
/// of the bits are set.
int find_first() const {
for (unsigned i = 0; i < NumBitWords(size()); ++i)
if (Bits[i] != 0)
return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
if (Bits[i] != 0) {
if (sizeof(BitWord) == 4)
return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
else if (sizeof(BitWord) == 8)
return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
else
assert(0 && "Unsupported!");
}
return -1;
}
@ -136,15 +142,27 @@ public:
unsigned BitPos = Prev % BITS_PER_WORD;
BitWord Copy = Bits[WordPos];
// Mask off previous bits.
Copy &= ~0 << BitPos;
Copy &= ~0L << BitPos;
if (Copy != 0)
return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
if (Copy != 0) {
if (sizeof(BitWord) == 4)
return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
else if (sizeof(BitWord) == 8)
return WordPos * BITS_PER_WORD + CountTrailingZeros_64(Copy);
else
assert(0 && "Unsupported!");
}
// Check subsequent words.
for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)
if (Bits[i] != 0)
return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
if (Bits[i] != 0) {
if (sizeof(BitWord) == 4)
return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
else if (sizeof(BitWord) == 8)
return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
else
assert(0 && "Unsupported!");
}
return -1;
}