blob: 2b3d2e9e02f970322befae75fbd0f8c5d2ccc21c (
plain) (
tree)
|
|
#include "bitset.h"
void bitset::set(uint32_t num) {
uint32_t idx = INDEX_FROM_BIT(num);
uint32_t off = OFFSET_FROM_BIT(num);
bits[idx] |= (0x1 << off);
}
void bitset::clear(uint32_t num) {
uint32_t idx = INDEX_FROM_BIT(num);
uint32_t off = OFFSET_FROM_BIT(num);
bits[idx] &= ~(0x1 << off);
}
uint32_t bitset::test(uint32_t num) {
uint32_t idx = INDEX_FROM_BIT(num);
uint32_t off = OFFSET_FROM_BIT(num);
return (bits[idx] & (0x1 << off));
}
uint32_t bitset::firstFree() {
uint32_t i, j;
for (i = 0; i < INDEX_FROM_BIT(size); i++) {
if (bits[i] != 0xFFFFFFFF) {
for (j = 0; j < 32; j++) {
uint32_t toTest = 0x1 << j;
if (!(bits[i] & toTest)) {
return i*4*8+j;
}
}
}
}
return (uint32_t) - 1;
}
|