(svn r11031) -Codechange: reduce the amount of duplication of bit counting functions. Based on patches by skidd13, SmatZ and Belugas.

This commit is contained in:
rubidium
2007-09-01 08:31:36 +00:00
parent 766d6d420e
commit 6f76bc2449
7 changed files with 30 additions and 46 deletions

View File

@@ -273,22 +273,6 @@ int FindFirstBit(uint32 value)
return i;
}
int CountBitsSet(uint32 value)
{
int num;
/* This loop is only called once for every bit set by clearing the lowest
* bit in each loop. The number of bits is therefore equal to the number of
* times the loop was called. It was found at the following website:
* http://graphics.stanford.edu/~seander/bithacks.html */
for (num = 0; value != 0; num++) {
value &= value - 1;
}
return num;
}
static void Save_NAME()
{
int i;